/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/svcomp/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 16:38:58,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 16:38:58,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 16:38:58,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 16:38:58,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 16:38:58,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 16:38:58,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 16:38:58,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 16:38:58,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 16:38:58,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 16:38:58,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 16:38:58,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 16:38:58,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 16:38:58,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 16:38:58,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 16:38:58,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 16:38:58,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 16:38:58,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 16:38:58,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 16:38:58,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 16:38:58,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 16:38:58,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 16:38:58,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 16:38:58,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 16:38:58,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 16:38:58,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 16:38:58,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 16:38:58,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 16:38:58,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 16:38:58,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 16:38:58,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 16:38:58,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 16:38:58,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 16:38:58,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 16:38:58,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 16:38:58,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 16:38:58,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 16:38:58,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 16:38:58,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 16:38:58,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 16:38:58,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 16:38:58,913 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 16:38:58,933 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 16:38:58,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 16:38:58,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 16:38:58,935 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 16:38:58,935 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 16:38:58,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 16:38:58,935 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 16:38:58,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 16:38:58,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 16:38:58,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 16:38:58,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 16:38:58,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 16:38:58,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 16:38:58,937 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 16:38:58,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 16:38:58,937 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 16:38:58,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 16:38:58,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 16:38:58,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 16:38:58,938 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 16:38:58,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 16:38:58,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 16:38:58,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 16:38:58,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 16:38:58,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 16:38:58,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 16:38:58,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 16:38:58,940 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 16:38:58,940 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 16:38:58,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 16:38:59,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 16:38:59,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 16:38:59,238 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 16:38:59,239 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 16:38:59,239 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 16:38:59,240 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2020-10-11 16:38:59,308 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ece3058a7/fb823a1978f04c11962cad2870d7132f/FLAG1c4312690 [2020-10-11 16:38:59,894 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 16:38:59,895 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2020-10-11 16:38:59,919 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ece3058a7/fb823a1978f04c11962cad2870d7132f/FLAG1c4312690 [2020-10-11 16:39:00,216 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ece3058a7/fb823a1978f04c11962cad2870d7132f [2020-10-11 16:39:00,225 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 16:39:00,227 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 16:39:00,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 16:39:00,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 16:39:00,231 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 16:39:00,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:39:00" (1/1) ... [2020-10-11 16:39:00,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6658cbfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:00, skipping insertion in model container [2020-10-11 16:39:00,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:39:00" (1/1) ... [2020-10-11 16:39:00,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 16:39:00,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 16:39:00,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 16:39:00,832 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 16:39:00,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 16:39:01,048 INFO L208 MainTranslator]: Completed translation [2020-10-11 16:39:01,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:01 WrapperNode [2020-10-11 16:39:01,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 16:39:01,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 16:39:01,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 16:39:01,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 16:39:01,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:01" (1/1) ... [2020-10-11 16:39:01,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:01" (1/1) ... [2020-10-11 16:39:01,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 16:39:01,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 16:39:01,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 16:39:01,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 16:39:01,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:01" (1/1) ... [2020-10-11 16:39:01,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:01" (1/1) ... [2020-10-11 16:39:01,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:01" (1/1) ... [2020-10-11 16:39:01,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:01" (1/1) ... [2020-10-11 16:39:01,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:01" (1/1) ... [2020-10-11 16:39:01,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:01" (1/1) ... [2020-10-11 16:39:01,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:01" (1/1) ... [2020-10-11 16:39:01,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 16:39:01,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 16:39:01,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 16:39:01,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 16:39:01,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:01" (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-11 16:39:01,249 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-10-11 16:39:01,249 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-10-11 16:39:01,250 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-10-11 16:39:01,250 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-10-11 16:39:01,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 16:39:01,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 16:39:01,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-11 16:39:01,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 16:39:01,251 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-11 16:39:01,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-11 16:39:01,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 16:39:01,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 16:39:01,253 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 16:39:01,826 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 16:39:01,826 INFO L298 CfgBuilder]: Removed 16 assume(true) statements. [2020-10-11 16:39:01,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:39:01 BoogieIcfgContainer [2020-10-11 16:39:01,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 16:39:01,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 16:39:01,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 16:39:01,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 16:39:01,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:39:00" (1/3) ... [2020-10-11 16:39:01,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549a53b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:39:01, skipping insertion in model container [2020-10-11 16:39:01,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:01" (2/3) ... [2020-10-11 16:39:01,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549a53b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:39:01, skipping insertion in model container [2020-10-11 16:39:01,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:39:01" (3/3) ... [2020-10-11 16:39:01,839 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2020-10-11 16:39:01,853 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 16:39:01,862 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 16:39:01,863 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 16:39:01,905 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,906 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,906 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,906 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,907 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,907 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,908 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,908 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,908 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,909 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,909 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,910 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,910 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,910 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,911 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,911 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,911 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,911 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,912 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,912 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,912 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,912 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,913 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,913 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,913 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,913 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,913 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,913 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,914 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,914 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,914 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,914 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,915 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,915 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,915 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,915 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,916 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,916 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,916 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,916 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,917 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,917 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,917 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,917 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,918 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,918 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,918 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,918 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,919 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,919 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,919 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,919 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,920 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,920 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,920 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,920 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,921 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,921 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,921 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,921 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,923 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,923 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,923 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,923 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,924 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,924 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,924 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,924 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,925 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,925 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,925 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,926 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,926 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,926 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,926 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,927 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,927 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,927 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,927 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,928 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,928 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,928 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,928 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,929 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,929 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,929 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,931 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,931 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,931 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,932 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,932 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,932 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,933 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,933 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,933 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,933 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,934 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,934 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,934 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,935 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,935 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,935 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,935 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,936 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,936 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,936 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,936 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,936 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,937 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,937 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,937 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,937 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,938 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,938 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,938 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,938 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,939 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,939 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,939 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,939 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,939 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,940 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,940 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,940 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,940 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,940 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,941 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,941 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,941 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,942 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,942 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,942 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,942 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,942 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,943 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,943 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,943 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,943 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,944 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,944 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,944 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,944 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,944 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,945 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,945 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,945 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,945 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,945 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,946 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,946 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,946 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,946 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,947 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,947 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,947 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,947 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,947 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,948 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,948 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,948 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,948 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,949 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,949 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,949 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,949 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,949 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,950 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,950 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,950 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,950 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,951 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,951 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,951 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,951 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,951 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,952 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,952 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,952 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,952 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,953 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,953 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,953 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,954 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,954 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,954 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,954 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,954 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,955 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,955 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,955 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,955 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,956 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,956 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,956 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,956 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,956 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,957 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,957 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,957 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,957 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,958 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,958 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,958 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,958 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,959 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,959 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,959 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,959 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,959 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,960 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,960 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,960 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,964 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,964 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,965 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,965 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,965 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,965 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,965 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,966 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,966 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,966 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,966 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,967 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,967 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,967 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,967 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,968 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,968 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,968 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,968 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,969 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,969 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,969 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,969 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,976 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,976 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,977 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,977 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,977 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,977 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,978 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,978 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,978 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,978 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,978 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,979 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,979 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,979 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,979 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,980 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,980 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,980 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,980 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,980 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,981 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,981 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,981 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,981 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,982 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,982 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,982 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,982 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,983 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,983 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:01,998 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:39:02,028 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-11 16:39:02,051 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 16:39:02,051 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 16:39:02,051 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 16:39:02,052 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 16:39:02,052 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 16:39:02,052 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 16:39:02,052 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 16:39:02,052 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 16:39:02,071 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 196 places, 204 transitions, 430 flow [2020-10-11 16:39:02,166 INFO L129 PetriNetUnfolder]: 14/204 cut-off events. [2020-10-11 16:39:02,166 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-11 16:39:02,174 INFO L80 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 204 events. 14/204 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 365 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 139. Up to 3 conditions per place. [2020-10-11 16:39:02,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 196 places, 204 transitions, 430 flow [2020-10-11 16:39:02,184 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 192 transitions, 396 flow [2020-10-11 16:39:02,196 INFO L129 PetriNetUnfolder]: 2/51 cut-off events. [2020-10-11 16:39:02,196 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 16:39:02,196 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:02,198 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, 1, 1, 1] [2020-10-11 16:39:02,198 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:02,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:02,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1929394428, now seen corresponding path program 1 times [2020-10-11 16:39:02,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:02,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892452948] [2020-10-11 16:39:02,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:02,452 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-11 16:39:02,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892452948] [2020-10-11 16:39:02,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:39:02,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 16:39:02,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509817176] [2020-10-11 16:39:02,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-11 16:39:02,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:02,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-11 16:39:02,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-11 16:39:02,493 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 204 [2020-10-11 16:39:02,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 192 transitions, 396 flow. Second operand 2 states. [2020-10-11 16:39:02,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:02,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 204 [2020-10-11 16:39:02,500 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:02,582 INFO L129 PetriNetUnfolder]: 9/187 cut-off events. [2020-10-11 16:39:02,582 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-11 16:39:02,585 INFO L80 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 187 events. 9/187 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 275 event pairs, 0 based on Foata normal form. 4/181 useless extension candidates. Maximal degree in co-relation 193. Up to 2 conditions per place. [2020-10-11 16:39:02,587 INFO L132 encePairwiseOnDemand]: 200/204 looper letters, 0 selfloop transitions, 0 changer transitions 0/185 dead transitions. [2020-10-11 16:39:02,587 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 185 transitions, 382 flow [2020-10-11 16:39:02,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-11 16:39:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-10-11 16:39:02,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 402 transitions. [2020-10-11 16:39:02,604 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9852941176470589 [2020-10-11 16:39:02,605 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 402 transitions. [2020-10-11 16:39:02,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 402 transitions. [2020-10-11 16:39:02,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:02,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 402 transitions. [2020-10-11 16:39:02,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. [2020-10-11 16:39:02,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 3 states. [2020-10-11 16:39:02,624 INFO L81 ComplementDD]: Finished complementDD. Result 3 states. [2020-10-11 16:39:02,626 INFO L185 Difference]: Start difference. First operand has 185 places, 192 transitions, 396 flow. Second operand 2 states and 402 transitions. [2020-10-11 16:39:02,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 185 transitions, 382 flow [2020-10-11 16:39:02,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 185 transitions, 374 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-11 16:39:02,637 INFO L241 Difference]: Finished difference. Result has 179 places, 185 transitions, 374 flow [2020-10-11 16:39:02,640 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=374, PETRI_PLACES=179, PETRI_TRANSITIONS=185} [2020-10-11 16:39:02,641 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, -6 predicate places. [2020-10-11 16:39:02,642 INFO L481 AbstractCegarLoop]: Abstraction has has 179 places, 185 transitions, 374 flow [2020-10-11 16:39:02,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-11 16:39:02,642 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:02,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:39:02,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 16:39:02,643 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:02,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:02,643 INFO L82 PathProgramCache]: Analyzing trace with hash -593181059, now seen corresponding path program 1 times [2020-10-11 16:39:02,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:02,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079737984] [2020-10-11 16:39:02,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:02,999 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-11 16:39:02,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079737984] [2020-10-11 16:39:03,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:39:03,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 16:39:03,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412486493] [2020-10-11 16:39:03,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 16:39:03,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:03,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 16:39:03,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-10-11 16:39:07,396 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 204 [2020-10-11 16:39:07,398 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 185 transitions, 374 flow. Second operand 12 states. [2020-10-11 16:39:07,398 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:07,398 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 204 [2020-10-11 16:39:07,398 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:07,883 INFO L129 PetriNetUnfolder]: 37/402 cut-off events. [2020-10-11 16:39:07,883 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 16:39:07,886 INFO L80 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 402 events. 37/402 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1424 event pairs, 15 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 476. Up to 54 conditions per place. [2020-10-11 16:39:07,889 INFO L132 encePairwiseOnDemand]: 189/204 looper letters, 15 selfloop transitions, 14 changer transitions 0/183 dead transitions. [2020-10-11 16:39:07,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 183 transitions, 428 flow [2020-10-11 16:39:07,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 16:39:07,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 16:39:07,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2227 transitions. [2020-10-11 16:39:07,898 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8397435897435898 [2020-10-11 16:39:07,899 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2227 transitions. [2020-10-11 16:39:07,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2227 transitions. [2020-10-11 16:39:07,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:07,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2227 transitions. [2020-10-11 16:39:07,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 16:39:07,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 16:39:07,916 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 16:39:07,916 INFO L185 Difference]: Start difference. First operand has 179 places, 185 transitions, 374 flow. Second operand 13 states and 2227 transitions. [2020-10-11 16:39:07,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 183 transitions, 428 flow [2020-10-11 16:39:07,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 183 transitions, 428 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-11 16:39:07,923 INFO L241 Difference]: Finished difference. Result has 189 places, 183 transitions, 407 flow [2020-10-11 16:39:07,923 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=407, PETRI_PLACES=189, PETRI_TRANSITIONS=183} [2020-10-11 16:39:07,924 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 4 predicate places. [2020-10-11 16:39:07,924 INFO L481 AbstractCegarLoop]: Abstraction has has 189 places, 183 transitions, 407 flow [2020-10-11 16:39:07,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 16:39:07,924 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:07,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:39:07,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 16:39:07,925 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:07,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:07,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1482308150, now seen corresponding path program 1 times [2020-10-11 16:39:07,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:07,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285670116] [2020-10-11 16:39:07,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:08,088 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-11 16:39:08,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285670116] [2020-10-11 16:39:08,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:39:08,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 16:39:08,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249937612] [2020-10-11 16:39:08,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 16:39:08,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:08,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 16:39:08,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 16:39:08,138 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 204 [2020-10-11 16:39:08,138 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 183 transitions, 407 flow. Second operand 3 states. [2020-10-11 16:39:08,138 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:08,139 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 204 [2020-10-11 16:39:08,139 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:08,182 INFO L129 PetriNetUnfolder]: 11/258 cut-off events. [2020-10-11 16:39:08,183 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-10-11 16:39:08,184 INFO L80 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 258 events. 11/258 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 622 event pairs, 0 based on Foata normal form. 1/248 useless extension candidates. Maximal degree in co-relation 289. Up to 8 conditions per place. [2020-10-11 16:39:08,186 INFO L132 encePairwiseOnDemand]: 200/204 looper letters, 2 selfloop transitions, 2 changer transitions 4/183 dead transitions. [2020-10-11 16:39:08,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 183 transitions, 417 flow [2020-10-11 16:39:08,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 16:39:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 16:39:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 588 transitions. [2020-10-11 16:39:08,188 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9607843137254902 [2020-10-11 16:39:08,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 588 transitions. [2020-10-11 16:39:08,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 588 transitions. [2020-10-11 16:39:08,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:08,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 588 transitions. [2020-10-11 16:39:08,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 16:39:08,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 16:39:08,192 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 16:39:08,192 INFO L185 Difference]: Start difference. First operand has 189 places, 183 transitions, 407 flow. Second operand 3 states and 588 transitions. [2020-10-11 16:39:08,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 183 transitions, 417 flow [2020-10-11 16:39:08,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 183 transitions, 396 flow, removed 0 selfloop flow, removed 10 redundant places. [2020-10-11 16:39:08,199 INFO L241 Difference]: Finished difference. Result has 182 places, 179 transitions, 386 flow [2020-10-11 16:39:08,199 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=182, PETRI_TRANSITIONS=179} [2020-10-11 16:39:08,200 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, -3 predicate places. [2020-10-11 16:39:08,200 INFO L481 AbstractCegarLoop]: Abstraction has has 182 places, 179 transitions, 386 flow [2020-10-11 16:39:08,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 16:39:08,200 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:08,201 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:39:08,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 16:39:08,201 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:08,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:08,202 INFO L82 PathProgramCache]: Analyzing trace with hash 621102753, now seen corresponding path program 1 times [2020-10-11 16:39:08,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:08,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542807319] [2020-10-11 16:39:08,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:08,347 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-11 16:39:08,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542807319] [2020-10-11 16:39:08,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:39:08,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 16:39:08,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110634843] [2020-10-11 16:39:08,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 16:39:08,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:08,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 16:39:08,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 16:39:08,380 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 204 [2020-10-11 16:39:08,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 179 transitions, 386 flow. Second operand 3 states. [2020-10-11 16:39:08,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:08,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 204 [2020-10-11 16:39:08,381 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:08,426 INFO L129 PetriNetUnfolder]: 12/283 cut-off events. [2020-10-11 16:39:08,426 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-10-11 16:39:08,427 INFO L80 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 283 events. 12/283 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 513 event pairs, 0 based on Foata normal form. 1/276 useless extension candidates. Maximal degree in co-relation 312. Up to 9 conditions per place. [2020-10-11 16:39:08,428 INFO L132 encePairwiseOnDemand]: 201/204 looper letters, 4 selfloop transitions, 2 changer transitions 0/180 dead transitions. [2020-10-11 16:39:08,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 180 transitions, 400 flow [2020-10-11 16:39:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 16:39:08,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 16:39:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 589 transitions. [2020-10-11 16:39:08,430 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9624183006535948 [2020-10-11 16:39:08,431 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 589 transitions. [2020-10-11 16:39:08,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 589 transitions. [2020-10-11 16:39:08,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:08,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 589 transitions. [2020-10-11 16:39:08,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 16:39:08,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 16:39:08,434 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 16:39:08,434 INFO L185 Difference]: Start difference. First operand has 182 places, 179 transitions, 386 flow. Second operand 3 states and 589 transitions. [2020-10-11 16:39:08,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 180 transitions, 400 flow [2020-10-11 16:39:08,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 180 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 16:39:08,439 INFO L241 Difference]: Finished difference. Result has 181 places, 180 transitions, 394 flow [2020-10-11 16:39:08,440 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=181, PETRI_TRANSITIONS=180} [2020-10-11 16:39:08,440 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, -4 predicate places. [2020-10-11 16:39:08,440 INFO L481 AbstractCegarLoop]: Abstraction has has 181 places, 180 transitions, 394 flow [2020-10-11 16:39:08,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 16:39:08,441 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:08,441 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:39:08,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 16:39:08,441 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:08,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:08,442 INFO L82 PathProgramCache]: Analyzing trace with hash 957471261, now seen corresponding path program 1 times [2020-10-11 16:39:08,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:08,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264955108] [2020-10-11 16:39:08,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:08,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264955108] [2020-10-11 16:39:08,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815719754] [2020-10-11 16:39:08,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:08,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-11 16:39:08,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:39:08,804 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-11 16:39:08,805 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:08,808 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:08,809 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:08,809 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-10-11 16:39:08,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-11 16:39:08,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-11 16:39:08,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-10-11 16:39:08,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18178898] [2020-10-11 16:39:08,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 16:39:08,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:08,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 16:39:08,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-11 16:39:08,903 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 204 [2020-10-11 16:39:08,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 180 transitions, 394 flow. Second operand 3 states. [2020-10-11 16:39:08,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:08,904 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 204 [2020-10-11 16:39:08,904 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:08,994 INFO L129 PetriNetUnfolder]: 16/371 cut-off events. [2020-10-11 16:39:08,995 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-11 16:39:08,996 INFO L80 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 371 events. 16/371 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 970 event pairs, 1 based on Foata normal form. 2/363 useless extension candidates. Maximal degree in co-relation 416. Up to 12 conditions per place. [2020-10-11 16:39:08,997 INFO L132 encePairwiseOnDemand]: 200/204 looper letters, 2 selfloop transitions, 3 changer transitions 5/180 dead transitions. [2020-10-11 16:39:08,998 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 180 transitions, 406 flow [2020-10-11 16:39:08,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 16:39:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 16:39:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 587 transitions. [2020-10-11 16:39:09,001 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9591503267973857 [2020-10-11 16:39:09,002 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 587 transitions. [2020-10-11 16:39:09,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 587 transitions. [2020-10-11 16:39:09,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:09,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 587 transitions. [2020-10-11 16:39:09,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 16:39:09,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 16:39:09,008 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 16:39:09,008 INFO L185 Difference]: Start difference. First operand has 181 places, 180 transitions, 394 flow. Second operand 3 states and 587 transitions. [2020-10-11 16:39:09,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 180 transitions, 406 flow [2020-10-11 16:39:09,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 180 transitions, 404 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-11 16:39:09,015 INFO L241 Difference]: Finished difference. Result has 182 places, 175 transitions, 387 flow [2020-10-11 16:39:09,016 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=182, PETRI_TRANSITIONS=175} [2020-10-11 16:39:09,017 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, -3 predicate places. [2020-10-11 16:39:09,017 INFO L481 AbstractCegarLoop]: Abstraction has has 182 places, 175 transitions, 387 flow [2020-10-11 16:39:09,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 16:39:09,017 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:09,017 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:39:09,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:09,232 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:09,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:09,232 INFO L82 PathProgramCache]: Analyzing trace with hash 134512671, now seen corresponding path program 1 times [2020-10-11 16:39:09,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:09,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097833091] [2020-10-11 16:39:09,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:09,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097833091] [2020-10-11 16:39:09,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813243561] [2020-10-11 16:39:09,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:09,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-11 16:39:09,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:39:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:09,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:39:09,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 16:39:09,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810379455] [2020-10-11 16:39:09,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 16:39:09,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:09,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 16:39:09,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-11 16:39:09,773 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:39:09,775 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 175 transitions, 387 flow. Second operand 7 states. [2020-10-11 16:39:09,775 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:09,775 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:39:09,775 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:09,893 INFO L129 PetriNetUnfolder]: 15/351 cut-off events. [2020-10-11 16:39:09,893 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-10-11 16:39:09,895 INFO L80 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 351 events. 15/351 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 613 event pairs, 0 based on Foata normal form. 2/343 useless extension candidates. Maximal degree in co-relation 406. Up to 13 conditions per place. [2020-10-11 16:39:09,897 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 5 changer transitions 0/179 dead transitions. [2020-10-11 16:39:09,897 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 179 transitions, 421 flow [2020-10-11 16:39:09,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 16:39:09,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-11 16:39:09,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1165 transitions. [2020-10-11 16:39:09,904 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.951797385620915 [2020-10-11 16:39:09,904 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1165 transitions. [2020-10-11 16:39:09,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1165 transitions. [2020-10-11 16:39:09,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:09,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1165 transitions. [2020-10-11 16:39:09,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-11 16:39:09,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-11 16:39:09,912 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-11 16:39:09,912 INFO L185 Difference]: Start difference. First operand has 182 places, 175 transitions, 387 flow. Second operand 6 states and 1165 transitions. [2020-10-11 16:39:09,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 179 transitions, 421 flow [2020-10-11 16:39:09,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 179 transitions, 418 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-11 16:39:09,918 INFO L241 Difference]: Finished difference. Result has 185 places, 178 transitions, 416 flow [2020-10-11 16:39:09,919 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=416, PETRI_PLACES=185, PETRI_TRANSITIONS=178} [2020-10-11 16:39:09,920 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 0 predicate places. [2020-10-11 16:39:09,920 INFO L481 AbstractCegarLoop]: Abstraction has has 185 places, 178 transitions, 416 flow [2020-10-11 16:39:09,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 16:39:09,920 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:09,921 INFO L255 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:39:10,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:10,136 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:10,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:10,137 INFO L82 PathProgramCache]: Analyzing trace with hash 878736081, now seen corresponding path program 2 times [2020-10-11 16:39:10,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:10,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998894167] [2020-10-11 16:39:10,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:10,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998894167] [2020-10-11 16:39:10,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921359212] [2020-10-11 16:39:10,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:10,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 16:39:10,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:39:10,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 16:39:10,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:39:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:10,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:39:10,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 16:39:10,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534216716] [2020-10-11 16:39:10,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 16:39:10,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:10,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 16:39:10,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-11 16:39:10,824 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:39:10,826 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 178 transitions, 416 flow. Second operand 9 states. [2020-10-11 16:39:10,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:10,826 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:39:10,826 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:10,953 INFO L129 PetriNetUnfolder]: 18/424 cut-off events. [2020-10-11 16:39:10,953 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-11 16:39:10,955 INFO L80 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 424 events. 18/424 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 733 event pairs, 0 based on Foata normal form. 2/414 useless extension candidates. Maximal degree in co-relation 518. Up to 16 conditions per place. [2020-10-11 16:39:10,956 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 8 changer transitions 0/182 dead transitions. [2020-10-11 16:39:10,957 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 182 transitions, 464 flow [2020-10-11 16:39:10,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 16:39:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 16:39:10,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1744 transitions. [2020-10-11 16:39:10,962 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9498910675381264 [2020-10-11 16:39:10,962 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1744 transitions. [2020-10-11 16:39:10,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1744 transitions. [2020-10-11 16:39:10,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:10,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1744 transitions. [2020-10-11 16:39:10,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 16:39:10,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 16:39:10,973 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 16:39:10,973 INFO L185 Difference]: Start difference. First operand has 185 places, 178 transitions, 416 flow. Second operand 9 states and 1744 transitions. [2020-10-11 16:39:10,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 182 transitions, 464 flow [2020-10-11 16:39:10,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 182 transitions, 458 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-11 16:39:10,979 INFO L241 Difference]: Finished difference. Result has 194 places, 181 transitions, 454 flow [2020-10-11 16:39:10,979 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=454, PETRI_PLACES=194, PETRI_TRANSITIONS=181} [2020-10-11 16:39:10,980 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 9 predicate places. [2020-10-11 16:39:10,980 INFO L481 AbstractCegarLoop]: Abstraction has has 194 places, 181 transitions, 454 flow [2020-10-11 16:39:10,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 16:39:10,980 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:10,980 INFO L255 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:39:11,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:11,196 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:11,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:11,196 INFO L82 PathProgramCache]: Analyzing trace with hash 249530583, now seen corresponding path program 3 times [2020-10-11 16:39:11,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:11,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212630423] [2020-10-11 16:39:11,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:11,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212630423] [2020-10-11 16:39:11,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620162694] [2020-10-11 16:39:11,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:11,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-11 16:39:11,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:39:11,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 37 conjunts are in the unsatisfiable core [2020-10-11 16:39:11,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:39:11,717 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-11 16:39:11,718 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:11,720 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:11,720 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:11,720 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-11 16:39:11,745 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:11,746 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-11 16:39:11,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:39:11,753 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:11,756 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:11,756 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:11,756 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-10-11 16:39:11,809 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 13 treesize of output 9 [2020-10-11 16:39:11,809 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:11,814 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:11,814 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:11,815 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2020-10-11 16:39:11,849 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 24 [2020-10-11 16:39:11,850 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:11,858 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:11,860 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-11 16:39:11,860 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:9 [2020-10-11 16:39:11,951 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:39:11,966 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:11,967 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2020-10-11 16:39:11,968 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:11,993 INFO L625 ElimStorePlain]: treesize reduction 30, result has 50.0 percent of original size [2020-10-11 16:39:11,995 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-11 16:39:11,996 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:16 [2020-10-11 16:39:12,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:39:12,005 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 24 [2020-10-11 16:39:12,006 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:12,014 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:12,016 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-11 16:39:12,016 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2020-10-11 16:39:12,021 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 19 treesize of output 7 [2020-10-11 16:39:12,022 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:12,024 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:12,024 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:12,024 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2020-10-11 16:39:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 44 proven. 41 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-11 16:39:12,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:39:12,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2020-10-11 16:39:12,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125752911] [2020-10-11 16:39:12,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-11 16:39:12,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:12,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-11 16:39:12,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2020-10-11 16:39:23,047 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 204 [2020-10-11 16:39:23,050 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 181 transitions, 454 flow. Second operand 19 states. [2020-10-11 16:39:23,050 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:23,050 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 204 [2020-10-11 16:39:23,050 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:24,687 INFO L129 PetriNetUnfolder]: 28/820 cut-off events. [2020-10-11 16:39:24,688 INFO L130 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2020-10-11 16:39:24,691 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 820 events. 28/820 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2621 event pairs, 0 based on Foata normal form. 12/826 useless extension candidates. Maximal degree in co-relation 1328. Up to 39 conditions per place. [2020-10-11 16:39:24,695 INFO L132 encePairwiseOnDemand]: 186/204 looper letters, 94 selfloop transitions, 67 changer transitions 0/302 dead transitions. [2020-10-11 16:39:24,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 302 transitions, 1131 flow [2020-10-11 16:39:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2020-10-11 16:39:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-11 16:39:24,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 7426 transitions. [2020-10-11 16:39:24,715 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8273172905525846 [2020-10-11 16:39:24,715 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 7426 transitions. [2020-10-11 16:39:24,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 7426 transitions. [2020-10-11 16:39:24,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:24,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 7426 transitions. [2020-10-11 16:39:24,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 45 states. [2020-10-11 16:39:24,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 45 states. [2020-10-11 16:39:24,749 INFO L81 ComplementDD]: Finished complementDD. Result 45 states. [2020-10-11 16:39:24,749 INFO L185 Difference]: Start difference. First operand has 194 places, 181 transitions, 454 flow. Second operand 44 states and 7426 transitions. [2020-10-11 16:39:24,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 302 transitions, 1131 flow [2020-10-11 16:39:24,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 302 transitions, 1097 flow, removed 8 selfloop flow, removed 5 redundant places. [2020-10-11 16:39:24,766 INFO L241 Difference]: Finished difference. Result has 249 places, 236 transitions, 877 flow [2020-10-11 16:39:24,766 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=877, PETRI_PLACES=249, PETRI_TRANSITIONS=236} [2020-10-11 16:39:24,767 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 64 predicate places. [2020-10-11 16:39:24,767 INFO L481 AbstractCegarLoop]: Abstraction has has 249 places, 236 transitions, 877 flow [2020-10-11 16:39:24,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-11 16:39:24,767 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:24,767 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:39:24,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:24,983 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:24,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:24,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1913665735, now seen corresponding path program 1 times [2020-10-11 16:39:24,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:24,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454027497] [2020-10-11 16:39:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:25,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454027497] [2020-10-11 16:39:25,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584936527] [2020-10-11 16:39:25,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:25,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 16:39:25,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:39:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:25,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:39:25,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2020-10-11 16:39:25,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207744559] [2020-10-11 16:39:25,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 16:39:25,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:25,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 16:39:25,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-11 16:39:25,838 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:39:25,839 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 236 transitions, 877 flow. Second operand 13 states. [2020-10-11 16:39:25,839 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:25,839 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:39:25,840 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:26,208 INFO L129 PetriNetUnfolder]: 32/956 cut-off events. [2020-10-11 16:39:26,209 INFO L130 PetriNetUnfolder]: For 926/926 co-relation queries the response was YES. [2020-10-11 16:39:26,215 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1872 conditions, 956 events. 32/956 cut-off events. For 926/926 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3051 event pairs, 0 based on Foata normal form. 4/954 useless extension candidates. Maximal degree in co-relation 1841. Up to 58 conditions per place. [2020-10-11 16:39:26,220 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 24 changer transitions 0/240 dead transitions. [2020-10-11 16:39:26,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 240 transitions, 981 flow [2020-10-11 16:39:26,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 16:39:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 16:39:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2902 transitions. [2020-10-11 16:39:26,230 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9483660130718954 [2020-10-11 16:39:26,230 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2902 transitions. [2020-10-11 16:39:26,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2902 transitions. [2020-10-11 16:39:26,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:26,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2902 transitions. [2020-10-11 16:39:26,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 16:39:26,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 16:39:26,244 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 16:39:26,244 INFO L185 Difference]: Start difference. First operand has 249 places, 236 transitions, 877 flow. Second operand 15 states and 2902 transitions. [2020-10-11 16:39:26,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 240 transitions, 981 flow [2020-10-11 16:39:26,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 240 transitions, 921 flow, removed 14 selfloop flow, removed 10 redundant places. [2020-10-11 16:39:26,256 INFO L241 Difference]: Finished difference. Result has 256 places, 239 transitions, 913 flow [2020-10-11 16:39:26,257 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=913, PETRI_PLACES=256, PETRI_TRANSITIONS=239} [2020-10-11 16:39:26,257 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 71 predicate places. [2020-10-11 16:39:26,257 INFO L481 AbstractCegarLoop]: Abstraction has has 256 places, 239 transitions, 913 flow [2020-10-11 16:39:26,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 16:39:26,258 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:26,258 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:39:26,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:26,472 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:26,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:26,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1070994261, now seen corresponding path program 2 times [2020-10-11 16:39:26,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:26,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157620938] [2020-10-11 16:39:26,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:26,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157620938] [2020-10-11 16:39:26,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916144631] [2020-10-11 16:39:26,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:26,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 16:39:26,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:39:26,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-11 16:39:26,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:39:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:27,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:39:27,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2020-10-11 16:39:27,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584376073] [2020-10-11 16:39:27,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-11 16:39:27,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:27,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-11 16:39:27,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-10-11 16:39:27,336 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:39:27,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 239 transitions, 913 flow. Second operand 15 states. [2020-10-11 16:39:27,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:39:27,339 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:39:27,339 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:39:27,715 INFO L129 PetriNetUnfolder]: 36/1092 cut-off events. [2020-10-11 16:39:27,715 INFO L130 PetriNetUnfolder]: For 1292/1292 co-relation queries the response was YES. [2020-10-11 16:39:27,722 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2207 conditions, 1092 events. 36/1092 cut-off events. For 1292/1292 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3498 event pairs, 2 based on Foata normal form. 4/1090 useless extension candidates. Maximal degree in co-relation 2173. Up to 68 conditions per place. [2020-10-11 16:39:27,726 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 27 changer transitions 0/243 dead transitions. [2020-10-11 16:39:27,726 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 243 transitions, 1031 flow [2020-10-11 16:39:27,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 16:39:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 16:39:27,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3481 transitions. [2020-10-11 16:39:27,734 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9479847494553377 [2020-10-11 16:39:27,735 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3481 transitions. [2020-10-11 16:39:27,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3481 transitions. [2020-10-11 16:39:27,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:39:27,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3481 transitions. [2020-10-11 16:39:27,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 16:39:27,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 16:39:27,748 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 16:39:27,749 INFO L185 Difference]: Start difference. First operand has 256 places, 239 transitions, 913 flow. Second operand 18 states and 3481 transitions. [2020-10-11 16:39:27,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 243 transitions, 1031 flow [2020-10-11 16:39:27,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 243 transitions, 972 flow, removed 11 selfloop flow, removed 10 redundant places. [2020-10-11 16:39:27,762 INFO L241 Difference]: Finished difference. Result has 266 places, 242 transitions, 960 flow [2020-10-11 16:39:27,763 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=960, PETRI_PLACES=266, PETRI_TRANSITIONS=242} [2020-10-11 16:39:27,764 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 81 predicate places. [2020-10-11 16:39:27,764 INFO L481 AbstractCegarLoop]: Abstraction has has 266 places, 242 transitions, 960 flow [2020-10-11 16:39:27,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-11 16:39:27,764 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:39:27,764 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:39:27,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:27,980 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:39:27,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:39:27,980 INFO L82 PathProgramCache]: Analyzing trace with hash -995612082, now seen corresponding path program 3 times [2020-10-11 16:39:27,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:39:27,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808665650] [2020-10-11 16:39:27,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:39:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:39:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:39:28,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808665650] [2020-10-11 16:39:28,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431080715] [2020-10-11 16:39:28,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:39:28,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-11 16:39:28,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:39:28,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 71 conjunts are in the unsatisfiable core [2020-10-11 16:39:28,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:39:28,905 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-11 16:39:28,906 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:28,907 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:28,908 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:28,908 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-11 16:39:28,934 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:28,934 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-11 16:39:28,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:39:28,939 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:28,941 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:28,941 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:28,941 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-10-11 16:39:29,013 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 13 treesize of output 9 [2020-10-11 16:39:29,014 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:29,018 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:29,019 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:29,019 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2020-10-11 16:39:29,064 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 24 [2020-10-11 16:39:29,065 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:29,073 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:29,074 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-11 16:39:29,075 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2020-10-11 16:39:29,204 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:39:29,217 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:29,217 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2020-10-11 16:39:29,218 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:29,245 INFO L625 ElimStorePlain]: treesize reduction 30, result has 53.1 percent of original size [2020-10-11 16:39:29,247 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-11 16:39:29,247 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:20 [2020-10-11 16:39:29,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:39:29,256 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-10-11 16:39:29,256 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:29,266 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:29,267 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-11 16:39:29,268 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2020-10-11 16:39:29,344 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 34 treesize of output 18 [2020-10-11 16:39:29,345 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:29,351 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:29,352 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-11 16:39:29,352 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:14 [2020-10-11 16:39:29,386 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 24 [2020-10-11 16:39:29,387 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:29,396 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:29,399 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-11 16:39:29,399 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2020-10-11 16:39:29,509 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:39:29,524 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:29,524 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2020-10-11 16:39:29,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:39:29,527 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:29,562 INFO L625 ElimStorePlain]: treesize reduction 35, result has 53.3 percent of original size [2020-10-11 16:39:29,564 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-11 16:39:29,564 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:20 [2020-10-11 16:39:29,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:39:29,576 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-10-11 16:39:29,577 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:29,585 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:29,587 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-11 16:39:29,587 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2020-10-11 16:39:29,740 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 31 treesize of output 15 [2020-10-11 16:39:29,740 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:29,744 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:29,744 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:29,744 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:14 [2020-10-11 16:39:29,781 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 24 [2020-10-11 16:39:29,781 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:29,787 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:29,790 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-11 16:39:29,791 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:9 [2020-10-11 16:39:29,911 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:39:29,926 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:29,927 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 49 [2020-10-11 16:39:29,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 16:39:29,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 16:39:29,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:39:29,936 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-11 16:39:29,963 INFO L625 ElimStorePlain]: treesize reduction 94, result has 26.0 percent of original size [2020-10-11 16:39:29,964 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-11 16:39:29,965 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:16 [2020-10-11 16:39:29,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:39:29,973 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 24 [2020-10-11 16:39:29,974 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:29,986 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:29,988 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-11 16:39:29,989 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2020-10-11 16:39:29,993 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 19 treesize of output 7 [2020-10-11 16:39:29,994 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:39:29,995 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:39:29,996 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:39:29,996 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2020-10-11 16:39:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 248 proven. 150 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2020-10-11 16:39:30,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:39:30,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 38 [2020-10-11 16:39:30,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43856412] [2020-10-11 16:39:30,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-10-11 16:39:30,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:39:30,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-10-11 16:39:30,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1197, Unknown=0, NotChecked=0, Total=1406 [2020-10-11 16:40:14,516 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 204 [2020-10-11 16:40:14,519 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 242 transitions, 960 flow. Second operand 38 states. [2020-10-11 16:40:14,520 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:40:14,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 204 [2020-10-11 16:40:14,520 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:40:26,560 INFO L129 PetriNetUnfolder]: 408/2515 cut-off events. [2020-10-11 16:40:26,561 INFO L130 PetriNetUnfolder]: For 4334/4334 co-relation queries the response was YES. [2020-10-11 16:40:26,573 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6363 conditions, 2515 events. 408/2515 cut-off events. For 4334/4334 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 11709 event pairs, 1 based on Foata normal form. 35/2539 useless extension candidates. Maximal degree in co-relation 6326. Up to 438 conditions per place. [2020-10-11 16:40:26,586 INFO L132 encePairwiseOnDemand]: 181/204 looper letters, 387 selfloop transitions, 311 changer transitions 0/832 dead transitions. [2020-10-11 16:40:26,587 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 832 transitions, 5699 flow [2020-10-11 16:40:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2020-10-11 16:40:26,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-10-11 16:40:26,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 29655 transitions. [2020-10-11 16:40:26,618 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7987233354880414 [2020-10-11 16:40:26,618 INFO L72 ComplementDD]: Start complementDD. Operand 182 states and 29655 transitions. [2020-10-11 16:40:26,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 29655 transitions. [2020-10-11 16:40:26,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:40:26,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 182 states and 29655 transitions. [2020-10-11 16:40:26,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 183 states. [2020-10-11 16:40:26,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 183 states. [2020-10-11 16:40:26,692 INFO L81 ComplementDD]: Finished complementDD. Result 183 states. [2020-10-11 16:40:26,692 INFO L185 Difference]: Start difference. First operand has 266 places, 242 transitions, 960 flow. Second operand 182 states and 29655 transitions. [2020-10-11 16:40:26,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 832 transitions, 5699 flow [2020-10-11 16:40:26,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 832 transitions, 5485 flow, removed 60 selfloop flow, removed 14 redundant places. [2020-10-11 16:40:26,727 INFO L241 Difference]: Finished difference. Result has 507 places, 506 transitions, 4012 flow [2020-10-11 16:40:26,727 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=182, PETRI_FLOW=4012, PETRI_PLACES=507, PETRI_TRANSITIONS=506} [2020-10-11 16:40:26,727 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 322 predicate places. [2020-10-11 16:40:26,728 INFO L481 AbstractCegarLoop]: Abstraction has has 507 places, 506 transitions, 4012 flow [2020-10-11 16:40:26,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-10-11 16:40:26,728 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:40:26,728 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:40:26,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:40:26,943 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:40:26,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:40:26,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1613063750, now seen corresponding path program 4 times [2020-10-11 16:40:26,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:40:26,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370240286] [2020-10-11 16:40:26,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:40:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:40:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 0 proven. 636 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:40:27,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370240286] [2020-10-11 16:40:27,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757517598] [2020-10-11 16:40:27,311 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:40:28,443 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 16:40:28,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:40:28,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-11 16:40:28,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:40:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 0 proven. 636 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:40:28,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:40:28,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2020-10-11 16:40:28,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010338108] [2020-10-11 16:40:28,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-11 16:40:28,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:40:28,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-11 16:40:28,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-10-11 16:40:29,190 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:40:29,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 506 transitions, 4012 flow. Second operand 19 states. [2020-10-11 16:40:29,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:40:29,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:40:29,193 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:40:30,663 INFO L129 PetriNetUnfolder]: 133/2518 cut-off events. [2020-10-11 16:40:30,663 INFO L130 PetriNetUnfolder]: For 38663/38663 co-relation queries the response was YES. [2020-10-11 16:40:30,693 INFO L80 FinitePrefix]: Finished finitePrefix Result has 9891 conditions, 2518 events. 133/2518 cut-off events. For 38663/38663 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 12633 event pairs, 0 based on Foata normal form. 8/2515 useless extension candidates. Maximal degree in co-relation 9780. Up to 185 conditions per place. [2020-10-11 16:40:30,711 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 74 changer transitions 0/510 dead transitions. [2020-10-11 16:40:30,711 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 510 transitions, 4264 flow [2020-10-11 16:40:30,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-11 16:40:30,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-11 16:40:30,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4639 transitions. [2020-10-11 16:40:30,717 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9475081699346405 [2020-10-11 16:40:30,717 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4639 transitions. [2020-10-11 16:40:30,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4639 transitions. [2020-10-11 16:40:30,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:40:30,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4639 transitions. [2020-10-11 16:40:30,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 25 states. [2020-10-11 16:40:30,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 25 states. [2020-10-11 16:40:30,727 INFO L81 ComplementDD]: Finished complementDD. Result 25 states. [2020-10-11 16:40:30,728 INFO L185 Difference]: Start difference. First operand has 507 places, 506 transitions, 4012 flow. Second operand 24 states and 4639 transitions. [2020-10-11 16:40:30,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 510 transitions, 4264 flow [2020-10-11 16:40:30,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 510 transitions, 2950 flow, removed 471 selfloop flow, removed 53 redundant places. [2020-10-11 16:40:30,877 INFO L241 Difference]: Finished difference. Result has 480 places, 509 transitions, 2934 flow [2020-10-11 16:40:30,878 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=2698, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2934, PETRI_PLACES=480, PETRI_TRANSITIONS=509} [2020-10-11 16:40:30,878 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 295 predicate places. [2020-10-11 16:40:30,879 INFO L481 AbstractCegarLoop]: Abstraction has has 480 places, 509 transitions, 2934 flow [2020-10-11 16:40:30,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-11 16:40:30,879 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:40:30,879 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:40:31,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-10-11 16:40:31,094 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:40:31,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:40:31,095 INFO L82 PathProgramCache]: Analyzing trace with hash -978501601, now seen corresponding path program 5 times [2020-10-11 16:40:31,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:40:31,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609238822] [2020-10-11 16:40:31,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:40:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:40:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:40:31,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609238822] [2020-10-11 16:40:31,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139401845] [2020-10-11 16:40:31,621 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:40:33,423 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2020-10-11 16:40:33,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:40:33,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-11 16:40:33,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:40:33,607 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:40:33,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:40:33,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2020-10-11 16:40:33,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939973923] [2020-10-11 16:40:33,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-11 16:40:33,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:40:33,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-11 16:40:33,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2020-10-11 16:40:34,233 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:40:34,236 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 509 transitions, 2934 flow. Second operand 21 states. [2020-10-11 16:40:34,236 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:40:34,236 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:40:34,236 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:40:35,507 INFO L129 PetriNetUnfolder]: 152/2838 cut-off events. [2020-10-11 16:40:35,507 INFO L130 PetriNetUnfolder]: For 42646/42646 co-relation queries the response was YES. [2020-10-11 16:40:35,534 INFO L80 FinitePrefix]: Finished finitePrefix Result has 10262 conditions, 2838 events. 152/2838 cut-off events. For 42646/42646 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 14395 event pairs, 0 based on Foata normal form. 8/2835 useless extension candidates. Maximal degree in co-relation 10150. Up to 177 conditions per place. [2020-10-11 16:40:35,549 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 77 changer transitions 0/513 dead transitions. [2020-10-11 16:40:35,549 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 513 transitions, 3200 flow [2020-10-11 16:40:35,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-11 16:40:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-11 16:40:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 5218 transitions. [2020-10-11 16:40:35,553 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9473493100944081 [2020-10-11 16:40:35,553 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 5218 transitions. [2020-10-11 16:40:35,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 5218 transitions. [2020-10-11 16:40:35,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:40:35,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 5218 transitions. [2020-10-11 16:40:35,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 28 states. [2020-10-11 16:40:35,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 28 states. [2020-10-11 16:40:35,564 INFO L81 ComplementDD]: Finished complementDD. Result 28 states. [2020-10-11 16:40:35,565 INFO L185 Difference]: Start difference. First operand has 480 places, 509 transitions, 2934 flow. Second operand 27 states and 5218 transitions. [2020-10-11 16:40:35,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 513 transitions, 3200 flow [2020-10-11 16:40:35,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 513 transitions, 3023 flow, removed 23 selfloop flow, removed 19 redundant places. [2020-10-11 16:40:35,705 INFO L241 Difference]: Finished difference. Result has 490 places, 512 transitions, 2999 flow [2020-10-11 16:40:35,706 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=2757, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2999, PETRI_PLACES=490, PETRI_TRANSITIONS=512} [2020-10-11 16:40:35,706 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 305 predicate places. [2020-10-11 16:40:35,706 INFO L481 AbstractCegarLoop]: Abstraction has has 490 places, 512 transitions, 2999 flow [2020-10-11 16:40:35,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-11 16:40:35,706 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:40:35,707 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:40:35,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:40:35,921 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:40:35,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:40:35,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1370216403, now seen corresponding path program 6 times [2020-10-11 16:40:35,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:40:35,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652319410] [2020-10-11 16:40:35,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:40:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:40:36,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 0 proven. 1077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:40:36,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652319410] [2020-10-11 16:40:36,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574743256] [2020-10-11 16:40:36,454 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:41:04,114 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2020-10-11 16:41:04,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:41:04,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-11 16:41:04,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:41:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 0 proven. 1077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:41:04,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:41:04,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2020-10-11 16:41:04,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046202392] [2020-10-11 16:41:04,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-11 16:41:04,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:41:04,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-11 16:41:04,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2020-10-11 16:41:05,272 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:41:05,274 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 512 transitions, 2999 flow. Second operand 23 states. [2020-10-11 16:41:05,275 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:41:05,275 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:41:05,275 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:41:07,423 INFO L129 PetriNetUnfolder]: 171/3158 cut-off events. [2020-10-11 16:41:07,424 INFO L130 PetriNetUnfolder]: For 48901/48901 co-relation queries the response was YES. [2020-10-11 16:41:07,447 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11599 conditions, 3158 events. 171/3158 cut-off events. For 48901/48901 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 16096 event pairs, 0 based on Foata normal form. 8/3155 useless extension candidates. Maximal degree in co-relation 11484. Up to 201 conditions per place. [2020-10-11 16:41:07,462 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 80 changer transitions 0/516 dead transitions. [2020-10-11 16:41:07,463 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 516 transitions, 3279 flow [2020-10-11 16:41:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-11 16:41:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-11 16:41:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5797 transitions. [2020-10-11 16:41:07,468 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9472222222222222 [2020-10-11 16:41:07,468 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5797 transitions. [2020-10-11 16:41:07,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5797 transitions. [2020-10-11 16:41:07,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:41:07,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5797 transitions. [2020-10-11 16:41:07,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 31 states. [2020-10-11 16:41:07,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 31 states. [2020-10-11 16:41:07,481 INFO L81 ComplementDD]: Finished complementDD. Result 31 states. [2020-10-11 16:41:07,481 INFO L185 Difference]: Start difference. First operand has 490 places, 512 transitions, 2999 flow. Second operand 30 states and 5797 transitions. [2020-10-11 16:41:07,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 516 transitions, 3279 flow [2020-10-11 16:41:07,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 516 transitions, 3071 flow, removed 30 selfloop flow, removed 23 redundant places. [2020-10-11 16:41:07,642 INFO L241 Difference]: Finished difference. Result has 499 places, 515 transitions, 3045 flow [2020-10-11 16:41:07,642 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=2791, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=3045, PETRI_PLACES=499, PETRI_TRANSITIONS=515} [2020-10-11 16:41:07,643 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 314 predicate places. [2020-10-11 16:41:07,643 INFO L481 AbstractCegarLoop]: Abstraction has has 499 places, 515 transitions, 3045 flow [2020-10-11 16:41:07,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-11 16:41:07,643 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:41:07,643 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:41:07,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:41:07,844 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:41:07,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:41:07,845 INFO L82 PathProgramCache]: Analyzing trace with hash -603816704, now seen corresponding path program 7 times [2020-10-11 16:41:07,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:41:07,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631273808] [2020-10-11 16:41:07,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:41:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:41:08,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:41:08,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631273808] [2020-10-11 16:41:08,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660046568] [2020-10-11 16:41:08,441 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:41:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:41:08,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-11 16:41:08,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:41:08,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:41:08,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:41:08,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2020-10-11 16:41:08,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179405943] [2020-10-11 16:41:08,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-11 16:41:08,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:41:08,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-11 16:41:08,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2020-10-11 16:41:09,836 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:41:09,839 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 515 transitions, 3045 flow. Second operand 25 states. [2020-10-11 16:41:09,840 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:41:09,840 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:41:09,840 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:41:11,641 INFO L129 PetriNetUnfolder]: 190/3478 cut-off events. [2020-10-11 16:41:11,642 INFO L130 PetriNetUnfolder]: For 55132/55132 co-relation queries the response was YES. [2020-10-11 16:41:11,679 INFO L80 FinitePrefix]: Finished finitePrefix Result has 12896 conditions, 3478 events. 190/3478 cut-off events. For 55132/55132 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 17816 event pairs, 0 based on Foata normal form. 8/3475 useless extension candidates. Maximal degree in co-relation 12778. Up to 225 conditions per place. [2020-10-11 16:41:11,694 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 83 changer transitions 0/519 dead transitions. [2020-10-11 16:41:11,694 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 519 transitions, 3339 flow [2020-10-11 16:41:11,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-10-11 16:41:11,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-10-11 16:41:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 6376 transitions. [2020-10-11 16:41:11,701 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9471182412358883 [2020-10-11 16:41:11,702 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 6376 transitions. [2020-10-11 16:41:11,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 6376 transitions. [2020-10-11 16:41:11,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:41:11,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 6376 transitions. [2020-10-11 16:41:11,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 34 states. [2020-10-11 16:41:11,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 34 states. [2020-10-11 16:41:11,714 INFO L81 ComplementDD]: Finished complementDD. Result 34 states. [2020-10-11 16:41:11,715 INFO L185 Difference]: Start difference. First operand has 499 places, 515 transitions, 3045 flow. Second operand 33 states and 6376 transitions. [2020-10-11 16:41:11,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 519 transitions, 3339 flow [2020-10-11 16:41:11,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 505 places, 519 transitions, 3119 flow, removed 33 selfloop flow, removed 26 redundant places. [2020-10-11 16:41:11,969 INFO L241 Difference]: Finished difference. Result has 508 places, 518 transitions, 3091 flow [2020-10-11 16:41:11,970 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=2825, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=3091, PETRI_PLACES=508, PETRI_TRANSITIONS=518} [2020-10-11 16:41:11,971 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 323 predicate places. [2020-10-11 16:41:11,971 INFO L481 AbstractCegarLoop]: Abstraction has has 508 places, 518 transitions, 3091 flow [2020-10-11 16:41:11,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-11 16:41:11,971 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:41:11,972 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:41:12,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-10-11 16:41:12,187 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:41:12,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:41:12,187 INFO L82 PathProgramCache]: Analyzing trace with hash -751148811, now seen corresponding path program 8 times [2020-10-11 16:41:12,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:41:12,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533621803] [2020-10-11 16:41:12,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:41:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:41:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 0 proven. 1670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:41:12,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533621803] [2020-10-11 16:41:12,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537577352] [2020-10-11 16:41:12,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:41:13,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 16:41:13,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:41:13,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-11 16:41:13,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:41:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 0 proven. 1670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:41:13,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:41:13,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2020-10-11 16:41:13,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292286085] [2020-10-11 16:41:13,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-10-11 16:41:13,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:41:13,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-10-11 16:41:13,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2020-10-11 16:41:14,882 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:41:14,886 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 518 transitions, 3091 flow. Second operand 27 states. [2020-10-11 16:41:14,886 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:41:14,886 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:41:14,887 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:41:16,840 INFO L129 PetriNetUnfolder]: 209/3798 cut-off events. [2020-10-11 16:41:16,841 INFO L130 PetriNetUnfolder]: For 61459/61459 co-relation queries the response was YES. [2020-10-11 16:41:16,873 INFO L80 FinitePrefix]: Finished finitePrefix Result has 14193 conditions, 3798 events. 209/3798 cut-off events. For 61459/61459 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 19542 event pairs, 0 based on Foata normal form. 8/3795 useless extension candidates. Maximal degree in co-relation 14072. Up to 249 conditions per place. [2020-10-11 16:41:16,892 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 86 changer transitions 0/522 dead transitions. [2020-10-11 16:41:16,892 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 522 transitions, 3399 flow [2020-10-11 16:41:16,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-10-11 16:41:16,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-11 16:41:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 6955 transitions. [2020-10-11 16:41:16,900 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9470315904139434 [2020-10-11 16:41:16,901 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 6955 transitions. [2020-10-11 16:41:16,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 6955 transitions. [2020-10-11 16:41:16,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:41:16,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 6955 transitions. [2020-10-11 16:41:16,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 37 states. [2020-10-11 16:41:16,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 37 states. [2020-10-11 16:41:16,913 INFO L81 ComplementDD]: Finished complementDD. Result 37 states. [2020-10-11 16:41:16,913 INFO L185 Difference]: Start difference. First operand has 508 places, 518 transitions, 3091 flow. Second operand 36 states and 6955 transitions. [2020-10-11 16:41:16,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 522 transitions, 3399 flow [2020-10-11 16:41:17,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 522 transitions, 3167 flow, removed 36 selfloop flow, removed 29 redundant places. [2020-10-11 16:41:17,163 INFO L241 Difference]: Finished difference. Result has 517 places, 521 transitions, 3137 flow [2020-10-11 16:41:17,164 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=2859, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=3137, PETRI_PLACES=517, PETRI_TRANSITIONS=521} [2020-10-11 16:41:17,164 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 332 predicate places. [2020-10-11 16:41:17,164 INFO L481 AbstractCegarLoop]: Abstraction has has 517 places, 521 transitions, 3137 flow [2020-10-11 16:41:17,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-10-11 16:41:17,164 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:41:17,165 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 9, 9, 9, 9, 9, 9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:41:17,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-10-11 16:41:17,380 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:41:17,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:41:17,381 INFO L82 PathProgramCache]: Analyzing trace with hash 60851716, now seen corresponding path program 9 times [2020-10-11 16:41:17,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:41:17,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143420897] [2020-10-11 16:41:17,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:41:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:41:18,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:41:18,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143420897] [2020-10-11 16:41:18,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315368803] [2020-10-11 16:41:18,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:41:23,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-10-11 16:41:23,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:41:23,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 110 conjunts are in the unsatisfiable core [2020-10-11 16:41:23,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:41:23,499 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-11 16:41:23,499 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:23,502 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:23,502 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:23,502 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-11 16:41:23,535 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:23,536 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-11 16:41:23,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:41:23,546 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:23,549 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:23,549 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:23,550 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-10-11 16:41:23,737 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 13 treesize of output 9 [2020-10-11 16:41:23,737 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:23,743 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:23,743 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:23,744 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2020-10-11 16:41:23,790 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 24 [2020-10-11 16:41:23,791 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:23,799 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:23,801 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-11 16:41:23,801 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2020-10-11 16:41:23,965 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:41:23,984 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:23,985 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2020-10-11 16:41:23,985 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:24,022 INFO L625 ElimStorePlain]: treesize reduction 30, result has 53.1 percent of original size [2020-10-11 16:41:24,023 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-11 16:41:24,024 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:20 [2020-10-11 16:41:24,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:41:24,034 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-10-11 16:41:24,034 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:24,051 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:24,053 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-11 16:41:24,053 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2020-10-11 16:41:24,290 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 31 treesize of output 15 [2020-10-11 16:41:24,291 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:24,298 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:24,298 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:24,299 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:16 [2020-10-11 16:41:24,361 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 24 [2020-10-11 16:41:24,362 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:24,371 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:24,373 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-11 16:41:24,373 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2020-10-11 16:41:24,606 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:41:24,624 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:24,624 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2020-10-11 16:41:24,625 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:24,656 INFO L625 ElimStorePlain]: treesize reduction 26, result has 52.7 percent of original size [2020-10-11 16:41:24,657 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-11 16:41:24,657 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:20 [2020-10-11 16:41:24,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:41:24,714 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-10-11 16:41:24,715 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:24,727 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:24,731 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-11 16:41:24,731 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2020-10-11 16:41:25,050 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 31 treesize of output 15 [2020-10-11 16:41:25,051 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:25,057 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:25,058 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:25,058 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:16 [2020-10-11 16:41:25,126 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 24 [2020-10-11 16:41:25,127 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:25,134 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:25,136 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-11 16:41:25,136 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2020-10-11 16:41:25,411 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:41:25,429 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:25,430 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2020-10-11 16:41:25,431 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:25,465 INFO L625 ElimStorePlain]: treesize reduction 26, result has 52.7 percent of original size [2020-10-11 16:41:25,466 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-11 16:41:25,467 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:20 [2020-10-11 16:41:25,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:41:25,536 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-10-11 16:41:25,536 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:25,550 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:25,551 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-11 16:41:25,552 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2020-10-11 16:41:25,949 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 31 treesize of output 15 [2020-10-11 16:41:25,950 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:25,956 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:25,956 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:25,957 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:14 [2020-10-11 16:41:26,032 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 24 [2020-10-11 16:41:26,033 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:26,041 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:26,042 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-11 16:41:26,043 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:9 [2020-10-11 16:41:26,314 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:41:26,332 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:26,333 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 49 [2020-10-11 16:41:26,334 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:26,364 INFO L625 ElimStorePlain]: treesize reduction 26, result has 49.0 percent of original size [2020-10-11 16:41:26,366 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-11 16:41:26,366 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:16 [2020-10-11 16:41:26,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:41:26,374 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 24 [2020-10-11 16:41:26,375 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:26,387 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:26,388 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-11 16:41:26,389 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2020-10-11 16:41:26,393 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 19 treesize of output 7 [2020-10-11 16:41:26,393 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:41:26,395 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:41:26,396 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:41:26,396 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2020-10-11 16:41:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 971 proven. 353 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2020-10-11 16:41:26,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:41:26,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 35] total 60 [2020-10-11 16:41:26,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267301734] [2020-10-11 16:41:26,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 60 states [2020-10-11 16:41:26,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:41:26,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2020-10-11 16:41:26,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=3200, Unknown=0, NotChecked=0, Total=3540 [2020-10-11 16:45:12,890 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 204 [2020-10-11 16:45:12,894 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 521 transitions, 3137 flow. Second operand 60 states. [2020-10-11 16:45:12,894 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:45:12,894 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 204 [2020-10-11 16:45:12,894 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:45:33,133 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-10-11 16:45:39,960 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-10-11 16:45:57,073 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-10-11 16:46:25,635 INFO L129 PetriNetUnfolder]: 1011/6590 cut-off events. [2020-10-11 16:46:25,635 INFO L130 PetriNetUnfolder]: For 336562/336562 co-relation queries the response was YES. [2020-10-11 16:46:25,812 INFO L80 FinitePrefix]: Finished finitePrefix Result has 43673 conditions, 6590 events. 1011/6590 cut-off events. For 336562/336562 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 39139 event pairs, 1 based on Foata normal form. 38/6611 useless extension candidates. Maximal degree in co-relation 43549. Up to 1084 conditions per place. [2020-10-11 16:46:25,881 INFO L132 encePairwiseOnDemand]: 181/204 looper letters, 847 selfloop transitions, 877 changer transitions 0/1856 dead transitions. [2020-10-11 16:46:25,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 927 places, 1856 transitions, 32428 flow [2020-10-11 16:46:25,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 411 states. [2020-10-11 16:46:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2020-10-11 16:46:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 66035 transitions. [2020-10-11 16:46:25,957 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7875936262582892 [2020-10-11 16:46:25,957 INFO L72 ComplementDD]: Start complementDD. Operand 411 states and 66035 transitions. [2020-10-11 16:46:25,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 411 states and 66035 transitions. [2020-10-11 16:46:25,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:46:25,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 411 states and 66035 transitions. [2020-10-11 16:46:26,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 412 states. [2020-10-11 16:46:26,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 412 states. [2020-10-11 16:46:26,537 INFO L81 ComplementDD]: Finished complementDD. Result 412 states. [2020-10-11 16:46:26,537 INFO L185 Difference]: Start difference. First operand has 517 places, 521 transitions, 3137 flow. Second operand 411 states and 66035 transitions. [2020-10-11 16:46:26,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 927 places, 1856 transitions, 32428 flow [2020-10-11 16:46:27,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 895 places, 1856 transitions, 31722 flow, removed 195 selfloop flow, removed 32 redundant places. [2020-10-11 16:46:27,089 INFO L241 Difference]: Finished difference. Result has 1041 places, 1296 transitions, 25470 flow [2020-10-11 16:46:27,091 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=2893, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=248, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=411, PETRI_FLOW=25470, PETRI_PLACES=1041, PETRI_TRANSITIONS=1296} [2020-10-11 16:46:27,092 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 856 predicate places. [2020-10-11 16:46:27,092 INFO L481 AbstractCegarLoop]: Abstraction has has 1041 places, 1296 transitions, 25470 flow [2020-10-11 16:46:27,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2020-10-11 16:46:27,092 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:46:27,092 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:46:27,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-10-11 16:46:27,306 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:46:27,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:46:27,308 INFO L82 PathProgramCache]: Analyzing trace with hash -2045829259, now seen corresponding path program 10 times [2020-10-11 16:46:27,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:46:27,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81451818] [2020-10-11 16:46:27,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:46:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:46:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2395 backedges. 0 proven. 2395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:46:28,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81451818] [2020-10-11 16:46:28,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136397046] [2020-10-11 16:46:28,951 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:46:45,559 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 16:46:45,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:46:45,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 28 conjunts are in the unsatisfiable core [2020-10-11 16:46:45,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:46:46,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2395 backedges. 0 proven. 2395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:46:46,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:46:46,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2020-10-11 16:46:46,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739598433] [2020-10-11 16:46:46,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-10-11 16:46:46,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:46:46,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-10-11 16:46:46,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2020-10-11 16:46:50,031 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 204 [2020-10-11 16:46:50,033 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1041 places, 1296 transitions, 25470 flow. Second operand 31 states. [2020-10-11 16:46:50,034 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:46:50,034 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 204 [2020-10-11 16:46:50,034 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:47:00,535 INFO L129 PetriNetUnfolder]: 719/6466 cut-off events. [2020-10-11 16:47:00,535 INFO L130 PetriNetUnfolder]: For 313416/313420 co-relation queries the response was YES. [2020-10-11 16:47:00,810 INFO L80 FinitePrefix]: Finished finitePrefix Result has 40437 conditions, 6466 events. 719/6466 cut-off events. For 313416/313420 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 38899 event pairs, 0 based on Foata normal form. 15/6464 useless extension candidates. Maximal degree in co-relation 40167. Up to 802 conditions per place. [2020-10-11 16:47:00,857 INFO L132 encePairwiseOnDemand]: 199/204 looper letters, 7 selfloop transitions, 191 changer transitions 0/1300 dead transitions. [2020-10-11 16:47:00,857 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1082 places, 1300 transitions, 26036 flow [2020-10-11 16:47:00,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-10-11 16:47:00,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-11 16:47:00,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 8113 transitions. [2020-10-11 16:47:00,869 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9468954248366013 [2020-10-11 16:47:00,869 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 8113 transitions. [2020-10-11 16:47:00,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 8113 transitions. [2020-10-11 16:47:00,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:47:00,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 8113 transitions. [2020-10-11 16:47:00,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 43 states. [2020-10-11 16:47:00,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 43 states. [2020-10-11 16:47:00,887 INFO L81 ComplementDD]: Finished complementDD. Result 43 states. [2020-10-11 16:47:00,887 INFO L185 Difference]: Start difference. First operand has 1041 places, 1296 transitions, 25470 flow. Second operand 42 states and 8113 transitions. [2020-10-11 16:47:00,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1082 places, 1300 transitions, 26036 flow [2020-10-11 16:47:03,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 970 places, 1300 transitions, 9909 flow, removed 7795 selfloop flow, removed 112 redundant places. [2020-10-11 16:47:03,459 INFO L241 Difference]: Finished difference. Result has 973 places, 1299 transitions, 9875 flow [2020-10-11 16:47:03,461 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=9343, PETRI_DIFFERENCE_MINUEND_PLACES=929, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=9875, PETRI_PLACES=973, PETRI_TRANSITIONS=1299} [2020-10-11 16:47:03,462 INFO L341 CegarLoopForPetriNet]: 185 programPoint places, 788 predicate places. [2020-10-11 16:47:03,462 INFO L481 AbstractCegarLoop]: Abstraction has has 973 places, 1299 transitions, 9875 flow [2020-10-11 16:47:03,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-10-11 16:47:03,463 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:47:03,463 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 11, 11, 11, 11, 11, 11, 11, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:47:03,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:47:03,677 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 16:47:03,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:47:03,677 INFO L82 PathProgramCache]: Analyzing trace with hash 769620000, now seen corresponding path program 11 times [2020-10-11 16:47:03,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:47:03,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204771510] [2020-10-11 16:47:03,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:47:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:47:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2807 backedges. 0 proven. 2807 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:47:05,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204771510] [2020-10-11 16:47:05,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946750860] [2020-10-11 16:47:05,273 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 16:48:07,926 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2020-10-11 16:48:07,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 16:48:08,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 293 conjunts are in the unsatisfiable core [2020-10-11 16:48:08,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 16:48:08,893 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 32 treesize of output 16 [2020-10-11 16:48:08,894 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:08,901 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:08,902 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:48:08,902 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:12 [2020-10-11 16:48:09,074 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:09,075 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 63 [2020-10-11 16:48:09,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:48:09,080 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:09,188 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2020-10-11 16:48:09,190 INFO L625 ElimStorePlain]: treesize reduction 24, result has 60.0 percent of original size [2020-10-11 16:48:09,192 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:48:09,192 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:24 [2020-10-11 16:48:09,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:48:09,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:48:10,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:48:10,382 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:48:10,392 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:48:10,452 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:10,452 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 50 [2020-10-11 16:48:10,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 16:48:10,457 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-11 16:48:10,530 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:10,531 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2020-10-11 16:48:10,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-11 16:48:10,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:48:10,537 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-10-11 16:48:10,800 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2020-10-11 16:48:10,803 INFO L625 ElimStorePlain]: treesize reduction 139, result has 35.0 percent of original size [2020-10-11 16:48:10,808 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:48:10,809 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:49 [2020-10-11 16:48:10,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:48:10,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:11,019 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 26 treesize of output 25 [2020-10-11 16:48:11,021 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:11,045 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 15 treesize of output 11 [2020-10-11 16:48:11,045 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:11,156 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-10-11 16:48:11,158 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:11,160 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:48:11,161 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:49 [2020-10-11 16:48:12,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:48:12,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:12,349 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 42 treesize of output 20 [2020-10-11 16:48:12,350 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:12,370 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 32 treesize of output 16 [2020-10-11 16:48:12,371 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:12,467 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:12,468 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:48:12,468 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:99, output treesize:63 [2020-10-11 16:48:12,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:48:12,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:12,770 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 26 treesize of output 25 [2020-10-11 16:48:12,771 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:12,884 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:12,884 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 67 [2020-10-11 16:48:12,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:48:12,889 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:13,163 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-10-11 16:48:13,166 INFO L625 ElimStorePlain]: treesize reduction 24, result has 79.7 percent of original size [2020-10-11 16:48:13,168 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-11 16:48:13,169 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:70 [2020-10-11 16:48:13,448 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-10-11 16:48:13,453 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-11 16:48:13,765 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2020-10-11 16:48:13,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:48:14,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:48:14,915 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:14,915 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2020-10-11 16:48:14,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-11 16:48:14,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:48:14,918 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-11 16:48:14,932 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:48:14,991 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:14,991 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 54 [2020-10-11 16:48:14,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 16:48:14,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 16:48:14,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 16:48:14,999 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-10-11 16:48:15,356 WARN L193 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2020-10-11 16:48:15,358 INFO L625 ElimStorePlain]: treesize reduction 144, result has 41.7 percent of original size [2020-10-11 16:48:15,364 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:48:15,364 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:59 [2020-10-11 16:48:15,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:48:15,594 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 15 treesize of output 11 [2020-10-11 16:48:15,595 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:15,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:15,621 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 36 treesize of output 29 [2020-10-11 16:48:15,622 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:15,742 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-10-11 16:48:15,744 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:15,747 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:48:15,747 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:59 [2020-10-11 16:48:17,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:48:17,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:17,191 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 32 treesize of output 16 [2020-10-11 16:48:17,192 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:17,204 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 52 treesize of output 24 [2020-10-11 16:48:17,205 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:17,322 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-10-11 16:48:17,324 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:17,325 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:48:17,325 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:109, output treesize:75 [2020-10-11 16:48:17,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:48:17,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:17,650 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 26 treesize of output 25 [2020-10-11 16:48:17,651 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:17,765 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:17,766 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 46 treesize of output 71 [2020-10-11 16:48:17,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 16:48:17,769 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:18,069 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2020-10-11 16:48:18,071 INFO L625 ElimStorePlain]: treesize reduction 24, result has 81.3 percent of original size [2020-10-11 16:48:18,074 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-11 16:48:18,075 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:80 [2020-10-11 16:48:18,411 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-10-11 16:48:18,414 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-11 16:48:18,794 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2020-10-11 16:48:18,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:48:20,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:48:20,145 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:20,146 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2020-10-11 16:48:20,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-11 16:48:20,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:48:20,148 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-11 16:48:20,163 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:48:20,235 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:20,235 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 52 treesize of output 58 [2020-10-11 16:48:20,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 16:48:20,241 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-10-11 16:48:20,621 WARN L193 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2020-10-11 16:48:20,624 INFO L625 ElimStorePlain]: treesize reduction 143, result has 44.1 percent of original size [2020-10-11 16:48:20,629 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:48:20,629 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:111, output treesize:69 [2020-10-11 16:48:20,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:48:20,897 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 15 treesize of output 11 [2020-10-11 16:48:20,898 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:20,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:20,925 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 46 treesize of output 33 [2020-10-11 16:48:20,927 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:21,070 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-10-11 16:48:21,073 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:21,075 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:48:21,076 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:69 [2020-10-11 16:48:21,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2020-10-11 16:48:21,959 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:21,964 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:21,965 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:48:21,965 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:9 [2020-10-11 16:48:22,211 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:22,212 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 62 [2020-10-11 16:48:22,213 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:22,315 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2020-10-11 16:48:22,318 INFO L625 ElimStorePlain]: treesize reduction 24, result has 59.3 percent of original size [2020-10-11 16:48:22,320 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:48:22,320 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2020-10-11 16:48:22,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:48:22,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:48:24,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:48:24,325 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:24,325 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2020-10-11 16:48:24,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-11 16:48:24,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:48:24,328 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-11 16:48:24,339 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:48:24,397 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:24,397 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 49 [2020-10-11 16:48:24,399 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:24,682 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2020-10-11 16:48:24,684 INFO L625 ElimStorePlain]: treesize reduction 53, result has 61.3 percent of original size [2020-10-11 16:48:24,690 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:48:24,691 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2020-10-11 16:48:24,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:48:24,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:25,003 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 24 [2020-10-11 16:48:25,004 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:25,022 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 15 treesize of output 11 [2020-10-11 16:48:25,023 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:25,146 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-10-11 16:48:25,147 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:25,150 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:48:25,151 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2020-10-11 16:48:26,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:48:26,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:26,990 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 32 treesize of output 16 [2020-10-11 16:48:26,990 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:27,005 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 41 treesize of output 19 [2020-10-11 16:48:27,006 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:27,137 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2020-10-11 16:48:27,139 INFO L625 ElimStorePlain]: treesize reduction 13, result has 79.0 percent of original size [2020-10-11 16:48:27,139 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:48:27,139 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:49 [2020-10-11 16:48:27,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:48:27,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:27,541 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 26 treesize of output 25 [2020-10-11 16:48:27,541 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:27,650 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:27,650 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 62 [2020-10-11 16:48:27,651 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:27,903 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-10-11 16:48:27,905 INFO L625 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2020-10-11 16:48:27,908 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-11 16:48:27,909 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:58 [2020-10-11 16:48:29,773 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-10-11 16:48:30,325 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-10-11 16:48:30,881 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-10-11 16:48:30,885 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-11 16:48:30,993 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:30,993 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2020-10-11 16:48:30,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-11 16:48:30,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:48:30,996 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-11 16:48:31,013 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:48:31,025 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:48:31,089 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:31,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 50 [2020-10-11 16:48:31,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 16:48:31,093 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-10-11 16:48:31,105 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:48:31,164 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:31,165 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 49 [2020-10-11 16:48:31,166 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:31,687 WARN L193 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2020-10-11 16:48:31,690 INFO L625 ElimStorePlain]: treesize reduction 147, result has 46.9 percent of original size [2020-10-11 16:48:31,706 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-11 16:48:31,707 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:140, output treesize:77 [2020-10-11 16:48:34,233 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-11 16:48:34,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:34,283 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 26 treesize of output 25 [2020-10-11 16:48:34,285 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:34,305 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 15 treesize of output 11 [2020-10-11 16:48:34,306 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:34,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:34,340 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 24 [2020-10-11 16:48:34,341 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:34,542 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-11 16:48:34,545 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:34,547 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-11 16:48:34,548 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:122, output treesize:77 [2020-10-11 16:48:37,654 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-10-11 16:48:38,242 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-10-11 16:48:40,885 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-10-11 16:48:43,507 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-10-11 16:48:43,511 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-10-11 16:48:43,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:43,546 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 32 treesize of output 16 [2020-10-11 16:48:43,547 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:43,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:43,567 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 41 treesize of output 19 [2020-10-11 16:48:43,568 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:43,583 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 42 treesize of output 20 [2020-10-11 16:48:43,584 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:43,872 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2020-10-11 16:48:43,874 INFO L625 ElimStorePlain]: treesize reduction 13, result has 86.9 percent of original size [2020-10-11 16:48:43,875 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-11 16:48:43,875 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:152, output treesize:86 [2020-10-11 16:48:44,513 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-11 16:48:44,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:44,560 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 26 treesize of output 25 [2020-10-11 16:48:44,561 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:44,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:44,601 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 36 treesize of output 29 [2020-10-11 16:48:44,602 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:44,706 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:44,707 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 62 [2020-10-11 16:48:44,707 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:45,069 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2020-10-11 16:48:45,072 INFO L625 ElimStorePlain]: treesize reduction 24, result has 84.0 percent of original size [2020-10-11 16:48:45,075 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-11 16:48:45,075 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:124, output treesize:91 [2020-10-11 16:48:45,667 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-10-11 16:48:46,391 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-10-11 16:48:47,058 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-10-11 16:48:47,736 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-10-11 16:48:48,558 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-10-11 16:48:49,264 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-11 16:48:49,268 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-10-11 16:48:49,293 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:48:49,303 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:48:49,384 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:49,385 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 49 [2020-10-11 16:48:49,386 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:49,402 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:48:49,412 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:48:49,484 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:49,485 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 50 [2020-10-11 16:48:49,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 16:48:49,488 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-10-11 16:48:49,582 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:49,583 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2020-10-11 16:48:49,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-11 16:48:49,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:48:49,586 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2020-10-11 16:48:49,602 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:48:49,663 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:49,664 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 54 [2020-10-11 16:48:49,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 16:48:49,667 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2020-10-11 16:48:50,490 WARN L193 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 70 [2020-10-11 16:48:50,493 INFO L625 ElimStorePlain]: treesize reduction 252, result has 42.5 percent of original size [2020-10-11 16:48:50,501 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-11 16:48:50,502 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:200, output treesize:116 [2020-10-11 16:48:51,119 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-10-11 16:48:51,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:51,179 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 24 [2020-10-11 16:48:51,180 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:51,207 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 15 treesize of output 11 [2020-10-11 16:48:51,208 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:51,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:51,262 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 26 treesize of output 25 [2020-10-11 16:48:51,263 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:51,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:51,295 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 36 treesize of output 29 [2020-10-11 16:48:51,296 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:51,575 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-10-11 16:48:51,577 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:51,580 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-11 16:48:51,581 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:176, output treesize:116 [2020-10-11 16:48:52,938 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-11 16:48:53,725 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-10-11 16:48:54,486 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-11 16:48:55,247 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-11 16:48:55,252 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-10-11 16:48:55,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:55,291 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 32 treesize of output 16 [2020-10-11 16:48:55,293 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:55,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:55,318 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 52 treesize of output 24 [2020-10-11 16:48:55,319 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:55,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:48:55,347 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 42 treesize of output 20 [2020-10-11 16:48:55,348 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:55,366 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 41 treesize of output 19 [2020-10-11 16:48:55,367 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-11 16:48:57,575 WARN L193 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 49 [2020-10-11 16:48:57,576 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:48:57,577 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-11 16:48:57,578 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:216, output treesize:133 [2020-10-11 16:49:02,487 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-10-11 16:49:02,493 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-10-11 16:49:02,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:02,550 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 46 treesize of output 33 [2020-10-11 16:49:02,551 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:02,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:02,599 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 36 treesize of output 29 [2020-10-11 16:49:02,599 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:02,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:02,653 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 26 treesize of output 25 [2020-10-11 16:49:02,654 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:02,783 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:02,784 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 62 [2020-10-11 16:49:02,785 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:03,329 WARN L193 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2020-10-11 16:49:03,332 INFO L625 ElimStorePlain]: treesize reduction 24, result has 88.2 percent of original size [2020-10-11 16:49:03,335 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-10-11 16:49:03,335 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:182, output treesize:134 [2020-10-11 16:49:04,178 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-10-11 16:49:05,112 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-10-11 16:49:05,995 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-10-11 16:49:06,917 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-10-11 16:49:09,913 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-10-11 16:49:12,821 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-10-11 16:49:12,825 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-10-11 16:49:12,929 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:12,930 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2020-10-11 16:49:12,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-11 16:49:12,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:49:12,932 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-11 16:49:12,949 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:49:12,959 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:49:13,031 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:13,032 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 49 [2020-10-11 16:49:13,032 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:13,048 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:49:13,059 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:49:13,128 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:13,129 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 50 [2020-10-11 16:49:13,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 16:49:13,132 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2020-10-11 16:49:13,154 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:49:13,165 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:49:13,239 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:13,239 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 52 treesize of output 58 [2020-10-11 16:49:13,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 16:49:13,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 16:49:13,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 16:49:13,244 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2020-10-11 16:49:13,265 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:49:13,334 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:13,335 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 54 [2020-10-11 16:49:13,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 16:49:13,337 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2020-10-11 16:49:14,423 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 132 DAG size of output: 78 [2020-10-11 16:49:14,426 INFO L625 ElimStorePlain]: treesize reduction 390, result has 39.3 percent of original size [2020-10-11 16:49:14,433 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-10-11 16:49:14,433 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:270, output treesize:165 [2020-10-11 16:49:15,201 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-10-11 16:49:15,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:15,275 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 26 treesize of output 25 [2020-10-11 16:49:15,275 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:15,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:15,336 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 46 treesize of output 33 [2020-10-11 16:49:15,336 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:15,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:15,386 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 36 treesize of output 29 [2020-10-11 16:49:15,386 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:15,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:15,432 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 24 [2020-10-11 16:49:15,433 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:15,455 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 15 treesize of output 11 [2020-10-11 16:49:15,455 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:15,856 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-11 16:49:15,858 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:15,862 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-10-11 16:49:15,862 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:240, output treesize:165 [2020-10-11 16:49:17,511 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-10-11 16:49:18,442 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-11 16:49:19,423 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-11 16:49:22,461 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-11 16:49:22,467 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-10-11 16:49:22,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:22,503 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 62 treesize of output 28 [2020-10-11 16:49:22,503 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:22,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:22,526 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 41 treesize of output 19 [2020-10-11 16:49:22,527 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:22,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:22,547 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 42 treesize of output 20 [2020-10-11 16:49:22,548 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:22,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:22,568 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 32 treesize of output 16 [2020-10-11 16:49:22,569 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:22,583 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 52 treesize of output 24 [2020-10-11 16:49:22,584 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:27,155 WARN L193 SmtUtils]: Spent 4.57 s on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2020-10-11 16:49:27,157 INFO L625 ElimStorePlain]: treesize reduction 13, result has 93.8 percent of original size [2020-10-11 16:49:27,157 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-10-11 16:49:27,158 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:290, output treesize:196 [2020-10-11 16:49:30,171 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-10-11 16:49:30,177 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-10-11 16:49:30,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:30,239 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 36 treesize of output 29 [2020-10-11 16:49:30,240 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:30,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:30,292 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 26 treesize of output 25 [2020-10-11 16:49:30,293 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:30,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:30,338 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 46 treesize of output 33 [2020-10-11 16:49:30,339 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:30,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:30,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 56 treesize of output 37 [2020-10-11 16:49:30,381 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:30,498 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:30,499 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 62 [2020-10-11 16:49:30,500 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:31,185 WARN L193 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2020-10-11 16:49:31,188 INFO L625 ElimStorePlain]: treesize reduction 24, result has 91.0 percent of original size [2020-10-11 16:49:31,190 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-10-11 16:49:31,191 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:250, output treesize:187 [2020-10-11 16:49:36,272 WARN L193 SmtUtils]: Spent 2.27 s on a formula simplification that was a NOOP. DAG size: 58 [2020-10-11 16:49:36,276 INFO L603 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2020-10-11 16:49:37,191 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 28 [2020-10-11 16:49:37,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:49:39,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:49:39,605 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:49:39,616 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:49:39,695 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:39,695 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 49 [2020-10-11 16:49:39,696 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:39,781 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:39,782 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2020-10-11 16:49:39,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-11 16:49:39,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:49:39,784 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-10-11 16:49:40,125 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2020-10-11 16:49:40,127 INFO L625 ElimStorePlain]: treesize reduction 53, result has 61.3 percent of original size [2020-10-11 16:49:40,133 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:49:40,133 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2020-10-11 16:49:40,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 16:49:40,712 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 15 treesize of output 11 [2020-10-11 16:49:40,713 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:40,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:40,759 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 24 [2020-10-11 16:49:40,760 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:40,910 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-10-11 16:49:40,912 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:40,915 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-11 16:49:40,915 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2020-10-11 16:49:42,830 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2020-10-11 16:49:42,852 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 13 [2020-10-11 16:49:42,855 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:42,904 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:42,904 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-11 16:49:42,905 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2020-10-11 16:49:43,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:43,460 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 24 [2020-10-11 16:49:43,461 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:43,514 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:43,517 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-11 16:49:43,518 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2020-10-11 16:49:46,673 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:49:46,738 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:46,738 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2020-10-11 16:49:46,740 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:46,914 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2020-10-11 16:49:46,916 INFO L625 ElimStorePlain]: treesize reduction 30, result has 64.3 percent of original size [2020-10-11 16:49:46,919 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-11 16:49:46,920 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2020-10-11 16:49:46,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:46,943 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 24 [2020-10-11 16:49:46,944 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:47,015 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:47,017 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-11 16:49:47,018 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2020-10-11 16:49:48,448 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 34 treesize of output 18 [2020-10-11 16:49:48,449 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:48,514 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:48,515 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-11 16:49:48,515 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2020-10-11 16:49:49,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:49,189 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 24 [2020-10-11 16:49:49,189 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:49,244 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:49,246 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-11 16:49:49,247 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2020-10-11 16:49:52,782 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:49:52,848 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:52,849 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 49 [2020-10-11 16:49:52,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 16:49:52,852 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-11 16:49:53,028 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2020-10-11 16:49:53,031 INFO L625 ElimStorePlain]: treesize reduction 93, result has 38.0 percent of original size [2020-10-11 16:49:53,033 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-11 16:49:53,034 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:40 [2020-10-11 16:49:53,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:53,067 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 24 [2020-10-11 16:49:53,068 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:53,159 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:53,164 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-11 16:49:53,164 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2020-10-11 16:49:56,439 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 34 treesize of output 18 [2020-10-11 16:49:56,440 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:56,491 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:56,492 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-11 16:49:56,493 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2020-10-11 16:49:57,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:49:57,105 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 24 [2020-10-11 16:49:57,106 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:49:57,159 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:49:57,161 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-11 16:49:57,162 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2020-10-11 16:50:00,775 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:50:00,840 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:50:00,841 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2020-10-11 16:50:00,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:50:00,844 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:50:01,048 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2020-10-11 16:50:01,051 INFO L625 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2020-10-11 16:50:01,053 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-11 16:50:01,054 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2020-10-11 16:50:01,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:50:01,083 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 24 [2020-10-11 16:50:01,084 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:50:01,154 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:50:01,157 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-11 16:50:01,157 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2020-10-11 16:50:04,401 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 34 treesize of output 18 [2020-10-11 16:50:04,401 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:50:04,455 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:50:04,457 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-11 16:50:04,457 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2020-10-11 16:50:05,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:50:05,165 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 24 [2020-10-11 16:50:05,166 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:50:05,226 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:50:05,229 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-11 16:50:05,229 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2020-10-11 16:50:09,096 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-11 16:50:09,164 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:50:09,164 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2020-10-11 16:50:09,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:50:09,166 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:50:09,368 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2020-10-11 16:50:09,370 INFO L625 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2020-10-11 16:50:09,372 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-11 16:50:09,373 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2020-10-11 16:50:09,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:50:09,398 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 24 [2020-10-11 16:50:09,398 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:50:09,470 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:50:09,472 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-11 16:50:09,473 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2020-10-11 16:50:10,360 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-10-11 16:50:11,233 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 34 treesize of output 18 [2020-10-11 16:50:11,234 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:50:11,294 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:50:11,295 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-11 16:50:11,295 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2020-10-11 16:50:12,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-11 16:50:12,028 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 30 treesize of output 29 [2020-10-11 16:50:12,029 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:50:12,059 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:50:12,063 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-11 16:50:12,064 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:9 [2020-10-11 16:50:14,366 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:50:14,366 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 57 [2020-10-11 16:50:14,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 16:50:14,369 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:50:14,469 INFO L625 ElimStorePlain]: treesize reduction 35, result has 46.2 percent of original size [2020-10-11 16:50:14,473 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-11 16:50:14,473 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2020-10-11 16:50:14,524 INFO L350 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2020-10-11 16:50:14,524 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 24 [2020-10-11 16:50:14,525 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:50:14,549 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:50:14,552 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-11 16:50:14,552 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2020-10-11 16:50:14,565 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 19 treesize of output 7 [2020-10-11 16:50:14,566 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-11 16:50:14,574 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 16:50:14,574 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-11 16:50:14,575 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-10-11 16:50:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2807 backedges. 1908 proven. 899 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:50:17,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 16:50:17,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 132] total 161 [2020-10-11 16:50:17,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954630748] [2020-10-11 16:50:17,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 161 states [2020-10-11 16:50:17,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:50:17,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2020-10-11 16:50:17,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2576, Invalid=23179, Unknown=5, NotChecked=0, Total=25760 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown