/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/stack_longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 14:44:48,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 14:44:48,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 14:44:48,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 14:44:48,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 14:44:48,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 14:44:48,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 14:44:48,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 14:44:48,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 14:44:48,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 14:44:48,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 14:44:48,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 14:44:48,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 14:44:48,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 14:44:48,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 14:44:48,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 14:44:48,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 14:44:48,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 14:44:48,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 14:44:48,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 14:44:48,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 14:44:48,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 14:44:48,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 14:44:48,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 14:44:48,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 14:44:48,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 14:44:48,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 14:44:48,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 14:44:48,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 14:44:48,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 14:44:48,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 14:44:48,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 14:44:48,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 14:44:48,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 14:44:48,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 14:44:48,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 14:44:48,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 14:44:48,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 14:44:48,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 14:44:48,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 14:44:48,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 14:44:48,505 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-09 14:44:48,545 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 14:44:48,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 14:44:48,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 14:44:48,548 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 14:44:48,548 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 14:44:48,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 14:44:48,549 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 14:44:48,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 14:44:48,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 14:44:48,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 14:44:48,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 14:44:48,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 14:44:48,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 14:44:48,551 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 14:44:48,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 14:44:48,552 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 14:44:48,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 14:44:48,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 14:44:48,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 14:44:48,553 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 14:44:48,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 14:44:48,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 14:44:48,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 14:44:48,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 14:44:48,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 14:44:48,554 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-10-09 14:44:48,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 14:44:48,554 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-09 14:44:48,554 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-09 14:44:48,554 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 14:44:48,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 14:44:48,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 14:44:48,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 14:44:48,872 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 14:44:48,872 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 14:44:48,873 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-2.i [2020-10-09 14:44:48,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5edb1f47a/4fc476fc073f4c20b779c5b1aea82b81/FLAGe314f9db8 [2020-10-09 14:44:49,492 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 14:44:49,493 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i [2020-10-09 14:44:49,515 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5edb1f47a/4fc476fc073f4c20b779c5b1aea82b81/FLAGe314f9db8 [2020-10-09 14:44:49,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5edb1f47a/4fc476fc073f4c20b779c5b1aea82b81 [2020-10-09 14:44:49,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 14:44:49,748 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 14:44:49,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 14:44:49,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 14:44:49,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 14:44:49,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 02:44:49" (1/1) ... [2020-10-09 14:44:49,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5708db2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:49, skipping insertion in model container [2020-10-09 14:44:49,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 02:44:49" (1/1) ... [2020-10-09 14:44:49,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 14:44:49,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 14:44:50,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 14:44:50,467 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 14:44:50,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 14:44:50,669 INFO L208 MainTranslator]: Completed translation [2020-10-09 14:44:50,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:50 WrapperNode [2020-10-09 14:44:50,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 14:44:50,673 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 14:44:50,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 14:44:50,673 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 14:44:50,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:50" (1/1) ... [2020-10-09 14:44:50,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:50" (1/1) ... [2020-10-09 14:44:50,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 14:44:50,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 14:44:50,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 14:44:50,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 14:44:50,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:50" (1/1) ... [2020-10-09 14:44:50,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:50" (1/1) ... [2020-10-09 14:44:50,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:50" (1/1) ... [2020-10-09 14:44:50,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:50" (1/1) ... [2020-10-09 14:44:50,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:50" (1/1) ... [2020-10-09 14:44:50,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:50" (1/1) ... [2020-10-09 14:44:50,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:50" (1/1) ... [2020-10-09 14:44:50,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 14:44:50,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 14:44:50,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 14:44:50,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 14:44:50,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 14:44:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-10-09 14:44:50,879 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-10-09 14:44:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-10-09 14:44:50,879 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-10-09 14:44:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 14:44:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 14:44:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-09 14:44:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 14:44:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-09 14:44:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-09 14:44:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 14:44:50,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 14:44:50,883 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 14:44:51,361 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 14:44:51,361 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-09 14:44:51,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 02:44:51 BoogieIcfgContainer [2020-10-09 14:44:51,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 14:44:51,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 14:44:51,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 14:44:51,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 14:44:51,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 02:44:49" (1/3) ... [2020-10-09 14:44:51,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b89aaaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 02:44:51, skipping insertion in model container [2020-10-09 14:44:51,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:44:50" (2/3) ... [2020-10-09 14:44:51,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b89aaaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 02:44:51, skipping insertion in model container [2020-10-09 14:44:51,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 02:44:51" (3/3) ... [2020-10-09 14:44:51,373 INFO L111 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2020-10-09 14:44:51,386 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 14:44:51,394 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 14:44:51,395 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 14:44:51,431 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,432 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,432 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,432 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,433 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,433 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,433 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,433 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,434 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,434 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,434 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,435 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,435 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,435 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,435 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,436 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,436 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,436 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,436 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,436 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,437 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,437 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,437 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,438 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,438 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,438 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,438 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,438 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,439 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,439 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,439 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,439 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,439 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,440 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,440 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,440 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,440 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,441 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,441 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,441 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,441 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,442 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,442 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,442 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,443 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,443 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,443 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,443 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,444 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,444 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,444 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,444 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,445 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,445 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,445 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,445 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,446 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,446 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,446 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,447 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,447 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,447 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,447 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,448 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,448 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,448 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,448 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,449 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,450 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,450 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,450 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,451 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,451 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,451 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,451 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,452 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,452 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,452 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,452 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,453 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,453 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,453 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,454 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,454 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,454 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,454 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,455 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,455 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,455 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,455 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,456 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,456 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,456 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,456 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,456 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,457 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,457 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,457 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,458 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,458 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,458 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,459 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,459 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,459 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,459 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,460 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,460 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,460 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,460 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,461 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,461 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,461 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,462 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,462 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,462 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,462 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,463 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,463 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,463 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,463 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,464 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,464 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,464 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,468 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,468 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,468 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,469 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,469 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,469 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,469 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,469 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,470 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,470 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,470 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,470 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,471 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,471 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,471 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,471 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,471 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,472 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,472 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,472 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,472 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,473 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,473 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,480 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,480 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,481 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,481 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,481 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,481 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,481 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,482 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,482 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,482 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,482 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,483 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,483 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,483 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,483 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,484 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,484 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,484 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:44:51,512 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-09 14:44:51,536 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 14:44:51,536 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 14:44:51,536 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 14:44:51,536 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 14:44:51,537 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 14:44:51,537 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 14:44:51,537 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 14:44:51,537 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 14:44:51,554 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 133 places, 138 transitions, 298 flow [2020-10-09 14:44:51,623 INFO L129 PetriNetUnfolder]: 11/138 cut-off events. [2020-10-09 14:44:51,623 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-09 14:44:51,630 INFO L80 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 138 events. 11/138 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 106. Up to 3 conditions per place. [2020-10-09 14:44:51,631 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 138 transitions, 298 flow [2020-10-09 14:44:51,639 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 126 transitions, 264 flow [2020-10-09 14:44:51,666 INFO L129 PetriNetUnfolder]: 6/101 cut-off events. [2020-10-09 14:44:51,667 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-09 14:44:51,667 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:44:51,668 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 14:44:51,668 INFO L429 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:44:51,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:44:51,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1945168569, now seen corresponding path program 1 times [2020-10-09 14:44:51,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:44:51,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196326784] [2020-10-09 14:44:51,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-09 14:44:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:44:51,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 14:44:51,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:44:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:44:51,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:44:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:44:51,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196326784] [2020-10-09 14:44:51,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:44:51,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 14:44:51,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783890231] [2020-10-09 14:44:51,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 14:44:51,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:44:51,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 14:44:51,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 14:44:52,025 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 138 [2020-10-09 14:44:52,027 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 126 transitions, 264 flow. Second operand 3 states. [2020-10-09 14:44:52,027 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:44:52,027 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 138 [2020-10-09 14:44:52,029 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:44:52,208 INFO L129 PetriNetUnfolder]: 28/476 cut-off events. [2020-10-09 14:44:52,208 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 14:44:52,216 INFO L80 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 476 events. 28/476 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1981 event pairs, 2 based on Foata normal form. 45/485 useless extension candidates. Maximal degree in co-relation 487. Up to 23 conditions per place. [2020-10-09 14:44:52,221 INFO L132 encePairwiseOnDemand]: 127/138 looper letters, 7 selfloop transitions, 4 changer transitions 0/125 dead transitions. [2020-10-09 14:44:52,221 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 125 transitions, 284 flow [2020-10-09 14:44:52,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 14:44:52,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 14:44:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2020-10-09 14:44:52,246 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9685990338164251 [2020-10-09 14:44:52,247 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2020-10-09 14:44:52,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2020-10-09 14:44:52,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:44:52,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2020-10-09 14:44:52,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 14:44:52,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 14:44:52,273 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 14:44:52,275 INFO L185 Difference]: Start difference. First operand has 122 places, 126 transitions, 264 flow. Second operand 3 states and 401 transitions. [2020-10-09 14:44:52,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 125 transitions, 284 flow [2020-10-09 14:44:52,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 125 transitions, 276 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-09 14:44:52,290 INFO L241 Difference]: Finished difference. Result has 122 places, 125 transitions, 282 flow [2020-10-09 14:44:52,293 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=122, PETRI_TRANSITIONS=125} [2020-10-09 14:44:52,295 INFO L341 CegarLoopForPetriNet]: 122 programPoint places, 0 predicate places. [2020-10-09 14:44:52,295 INFO L481 AbstractCegarLoop]: Abstraction has has 122 places, 125 transitions, 282 flow [2020-10-09 14:44:52,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 14:44:52,295 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:44:52,295 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] [2020-10-09 14:44:52,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-09 14:44:52,512 INFO L429 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:44:52,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:44:52,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1440008092, now seen corresponding path program 1 times [2020-10-09 14:44:52,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:44:52,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286989404] [2020-10-09 14:44:52,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-09 14:44:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:44:52,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 14:44:52,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:44:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:44:52,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:44:52,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:44:52,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286989404] [2020-10-09 14:44:52,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:44:52,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-09 14:44:52,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861410679] [2020-10-09 14:44:52,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 14:44:52,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:44:52,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 14:44:52,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-09 14:44:52,791 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 138 [2020-10-09 14:44:52,793 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 125 transitions, 282 flow. Second operand 4 states. [2020-10-09 14:44:52,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:44:52,793 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 138 [2020-10-09 14:44:52,794 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:44:52,901 INFO L129 PetriNetUnfolder]: 28/592 cut-off events. [2020-10-09 14:44:52,902 INFO L130 PetriNetUnfolder]: For 87/130 co-relation queries the response was YES. [2020-10-09 14:44:52,907 INFO L80 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 592 events. 28/592 cut-off events. For 87/130 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2068 event pairs, 0 based on Foata normal form. 10/563 useless extension candidates. Maximal degree in co-relation 621. Up to 36 conditions per place. [2020-10-09 14:44:52,911 INFO L132 encePairwiseOnDemand]: 132/138 looper letters, 9 selfloop transitions, 4 changer transitions 0/127 dead transitions. [2020-10-09 14:44:52,912 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 127 transitions, 316 flow [2020-10-09 14:44:52,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 14:44:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 14:44:52,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2020-10-09 14:44:52,914 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9396135265700483 [2020-10-09 14:44:52,915 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2020-10-09 14:44:52,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2020-10-09 14:44:52,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:44:52,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2020-10-09 14:44:52,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 14:44:52,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 14:44:52,919 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 14:44:52,919 INFO L185 Difference]: Start difference. First operand has 122 places, 125 transitions, 282 flow. Second operand 3 states and 389 transitions. [2020-10-09 14:44:52,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 127 transitions, 316 flow [2020-10-09 14:44:52,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 127 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-09 14:44:52,926 INFO L241 Difference]: Finished difference. Result has 124 places, 127 transitions, 306 flow [2020-10-09 14:44:52,927 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=124, PETRI_TRANSITIONS=127} [2020-10-09 14:44:52,927 INFO L341 CegarLoopForPetriNet]: 122 programPoint places, 2 predicate places. [2020-10-09 14:44:52,928 INFO L481 AbstractCegarLoop]: Abstraction has has 124 places, 127 transitions, 306 flow [2020-10-09 14:44:52,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 14:44:52,928 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:44:52,929 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] [2020-10-09 14:44:53,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-09 14:44:53,145 INFO L429 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:44:53,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:44:53,146 INFO L82 PathProgramCache]: Analyzing trace with hash 2070190818, now seen corresponding path program 1 times [2020-10-09 14:44:53,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:44:53,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284887744] [2020-10-09 14:44:53,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-09 14:44:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:44:53,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 14:44:53,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:44:53,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:44:53,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:44:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:44:53,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284887744] [2020-10-09 14:44:53,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:44:53,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-09 14:44:53,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96818519] [2020-10-09 14:44:53,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 14:44:53,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:44:53,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 14:44:53,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 14:44:53,392 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 138 [2020-10-09 14:44:53,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 127 transitions, 306 flow. Second operand 4 states. [2020-10-09 14:44:53,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:44:53,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 138 [2020-10-09 14:44:53,393 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:44:53,503 INFO L129 PetriNetUnfolder]: 28/580 cut-off events. [2020-10-09 14:44:53,503 INFO L130 PetriNetUnfolder]: For 38/55 co-relation queries the response was YES. [2020-10-09 14:44:53,507 INFO L80 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 580 events. 28/580 cut-off events. For 38/55 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1998 event pairs, 0 based on Foata normal form. 4/554 useless extension candidates. Maximal degree in co-relation 632. Up to 37 conditions per place. [2020-10-09 14:44:53,510 INFO L132 encePairwiseOnDemand]: 133/138 looper letters, 7 selfloop transitions, 4 changer transitions 0/130 dead transitions. [2020-10-09 14:44:53,510 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 130 transitions, 334 flow [2020-10-09 14:44:53,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-09 14:44:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-09 14:44:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2020-10-09 14:44:53,513 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.927536231884058 [2020-10-09 14:44:53,513 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2020-10-09 14:44:53,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2020-10-09 14:44:53,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:44:53,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2020-10-09 14:44:53,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-09 14:44:53,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-09 14:44:53,516 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-09 14:44:53,517 INFO L185 Difference]: Start difference. First operand has 124 places, 127 transitions, 306 flow. Second operand 4 states and 512 transitions. [2020-10-09 14:44:53,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 130 transitions, 334 flow [2020-10-09 14:44:53,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 130 transitions, 322 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-09 14:44:53,522 INFO L241 Difference]: Finished difference. Result has 127 places, 130 transitions, 322 flow [2020-10-09 14:44:53,522 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=127, PETRI_TRANSITIONS=130} [2020-10-09 14:44:53,523 INFO L341 CegarLoopForPetriNet]: 122 programPoint places, 5 predicate places. [2020-10-09 14:44:53,523 INFO L481 AbstractCegarLoop]: Abstraction has has 127 places, 130 transitions, 322 flow [2020-10-09 14:44:53,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 14:44:53,523 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:44:53,523 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] [2020-10-09 14:44:53,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-09 14:44:53,736 INFO L429 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:44:53,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:44:53,737 INFO L82 PathProgramCache]: Analyzing trace with hash 63058072, now seen corresponding path program 1 times [2020-10-09 14:44:53,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:44:53,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528967845] [2020-10-09 14:44:53,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-09 14:44:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:44:53,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 14:44:53,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:44:53,918 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-09 14:44:53,920 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:44:53,923 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:44:53,924 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:44:53,924 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-10-09 14:44:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:44:53,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:44:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:44:53,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528967845] [2020-10-09 14:44:53,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:44:53,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-09 14:44:53,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129482146] [2020-10-09 14:44:53,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 14:44:53,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:44:53,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 14:44:53,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-09 14:44:54,057 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 138 [2020-10-09 14:44:54,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 130 transitions, 322 flow. Second operand 4 states. [2020-10-09 14:44:54,058 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:44:54,058 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 138 [2020-10-09 14:44:54,058 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:44:54,142 INFO L129 PetriNetUnfolder]: 14/399 cut-off events. [2020-10-09 14:44:54,142 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 14:44:54,144 INFO L80 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 399 events. 14/399 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1130 event pairs, 0 based on Foata normal form. 11/389 useless extension candidates. Maximal degree in co-relation 424. Up to 15 conditions per place. [2020-10-09 14:44:54,145 INFO L132 encePairwiseOnDemand]: 134/138 looper letters, 2 selfloop transitions, 4 changer transitions 0/126 dead transitions. [2020-10-09 14:44:54,146 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 126 transitions, 320 flow [2020-10-09 14:44:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 14:44:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 14:44:54,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2020-10-09 14:44:54,148 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9396135265700483 [2020-10-09 14:44:54,148 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2020-10-09 14:44:54,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2020-10-09 14:44:54,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:44:54,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2020-10-09 14:44:54,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 14:44:54,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 14:44:54,151 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 14:44:54,151 INFO L185 Difference]: Start difference. First operand has 127 places, 130 transitions, 322 flow. Second operand 3 states and 389 transitions. [2020-10-09 14:44:54,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 126 transitions, 320 flow [2020-10-09 14:44:54,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 126 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 14:44:54,156 INFO L241 Difference]: Finished difference. Result has 126 places, 126 transitions, 314 flow [2020-10-09 14:44:54,156 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=126, PETRI_TRANSITIONS=126} [2020-10-09 14:44:54,156 INFO L341 CegarLoopForPetriNet]: 122 programPoint places, 4 predicate places. [2020-10-09 14:44:54,157 INFO L481 AbstractCegarLoop]: Abstraction has has 126 places, 126 transitions, 314 flow [2020-10-09 14:44:54,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 14:44:54,157 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:44:54,157 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 14:44:54,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-09 14:44:54,379 INFO L429 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:44:54,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:44:54,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1239398404, now seen corresponding path program 1 times [2020-10-09 14:44:54,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:44:54,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115992211] [2020-10-09 14:44:54,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-09 14:44:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:44:54,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-09 14:44:54,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:44:54,514 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:44:54,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:44:54,581 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:44:54,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115992211] [2020-10-09 14:44:54,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1335403456] [2020-10-09 14:44:54,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:44:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:44:54,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-09 14:44:54,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:44:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:44:54,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:44:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:44:54,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940434681] [2020-10-09 14:44:54,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:44:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:44:54,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-09 14:44:54,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:44:54,883 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:44:54,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:44:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:44:54,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:44:54,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2020-10-09 14:44:54,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922431063] [2020-10-09 14:44:54,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 14:44:54,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:44:54,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 14:44:54,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-09 14:44:55,156 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 138 [2020-10-09 14:44:55,157 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 126 transitions, 314 flow. Second operand 8 states. [2020-10-09 14:44:55,157 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:44:55,157 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 138 [2020-10-09 14:44:55,158 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:44:55,295 INFO L129 PetriNetUnfolder]: 20/589 cut-off events. [2020-10-09 14:44:55,296 INFO L130 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2020-10-09 14:44:55,298 INFO L80 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 589 events. 20/589 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1833 event pairs, 0 based on Foata normal form. 4/562 useless extension candidates. Maximal degree in co-relation 709. Up to 28 conditions per place. [2020-10-09 14:44:55,300 INFO L132 encePairwiseOnDemand]: 131/138 looper letters, 18 selfloop transitions, 13 changer transitions 0/142 dead transitions. [2020-10-09 14:44:55,300 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 142 transitions, 436 flow [2020-10-09 14:44:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 14:44:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 14:44:55,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1128 transitions. [2020-10-09 14:44:55,304 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9082125603864735 [2020-10-09 14:44:55,304 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1128 transitions. [2020-10-09 14:44:55,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1128 transitions. [2020-10-09 14:44:55,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:44:55,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1128 transitions. [2020-10-09 14:44:55,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 14:44:55,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 14:44:55,311 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 14:44:55,311 INFO L185 Difference]: Start difference. First operand has 126 places, 126 transitions, 314 flow. Second operand 9 states and 1128 transitions. [2020-10-09 14:44:55,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 142 transitions, 436 flow [2020-10-09 14:44:55,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 142 transitions, 432 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 14:44:55,316 INFO L241 Difference]: Finished difference. Result has 136 places, 136 transitions, 403 flow [2020-10-09 14:44:55,316 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=403, PETRI_PLACES=136, PETRI_TRANSITIONS=136} [2020-10-09 14:44:55,316 INFO L341 CegarLoopForPetriNet]: 122 programPoint places, 14 predicate places. [2020-10-09 14:44:55,316 INFO L481 AbstractCegarLoop]: Abstraction has has 136 places, 136 transitions, 403 flow [2020-10-09 14:44:55,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 14:44:55,317 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:44:55,317 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] [2020-10-09 14:44:55,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 mathsat -unsat_core_generation=3,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:44:55,941 INFO L429 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:44:55,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:44:55,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1433653210, now seen corresponding path program 1 times [2020-10-09 14:44:55,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:44:55,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506132962] [2020-10-09 14:44:55,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-09 14:44:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:44:56,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 59 conjunts are in the unsatisfiable core [2020-10-09 14:44:56,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:44:56,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-09 14:44:56,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:56,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:44:56,521 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 22 treesize of output 18 [2020-10-09 14:44:56,522 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:44:56,562 INFO L625 ElimStorePlain]: treesize reduction 13, result has 82.2 percent of original size [2020-10-09 14:44:56,566 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:44:56,567 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:77, output treesize:59 [2020-10-09 14:44:56,723 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:44:56,723 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 45 treesize of output 48 [2020-10-09 14:44:56,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:44:56,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:44:56,785 INFO L545 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-09 14:44:56,834 INFO L625 ElimStorePlain]: treesize reduction 25, result has 71.9 percent of original size [2020-10-09 14:44:56,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:56,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:56,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:56,849 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-09 14:44:56,850 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:64 [2020-10-09 14:44:56,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:56,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:56,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:56,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:56,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:56,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:57,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:58,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:58,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:58,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:58,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:58,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:58,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:58,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:58,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:58,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:58,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:58,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:58,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:58,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:58,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:58,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:44:59,076 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:44:59,077 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 48 treesize of output 32 [2020-10-09 14:44:59,078 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:44:59,090 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:44:59,092 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:44:59,092 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:18 [2020-10-09 14:44:59,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:44:59,255 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:44:59,481 INFO L721 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:45:00,022 INFO L721 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:45:00,538 INFO L721 QuantifierPusher]: Run 40 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:45:15,145 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:45:36,767 WARN L193 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 201 [2020-10-09 14:46:36,850 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 201 [2020-10-09 14:46:57,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:46:57,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:47:00,286 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) is different from false [2020-10-09 14:47:02,233 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* |c_t1Thread1of1ForFork0_inc_top_#t~post30| 4))) 4294967296)))) is different from false [2020-10-09 14:47:04,241 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2020-10-09 14:47:04,260 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 168 treesize of output 152 [2020-10-09 14:47:04,264 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-09 14:47:04,319 INFO L625 ElimStorePlain]: treesize reduction 105, result has 23.9 percent of original size [2020-10-09 14:47:04,321 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-09 14:47:04,322 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:21 [2020-10-09 14:47:07,562 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:47:07,602 INFO L721 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:47:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:47:07,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506132962] [2020-10-09 14:47:07,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:47:07,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26, 23] imperfect sequences [] total 47 [2020-10-09 14:47:07,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814211678] [2020-10-09 14:47:07,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 47 states [2020-10-09 14:47:07,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:47:07,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2020-10-09 14:47:07,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1751, Unknown=4, NotChecked=258, Total=2162 [2020-10-09 14:47:10,939 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 138 [2020-10-09 14:47:10,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 136 transitions, 403 flow. Second operand 47 states. [2020-10-09 14:47:10,945 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:47:10,945 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 138 [2020-10-09 14:47:10,945 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:47:12,731 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2020-10-09 14:47:13,401 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2020-10-09 14:47:13,763 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-10-09 14:47:14,377 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2020-10-09 14:47:14,876 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2020-10-09 14:47:17,199 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (mod c_t1Thread1of1ForFork0_~tmp~0 4294967296)) (.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (let ((.cse2 (select .cse0 (+ |c_~#arr~0.offset| .cse1))) (.cse3 (<= 800 .cse5)) (.cse4 (< .cse5 800))) (and (= c_~top~0 |c_t1Thread1of1ForFork0_push_#t~ret35|) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (= |c_ULTIMATE.start_main_~#id2~0.offset| 0) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (not (= 4294967294 (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 4))) 4294967296))) (< .cse2 4294967296) (<= (div .cse2 (- 4294967296)) (div (+ (* .cse2 (- 1)) 799) 4294967296)) (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) (= |c_t1Thread1of1ForFork0_push_#in~stack.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x| 4294967296) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| 0) .cse3) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| 1) .cse4)) (<= (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 799) 4294967296)) (<= (div |c_t1Thread1of1ForFork0_push_#in~x| (- 4294967296)) (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x| (- 1)) 799) 4294967296)) (<= 0 c_t1Thread1of1ForFork0_push_~x) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res|) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (or (and .cse3 (= c_t1Thread1of1ForFork0_assume_abort_if_not_~cond 0)) (and (= c_t1Thread1of1ForFork0_assume_abort_if_not_~cond 1) .cse4)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack.offset|) (= c_~top~0 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x|) .cse4))) is different from false [2020-10-09 14:47:19,284 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))))) (and (= |c_ULTIMATE.start_main_~#id2~0.offset| 0) (< .cse0 4294967296) (<= (div .cse0 (- 4294967296)) (div (+ (* .cse0 (- 1)) 799) 4294967296)) (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) (<= 0 .cse0) (= |c_~#arr~0.offset| 0) (= c_~top~0 0))) is different from false [2020-10-09 14:47:21,383 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* |c_t1Thread1of1ForFork0_inc_top_#t~post30| 4))))) (and (= |c_ULTIMATE.start_main_~#id2~0.offset| 0) (= |c_t1Thread1of1ForFork0_inc_top_#t~post30| 0) (<= (div .cse0 (- 4294967296)) (div (+ (* .cse0 (- 1)) 799) 4294967296)) (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* |c_t1Thread1of1ForFork0_inc_top_#t~post30| 4))) 4294967296)))) (= |c_~#arr~0.offset| 0) (<= 0 .cse0) (< .cse0 4294967296))) is different from false [2020-10-09 14:47:23,455 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) |c_~#arr~0.offset|))) (and (= |c_ULTIMATE.start_main_~#id2~0.offset| 0) (< .cse0 4294967296) (<= 0 .cse0) (<= (div .cse0 (- 4294967296)) (div (+ (* .cse0 (- 1)) 799) 4294967296)) (= c_~top~0 1) (= |c_~#arr~0.offset| 0) (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))))) is different from false [2020-10-09 14:47:26,059 WARN L193 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2020-10-09 14:47:27,125 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2020-10-09 14:47:28,367 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2020-10-09 14:47:33,286 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#arr~0.offset| (* 4 c_~top~0)))) (and (= .cse0 (+ c_t1Thread1of1ForFork0_push_~stack.offset (* 4 |c_t1Thread1of1ForFork0_push_#t~ret35|))) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (= .cse0 (+ (* 4 |c_t1Thread1of1ForFork0_get_top_#res|) c_t1Thread1of1ForFork0_push_~stack.offset)) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x| 4294967296))) (not (= (mod c_t1Thread1of1ForFork0_push_~x 4294967296) 4294967294)) (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) (not (= (mod (+ (* (mod c_t1Thread1of1ForFork0_~tmp~0 4294967296) 4294967295) 4294967294) (- 4294967296)) 0)) (= |c_t1Thread1of1ForFork0_push_#in~stack.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack.offset|))) is different from false [2020-10-09 14:47:35,314 WARN L193 SmtUtils]: Spent 737.00 ms on a formula simplification that was a NOOP. DAG size: 237 [2020-10-09 14:47:37,487 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#arr~0.offset| (* 4 c_~top~0)))) (and (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (= c_~top~0 1) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x| 4294967296))) (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) (exists ((aux_div_v_arrayElimCell_1_38 Int) (|ULTIMATE.start_main_~#id2~0.base| Int) (aux_div_aux_mod_v_arrayElimCell_1_38_107 Int) (aux_mod_aux_mod_v_arrayElimCell_1_38_107 Int)) (let ((.cse0 (* 4294967296 aux_div_aux_mod_v_arrayElimCell_1_38_107))) (let ((.cse1 (+ .cse0 aux_mod_aux_mod_v_arrayElimCell_1_38_107))) (and (<= aux_div_v_arrayElimCell_1_38 aux_div_aux_mod_v_arrayElimCell_1_38_107) (< 0 (+ .cse0 aux_mod_aux_mod_v_arrayElimCell_1_38_107 4294966497)) (<= 0 aux_mod_aux_mod_v_arrayElimCell_1_38_107) (<= .cse1 (+ (* 4294967296 aux_div_v_arrayElimCell_1_38) 799)) (or (= 799 (+ (select (select |c_#memory_int| |c_~#arr~0.base|) |c_~#arr~0.offset|) .cse0 aux_mod_aux_mod_v_arrayElimCell_1_38_107)) (= |c_~#arr~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) 0) 1) (<= .cse1 799))))) (= |c_t1Thread1of1ForFork0_push_#in~stack.base| |c_~#arr~0.base|) (= .cse2 (+ c_t1Thread1of1ForFork0_push_~stack.offset (* 4 |c_t1Thread1of1ForFork0_push_#t~ret35|))) (= .cse2 (+ (* 4 |c_t1Thread1of1ForFork0_get_top_#res|) c_t1Thread1of1ForFork0_push_~stack.offset)) (not (= (mod c_t1Thread1of1ForFork0_push_~x 4294967296) 4294967294)) (= |c_~#arr~0.offset| 0) (not (= (mod (+ (* (mod c_t1Thread1of1ForFork0_~tmp~0 4294967296) 4294967295) 4294967294) (- 4294967296)) 0)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack.offset|))) is different from false [2020-10-09 14:47:39,192 WARN L193 SmtUtils]: Spent 717.00 ms on a formula simplification that was a NOOP. DAG size: 235 [2020-10-09 14:47:40,245 WARN L193 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 227 [2020-10-09 14:47:43,900 WARN L193 SmtUtils]: Spent 1.78 s on a formula simplification that was a NOOP. DAG size: 284 [2020-10-09 14:47:46,853 WARN L193 SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2020-10-09 14:47:48,472 WARN L193 SmtUtils]: Spent 843.00 ms on a formula simplification that was a NOOP. DAG size: 241 [2020-10-09 14:47:50,044 WARN L193 SmtUtils]: Spent 723.00 ms on a formula simplification that was a NOOP. DAG size: 235 [2020-10-09 14:47:51,451 WARN L193 SmtUtils]: Spent 645.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2020-10-09 14:47:54,514 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 248 [2020-10-09 14:47:56,108 WARN L193 SmtUtils]: Spent 655.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2020-10-09 14:48:00,096 WARN L193 SmtUtils]: Spent 2.69 s on a formula simplification that was a NOOP. DAG size: 259 [2020-10-09 14:48:03,652 WARN L193 SmtUtils]: Spent 2.56 s on a formula simplification that was a NOOP. DAG size: 263 [2020-10-09 14:48:06,781 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse37 (+ |c_~#arr~0.offset| (* 4 c_~top~0))) (.cse36 (select |c_#memory_int| c_t2Thread1of1ForFork1_pop_~stack.base))) (and (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (exists ((|aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389| Int) (|aux_div_t2Thread1of1ForFork1_pop_#t~mem39_56| Int) (|aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_193_346_236| Int) (|aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_193_346_236_394_367_391| Int) (|aux_div_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145| Int) (|aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367_391_415_439_463_487| Int) (|aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_193_346_236_394_367| Int) (|aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_169| Int) (|aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367_391_415_439_463_487_511_535_278| Int) (|aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367_391_415_439_463| Int) (|aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367| Int) (|aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_169_293_271_146| Int) (|aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367_391_415_439_463_487_511| Int) (|aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_193_346_236_394_367_391_206| Int) (|aux_div_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143| Int) (|aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_193| Int) (|aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367_391| Int) (|aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367_391_415| Int) (|aux_div_aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_169_293| Int) (|aux_div_aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_193_346_236_394| Int) (|aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_205_370| Int) (|aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217| Int) (|aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_169| Int) (|aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367_391_415_439| Int) (|aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_158| Int) (|aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_205| Int) (|aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367_391_415_439_463_487_511_535| Int) (|aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_169_293_271| Int)) (let ((.cse3 (* 4294967296 |aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_193_346_236_394_367_391|)) (.cse4 (* 4294967296 |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_193_346_236_394_367_391_206|)) (.cse32 (* 4294967296 |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367_391_415_439_463_487_511_535_278|)) (.cse23 (* 4294967296 |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367_391_415_439_463_487_511_535|)) (.cse13 (* 4294967296 |aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_169_293_271_146|)) (.cse24 (* 4294967296 |aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_169_293_271|))) (let ((.cse11 (* 4294967295 |aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_193_346_236|)) (.cse18 (* 4294967296 |aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389|)) (.cse10 (* 4294967296 |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367_391_415_439_463_487|)) (.cse12 (* 4294967296 |aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367|)) (.cse17 (* 4294967296 |aux_div_t2Thread1of1ForFork1_pop_#t~mem39_56|)) (.cse15 (div (+ (* |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367_391_415_439_463_487_511_535_278| 4294967296) |c_t2Thread1of1ForFork1_pop_#res| (* |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367_391_415_439_463_487_511_535| 4294967296) (* |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_158| 4294967296) (- 799)) 4294967295)) (.cse22 (* 4294967296 |aux_div_aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_169_293|)) (.cse29 (+ .cse13 .cse24)) (.cse1 (* 4294967296 |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367_391_415_439|)) (.cse27 (* 4294967295 |aux_div_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145|)) (.cse14 (* 4294967296 |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367_391_415|)) (.cse16 (* 4294967296 |aux_div_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143|)) (.cse9 (* 4294967295 |aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_193|)) (.cse31 (+ .cse32 |c_t2Thread1of1ForFork1_pop_#res| .cse23)) (.cse30 (* 4294967295 |aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217|)) (.cse26 (* 4294967296 |aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367_391|)) (.cse6 (+ .cse32 .cse23)) (.cse19 (* 4294967296 |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367_391_415_439_463|)) (.cse21 (* 4294967296 |aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_193_346_236_394_367|)) (.cse7 (+ .cse3 .cse4)) (.cse28 (* 4294967296 |aux_div_aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_193_346_236_394|)) (.cse34 (+ |c_t2Thread1of1ForFork1_pop_#res| .cse13 .cse24)) (.cse33 (* 4294967295 |aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_169|)) (.cse8 (* 4294967295 |c_t2Thread1of1ForFork1_pop_#res|)) (.cse35 (* 4294967295 |aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_205|)) (.cse20 (* 4294967296 |aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_205_370|)) (.cse0 (* 4294967296 |c_t2Thread1of1ForFork1_pop_#res|)) (.cse5 (* 4294967296 |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217_389_367_391_415_439_463_487_511|)) (.cse2 (* 4294967296 |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_158|)) (.cse25 (* 18446744069414584320 |aux_div_aux_div_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_169|))) (and (< (+ .cse0 .cse1 .cse2) (+ .cse3 .cse4 4294967296)) (<= .cse5 .cse6) (< .cse7 (+ .cse8 .cse9 4294968094)) (<= .cse10 .cse6) (< .cse7 (+ .cse11 .cse8 4294968094)) (<= .cse1 .cse6) (<= .cse12 .cse6) (<= 0 .cse2) (<= 0 |aux_div_aux_div_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_169|) (<= 0 .cse13) (<= (+ .cse11 .cse8 799) .cse7) (< .cse13 4294967296) (< .cse6 (+ .cse12 4294967296)) (<= .cse14 .cse6) (<= (+ .cse15 .cse16) (+ .cse17 799)) (< .cse6 (+ .cse18 4294967296)) (< .cse6 (+ .cse19 4294967296)) (< 0 (+ |aux_div_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145| .cse16 4294966497)) (<= .cse18 .cse6) (<= (+ .cse20 .cse3 .cse4) (+ .cse18 .cse0 .cse2 .cse21)) (< .cse6 (+ .cse10 4294967296)) (<= (mod (+ (* (div (+ (* (div (+ (* (div (+ (* |aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_193_346_236_394_367_391| 4294967296) (* |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_193_346_236_394_367_391_206| 4294967296)) 4294967296) 4294967296) (* |c_t2Thread1of1ForFork1_pop_#res| (- 4294967296))) 4294967296) 4294967296) |c_t2Thread1of1ForFork1_pop_#res| (- 799)) 4294967295) 4294967295) 799) 4294967296) 2147483647) (< .cse7 (+ .cse21 4294967296)) (<= .cse22 (+ .cse2 .cse10)) (<= .cse7 (+ .cse0 .cse23 .cse2)) (< (+ .cse12 .cse2) (+ .cse24 4294967296)) (< .cse4 4294967296) (<= .cse25 (+ .cse0 .cse2 .cse26 18446740637735714816)) (< .cse17 (+ .cse15 .cse16 4294966497)) (<= (+ .cse3 .cse4 .cse27 799) (+ .cse14 .cse28 |c_t2Thread1of1ForFork1_pop_#res| .cse2)) (<= 0 .cse4) (< .cse29 (+ .cse22 4294967296)) (<= .cse28 .cse7) (<= (+ .cse30 799) .cse31) (<= .cse22 .cse29) (< |aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_914_217| 4294967296) (< .cse6 (+ .cse1 4294967296)) (< (+ .cse32 |c_t2Thread1of1ForFork1_pop_#res| .cse23 .cse2) (+ .cse27 4294968094)) (< .cse6 (+ .cse5 4294967296)) (< .cse6 (+ .cse14 4294967296)) (< .cse2 4294967296) (<= (+ |aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_div_aux_mod_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143_98_145_245_223_247_382_205| .cse16) 799) (< .cse32 4294967296) (<= (+ .cse8 .cse9 799) .cse7) (<= |aux_div_t2Thread1of1ForFork1_pop_#t~mem39_56| |aux_div_aux_mod_t2Thread1of1ForFork1_pop_#t~mem39_56_143|) (< .cse6 (+ .cse26 4294967296)) (<= (+ .cse33 799) .cse34) (<= 0 .cse32) (< .cse20 (+ .cse8 .cse35 4294968094)) (<= .cse19 .cse6) (< .cse31 (+ .cse30 4294968094)) (<= .cse26 .cse6) (<= .cse21 .cse7) (< (+ .cse19 .cse0 .cse2 .cse21) (+ .cse20 .cse3 .cse4 4294967296)) (< .cse7 (+ .cse28 4294967296)) (< .cse34 (+ .cse33 4294968094)) (<= (+ .cse8 .cse35 799) .cse20) (< (+ .cse0 .cse5 .cse2 18446740633440747520) (+ .cse25 .cse4)))))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x| 4294967296))) (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) (<= 0 |c_t2Thread1of1ForFork1_pop_#res|) (= |c_t1Thread1of1ForFork0_push_#in~stack.base| |c_~#arr~0.base|) (not (= (mod (select .cse36 (+ c_t2Thread1of1ForFork1_pop_~stack.offset (* |c_t2Thread1of1ForFork1_get_top_#res| 4))) 4294967296) 4294967294)) (= .cse37 (+ c_t1Thread1of1ForFork0_push_~stack.offset (* 4 |c_t1Thread1of1ForFork0_push_#t~ret35|))) (= .cse37 (+ (* 4 |c_t1Thread1of1ForFork0_get_top_#res|) c_t1Thread1of1ForFork0_push_~stack.offset)) (< |c_t2Thread1of1ForFork1_pop_#res| 4294967296) (not (= (mod c_t1Thread1of1ForFork0_push_~x 4294967296) 4294967294)) (= |c_~#arr~0.offset| 0) (not (= (mod (+ (* (mod c_t1Thread1of1ForFork0_~tmp~0 4294967296) 4294967295) 4294967294) (- 4294967296)) 0)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack.offset|) (= c_~top~0 0) (not (= (mod (select .cse36 (+ c_t2Thread1of1ForFork1_pop_~stack.offset (* c_~top~0 4))) 4294967296) 4294967294)))) is different from false [2020-10-09 14:48:09,856 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#arr~0.offset| (* 4 c_~top~0)))) (and (= .cse0 (+ c_t1Thread1of1ForFork0_push_~stack.offset (* 4 |c_t1Thread1of1ForFork0_push_#t~ret35|))) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (= .cse0 (+ (* 4 |c_t1Thread1of1ForFork0_get_top_#res|) c_t1Thread1of1ForFork0_push_~stack.offset)) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x| 4294967296))) (not (= (mod c_t1Thread1of1ForFork0_push_~x 4294967296) 4294967294)) (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) (not (= (mod (+ (* (mod c_t1Thread1of1ForFork0_~tmp~0 4294967296) 4294967295) 4294967294) (- 4294967296)) 0)) (= |c_t1Thread1of1ForFork0_push_#in~stack.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack.offset|))) is different from false [2020-10-09 14:48:16,149 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#arr~0.offset| (* 4 c_~top~0))) (.cse0 (select |c_#memory_int| c_t2Thread1of1ForFork1_pop_~stack.base))) (and (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x| 4294967296))) (not (= 0 (+ |c_t2Thread1of1ForFork1_pop_#res| 2))) (forall ((|ULTIMATE.start_main_~#id2~0.base| Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0.base|) |c_ULTIMATE.start_main_~#id2~0.offset| 1)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) (= |c_t1Thread1of1ForFork0_push_#in~stack.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ c_t2Thread1of1ForFork1_pop_~stack.offset (* |c_t2Thread1of1ForFork1_get_top_#res| 4))) 4294967296) 4294967294)) (= .cse1 (+ c_t1Thread1of1ForFork0_push_~stack.offset (* 4 |c_t1Thread1of1ForFork0_push_#t~ret35|))) (= .cse1 (+ (* 4 |c_t1Thread1of1ForFork0_get_top_#res|) c_t1Thread1of1ForFork0_push_~stack.offset)) (not (= (mod c_t1Thread1of1ForFork0_push_~x 4294967296) 4294967294)) (not (= (mod (+ (* (mod c_t1Thread1of1ForFork0_~tmp~0 4294967296) 4294967295) 4294967294) (- 4294967296)) 0)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack.offset|) (not (= (mod (select .cse0 (+ c_t2Thread1of1ForFork1_pop_~stack.offset (* c_~top~0 4))) 4294967296) 4294967294)))) is different from false [2020-10-09 14:48:22,177 INFO L129 PetriNetUnfolder]: 1634/5457 cut-off events. [2020-10-09 14:48:22,177 INFO L130 PetriNetUnfolder]: For 900/900 co-relation queries the response was YES. [2020-10-09 14:48:22,211 INFO L80 FinitePrefix]: Finished finitePrefix Result has 10563 conditions, 5457 events. 1634/5457 cut-off events. For 900/900 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 44395 event pairs, 111 based on Foata normal form. 8/5184 useless extension candidates. Maximal degree in co-relation 4168. Up to 685 conditions per place. [2020-10-09 14:48:22,251 INFO L132 encePairwiseOnDemand]: 96/138 looper letters, 431 selfloop transitions, 192 changer transitions 18/698 dead transitions. [2020-10-09 14:48:22,251 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 698 transitions, 3116 flow [2020-10-09 14:48:22,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2020-10-09 14:48:22,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-09 14:48:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 8131 transitions. [2020-10-09 14:48:22,284 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.5168446478515129 [2020-10-09 14:48:22,285 INFO L72 ComplementDD]: Start complementDD. Operand 114 states and 8131 transitions. [2020-10-09 14:48:22,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 8131 transitions. [2020-10-09 14:48:22,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:48:22,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 114 states and 8131 transitions. [2020-10-09 14:48:22,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 115 states. [2020-10-09 14:48:22,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 115 states. [2020-10-09 14:48:22,352 INFO L81 ComplementDD]: Finished complementDD. Result 115 states. [2020-10-09 14:48:22,352 INFO L185 Difference]: Start difference. First operand has 136 places, 136 transitions, 403 flow. Second operand 114 states and 8131 transitions. [2020-10-09 14:48:22,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 698 transitions, 3116 flow [2020-10-09 14:48:22,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 698 transitions, 3104 flow, removed 6 selfloop flow, removed 0 redundant places. [2020-10-09 14:48:22,381 INFO L241 Difference]: Finished difference. Result has 278 places, 329 transitions, 1723 flow [2020-10-09 14:48:22,382 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=114, PETRI_FLOW=1723, PETRI_PLACES=278, PETRI_TRANSITIONS=329} [2020-10-09 14:48:22,383 INFO L341 CegarLoopForPetriNet]: 122 programPoint places, 156 predicate places. [2020-10-09 14:48:22,383 INFO L481 AbstractCegarLoop]: Abstraction has has 278 places, 329 transitions, 1723 flow [2020-10-09 14:48:22,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2020-10-09 14:48:22,383 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:48:22,384 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] [2020-10-09 14:48:22,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-09 14:48:22,597 INFO L429 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:48:22,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:48:22,598 INFO L82 PathProgramCache]: Analyzing trace with hash -590482302, now seen corresponding path program 2 times [2020-10-09 14:48:22,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:48:22,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446441424] [2020-10-09 14:48:22,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-10-09 14:48:22,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 14:48:22,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:48:22,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 58 conjunts are in the unsatisfiable core [2020-10-09 14:48:22,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:22,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-09 14:48:22,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:22,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:48:23,096 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 22 treesize of output 18 [2020-10-09 14:48:23,096 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:48:23,146 INFO L625 ElimStorePlain]: treesize reduction 13, result has 81.4 percent of original size [2020-10-09 14:48:23,148 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:48:23,148 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:56 [2020-10-09 14:48:23,635 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 41 treesize of output 21 [2020-10-09 14:48:23,635 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:48:23,645 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:48:23,645 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:48:23,645 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:18 [2020-10-09 14:48:23,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:48:23,754 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:48:23,916 INFO L721 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:48:24,106 INFO L721 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:48:24,369 INFO L721 QuantifierPusher]: Run 40 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:48:36,503 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:49:00,805 WARN L193 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 273 DAG size of output: 201 [2020-10-09 14:50:05,778 WARN L193 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 201 [2020-10-09 14:50:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:50:27,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:50:28,941 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 54 treesize of output 46 [2020-10-09 14:50:28,951 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-10-09 14:50:28,987 INFO L625 ElimStorePlain]: treesize reduction 17, result has 55.3 percent of original size [2020-10-09 14:50:28,987 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-09 14:50:28,988 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:21 [2020-10-09 14:50:30,013 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:50:30,037 INFO L721 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:50:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:50:30,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446441424] [2020-10-09 14:50:30,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:50:30,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24, 22] imperfect sequences [] total 44 [2020-10-09 14:50:30,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748158343] [2020-10-09 14:50:30,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-10-09 14:50:30,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:50:30,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-10-09 14:50:30,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1759, Unknown=0, NotChecked=0, Total=1892 [2020-10-09 14:53:48,773 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 138 [2020-10-09 14:53:48,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 329 transitions, 1723 flow. Second operand 44 states. [2020-10-09 14:53:48,774 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:53:48,775 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 138 [2020-10-09 14:53:48,775 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:53:50,112 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-10-09 14:53:50,801 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-10-09 14:53:51,529 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2020-10-09 14:53:52,405 WARN L193 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2020-10-09 14:53:53,259 WARN L193 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2020-10-09 14:53:54,454 WARN L193 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2020-10-09 14:53:55,671 WARN L193 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2020-10-09 14:53:56,850 WARN L193 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2020-10-09 14:53:58,457 WARN L193 SmtUtils]: Spent 945.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2020-10-09 14:53:59,318 WARN L193 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2020-10-09 14:53:59,699 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-10-09 14:54:00,185 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-10-09 14:54:00,742 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-10-09 14:54:01,365 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-10-09 14:54:01,957 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-09 14:54:02,984 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-10-09 14:54:03,434 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-10-09 14:54:03,880 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-10-09 14:54:04,633 WARN L193 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-09 14:54:05,431 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-09 14:54:06,071 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-09 14:54:06,524 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-10-09 14:54:07,169 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-09 14:54:07,635 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-09 14:54:08,350 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-09 14:54:08,888 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-09 14:54:09,691 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-09 14:54:10,068 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-10-09 14:54:12,490 WARN L193 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 268 [2020-10-09 14:54:16,803 WARN L193 SmtUtils]: Spent 3.31 s on a formula simplification that was a NOOP. DAG size: 266 [2020-10-09 14:54:17,439 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-10-09 14:54:19,803 WARN L193 SmtUtils]: Spent 1.40 s on a formula simplification that was a NOOP. DAG size: 258 [2020-10-09 14:54:27,298 WARN L193 SmtUtils]: Spent 4.42 s on a formula simplification that was a NOOP. DAG size: 315 [2020-10-09 14:54:29,724 WARN L193 SmtUtils]: Spent 724.00 ms on a formula simplification that was a NOOP. DAG size: 251 [2020-10-09 14:54:33,775 WARN L193 SmtUtils]: Spent 2.82 s on a formula simplification that was a NOOP. DAG size: 263 [2020-10-09 14:54:36,107 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 269 [2020-10-09 14:54:36,517 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-10-09 14:54:41,593 WARN L193 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 269 DAG size of output: 260 [2020-10-09 14:54:45,256 WARN L193 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2020-10-09 14:54:45,556 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-10-09 14:54:46,152 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-10-09 14:54:47,312 WARN L193 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2020-10-09 14:54:48,526 WARN L193 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2020-10-09 14:54:48,829 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-09 14:54:50,335 WARN L193 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2020-10-09 14:54:51,282 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-09 14:54:52,849 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2020-10-09 14:54:53,160 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-09 14:54:54,676 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2020-10-09 14:54:55,720 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-10-09 14:54:56,048 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-10-09 14:54:56,418 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-10-09 14:54:56,774 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-10-09 14:54:58,431 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2020-10-09 14:54:58,822 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-09 14:54:59,144 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-09 14:55:00,454 WARN L193 SmtUtils]: Spent 910.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2020-10-09 14:55:00,839 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-10-09 14:55:01,420 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-10-09 14:55:01,843 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-10-09 14:55:02,169 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-10-09 14:55:02,596 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-09 14:55:03,164 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-10-09 14:55:04,233 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-09 14:55:05,246 WARN L193 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-10-09 14:55:05,823 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-09 14:55:06,610 WARN L193 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-10-09 14:55:07,277 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-09 14:55:08,382 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-09 14:55:09,233 WARN L193 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-10-09 14:55:10,759 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-09 14:55:11,344 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-09 14:55:11,946 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-10-09 14:55:12,677 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-09 14:55:13,393 WARN L193 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-09 14:55:13,879 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-09 14:55:14,504 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-09 14:55:14,973 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-10-09 14:55:15,821 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-09 14:55:16,237 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-10-09 14:55:16,836 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-10-09 14:55:17,312 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-10-09 14:55:18,097 WARN L193 SmtUtils]: Spent 462.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-09 14:55:18,652 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-09 14:55:19,208 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-10-09 14:55:19,813 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-10-09 14:55:20,285 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-09 14:55:21,167 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-10-09 14:55:21,637 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-10-09 14:55:22,386 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-09 14:55:22,994 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-09 14:55:23,491 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-10-09 14:55:24,028 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-10-09 14:55:24,726 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-10-09 14:55:25,104 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-10-09 14:55:25,590 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-10-09 14:55:26,429 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-09 14:55:27,120 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-10-09 14:55:28,422 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-09 14:55:29,124 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-09 14:55:29,617 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-10-09 14:55:29,974 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-10-09 14:55:30,582 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-09 14:55:30,981 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-10-09 14:55:31,344 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-09 14:55:31,876 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-10-09 14:55:32,286 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-10-09 14:55:32,809 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-09 14:55:33,198 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-10-09 14:55:33,621 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-10-09 14:55:34,046 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-09 14:55:34,437 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-10-09 14:55:34,651 INFO L129 PetriNetUnfolder]: 801/5325 cut-off events. [2020-10-09 14:55:34,651 INFO L130 PetriNetUnfolder]: For 36980/38085 co-relation queries the response was YES. [2020-10-09 14:55:34,698 INFO L80 FinitePrefix]: Finished finitePrefix Result has 17824 conditions, 5325 events. 801/5325 cut-off events. For 36980/38085 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 45775 event pairs, 132 based on Foata normal form. 42/5056 useless extension candidates. Maximal degree in co-relation 17541. Up to 738 conditions per place. [2020-10-09 14:55:34,722 INFO L132 encePairwiseOnDemand]: 99/138 looper letters, 200 selfloop transitions, 378 changer transitions 5/687 dead transitions. [2020-10-09 14:55:34,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 687 transitions, 5601 flow [2020-10-09 14:55:34,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2020-10-09 14:55:34,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-09 14:55:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 11369 transitions. [2020-10-09 14:55:34,753 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.610252281266774 [2020-10-09 14:55:34,754 INFO L72 ComplementDD]: Start complementDD. Operand 135 states and 11369 transitions. [2020-10-09 14:55:34,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 11369 transitions. [2020-10-09 14:55:34,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:55:34,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 135 states and 11369 transitions. [2020-10-09 14:55:34,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 136 states. [2020-10-09 14:55:34,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 136 states. [2020-10-09 14:55:34,810 INFO L81 ComplementDD]: Finished complementDD. Result 136 states. [2020-10-09 14:55:34,810 INFO L185 Difference]: Start difference. First operand has 278 places, 329 transitions, 1723 flow. Second operand 135 states and 11369 transitions. [2020-10-09 14:55:34,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 687 transitions, 5601 flow [2020-10-09 14:55:34,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 687 transitions, 5515 flow, removed 14 selfloop flow, removed 5 redundant places. [2020-10-09 14:55:34,878 INFO L241 Difference]: Finished difference. Result has 425 places, 560 transitions, 4100 flow [2020-10-09 14:55:34,879 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=1667, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=135, PETRI_FLOW=4100, PETRI_PLACES=425, PETRI_TRANSITIONS=560} [2020-10-09 14:55:34,879 INFO L341 CegarLoopForPetriNet]: 122 programPoint places, 303 predicate places. [2020-10-09 14:55:34,879 INFO L481 AbstractCegarLoop]: Abstraction has has 425 places, 560 transitions, 4100 flow [2020-10-09 14:55:34,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-10-09 14:55:34,879 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:55:34,880 INFO L255 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-09 14:55:35,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-09 14:55:35,082 INFO L429 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:55:35,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:55:35,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1521828139, now seen corresponding path program 1 times [2020-10-09 14:55:35,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:55:35,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183963647] [2020-10-09 14:55:35,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-10-09 14:55:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:55:35,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-09 14:55:35,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:55:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-09 14:55:35,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:55:35,543 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-09 14:55:35,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183963647] [2020-10-09 14:55:35,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [444017996] [2020-10-09 14:55:35,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:55:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:55:35,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-09 14:55:35,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:55:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-09 14:55:35,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:55:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-09 14:55:35,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214308986] [2020-10-09 14:55:35,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:55:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:55:35,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-09 14:55:35,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:55:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-09 14:55:35,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:55:35,927 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-09 14:55:35,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:55:35,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 14 [2020-10-09 14:55:35,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335419318] [2020-10-09 14:55:35,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 14:55:35,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:55:35,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 14:55:35,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-09 14:55:38,201 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 138 [2020-10-09 14:55:38,202 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 560 transitions, 4100 flow. Second operand 14 states. [2020-10-09 14:55:38,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:55:38,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 138 [2020-10-09 14:55:38,202 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:55:40,612 INFO L129 PetriNetUnfolder]: 779/5984 cut-off events. [2020-10-09 14:55:40,612 INFO L130 PetriNetUnfolder]: For 33853/34107 co-relation queries the response was YES. [2020-10-09 14:55:40,652 INFO L80 FinitePrefix]: Finished finitePrefix Result has 19447 conditions, 5984 events. 779/5984 cut-off events. For 33853/34107 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 53171 event pairs, 163 based on Foata normal form. 21/5644 useless extension candidates. Maximal degree in co-relation 19123. Up to 798 conditions per place. [2020-10-09 14:55:40,677 INFO L132 encePairwiseOnDemand]: 128/138 looper letters, 69 selfloop transitions, 154 changer transitions 0/631 dead transitions. [2020-10-09 14:55:40,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 631 transitions, 5332 flow [2020-10-09 14:55:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-09 14:55:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-09 14:55:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2286 transitions. [2020-10-09 14:55:40,685 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8718535469107551 [2020-10-09 14:55:40,685 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2286 transitions. [2020-10-09 14:55:40,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2286 transitions. [2020-10-09 14:55:40,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:55:40,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2286 transitions. [2020-10-09 14:55:40,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 20 states. [2020-10-09 14:55:40,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 20 states. [2020-10-09 14:55:40,692 INFO L81 ComplementDD]: Finished complementDD. Result 20 states. [2020-10-09 14:55:40,692 INFO L185 Difference]: Start difference. First operand has 425 places, 560 transitions, 4100 flow. Second operand 19 states and 2286 transitions. [2020-10-09 14:55:40,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 631 transitions, 5332 flow [2020-10-09 14:55:40,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 631 transitions, 4912 flow, removed 115 selfloop flow, removed 17 redundant places. [2020-10-09 14:55:40,811 INFO L241 Difference]: Finished difference. Result has 431 places, 590 transitions, 4416 flow [2020-10-09 14:55:40,812 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=3659, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4416, PETRI_PLACES=431, PETRI_TRANSITIONS=590} [2020-10-09 14:55:40,813 INFO L341 CegarLoopForPetriNet]: 122 programPoint places, 309 predicate places. [2020-10-09 14:55:40,813 INFO L481 AbstractCegarLoop]: Abstraction has has 431 places, 590 transitions, 4416 flow [2020-10-09 14:55:40,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 14:55:40,813 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:55:40,813 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, 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] [2020-10-09 14:55:41,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 mathsat -unsat_core_generation=3 [2020-10-09 14:55:41,425 INFO L429 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:55:41,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:55:41,426 INFO L82 PathProgramCache]: Analyzing trace with hash -177223312, now seen corresponding path program 1 times [2020-10-09 14:55:41,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:55:41,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897004567] [2020-10-09 14:55:41,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-10-09 14:55:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:55:41,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 107 conjunts are in the unsatisfiable core [2020-10-09 14:55:41,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:55:41,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-09 14:55:41,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:55:41,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:55:42,297 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2020-10-09 14:55:42,802 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-10-09 14:55:43,020 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-10-09 14:55:43,044 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 22 treesize of output 18 [2020-10-09 14:55:43,044 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:55:43,166 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2020-10-09 14:55:43,168 INFO L625 ElimStorePlain]: treesize reduction 13, result has 81.4 percent of original size [2020-10-09 14:55:43,170 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:55:43,170 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:56 [2020-10-09 14:55:43,927 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-10-09 14:55:44,191 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-10-09 14:55:44,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-09 14:55:44,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:55:44,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:55:45,225 WARN L193 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2020-10-09 14:55:45,563 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-10-09 14:55:45,908 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-10-09 14:55:46,289 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-10-09 14:55:46,713 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-10-09 14:55:46,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-09 14:55:46,744 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 43 [2020-10-09 14:55:46,745 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:55:47,039 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2020-10-09 14:55:47,041 INFO L625 ElimStorePlain]: treesize reduction 13, result has 87.4 percent of original size [2020-10-09 14:55:47,043 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:55:47,043 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:107, output treesize:89 [2020-10-09 14:55:47,467 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-10-09 14:55:47,827 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-10-09 14:55:48,262 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-10-09 14:55:48,706 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-10-09 14:55:49,152 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-10-09 14:55:49,678 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-10-09 14:55:50,205 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-10-09 14:55:50,849 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-10-09 14:55:51,527 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-10-09 14:55:52,099 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-10-09 14:55:53,224 WARN L193 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2020-10-09 14:55:53,930 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-10-09 14:55:54,819 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-10-09 14:55:55,323 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-10-09 14:55:55,880 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-10-09 14:55:56,502 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-10-09 14:55:57,134 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-10-09 14:55:57,789 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-10-09 14:55:57,808 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:55:57,809 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 38 [2020-10-09 14:55:57,821 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:55:57,868 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:55:57,869 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:55:57,869 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:18 [2020-10-09 14:55:58,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:55:58,385 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:55:58,503 INFO L721 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:55:58,667 INFO L721 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:55:58,940 INFO L721 QuantifierPusher]: Run 40 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:56:09,477 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:56:34,982 WARN L193 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 273 DAG size of output: 201 [2020-10-09 14:57:35,971 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 201 [2020-10-09 14:57:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:57:56,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:58:11,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:58:14,964 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 54 treesize of output 46 [2020-10-09 14:58:14,970 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-10-09 14:58:15,069 INFO L625 ElimStorePlain]: treesize reduction 17, result has 55.3 percent of original size [2020-10-09 14:58:15,069 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-09 14:58:15,069 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:21 [2020-10-09 14:58:20,942 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:58:20,980 INFO L721 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-09 14:58:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:58:21,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897004567] [2020-10-09 14:58:21,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2145308395] [2020-10-09 14:58:21,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:58:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:58:21,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 55 conjunts are in the unsatisfiable core [2020-10-09 14:58:21,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:58:21,536 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-09 14:58:21,537 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:58:21,544 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:21,545 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:58:21,545 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-09 14:58:22,133 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 7 treesize of output 6 [2020-10-09 14:58:22,133 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:58:22,153 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:22,153 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:58:22,154 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-10-09 14:58:22,795 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:22,796 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-10-09 14:58:22,797 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:58:22,882 INFO L625 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2020-10-09 14:58:22,883 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 14:58:22,883 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2020-10-09 14:58:23,568 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:23,568 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-10-09 14:58:23,569 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:58:23,652 INFO L625 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2020-10-09 14:58:23,653 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:58:23,653 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2020-10-09 14:58:24,328 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:24,328 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-10-09 14:58:24,329 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 14:58:24,358 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:24,358 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:58:24,359 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2020-10-09 14:58:24,981 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2020-10-09 14:58:25,000 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 8 treesize of output 7 [2020-10-09 14:58:25,001 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-09 14:58:25,022 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:25,023 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:58:25,058 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:25,059 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 14:58:25,059 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2020-10-09 14:58:25,714 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2020-10-09 14:58:25,728 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 8 treesize of output 7 [2020-10-09 14:58:25,728 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-09 14:58:25,756 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:25,757 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:58:25,836 INFO L625 ElimStorePlain]: treesize reduction 4, result has 87.9 percent of original size [2020-10-09 14:58:25,838 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-09 14:58:25,838 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:29 [2020-10-09 14:58:29,398 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-10-09 14:58:30,935 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-09 14:58:30,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2020-10-09 14:58:30,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:31,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 14:58:33,870 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2020-10-09 14:58:35,880 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-10-09 14:58:35,883 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:35,883 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:35,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:35,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:35,944 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~#id2~0.offset| Int) (|ULTIMATE.start_main_~#id2~0.base| Int) (aux_div_t1Thread1of1ForFork0_push_~x_49 Int) (|v_#memory_int_57| (Array Int (Array Int Int))) (aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (t1Thread1of1ForFork0_push_~stack.offset Int) (aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (|ULTIMATE.start_main_~#id1~0.base| Int) (|ULTIMATE.start_main_~#id1~0.offset| Int) (|t1Thread1of1ForFork0_push_#t~ret35| Int)) (let ((.cse4 (* 4294967296 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))) (let ((.cse0 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129)) (.cse2 (* 4294967296 aux_div_t1Thread1of1ForFork0_push_~x_49)) (.cse1 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294966497)) (.cse3 (select |v_#memory_int_57| |c_~#arr~0.base|))) (and (<= .cse0 799) (not (= |ULTIMATE.start_main_~#id1~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (< 0 .cse1) (<= .cse0 (+ .cse2 799)) (= |c_#memory_int| (store |v_#memory_int_57| |c_~#arr~0.base| (store .cse3 (+ t1Thread1of1ForFork0_push_~stack.offset (* |t1Thread1of1ForFork0_push_#t~ret35| 4)) (+ (* aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 4294967296)) (* aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 1)) 799)))) (< aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294967296) (not (= |ULTIMATE.start_main_~#id1~0.base| |c_~#arr~0.base|)) (< .cse2 .cse1) (= ((as const (Array Int Int)) 0) .cse3) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id1~0.base|) |ULTIMATE.start_main_~#id1~0.offset|) 0) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id2~0.base|) |ULTIMATE.start_main_~#id2~0.offset|) 1) (<= 0 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129) (<= aux_div_t1Thread1of1ForFork0_push_~x_49 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))))) is different from true [2020-10-09 14:58:36,126 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-10-09 14:58:36,128 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:36,129 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:36,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:36,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:36,312 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:36,312 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:36,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:36,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:36,488 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:36,489 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:36,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:36,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:36,646 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:36,647 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:36,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:36,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:36,791 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:36,792 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:36,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:36,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:36,936 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:36,936 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:36,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:36,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:37,079 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:37,079 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:37,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:37,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:37,222 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:37,223 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:37,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:37,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:37,371 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:37,372 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:37,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:37,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:37,522 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:37,522 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:37,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:37,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:37,675 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:37,675 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:37,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:37,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:37,821 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:37,821 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:37,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:37,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:37,967 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:37,968 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:37,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:37,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:38,113 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:38,114 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:38,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:38,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:38,264 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:38,264 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:38,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:38,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:38,409 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:38,410 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:38,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:38,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:38,555 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:38,555 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:38,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:38,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:38,697 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:38,698 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:38,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:38,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:38,841 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:38,842 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:38,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:38,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:38,987 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:38,987 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:38,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:38,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:39,135 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:39,136 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:39,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:39,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:39,313 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-10-09 14:58:39,316 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:39,316 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:39,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:39,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:39,478 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-10-09 14:58:39,481 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:39,482 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:39,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:39,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:39,640 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:39,641 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:39,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:39,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:40,837 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:40,838 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:40,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:40,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:41,010 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:41,011 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:41,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:41,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:41,036 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:58:41,162 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:41,163 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:41,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:41,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:42,383 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:42,384 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:42,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:42,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:42,576 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-10-09 14:58:42,578 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:42,579 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:42,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:42,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:42,772 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-10-09 14:58:42,774 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:42,775 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:42,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:42,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:42,944 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:42,945 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:42,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:42,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:44,126 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:58:44,258 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:44,259 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:44,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:44,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:45,516 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:45,517 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 80 [2020-10-09 14:58:45,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:45,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:45,683 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:45,684 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:45,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:45,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:45,744 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_t1Thread1of1ForFork0_push_~stack.offset_55 Int) (aux_div_t1Thread1of1ForFork0_push_~x_49 Int) (|v_#memory_int_57| (Array Int (Array Int Int))) (aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (|ULTIMATE.start_main_~#id1~0.offset| Int) (|t1Thread1of1ForFork0_push_#t~ret35| Int) (t1Thread1of1ForFork0_push_~x Int) (|ULTIMATE.start_main_~#id2~0.offset| Int) (|ULTIMATE.start_main_~#id2~0.base| Int) (t1Thread1of1ForFork0_push_~stack.offset Int) (|ULTIMATE.start_main_~#id1~0.base| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35_64| Int)) (let ((.cse4 (* 4294967296 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))) (let ((.cse0 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129)) (.cse2 (* 4294967296 aux_div_t1Thread1of1ForFork0_push_~x_49)) (.cse1 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294966497)) (.cse3 (select |v_#memory_int_57| |c_~#arr~0.base|))) (and (<= .cse0 799) (not (= |ULTIMATE.start_main_~#id1~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (< 0 .cse1) (<= .cse0 (+ .cse2 799)) (= |c_#memory_int| (store |v_#memory_int_57| |c_~#arr~0.base| (store (store .cse3 (+ v_t1Thread1of1ForFork0_push_~stack.offset_55 (* |v_t1Thread1of1ForFork0_push_#t~ret35_64| 4)) (+ (* aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 4294967296)) (* aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 1)) 799)) (+ t1Thread1of1ForFork0_push_~stack.offset (* |t1Thread1of1ForFork0_push_#t~ret35| 4)) t1Thread1of1ForFork0_push_~x))) (< aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294967296) (not (= |ULTIMATE.start_main_~#id1~0.base| |c_~#arr~0.base|)) (< .cse2 .cse1) (= ((as const (Array Int Int)) 0) .cse3) (<= |c_~#arr~0.offset| t1Thread1of1ForFork0_push_~stack.offset) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id1~0.base|) |ULTIMATE.start_main_~#id1~0.offset|) 0) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id2~0.base|) |ULTIMATE.start_main_~#id2~0.offset|) 1) (<= 0 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129) (<= c_~top~0 |t1Thread1of1ForFork0_push_#t~ret35|) (<= aux_div_t1Thread1of1ForFork0_push_~x_49 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))))) is different from true [2020-10-09 14:58:45,927 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-10-09 14:58:45,930 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:45,930 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:45,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:45,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:46,163 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-10-09 14:58:46,166 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:46,166 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:46,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:46,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:46,372 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:46,373 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:46,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:46,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:46,419 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_t1Thread1of1ForFork0_push_~stack.offset_55 Int) (aux_div_t1Thread1of1ForFork0_push_~x_49 Int) (|v_#memory_int_57| (Array Int (Array Int Int))) (aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (|ULTIMATE.start_main_~#id1~0.offset| Int) (|t1Thread1of1ForFork0_push_#t~ret35| Int) (t1Thread1of1ForFork0_push_~x Int) (|ULTIMATE.start_main_~#id2~0.offset| Int) (|ULTIMATE.start_main_~#id2~0.base| Int) (t1Thread1of1ForFork0_push_~stack.offset Int) (|ULTIMATE.start_main_~#id1~0.base| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35_64| Int)) (let ((.cse4 (* 4294967296 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))) (let ((.cse0 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129)) (.cse2 (* 4294967296 aux_div_t1Thread1of1ForFork0_push_~x_49)) (.cse1 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294966497)) (.cse3 (select |v_#memory_int_57| |c_~#arr~0.base|))) (and (<= .cse0 799) (not (= |ULTIMATE.start_main_~#id1~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (<= |c_t1Thread1of1ForFork0_inc_top_#t~post30| |t1Thread1of1ForFork0_push_#t~ret35|) (< 0 .cse1) (<= .cse0 (+ .cse2 799)) (= |c_#memory_int| (store |v_#memory_int_57| |c_~#arr~0.base| (store (store .cse3 (+ v_t1Thread1of1ForFork0_push_~stack.offset_55 (* |v_t1Thread1of1ForFork0_push_#t~ret35_64| 4)) (+ (* aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 4294967296)) (* aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 1)) 799)) (+ t1Thread1of1ForFork0_push_~stack.offset (* |t1Thread1of1ForFork0_push_#t~ret35| 4)) t1Thread1of1ForFork0_push_~x))) (< aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294967296) (not (= |ULTIMATE.start_main_~#id1~0.base| |c_~#arr~0.base|)) (< .cse2 .cse1) (= ((as const (Array Int Int)) 0) .cse3) (<= |c_~#arr~0.offset| t1Thread1of1ForFork0_push_~stack.offset) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id1~0.base|) |ULTIMATE.start_main_~#id1~0.offset|) 0) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id2~0.base|) |ULTIMATE.start_main_~#id2~0.offset|) 1) (<= 0 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129) (<= aux_div_t1Thread1of1ForFork0_push_~x_49 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))))) is different from true [2020-10-09 14:58:46,562 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:46,563 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:46,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:46,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:46,607 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_t1Thread1of1ForFork0_push_~stack.offset_55 Int) (aux_div_t1Thread1of1ForFork0_push_~x_49 Int) (|v_#memory_int_57| (Array Int (Array Int Int))) (aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (|ULTIMATE.start_main_~#id1~0.offset| Int) (|t1Thread1of1ForFork0_push_#t~ret35| Int) (t1Thread1of1ForFork0_push_~x Int) (|ULTIMATE.start_main_~#id2~0.offset| Int) (|ULTIMATE.start_main_~#id2~0.base| Int) (t1Thread1of1ForFork0_push_~stack.offset Int) (|ULTIMATE.start_main_~#id1~0.base| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35_64| Int)) (let ((.cse4 (* 4294967296 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))) (let ((.cse0 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129)) (.cse2 (* 4294967296 aux_div_t1Thread1of1ForFork0_push_~x_49)) (.cse1 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294966497)) (.cse3 (select |v_#memory_int_57| |c_~#arr~0.base|))) (and (<= .cse0 799) (not (= |ULTIMATE.start_main_~#id1~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (< 0 .cse1) (<= .cse0 (+ .cse2 799)) (= |c_#memory_int| (store |v_#memory_int_57| |c_~#arr~0.base| (store (store .cse3 (+ v_t1Thread1of1ForFork0_push_~stack.offset_55 (* |v_t1Thread1of1ForFork0_push_#t~ret35_64| 4)) (+ (* aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 4294967296)) (* aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 1)) 799)) (+ t1Thread1of1ForFork0_push_~stack.offset (* |t1Thread1of1ForFork0_push_#t~ret35| 4)) t1Thread1of1ForFork0_push_~x))) (< aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294967296) (not (= |ULTIMATE.start_main_~#id1~0.base| |c_~#arr~0.base|)) (< .cse2 .cse1) (= ((as const (Array Int Int)) 0) .cse3) (<= |c_~#arr~0.offset| t1Thread1of1ForFork0_push_~stack.offset) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id1~0.base|) |ULTIMATE.start_main_~#id1~0.offset|) 0) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id2~0.base|) |ULTIMATE.start_main_~#id2~0.offset|) 1) (<= 0 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129) (<= c_~top~0 (+ |t1Thread1of1ForFork0_push_#t~ret35| 1)) (<= aux_div_t1Thread1of1ForFork0_push_~x_49 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))))) is different from true [2020-10-09 14:58:46,750 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:46,751 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:46,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:46,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:46,932 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:46,932 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:46,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:46,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:47,093 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:47,094 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:47,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:47,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:47,258 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:47,258 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:47,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:47,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:47,438 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:47,438 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:47,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:47,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:47,598 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:47,598 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:47,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:47,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:47,760 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:47,760 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:47,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:47,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:47,961 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-10-09 14:58:47,963 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:47,963 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:47,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:47,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:48,128 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:48,129 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:48,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:48,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:48,289 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:48,289 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:48,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:48,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:48,448 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:48,449 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:48,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:48,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:48,612 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:48,612 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:48,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:48,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:48,798 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-10-09 14:58:48,800 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:48,801 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:48,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:48,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:48,996 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:48,996 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:48,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:48,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:49,164 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:49,164 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:49,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:49,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:49,333 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:49,334 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:49,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:49,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:49,496 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:49,496 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:49,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:49,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:49,658 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:49,658 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:49,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:49,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:49,843 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-10-09 14:58:49,845 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:49,846 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:49,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:49,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:50,010 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:50,011 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:50,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:50,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:50,181 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:50,181 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:50,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:50,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:50,223 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_t1Thread1of1ForFork0_push_~stack.offset_55 Int) (aux_div_t1Thread1of1ForFork0_push_~x_49 Int) (|v_#memory_int_57| (Array Int (Array Int Int))) (aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (|ULTIMATE.start_main_~#id1~0.offset| Int) (|t1Thread1of1ForFork0_push_#t~ret35| Int) (t1Thread1of1ForFork0_push_~x Int) (|ULTIMATE.start_main_~#id2~0.offset| Int) (|ULTIMATE.start_main_~#id2~0.base| Int) (t1Thread1of1ForFork0_push_~stack.offset Int) (|ULTIMATE.start_main_~#id1~0.base| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35_64| Int)) (let ((.cse4 (* 4294967296 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))) (let ((.cse0 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129)) (.cse2 (* 4294967296 aux_div_t1Thread1of1ForFork0_push_~x_49)) (.cse1 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294966497)) (.cse3 (select |v_#memory_int_57| |c_~#arr~0.base|))) (and (<= .cse0 799) (not (= |ULTIMATE.start_main_~#id1~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (< 0 .cse1) (<= .cse0 (+ .cse2 799)) (= |c_#memory_int| (store |v_#memory_int_57| |c_~#arr~0.base| (store (store .cse3 (+ v_t1Thread1of1ForFork0_push_~stack.offset_55 (* |v_t1Thread1of1ForFork0_push_#t~ret35_64| 4)) (+ (* aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 4294967296)) (* aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 1)) 799)) (+ t1Thread1of1ForFork0_push_~stack.offset (* |t1Thread1of1ForFork0_push_#t~ret35| 4)) t1Thread1of1ForFork0_push_~x))) (< aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294967296) (not (= |ULTIMATE.start_main_~#id1~0.base| |c_~#arr~0.base|)) (< .cse2 .cse1) (= ((as const (Array Int Int)) 0) .cse3) (<= |c_~#arr~0.offset| t1Thread1of1ForFork0_push_~stack.offset) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id1~0.base|) |ULTIMATE.start_main_~#id1~0.offset|) 0) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id2~0.base|) |ULTIMATE.start_main_~#id2~0.offset|) 1) (<= 0 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129) (<= |c_t2Thread1of1ForFork1_dec_top_#t~post31| (+ |t1Thread1of1ForFork0_push_#t~ret35| 1)) (<= aux_div_t1Thread1of1ForFork0_push_~x_49 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))))) is different from true [2020-10-09 14:58:50,365 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:50,366 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:50,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:50,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:50,529 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:50,529 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:50,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:50,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:50,701 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-10-09 14:58:50,704 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:50,704 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:50,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:50,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:50,877 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:50,878 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:50,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:50,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:51,046 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:51,047 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:51,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:51,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:51,211 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:51,212 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:51,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:51,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:51,375 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:51,375 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:51,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:51,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:51,542 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:51,542 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:51,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:51,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:51,716 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-10-09 14:58:51,718 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:51,718 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:51,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:51,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:51,879 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:51,880 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:51,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:51,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:52,041 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:52,042 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:52,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:52,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:52,209 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:52,210 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:52,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:52,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:52,373 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:52,374 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:52,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:52,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:52,530 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:52,530 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:52,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:52,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:52,694 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:52,695 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:52,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:52,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:52,854 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:52,854 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:52,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:52,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:53,016 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:53,017 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:53,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:53,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:53,178 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:53,179 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:53,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:53,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:53,348 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:53,348 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:53,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:53,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:53,507 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:53,508 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:53,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:53,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:53,667 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:53,668 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:53,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:53,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:53,829 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:53,830 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:53,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:53,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:53,997 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:53,998 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:53,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:54,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:54,043 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_t1Thread1of1ForFork0_push_~stack.offset_55 Int) (aux_div_t1Thread1of1ForFork0_push_~x_49 Int) (|v_#memory_int_57| (Array Int (Array Int Int))) (aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (|ULTIMATE.start_main_~#id1~0.offset| Int) (|t1Thread1of1ForFork0_push_#t~ret35| Int) (t1Thread1of1ForFork0_push_~x Int) (|ULTIMATE.start_main_~#id2~0.offset| Int) (|ULTIMATE.start_main_~#id2~0.base| Int) (t1Thread1of1ForFork0_push_~stack.offset Int) (|ULTIMATE.start_main_~#id1~0.base| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35_64| Int)) (let ((.cse4 (* 4294967296 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))) (let ((.cse0 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129)) (.cse2 (* 4294967296 aux_div_t1Thread1of1ForFork0_push_~x_49)) (.cse1 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294966497)) (.cse3 (select |v_#memory_int_57| |c_t2Thread1of1ForFork1_pop_#in~stack.base|))) (and (<= .cse0 799) (not (= |ULTIMATE.start_main_~#id1~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (< 0 .cse1) (<= .cse0 (+ .cse2 799)) (< aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294967296) (not (= |ULTIMATE.start_main_~#id1~0.base| |c_t2Thread1of1ForFork1_pop_#in~stack.base|)) (< .cse2 .cse1) (= ((as const (Array Int Int)) 0) .cse3) (<= |c_t2Thread1of1ForFork1_pop_#in~stack.offset| t1Thread1of1ForFork0_push_~stack.offset) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id1~0.base|) |ULTIMATE.start_main_~#id1~0.offset|) 0) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id2~0.base|) |ULTIMATE.start_main_~#id2~0.offset|) 1) (<= 0 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129) (= (store |v_#memory_int_57| |c_t2Thread1of1ForFork1_pop_#in~stack.base| (store (store .cse3 (+ v_t1Thread1of1ForFork0_push_~stack.offset_55 (* |v_t1Thread1of1ForFork0_push_#t~ret35_64| 4)) (+ (* aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 4294967296)) (* aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 1)) 799)) (+ t1Thread1of1ForFork0_push_~stack.offset (* |t1Thread1of1ForFork0_push_#t~ret35| 4)) t1Thread1of1ForFork0_push_~x)) |c_#memory_int|) (<= c_~top~0 |t1Thread1of1ForFork0_push_#t~ret35|) (<= aux_div_t1Thread1of1ForFork0_push_~x_49 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))))) is different from true [2020-10-09 14:58:54,181 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:54,182 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:54,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:54,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:54,341 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:54,342 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:54,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:54,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:54,511 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:54,512 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:54,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:54,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:54,563 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_t1Thread1of1ForFork0_push_~stack.offset_55 Int) (aux_div_t1Thread1of1ForFork0_push_~x_49 Int) (|v_#memory_int_57| (Array Int (Array Int Int))) (aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (|ULTIMATE.start_main_~#id1~0.offset| Int) (|t1Thread1of1ForFork0_push_#t~ret35| Int) (t1Thread1of1ForFork0_push_~x Int) (|ULTIMATE.start_main_~#id2~0.offset| Int) (|ULTIMATE.start_main_~#id2~0.base| Int) (t1Thread1of1ForFork0_push_~stack.offset Int) (|ULTIMATE.start_main_~#id1~0.base| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35_64| Int)) (let ((.cse4 (* 4294967296 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))) (let ((.cse0 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129)) (.cse1 (select |v_#memory_int_57| c_t2Thread1of1ForFork1_pop_~stack.base)) (.cse3 (* 4294967296 aux_div_t1Thread1of1ForFork0_push_~x_49)) (.cse2 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294966497))) (and (<= .cse0 799) (<= c_t2Thread1of1ForFork1_pop_~stack.offset t1Thread1of1ForFork0_push_~stack.offset) (not (= |ULTIMATE.start_main_~#id1~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (not (= |ULTIMATE.start_main_~#id1~0.base| c_t2Thread1of1ForFork1_pop_~stack.base)) (= |c_#memory_int| (store |v_#memory_int_57| c_t2Thread1of1ForFork1_pop_~stack.base (store (store .cse1 (+ v_t1Thread1of1ForFork0_push_~stack.offset_55 (* |v_t1Thread1of1ForFork0_push_#t~ret35_64| 4)) (+ (* aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 4294967296)) (* aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 1)) 799)) (+ t1Thread1of1ForFork0_push_~stack.offset (* |t1Thread1of1ForFork0_push_#t~ret35| 4)) t1Thread1of1ForFork0_push_~x))) (< 0 .cse2) (<= .cse0 (+ .cse3 799)) (< aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294967296) (= ((as const (Array Int Int)) 0) .cse1) (< .cse3 .cse2) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id1~0.base|) |ULTIMATE.start_main_~#id1~0.offset|) 0) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id2~0.base|) |ULTIMATE.start_main_~#id2~0.offset|) 1) (<= 0 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129) (<= c_~top~0 |t1Thread1of1ForFork0_push_#t~ret35|) (<= aux_div_t1Thread1of1ForFork0_push_~x_49 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))))) is different from true [2020-10-09 14:58:54,704 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:54,705 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:54,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:54,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:54,888 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-10-09 14:58:54,891 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:54,891 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:54,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:54,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:55,071 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:55,072 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:55,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:55,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:55,119 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_t1Thread1of1ForFork0_push_~stack.offset_55 Int) (aux_div_t1Thread1of1ForFork0_push_~x_49 Int) (|v_#memory_int_57| (Array Int (Array Int Int))) (aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (|ULTIMATE.start_main_~#id1~0.offset| Int) (|t1Thread1of1ForFork0_push_#t~ret35| Int) (t1Thread1of1ForFork0_push_~x Int) (|ULTIMATE.start_main_~#id2~0.offset| Int) (|ULTIMATE.start_main_~#id2~0.base| Int) (t1Thread1of1ForFork0_push_~stack.offset Int) (|ULTIMATE.start_main_~#id1~0.base| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35_64| Int)) (let ((.cse4 (* 4294967296 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))) (let ((.cse0 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129)) (.cse1 (select |v_#memory_int_57| c_t2Thread1of1ForFork1_pop_~stack.base)) (.cse3 (* 4294967296 aux_div_t1Thread1of1ForFork0_push_~x_49)) (.cse2 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294966497))) (and (<= .cse0 799) (<= c_t2Thread1of1ForFork1_pop_~stack.offset t1Thread1of1ForFork0_push_~stack.offset) (not (= |ULTIMATE.start_main_~#id1~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (not (= |ULTIMATE.start_main_~#id1~0.base| c_t2Thread1of1ForFork1_pop_~stack.base)) (= |c_#memory_int| (store |v_#memory_int_57| c_t2Thread1of1ForFork1_pop_~stack.base (store (store .cse1 (+ v_t1Thread1of1ForFork0_push_~stack.offset_55 (* |v_t1Thread1of1ForFork0_push_#t~ret35_64| 4)) (+ (* aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 4294967296)) (* aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 1)) 799)) (+ t1Thread1of1ForFork0_push_~stack.offset (* |t1Thread1of1ForFork0_push_#t~ret35| 4)) t1Thread1of1ForFork0_push_~x))) (< 0 .cse2) (<= .cse0 (+ .cse3 799)) (< aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294967296) (= ((as const (Array Int Int)) 0) .cse1) (< .cse3 .cse2) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id1~0.base|) |ULTIMATE.start_main_~#id1~0.offset|) 0) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id2~0.base|) |ULTIMATE.start_main_~#id2~0.offset|) 1) (<= 0 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129) (<= |c_t2Thread1of1ForFork1_dec_top_#t~post31| |t1Thread1of1ForFork0_push_#t~ret35|) (<= aux_div_t1Thread1of1ForFork0_push_~x_49 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))))) is different from true [2020-10-09 14:58:55,279 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-10-09 14:58:55,281 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:55,282 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:55,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:55,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:55,331 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_t1Thread1of1ForFork0_push_~stack.offset_55 Int) (aux_div_t1Thread1of1ForFork0_push_~x_49 Int) (|v_#memory_int_57| (Array Int (Array Int Int))) (aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (|ULTIMATE.start_main_~#id1~0.offset| Int) (|t1Thread1of1ForFork0_push_#t~ret35| Int) (t1Thread1of1ForFork0_push_~x Int) (|ULTIMATE.start_main_~#id2~0.offset| Int) (|ULTIMATE.start_main_~#id2~0.base| Int) (t1Thread1of1ForFork0_push_~stack.offset Int) (|ULTIMATE.start_main_~#id1~0.base| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35_64| Int)) (let ((.cse4 (* 4294967296 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))) (let ((.cse0 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129)) (.cse1 (select |v_#memory_int_57| c_t2Thread1of1ForFork1_pop_~stack.base)) (.cse3 (* 4294967296 aux_div_t1Thread1of1ForFork0_push_~x_49)) (.cse2 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294966497))) (and (<= .cse0 799) (<= c_t2Thread1of1ForFork1_pop_~stack.offset t1Thread1of1ForFork0_push_~stack.offset) (not (= |ULTIMATE.start_main_~#id1~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (not (= |ULTIMATE.start_main_~#id1~0.base| c_t2Thread1of1ForFork1_pop_~stack.base)) (= |c_#memory_int| (store |v_#memory_int_57| c_t2Thread1of1ForFork1_pop_~stack.base (store (store .cse1 (+ v_t1Thread1of1ForFork0_push_~stack.offset_55 (* |v_t1Thread1of1ForFork0_push_#t~ret35_64| 4)) (+ (* aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 4294967296)) (* aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 1)) 799)) (+ t1Thread1of1ForFork0_push_~stack.offset (* |t1Thread1of1ForFork0_push_#t~ret35| 4)) t1Thread1of1ForFork0_push_~x))) (< 0 .cse2) (<= .cse0 (+ .cse3 799)) (< aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294967296) (= ((as const (Array Int Int)) 0) .cse1) (< .cse3 .cse2) (<= (+ c_~top~0 1) |t1Thread1of1ForFork0_push_#t~ret35|) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id1~0.base|) |ULTIMATE.start_main_~#id1~0.offset|) 0) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id2~0.base|) |ULTIMATE.start_main_~#id2~0.offset|) 1) (<= 0 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129) (<= aux_div_t1Thread1of1ForFork0_push_~x_49 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))))) is different from true [2020-10-09 14:58:55,473 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:55,474 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:55,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:55,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:55,643 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:55,644 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:55,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:55,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:55,823 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:55,823 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:55,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:55,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:55,867 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_t1Thread1of1ForFork0_push_~stack.offset_55 Int) (aux_div_t1Thread1of1ForFork0_push_~x_49 Int) (|v_#memory_int_57| (Array Int (Array Int Int))) (aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (|ULTIMATE.start_main_~#id1~0.offset| Int) (|t1Thread1of1ForFork0_push_#t~ret35| Int) (t1Thread1of1ForFork0_push_~x Int) (|ULTIMATE.start_main_~#id2~0.offset| Int) (|ULTIMATE.start_main_~#id2~0.base| Int) (t1Thread1of1ForFork0_push_~stack.offset Int) (|ULTIMATE.start_main_~#id1~0.base| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35_64| Int)) (let ((.cse4 (* 4294967296 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))) (let ((.cse0 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129)) (.cse1 (select |v_#memory_int_57| c_t2Thread1of1ForFork1_pop_~stack.base)) (.cse3 (* 4294967296 aux_div_t1Thread1of1ForFork0_push_~x_49)) (.cse2 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294966497))) (and (<= .cse0 799) (<= c_t2Thread1of1ForFork1_pop_~stack.offset t1Thread1of1ForFork0_push_~stack.offset) (not (= |ULTIMATE.start_main_~#id1~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (not (= |ULTIMATE.start_main_~#id1~0.base| c_t2Thread1of1ForFork1_pop_~stack.base)) (= |c_#memory_int| (store |v_#memory_int_57| c_t2Thread1of1ForFork1_pop_~stack.base (store (store .cse1 (+ v_t1Thread1of1ForFork0_push_~stack.offset_55 (* |v_t1Thread1of1ForFork0_push_#t~ret35_64| 4)) (+ (* aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 4294967296)) (* aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 1)) 799)) (+ t1Thread1of1ForFork0_push_~stack.offset (* |t1Thread1of1ForFork0_push_#t~ret35| 4)) t1Thread1of1ForFork0_push_~x))) (<= (+ |c_t2Thread1of1ForFork1_get_top_#res| 1) |t1Thread1of1ForFork0_push_#t~ret35|) (< 0 .cse2) (<= .cse0 (+ .cse3 799)) (< aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294967296) (= ((as const (Array Int Int)) 0) .cse1) (< .cse3 .cse2) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id1~0.base|) |ULTIMATE.start_main_~#id1~0.offset|) 0) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id2~0.base|) |ULTIMATE.start_main_~#id2~0.offset|) 1) (<= 0 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129) (<= aux_div_t1Thread1of1ForFork0_push_~x_49 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))))) is different from true [2020-10-09 14:58:56,008 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:56,009 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:56,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:56,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:56,056 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_t1Thread1of1ForFork0_push_~stack.offset_55 Int) (aux_div_t1Thread1of1ForFork0_push_~x_49 Int) (|v_#memory_int_57| (Array Int (Array Int Int))) (aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 Int) (|ULTIMATE.start_main_~#id1~0.offset| Int) (|t1Thread1of1ForFork0_push_#t~ret35| Int) (t1Thread1of1ForFork0_push_~x Int) (|ULTIMATE.start_main_~#id2~0.offset| Int) (|ULTIMATE.start_main_~#id2~0.base| Int) (t1Thread1of1ForFork0_push_~stack.offset Int) (|ULTIMATE.start_main_~#id1~0.base| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35_64| Int)) (let ((.cse4 (* 4294967296 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))) (let ((.cse0 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129)) (.cse1 (select |v_#memory_int_57| c_t2Thread1of1ForFork1_pop_~stack.base)) (.cse3 (* 4294967296 aux_div_t1Thread1of1ForFork0_push_~x_49)) (.cse2 (+ .cse4 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294966497))) (and (<= (+ |c_t2Thread1of1ForFork1_pop_#t~ret38| 1) |t1Thread1of1ForFork0_push_#t~ret35|) (<= .cse0 799) (<= c_t2Thread1of1ForFork1_pop_~stack.offset t1Thread1of1ForFork0_push_~stack.offset) (not (= |ULTIMATE.start_main_~#id1~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (not (= |ULTIMATE.start_main_~#id1~0.base| c_t2Thread1of1ForFork1_pop_~stack.base)) (= |c_#memory_int| (store |v_#memory_int_57| c_t2Thread1of1ForFork1_pop_~stack.base (store (store .cse1 (+ v_t1Thread1of1ForFork0_push_~stack.offset_55 (* |v_t1Thread1of1ForFork0_push_#t~ret35_64| 4)) (+ (* aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 4294967296)) (* aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 (- 1)) 799)) (+ t1Thread1of1ForFork0_push_~stack.offset (* |t1Thread1of1ForFork0_push_#t~ret35| 4)) t1Thread1of1ForFork0_push_~x))) (< 0 .cse2) (<= .cse0 (+ .cse3 799)) (< aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129 4294967296) (= ((as const (Array Int Int)) 0) .cse1) (< .cse3 .cse2) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id1~0.base|) |ULTIMATE.start_main_~#id1~0.offset|) 0) (= (select (select |v_#memory_int_57| |ULTIMATE.start_main_~#id2~0.base|) |ULTIMATE.start_main_~#id2~0.offset|) 1) (<= 0 aux_mod_aux_mod_t1Thread1of1ForFork0_push_~x_49_129) (<= aux_div_t1Thread1of1ForFork0_push_~x_49 aux_div_aux_mod_t1Thread1of1ForFork0_push_~x_49_129))))) is different from true [2020-10-09 14:58:56,188 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:56,189 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 94 [2020-10-09 14:58:56,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:58:56,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:56,313 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:56,313 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 53 [2020-10-09 14:58:56,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:58:56,341 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2020-10-09 14:58:56,343 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-09 14:58:56,460 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2020-10-09 14:58:56,462 INFO L625 ElimStorePlain]: treesize reduction 5, result has 89.1 percent of original size [2020-10-09 14:58:56,484 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2020-10-09 14:58:56,487 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-09 14:58:56,524 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 14:58:56,525 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 14:58:56,837 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-10-09 14:58:56,839 INFO L625 ElimStorePlain]: treesize reduction 13, result has 86.6 percent of original size [2020-10-09 14:58:56,854 INFO L545 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2020-10-09 14:58:56,854 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:114, output treesize:72 Received shutdown request... [2020-10-09 14:58:59,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3,15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:58:59,325 WARN L546 AbstractCegarLoop]: Verification canceled [2020-10-09 14:58:59,331 WARN L235 ceAbstractionStarter]: Timeout [2020-10-09 14:58:59,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 02:58:59 BasicIcfg [2020-10-09 14:58:59,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 14:58:59,333 INFO L168 Benchmark]: Toolchain (without parser) took 849586.44 ms. Allocated memory was 248.0 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 200.4 MB in the beginning and 240.9 MB in the end (delta: -40.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 14.2 GB. [2020-10-09 14:58:59,333 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 248.0 MB. Free memory is still 221.8 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 14:58:59,333 INFO L168 Benchmark]: CACSL2BoogieTranslator took 923.15 ms. Allocated memory was 248.0 MB in the beginning and 306.2 MB in the end (delta: 58.2 MB). Free memory was 200.4 MB in the beginning and 234.3 MB in the end (delta: -33.9 MB). Peak memory consumption was 34.2 MB. Max. memory is 14.2 GB. [2020-10-09 14:58:59,334 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.95 ms. Allocated memory is still 306.2 MB. Free memory was 234.3 MB in the beginning and 231.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 14:58:59,334 INFO L168 Benchmark]: Boogie Preprocessor took 37.21 ms. Allocated memory is still 306.2 MB. Free memory was 231.8 MB in the beginning and 229.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 14:58:59,334 INFO L168 Benchmark]: RCFGBuilder took 554.48 ms. Allocated memory is still 306.2 MB. Free memory was 229.3 MB in the beginning and 194.9 MB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 14.2 GB. [2020-10-09 14:58:59,334 INFO L168 Benchmark]: TraceAbstraction took 847966.53 ms. Allocated memory was 306.2 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 194.9 MB in the beginning and 240.9 MB in the end (delta: -46.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 14.2 GB. [2020-10-09 14:58:59,336 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.54 ms. Allocated memory is still 248.0 MB. Free memory is still 221.8 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 923.15 ms. Allocated memory was 248.0 MB in the beginning and 306.2 MB in the end (delta: 58.2 MB). Free memory was 200.4 MB in the beginning and 234.3 MB in the end (delta: -33.9 MB). Peak memory consumption was 34.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 98.95 ms. Allocated memory is still 306.2 MB. Free memory was 234.3 MB in the beginning and 231.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 37.21 ms. Allocated memory is still 306.2 MB. Free memory was 231.8 MB in the beginning and 229.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 554.48 ms. Allocated memory is still 306.2 MB. Free memory was 229.3 MB in the beginning and 194.9 MB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 847966.53 ms. Allocated memory was 306.2 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 194.9 MB in the beginning and 240.9 MB in the end (delta: -46.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 922). Cancelled while CegarLoopForPetriNet was analyzing trace of length 153 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 111 known predicates. - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 922). Cancelled while CegarLoopForPetriNet was analyzing trace of length 153 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 111 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 127 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: TIMEOUT, OverallTime: 847.7s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 385.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 223 SDtfs, 3073 SDslu, 15760 SDs, 0 SdLazy, 16143 SolverSat, 298 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 47.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2461 GetRequests, 2084 SyntacticMatches, 16 SemanticMatches, 361 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 16184 ImplicationChecksByTransitivity, 172.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4416occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 260.1s InterpolantComputationTime, 1099 NumberOfCodeBlocks, 1099 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2174 ConstructedInterpolants, 45 QuantifiedInterpolants, 1718382 SizeOfPredicates, 104 NumberOfNonLiveVariables, 2521 ConjunctsInSsa, 162 ConjunctsInUnsatCore, 24 InterpolantComputations, 12 PerfectInterpolantSequences, 162/528 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown