/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/fib_bench_longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 14:16:20,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 14:16:20,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 14:16:20,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 14:16:20,351 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 14:16:20,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 14:16:20,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 14:16:20,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 14:16:20,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 14:16:20,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 14:16:20,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 14:16:20,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 14:16:20,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 14:16:20,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 14:16:20,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 14:16:20,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 14:16:20,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 14:16:20,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 14:16:20,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 14:16:20,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 14:16:20,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 14:16:20,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 14:16:20,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 14:16:20,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 14:16:20,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 14:16:20,376 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 14:16:20,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 14:16:20,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 14:16:20,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 14:16:20,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 14:16:20,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 14:16:20,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 14:16:20,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 14:16:20,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 14:16:20,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 14:16:20,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 14:16:20,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 14:16:20,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 14:16:20,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 14:16:20,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 14:16:20,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 14:16:20,385 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:16:20,408 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 14:16:20,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 14:16:20,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 14:16:20,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 14:16:20,410 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 14:16:20,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 14:16:20,410 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 14:16:20,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 14:16:20,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 14:16:20,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 14:16:20,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 14:16:20,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 14:16:20,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 14:16:20,411 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 14:16:20,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 14:16:20,412 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 14:16:20,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 14:16:20,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 14:16:20,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 14:16:20,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 14:16:20,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 14:16:20,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 14:16:20,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 14:16:20,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 14:16:20,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 14:16:20,414 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-10-09 14:16:20,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 14:16:20,414 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-09 14:16:20,414 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-09 14:16:20,415 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 14:16:20,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 14:16:20,742 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 14:16:20,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 14:16:20,746 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 14:16:20,747 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 14:16:20,748 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_bench_longer-2.i [2020-10-09 14:16:20,810 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6e25ddc/f0106b51413549b3b2a17ab8f08fe8b3/FLAGd5b9218ef [2020-10-09 14:16:21,336 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 14:16:21,337 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_bench_longer-2.i [2020-10-09 14:16:21,354 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6e25ddc/f0106b51413549b3b2a17ab8f08fe8b3/FLAGd5b9218ef [2020-10-09 14:16:21,587 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6e25ddc/f0106b51413549b3b2a17ab8f08fe8b3 [2020-10-09 14:16:21,598 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 14:16:21,600 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 14:16:21,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 14:16:21,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 14:16:21,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 14:16:21,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 02:16:21" (1/1) ... [2020-10-09 14:16:21,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170c5a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:21, skipping insertion in model container [2020-10-09 14:16:21,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 02:16:21" (1/1) ... [2020-10-09 14:16:21,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 14:16:21,665 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 14:16:22,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 14:16:22,132 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 14:16:22,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 14:16:22,247 INFO L208 MainTranslator]: Completed translation [2020-10-09 14:16:22,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22 WrapperNode [2020-10-09 14:16:22,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 14:16:22,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 14:16:22,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 14:16:22,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 14:16:22,257 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:16:22" (1/1) ... [2020-10-09 14:16:22,273 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:16:22" (1/1) ... [2020-10-09 14:16:22,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 14:16:22,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 14:16:22,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 14:16:22,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 14:16:22,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22" (1/1) ... [2020-10-09 14:16:22,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22" (1/1) ... [2020-10-09 14:16:22,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22" (1/1) ... [2020-10-09 14:16:22,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22" (1/1) ... [2020-10-09 14:16:22,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22" (1/1) ... [2020-10-09 14:16:22,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22" (1/1) ... [2020-10-09 14:16:22,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22" (1/1) ... [2020-10-09 14:16:22,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 14:16:22,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 14:16:22,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 14:16:22,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 14:16:22,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 14:16:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-10-09 14:16:22,400 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-10-09 14:16:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-10-09 14:16:22,401 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-10-09 14:16:22,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 14:16:22,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 14:16:22,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 14:16:22,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 14:16:22,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 14:16:22,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 14:16:22,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 14:16:22,405 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:16:22,706 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 14:16:22,706 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-09 14:16:22,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 02:16:22 BoogieIcfgContainer [2020-10-09 14:16:22,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 14:16:22,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 14:16:22,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 14:16:22,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 14:16:22,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 02:16:21" (1/3) ... [2020-10-09 14:16:22,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715fb67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 02:16:22, skipping insertion in model container [2020-10-09 14:16:22,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:16:22" (2/3) ... [2020-10-09 14:16:22,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715fb67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 02:16:22, skipping insertion in model container [2020-10-09 14:16:22,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 02:16:22" (3/3) ... [2020-10-09 14:16:22,720 INFO L111 eAbstractionObserver]: Analyzing ICFG fib_bench_longer-2.i [2020-10-09 14:16:22,735 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 14:16:22,744 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-09 14:16:22,745 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 14:16:22,776 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,777 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,777 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,777 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,778 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,778 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,779 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,779 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,779 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,779 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,780 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,780 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,780 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,780 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,781 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,781 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,781 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,782 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,782 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,782 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,782 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,783 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,783 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,783 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,784 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,785 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,785 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,785 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,786 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,789 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,796 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,797 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,797 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,798 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,798 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,798 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,822 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,823 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,823 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,823 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,823 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,823 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:16:22,860 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-10-09 14:16:22,882 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 14:16:22,883 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 14:16:22,883 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 14:16:22,883 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 14:16:22,883 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 14:16:22,883 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 14:16:22,883 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 14:16:22,884 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 14:16:22,897 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 59 places, 57 transitions, 124 flow [2020-10-09 14:16:22,936 INFO L129 PetriNetUnfolder]: 5/55 cut-off events. [2020-10-09 14:16:22,936 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 14:16:22,944 INFO L80 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 55 events. 5/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2020-10-09 14:16:22,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 57 transitions, 124 flow [2020-10-09 14:16:22,950 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 55 transitions, 116 flow [2020-10-09 14:16:22,967 INFO L129 PetriNetUnfolder]: 4/44 cut-off events. [2020-10-09 14:16:22,967 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 14:16:22,968 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:16:22,969 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 14:16:22,969 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:16:22,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:16:22,975 INFO L82 PathProgramCache]: Analyzing trace with hash 627590565, now seen corresponding path program 1 times [2020-10-09 14:16:22,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:16:22,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553387627] [2020-10-09 14:16:22,990 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:16:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:16:23,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 14:16:23,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:16:23,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:23,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:23,245 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:16:23,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:16:23,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:23,322 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:16:23,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553387627] [2020-10-09 14:16:23,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:16:23,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2020-10-09 14:16:23,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011569527] [2020-10-09 14:16:23,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 14:16:23,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:16:23,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 14:16:23,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-09 14:16:23,541 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 57 [2020-10-09 14:16:23,544 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 116 flow. Second operand 9 states. [2020-10-09 14:16:23,544 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:16:23,544 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 57 [2020-10-09 14:16:23,546 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:16:24,005 INFO L129 PetriNetUnfolder]: 84/383 cut-off events. [2020-10-09 14:16:24,006 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 14:16:24,009 INFO L80 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 383 events. 84/383 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2260 event pairs, 0 based on Foata normal form. 91/435 useless extension candidates. Maximal degree in co-relation 501. Up to 47 conditions per place. [2020-10-09 14:16:24,013 INFO L132 encePairwiseOnDemand]: 46/57 looper letters, 16 selfloop transitions, 23 changer transitions 43/118 dead transitions. [2020-10-09 14:16:24,013 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 118 transitions, 392 flow [2020-10-09 14:16:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-09 14:16:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-09 14:16:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1119 transitions. [2020-10-09 14:16:24,035 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8923444976076556 [2020-10-09 14:16:24,036 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1119 transitions. [2020-10-09 14:16:24,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1119 transitions. [2020-10-09 14:16:24,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:16:24,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1119 transitions. [2020-10-09 14:16:24,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 23 states. [2020-10-09 14:16:24,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 23 states. [2020-10-09 14:16:24,061 INFO L81 ComplementDD]: Finished complementDD. Result 23 states. [2020-10-09 14:16:24,064 INFO L185 Difference]: Start difference. First operand has 57 places, 55 transitions, 116 flow. Second operand 22 states and 1119 transitions. [2020-10-09 14:16:24,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 118 transitions, 392 flow [2020-10-09 14:16:24,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 118 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-09 14:16:24,080 INFO L241 Difference]: Finished difference. Result has 94 places, 69 transitions, 266 flow [2020-10-09 14:16:24,091 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=266, PETRI_PLACES=94, PETRI_TRANSITIONS=69} [2020-10-09 14:16:24,093 INFO L341 CegarLoopForPetriNet]: 57 programPoint places, 37 predicate places. [2020-10-09 14:16:24,093 INFO L481 AbstractCegarLoop]: Abstraction has has 94 places, 69 transitions, 266 flow [2020-10-09 14:16:24,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 14:16:24,093 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:16:24,093 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] [2020-10-09 14:16:24,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-09 14:16:24,305 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:16:24,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:16:24,306 INFO L82 PathProgramCache]: Analyzing trace with hash -933138607, now seen corresponding path program 1 times [2020-10-09 14:16:24,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:16:24,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418773094] [2020-10-09 14:16:24,311 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:16:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:16:24,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-09 14:16:24,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:16:24,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:24,601 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:16:24,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:16:24,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:24,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:24,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:24,750 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:16:24,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418773094] [2020-10-09 14:16:24,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:16:24,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2020-10-09 14:16:24,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822395022] [2020-10-09 14:16:24,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-09 14:16:24,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:16:24,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-09 14:16:24,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-10-09 14:16:25,004 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 57 [2020-10-09 14:16:25,005 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 69 transitions, 266 flow. Second operand 13 states. [2020-10-09 14:16:25,005 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:16:25,005 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 57 [2020-10-09 14:16:25,005 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:16:25,872 INFO L129 PetriNetUnfolder]: 91/448 cut-off events. [2020-10-09 14:16:25,872 INFO L130 PetriNetUnfolder]: For 1129/1137 co-relation queries the response was YES. [2020-10-09 14:16:25,878 INFO L80 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 448 events. 91/448 cut-off events. For 1129/1137 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2615 event pairs, 0 based on Foata normal form. 22/419 useless extension candidates. Maximal degree in co-relation 894. Up to 81 conditions per place. [2020-10-09 14:16:25,884 INFO L132 encePairwiseOnDemand]: 50/57 looper letters, 21 selfloop transitions, 56 changer transitions 37/150 dead transitions. [2020-10-09 14:16:25,884 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 150 transitions, 978 flow [2020-10-09 14:16:25,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-10-09 14:16:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-09 14:16:25,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 1679 transitions. [2020-10-09 14:16:25,891 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8416040100250627 [2020-10-09 14:16:25,891 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 1679 transitions. [2020-10-09 14:16:25,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 1679 transitions. [2020-10-09 14:16:25,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:16:25,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 1679 transitions. [2020-10-09 14:16:25,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 36 states. [2020-10-09 14:16:25,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 36 states. [2020-10-09 14:16:25,900 INFO L81 ComplementDD]: Finished complementDD. Result 36 states. [2020-10-09 14:16:25,900 INFO L185 Difference]: Start difference. First operand has 94 places, 69 transitions, 266 flow. Second operand 35 states and 1679 transitions. [2020-10-09 14:16:25,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 150 transitions, 978 flow [2020-10-09 14:16:25,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 150 transitions, 924 flow, removed 27 selfloop flow, removed 9 redundant places. [2020-10-09 14:16:25,916 INFO L241 Difference]: Finished difference. Result has 123 places, 107 transitions, 643 flow [2020-10-09 14:16:25,917 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=643, PETRI_PLACES=123, PETRI_TRANSITIONS=107} [2020-10-09 14:16:25,918 INFO L341 CegarLoopForPetriNet]: 57 programPoint places, 66 predicate places. [2020-10-09 14:16:25,918 INFO L481 AbstractCegarLoop]: Abstraction has has 123 places, 107 transitions, 643 flow [2020-10-09 14:16:25,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-09 14:16:25,918 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:16:25,919 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] [2020-10-09 14:16:26,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-09 14:16:26,139 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:16:26,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:16:26,141 INFO L82 PathProgramCache]: Analyzing trace with hash -979469551, now seen corresponding path program 2 times [2020-10-09 14:16:26,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:16:26,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112662574] [2020-10-09 14:16:26,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-09 14:16:26,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 14:16:26,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:16:26,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-09 14:16:26,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:16:26,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:16:26,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:26,265 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:16:26,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:16:26,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:26,318 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:26,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:26,379 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:16:26,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112662574] [2020-10-09 14:16:26,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:16:26,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2020-10-09 14:16:26,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201945019] [2020-10-09 14:16:26,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-09 14:16:26,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:16:26,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-09 14:16:26,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-09 14:16:26,499 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 57 [2020-10-09 14:16:26,500 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 107 transitions, 643 flow. Second operand 13 states. [2020-10-09 14:16:26,500 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:16:26,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 57 [2020-10-09 14:16:26,501 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:16:28,015 INFO L129 PetriNetUnfolder]: 196/1097 cut-off events. [2020-10-09 14:16:28,015 INFO L130 PetriNetUnfolder]: For 6279/6287 co-relation queries the response was YES. [2020-10-09 14:16:28,024 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2662 conditions, 1097 events. 196/1097 cut-off events. For 6279/6287 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8778 event pairs, 0 based on Foata normal form. 35/1015 useless extension candidates. Maximal degree in co-relation 2605. Up to 207 conditions per place. [2020-10-09 14:16:28,031 INFO L132 encePairwiseOnDemand]: 50/57 looper letters, 24 selfloop transitions, 160 changer transitions 60/280 dead transitions. [2020-10-09 14:16:28,031 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 280 transitions, 2673 flow [2020-10-09 14:16:28,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-10-09 14:16:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-09 14:16:28,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 2450 transitions. [2020-10-09 14:16:28,040 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8427932576539388 [2020-10-09 14:16:28,040 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 2450 transitions. [2020-10-09 14:16:28,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 2450 transitions. [2020-10-09 14:16:28,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:16:28,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 2450 transitions. [2020-10-09 14:16:28,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 52 states. [2020-10-09 14:16:28,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 52 states. [2020-10-09 14:16:28,053 INFO L81 ComplementDD]: Finished complementDD. Result 52 states. [2020-10-09 14:16:28,053 INFO L185 Difference]: Start difference. First operand has 123 places, 107 transitions, 643 flow. Second operand 51 states and 2450 transitions. [2020-10-09 14:16:28,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 280 transitions, 2673 flow [2020-10-09 14:16:28,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 280 transitions, 2477 flow, removed 74 selfloop flow, removed 20 redundant places. [2020-10-09 14:16:28,080 INFO L241 Difference]: Finished difference. Result has 172 places, 216 transitions, 1814 flow [2020-10-09 14:16:28,081 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=1814, PETRI_PLACES=172, PETRI_TRANSITIONS=216} [2020-10-09 14:16:28,081 INFO L341 CegarLoopForPetriNet]: 57 programPoint places, 115 predicate places. [2020-10-09 14:16:28,081 INFO L481 AbstractCegarLoop]: Abstraction has has 172 places, 216 transitions, 1814 flow [2020-10-09 14:16:28,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-09 14:16:28,082 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:16:28,082 INFO L255 CegarLoopForPetriNet]: trace histogram [3, 3, 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] [2020-10-09 14:16:28,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-09 14:16:28,293 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:16:28,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:16:28,294 INFO L82 PathProgramCache]: Analyzing trace with hash 363117953, now seen corresponding path program 1 times [2020-10-09 14:16:28,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:16:28,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87666056] [2020-10-09 14:16:28,295 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:16:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:16:28,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-09 14:16:28,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:16:28,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:28,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:28,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:16:28,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:28,597 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:28,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:28,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:28,697 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:28,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:28,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87666056] [2020-10-09 14:16:28,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1427097313] [2020-10-09 14:16:28,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:16:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:16:28,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-09 14:16:28,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:16:29,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:29,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:29,071 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:29,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:16:29,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:29,082 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:29,085 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:29,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:29,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:29,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105105155] [2020-10-09 14:16:29,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:16:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:16:29,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-09 14:16:29,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:16:29,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:29,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:29,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:16:29,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:29,327 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:29,330 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:29,333 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:29,338 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:29,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:16:29,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10, 10] total 17 [2020-10-09 14:16:29,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504567743] [2020-10-09 14:16:29,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-09 14:16:29,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:16:29,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-09 14:16:29,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2020-10-09 14:16:29,781 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 57 [2020-10-09 14:16:29,782 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 216 transitions, 1814 flow. Second operand 17 states. [2020-10-09 14:16:29,782 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:16:29,782 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 57 [2020-10-09 14:16:29,782 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:16:33,514 INFO L129 PetriNetUnfolder]: 365/2198 cut-off events. [2020-10-09 14:16:33,515 INFO L130 PetriNetUnfolder]: For 22815/22856 co-relation queries the response was YES. [2020-10-09 14:16:33,535 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6080 conditions, 2198 events. 365/2198 cut-off events. For 22815/22856 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 19482 event pairs, 0 based on Foata normal form. 56/2021 useless extension candidates. Maximal degree in co-relation 6003. Up to 402 conditions per place. [2020-10-09 14:16:33,548 INFO L132 encePairwiseOnDemand]: 50/57 looper letters, 30 selfloop transitions, 401 changer transitions 77/544 dead transitions. [2020-10-09 14:16:33,548 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 544 transitions, 6618 flow [2020-10-09 14:16:33,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2020-10-09 14:16:33,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-09 14:16:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 3451 transitions. [2020-10-09 14:16:33,571 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8408869395711501 [2020-10-09 14:16:33,571 INFO L72 ComplementDD]: Start complementDD. Operand 72 states and 3451 transitions. [2020-10-09 14:16:33,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 3451 transitions. [2020-10-09 14:16:33,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:16:33,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 72 states and 3451 transitions. [2020-10-09 14:16:33,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 73 states. [2020-10-09 14:16:33,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 73 states. [2020-10-09 14:16:33,593 INFO L81 ComplementDD]: Finished complementDD. Result 73 states. [2020-10-09 14:16:33,593 INFO L185 Difference]: Start difference. First operand has 172 places, 216 transitions, 1814 flow. Second operand 72 states and 3451 transitions. [2020-10-09 14:16:33,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 544 transitions, 6618 flow [2020-10-09 14:16:33,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 544 transitions, 5666 flow, removed 455 selfloop flow, removed 27 redundant places. [2020-10-09 14:16:33,683 INFO L241 Difference]: Finished difference. Result has 236 places, 463 transitions, 4606 flow [2020-10-09 14:16:33,683 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=4606, PETRI_PLACES=236, PETRI_TRANSITIONS=463} [2020-10-09 14:16:33,684 INFO L341 CegarLoopForPetriNet]: 57 programPoint places, 179 predicate places. [2020-10-09 14:16:33,684 INFO L481 AbstractCegarLoop]: Abstraction has has 236 places, 463 transitions, 4606 flow [2020-10-09 14:16:33,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-09 14:16:33,684 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:16:33,684 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 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] [2020-10-09 14:16:34,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3,6 cvc4 --incremental --print-success --lang smt --rewrite-divk,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:16:34,297 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:16:34,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:16:34,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1061462731, now seen corresponding path program 1 times [2020-10-09 14:16:34,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:16:34,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780886132] [2020-10-09 14:16:34,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-09 14:16:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:16:34,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-09 14:16:34,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:16:34,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:34,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:34,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:16:34,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:34,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:34,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:34,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:34,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:34,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:35,917 WARN L193 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-10-09 14:16:36,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:38,214 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 30 [2020-10-09 14:16:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:38,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780886132] [2020-10-09 14:16:38,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [746854369] [2020-10-09 14:16:38,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:16:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:16:38,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-09 14:16:38,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:16:38,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:38,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:38,419 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:38,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:16:38,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:38,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:38,428 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:38,430 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:38,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:38,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:42,758 WARN L193 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 43 [2020-10-09 14:16:43,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:47,909 WARN L193 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 41 [2020-10-09 14:16:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:47,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274529861] [2020-10-09 14:16:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:16:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:16:47,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-09 14:16:47,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:16:48,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:48,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:16:48,076 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:48,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:16:48,078 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:48,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:48,084 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:48,087 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:48,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:48,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:49,184 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:16:49,228 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:16:49,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:16:49,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12, 12] total 23 [2020-10-09 14:16:49,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180279231] [2020-10-09 14:16:49,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-09 14:16:49,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:16:49,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-09 14:16:49,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=379, Unknown=4, NotChecked=0, Total=506 [2020-10-09 14:16:54,428 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 57 [2020-10-09 14:16:54,429 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 463 transitions, 4606 flow. Second operand 23 states. [2020-10-09 14:16:54,430 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:16:54,430 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 57 [2020-10-09 14:16:54,430 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:17:12,476 WARN L193 SmtUtils]: Spent 8.00 s on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-10-09 14:17:22,502 WARN L193 SmtUtils]: Spent 6.99 s on a formula simplification. DAG size of input: 96 DAG size of output: 50 [2020-10-09 14:17:24,609 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~i~0 (- 1)))) (let ((.cse7 (+ c_~i~0 (* 2 c_~j~0))) (.cse9 (* c_~j~0 (- 1))) (.cse0 (+ c_~i~0 c_~j~0)) (.cse10 (+ .cse8 376)) (.cse2 (+ c_~i~0 (* 3 c_~j~0)))) (and (< .cse0 377) (forall ((aux_div_aux_mod_v_~j~0_25_50_41 Int) (aux_div_v_~j~0_25_50 Int)) (let ((.cse1 (* 2 aux_div_aux_mod_v_~j~0_25_50_41))) (or (< (+ aux_div_v_~j~0_25_50 c_~i~0 c_~j~0) (+ aux_div_aux_mod_v_~j~0_25_50_41 186)) (<= (+ .cse1 c_~i~0 2) 0) (< 0 (+ .cse1 c_~i~0)) (< (+ (* 3 aux_div_aux_mod_v_~j~0_25_50_41) c_~i~0 555) (* 4 aux_div_v_~j~0_25_50))))) (< .cse2 377) (< c_~i~0 377) (<= c_~i~0 1) (forall ((aux_div_aux_mod_aux_mod_v_~j~0_30_50_76_89 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~j~0_30_50_76_89_54 Int) (aux_div_v_~j~0_30_50 Int) (aux_div_aux_mod_v_~j~0_30_50_76 Int)) (let ((.cse5 (* 2 aux_div_v_~j~0_30_50)) (.cse4 (* 2 aux_div_aux_mod_aux_mod_v_~j~0_30_50_76_89)) (.cse3 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~j~0_30_50_76_89_54)) (.cse6 (* 2 aux_div_aux_mod_v_~j~0_30_50_76))) (or (< 0 .cse3) (<= (+ .cse4 c_~i~0 .cse3 .cse5) 370) (<= (+ .cse3 2) 0) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~j~0_30_50_76_89) c_~i~0) (+ aux_div_v_~j~0_30_50 3)) (< .cse6 (+ .cse4 .cse3)) (< 372 (+ .cse4 .cse3 c_~i~0 .cse5)) (< (+ c_~i~0 c_~j~0) aux_div_aux_mod_v_~j~0_30_50_76) (<= (+ .cse4 .cse3 2) .cse6)))) (< .cse7 (+ (div (+ .cse8 .cse9 374) 2) 2)) (< c_~j~0 377) (< .cse7 377) (< .cse0 (+ (div .cse10 2) 1)) (<= (div (+ .cse9 3) (- 2)) 2) (< .cse0 (+ (div .cse10 3) 1)) (= c_ULTIMATE.start_main_~condI~0 0) (< .cse2 (+ (div (+ .cse8 (* c_~j~0 (- 2)) 372) 2) 3))))) is different from false [2020-10-09 14:17:52,259 WARN L193 SmtUtils]: Spent 5.55 s on a formula simplification. DAG size of input: 88 DAG size of output: 40 [2020-10-09 14:17:54,688 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~i~0 (- 1)))) (let ((.cse7 (+ c_~i~0 (* 2 c_~j~0))) (.cse0 (+ c_~i~0 c_~j~0)) (.cse9 (+ .cse8 376)) (.cse2 (+ c_~i~0 (* 3 c_~j~0)))) (and (< .cse0 377) (forall ((aux_div_aux_mod_v_~j~0_25_50_41 Int) (aux_div_v_~j~0_25_50 Int)) (let ((.cse1 (* 2 aux_div_aux_mod_v_~j~0_25_50_41))) (or (< (+ aux_div_v_~j~0_25_50 c_~i~0 c_~j~0) (+ aux_div_aux_mod_v_~j~0_25_50_41 186)) (<= (+ .cse1 c_~i~0 2) 0) (< 0 (+ .cse1 c_~i~0)) (< (+ (* 3 aux_div_aux_mod_v_~j~0_25_50_41) c_~i~0 555) (* 4 aux_div_v_~j~0_25_50))))) (< .cse2 377) (< c_~i~0 377) (<= c_~i~0 1) (forall ((aux_div_aux_mod_aux_mod_v_~j~0_30_50_76_89 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~j~0_30_50_76_89_54 Int) (aux_div_v_~j~0_30_50 Int) (aux_div_aux_mod_v_~j~0_30_50_76 Int)) (let ((.cse5 (* 2 aux_div_v_~j~0_30_50)) (.cse4 (* 2 aux_div_aux_mod_aux_mod_v_~j~0_30_50_76_89)) (.cse3 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~j~0_30_50_76_89_54)) (.cse6 (* 2 aux_div_aux_mod_v_~j~0_30_50_76))) (or (< 0 .cse3) (<= (+ .cse4 c_~i~0 .cse3 .cse5) 370) (<= (+ .cse3 2) 0) (< (+ (* 3 aux_div_aux_mod_aux_mod_v_~j~0_30_50_76_89) c_~i~0) (+ aux_div_v_~j~0_30_50 3)) (< .cse6 (+ .cse4 .cse3)) (< 372 (+ .cse4 .cse3 c_~i~0 .cse5)) (< (+ c_~i~0 c_~j~0) aux_div_aux_mod_v_~j~0_30_50_76) (<= (+ .cse4 .cse3 2) .cse6)))) (< .cse7 (+ (div (+ .cse8 (* c_~j~0 (- 1)) 374) 2) 2)) (< c_~j~0 377) (< .cse7 377) (< .cse0 (+ (div .cse9 2) 1)) (< .cse0 (+ (div .cse9 3) 1)) (= c_ULTIMATE.start_main_~condI~0 0) (< .cse2 (+ (div (+ .cse8 (* c_~j~0 (- 2)) 372) 2) 3))))) is different from false [2020-10-09 14:17:59,414 WARN L193 SmtUtils]: Spent 4.30 s on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2020-10-09 14:18:02,382 WARN L193 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2020-10-09 14:18:11,725 WARN L193 SmtUtils]: Spent 7.17 s on a formula simplification. DAG size of input: 99 DAG size of output: 44 [2020-10-09 14:18:18,362 WARN L193 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-10-09 14:18:22,880 WARN L193 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2020-10-09 14:18:31,294 WARN L193 SmtUtils]: Spent 3.13 s on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2020-10-09 14:18:42,354 WARN L193 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2020-10-09 14:18:48,583 WARN L193 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2020-10-09 14:18:57,963 WARN L193 SmtUtils]: Spent 8.46 s on a formula simplification. DAG size of input: 98 DAG size of output: 52 [2020-10-09 14:19:01,014 WARN L193 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-10-09 14:19:04,956 WARN L193 SmtUtils]: Spent 3.27 s on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2020-10-09 14:19:09,162 WARN L193 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2020-10-09 14:19:21,765 WARN L193 SmtUtils]: Spent 3.66 s on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2020-10-09 14:19:38,325 WARN L193 SmtUtils]: Spent 9.30 s on a formula simplification. DAG size of input: 101 DAG size of output: 46 [2020-10-09 14:19:47,314 WARN L193 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2020-10-09 14:19:56,197 WARN L193 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2020-10-09 14:20:09,765 WARN L193 SmtUtils]: Spent 8.41 s on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2020-10-09 14:20:25,218 WARN L193 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2020-10-09 14:20:33,665 WARN L193 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2020-10-09 14:20:44,655 WARN L193 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2020-10-09 14:20:55,085 WARN L193 SmtUtils]: Spent 3.70 s on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2020-10-09 14:21:08,569 WARN L193 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2020-10-09 14:21:26,778 WARN L193 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 45 [2020-10-09 14:21:37,965 INFO L129 PetriNetUnfolder]: 772/4835 cut-off events. [2020-10-09 14:21:37,965 INFO L130 PetriNetUnfolder]: For 86679/86839 co-relation queries the response was YES. [2020-10-09 14:21:38,028 INFO L80 FinitePrefix]: Finished finitePrefix Result has 14089 conditions, 4835 events. 772/4835 cut-off events. For 86679/86839 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 49115 event pairs, 0 based on Foata normal form. 111/4429 useless extension candidates. Maximal degree in co-relation 13994. Up to 779 conditions per place. [2020-10-09 14:21:38,056 INFO L132 encePairwiseOnDemand]: 50/57 looper letters, 70 selfloop transitions, 942 changer transitions 140/1188 dead transitions. [2020-10-09 14:21:38,056 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 1188 transitions, 15635 flow [2020-10-09 14:21:38,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2020-10-09 14:21:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-09 14:21:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 4940 transitions. [2020-10-09 14:21:38,079 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8414239482200647 [2020-10-09 14:21:38,079 INFO L72 ComplementDD]: Start complementDD. Operand 103 states and 4940 transitions. [2020-10-09 14:21:38,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 4940 transitions. [2020-10-09 14:21:38,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:21:38,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 103 states and 4940 transitions. [2020-10-09 14:21:38,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 104 states. [2020-10-09 14:21:38,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 104 states. [2020-10-09 14:21:38,114 INFO L81 ComplementDD]: Finished complementDD. Result 104 states. [2020-10-09 14:21:38,114 INFO L185 Difference]: Start difference. First operand has 236 places, 463 transitions, 4606 flow. Second operand 103 states and 4940 transitions. [2020-10-09 14:21:38,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 1188 transitions, 15635 flow [2020-10-09 14:21:38,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 1188 transitions, 14858 flow, removed 332 selfloop flow, removed 36 redundant places. [2020-10-09 14:21:38,326 INFO L241 Difference]: Finished difference. Result has 339 places, 1038 transitions, 12130 flow [2020-10-09 14:21:38,327 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=4414, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=420, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=103, PETRI_FLOW=12130, PETRI_PLACES=339, PETRI_TRANSITIONS=1038} [2020-10-09 14:21:38,327 INFO L341 CegarLoopForPetriNet]: 57 programPoint places, 282 predicate places. [2020-10-09 14:21:38,327 INFO L481 AbstractCegarLoop]: Abstraction has has 339 places, 1038 transitions, 12130 flow [2020-10-09 14:21:38,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-09 14:21:38,327 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:21:38,328 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 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] [2020-10-09 14:21:38,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk,8 mathsat -unsat_core_generation=3,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:21:38,931 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:21:38,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:21:38,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1112258801, now seen corresponding path program 2 times [2020-10-09 14:21:38,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:21:38,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712354166] [2020-10-09 14:21:38,933 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 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:21:38,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-09 14:21:38,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:21:38,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-09 14:21:38,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:21:39,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:21:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:21:39,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:21:39,436 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:39,476 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:39,519 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:39,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:39,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:39,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:39,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:39,954 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:21:39,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712354166] [2020-10-09 14:21:39,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1140896008] [2020-10-09 14:21:39,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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:21:40,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-09 14:21:40,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:21:40,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-09 14:21:40,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:21:40,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:21:40,143 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:21:40,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:21:40,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:40,147 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:40,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:40,156 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:40,161 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:40,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:40,171 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:21:40,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674039824] [2020-10-09 14:21:40,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:21:40,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-09 14:21:40,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:21:40,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-09 14:21:40,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:21:40,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:21:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:21:40,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:21:40,334 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:40,337 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:40,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:40,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:40,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:40,356 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:40,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:21:40,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:21:40,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12, 12] total 21 [2020-10-09 14:21:40,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385977450] [2020-10-09 14:21:40,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-09 14:21:40,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:21:40,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-09 14:21:40,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2020-10-09 14:21:40,696 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 57 [2020-10-09 14:21:40,697 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 1038 transitions, 12130 flow. Second operand 21 states. [2020-10-09 14:21:40,697 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:21:40,697 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 57 [2020-10-09 14:21:40,697 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:21:46,437 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2020-10-09 14:21:46,919 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2020-10-09 14:21:49,165 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2020-10-09 14:21:51,926 INFO L129 PetriNetUnfolder]: 1126/7772 cut-off events. [2020-10-09 14:21:51,926 INFO L130 PetriNetUnfolder]: For 215115/215330 co-relation queries the response was YES. [2020-10-09 14:21:52,031 INFO L80 FinitePrefix]: Finished finitePrefix Result has 24636 conditions, 7772 events. 1126/7772 cut-off events. For 215115/215330 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 90987 event pairs, 2 based on Foata normal form. 96/7019 useless extension candidates. Maximal degree in co-relation 24503. Up to 947 conditions per place. [2020-10-09 14:21:52,074 INFO L132 encePairwiseOnDemand]: 50/57 looper letters, 779 selfloop transitions, 909 changer transitions 139/1863 dead transitions. [2020-10-09 14:21:52,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 1863 transitions, 28113 flow [2020-10-09 14:21:52,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2020-10-09 14:21:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-09 14:21:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 4063 transitions. [2020-10-09 14:21:52,083 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8385964912280702 [2020-10-09 14:21:52,084 INFO L72 ComplementDD]: Start complementDD. Operand 85 states and 4063 transitions. [2020-10-09 14:21:52,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 4063 transitions. [2020-10-09 14:21:52,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:21:52,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 85 states and 4063 transitions. [2020-10-09 14:21:52,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 86 states. [2020-10-09 14:21:52,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 86 states. [2020-10-09 14:21:52,097 INFO L81 ComplementDD]: Finished complementDD. Result 86 states. [2020-10-09 14:21:52,097 INFO L185 Difference]: Start difference. First operand has 339 places, 1038 transitions, 12130 flow. Second operand 85 states and 4063 transitions. [2020-10-09 14:21:52,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 1863 transitions, 28113 flow [2020-10-09 14:21:52,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 1863 transitions, 27820 flow, removed 123 selfloop flow, removed 40 redundant places. [2020-10-09 14:21:53,018 INFO L241 Difference]: Finished difference. Result has 409 places, 1662 transitions, 22973 flow [2020-10-09 14:21:53,019 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=11963, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1038, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=417, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=22973, PETRI_PLACES=409, PETRI_TRANSITIONS=1662} [2020-10-09 14:21:53,020 INFO L341 CegarLoopForPetriNet]: 57 programPoint places, 352 predicate places. [2020-10-09 14:21:53,020 INFO L481 AbstractCegarLoop]: Abstraction has has 409 places, 1662 transitions, 22973 flow [2020-10-09 14:21:53,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-09 14:21:53,020 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:21:53,020 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 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] [2020-10-09 14:21:53,622 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:21:53,625 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:21:53,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:21:53,625 INFO L82 PathProgramCache]: Analyzing trace with hash 2070175399, now seen corresponding path program 3 times [2020-10-09 14:21:53,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:21:53,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789245683] [2020-10-09 14:21:53,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 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:21:53,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-09 14:21:53,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:21:53,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-09 14:21:53,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:21:53,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:21:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:21:54,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:21:54,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:54,160 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:54,225 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:54,362 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:54,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:54,531 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:54,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:54,712 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:21:54,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789245683] [2020-10-09 14:21:54,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1796961752] [2020-10-09 14:21:54,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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:21:54,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-09 14:21:54,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:21:54,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-09 14:21:54,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:21:54,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:21:54,886 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:21:54,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:21:54,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:54,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:54,894 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:54,900 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:54,903 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:54,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:54,910 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:54,926 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:21:54,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343334303] [2020-10-09 14:21:54,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:21:54,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-09 14:21:54,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:21:54,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-09 14:21:54,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:21:55,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:21:55,050 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:21:55,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:21:55,051 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:55,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:55,062 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:55,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:55,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:55,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:55,076 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:21:55,094 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:21:55,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:21:55,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12, 12] total 21 [2020-10-09 14:21:55,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105382569] [2020-10-09 14:21:55,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-09 14:21:55,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:21:55,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-09 14:21:55,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2020-10-09 14:21:56,681 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 57 [2020-10-09 14:21:56,682 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 1662 transitions, 22973 flow. Second operand 21 states. [2020-10-09 14:21:56,682 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:21:56,682 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 57 [2020-10-09 14:21:56,682 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:22:02,469 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2020-10-09 14:22:04,136 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2020-10-09 14:22:07,898 INFO L129 PetriNetUnfolder]: 1238/8852 cut-off events. [2020-10-09 14:22:07,899 INFO L130 PetriNetUnfolder]: For 262975/263318 co-relation queries the response was YES. [2020-10-09 14:22:08,019 INFO L80 FinitePrefix]: Finished finitePrefix Result has 29590 conditions, 8852 events. 1238/8852 cut-off events. For 262975/263318 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 107890 event pairs, 0 based on Foata normal form. 90/7973 useless extension candidates. Maximal degree in co-relation 29429. Up to 1048 conditions per place. [2020-10-09 14:22:08,068 INFO L132 encePairwiseOnDemand]: 50/57 looper letters, 734 selfloop transitions, 1222 changer transitions 90/2082 dead transitions. [2020-10-09 14:22:08,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 2082 transitions, 36777 flow [2020-10-09 14:22:08,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2020-10-09 14:22:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-09 14:22:08,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 3883 transitions. [2020-10-09 14:22:08,076 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8410223088585662 [2020-10-09 14:22:08,076 INFO L72 ComplementDD]: Start complementDD. Operand 81 states and 3883 transitions. [2020-10-09 14:22:08,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 3883 transitions. [2020-10-09 14:22:08,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:22:08,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 81 states and 3883 transitions. [2020-10-09 14:22:08,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 82 states. [2020-10-09 14:22:08,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 82 states. [2020-10-09 14:22:08,089 INFO L81 ComplementDD]: Finished complementDD. Result 82 states. [2020-10-09 14:22:08,089 INFO L185 Difference]: Start difference. First operand has 409 places, 1662 transitions, 22973 flow. Second operand 81 states and 3883 transitions. [2020-10-09 14:22:08,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 2082 transitions, 36777 flow [2020-10-09 14:22:09,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 2082 transitions, 36084 flow, removed 300 selfloop flow, removed 39 redundant places. [2020-10-09 14:22:09,645 INFO L241 Difference]: Finished difference. Result has 471 places, 1903 transitions, 30188 flow [2020-10-09 14:22:09,648 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=22774, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1014, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=81, PETRI_FLOW=30188, PETRI_PLACES=471, PETRI_TRANSITIONS=1903} [2020-10-09 14:22:09,648 INFO L341 CegarLoopForPetriNet]: 57 programPoint places, 414 predicate places. [2020-10-09 14:22:09,648 INFO L481 AbstractCegarLoop]: Abstraction has has 471 places, 1903 transitions, 30188 flow [2020-10-09 14:22:09,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-09 14:22:09,649 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:22:09,649 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 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] [2020-10-09 14:22:10,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 mathsat -unsat_core_generation=3,15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:22:10,257 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:22:10,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:22:10,258 INFO L82 PathProgramCache]: Analyzing trace with hash 146070790, now seen corresponding path program 4 times [2020-10-09 14:22:10,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:22:10,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311217621] [2020-10-09 14:22:10,259 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-10-09 14:22:10,308 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-09 14:22:10,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:22:10,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-09 14:22:10,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:22:10,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:22:10,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:22:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:22:10,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:22:11,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:11,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:11,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:11,234 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:11,309 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:11,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:11,508 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:13,912 WARN L193 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 31 [2020-10-09 14:22:13,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:22:14,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311217621] [2020-10-09 14:22:14,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1019135606] [2020-10-09 14:22:14,218 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:22:14,316 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-09 14:22:14,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:22:14,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-09 14:22:14,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:22:14,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:22:14,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:22:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:22:14,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:22:14,418 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:14,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:14,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:14,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:14,430 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:14,431 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:14,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:15,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:22:15,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251298197] [2020-10-09 14:22:15,247 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:22:15,305 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-09 14:22:15,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:22:15,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-09 14:22:15,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:22:15,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:22:15,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:22:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:22:15,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:22:15,370 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:15,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:15,374 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:15,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:15,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:15,379 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:15,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:15,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:22:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:22:15,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:22:15,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13, 13] total 23 [2020-10-09 14:22:15,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598583065] [2020-10-09 14:22:15,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-09 14:22:15,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:22:15,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-09 14:22:15,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2020-10-09 14:22:16,099 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 57 [2020-10-09 14:22:16,100 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 1903 transitions, 30188 flow. Second operand 23 states. [2020-10-09 14:22:16,100 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:22:16,100 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 57 [2020-10-09 14:22:16,101 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:22:19,208 WARN L193 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-10-09 14:22:19,871 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-10-09 14:22:21,376 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-10-09 14:22:30,339 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2020-10-09 14:22:34,289 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2020-10-09 14:22:34,693 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2020-10-09 14:22:36,913 WARN L193 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2020-10-09 14:22:40,756 WARN L193 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2020-10-09 14:22:43,526 WARN L193 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2020-10-09 14:22:46,336 WARN L193 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2020-10-09 14:22:52,065 WARN L193 SmtUtils]: Spent 5.50 s on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2020-10-09 14:22:53,342 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2020-10-09 14:22:56,105 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2020-10-09 14:22:59,993 WARN L193 SmtUtils]: Spent 3.46 s on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2020-10-09 14:23:01,907 WARN L193 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2020-10-09 14:23:04,277 WARN L193 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2020-10-09 14:23:04,944 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2020-10-09 14:23:08,109 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2020-10-09 14:23:08,924 WARN L193 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 39 [2020-10-09 14:23:19,022 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2020-10-09 14:23:39,373 INFO L129 PetriNetUnfolder]: 1990/14356 cut-off events. [2020-10-09 14:23:39,374 INFO L130 PetriNetUnfolder]: For 443876/444390 co-relation queries the response was YES. [2020-10-09 14:23:39,736 INFO L80 FinitePrefix]: Finished finitePrefix Result has 48344 conditions, 14356 events. 1990/14356 cut-off events. For 443876/444390 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 190551 event pairs, 0 based on Foata normal form. 209/13005 useless extension candidates. Maximal degree in co-relation 48158. Up to 1843 conditions per place. [2020-10-09 14:23:39,811 INFO L132 encePairwiseOnDemand]: 50/57 looper letters, 366 selfloop transitions, 2799 changer transitions 125/3326 dead transitions. [2020-10-09 14:23:39,811 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 3326 transitions, 60721 flow [2020-10-09 14:23:39,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2020-10-09 14:23:39,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-10-09 14:23:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 5744 transitions. [2020-10-09 14:23:39,821 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.839766081871345 [2020-10-09 14:23:39,821 INFO L72 ComplementDD]: Start complementDD. Operand 120 states and 5744 transitions. [2020-10-09 14:23:39,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 5744 transitions. [2020-10-09 14:23:39,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:23:39,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 120 states and 5744 transitions. [2020-10-09 14:23:39,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 121 states. [2020-10-09 14:23:39,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 121 states. [2020-10-09 14:23:39,838 INFO L81 ComplementDD]: Finished complementDD. Result 121 states. [2020-10-09 14:23:39,838 INFO L185 Difference]: Start difference. First operand has 471 places, 1903 transitions, 30188 flow. Second operand 120 states and 5744 transitions. [2020-10-09 14:23:39,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 3326 transitions, 60721 flow [2020-10-09 14:23:45,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 3326 transitions, 60246 flow, removed 179 selfloop flow, removed 42 redundant places. [2020-10-09 14:23:45,988 INFO L241 Difference]: Finished difference. Result has 586 places, 3183 transitions, 56052 flow [2020-10-09 14:23:45,991 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=29855, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1903, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1728, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=120, PETRI_FLOW=56052, PETRI_PLACES=586, PETRI_TRANSITIONS=3183} [2020-10-09 14:23:45,991 INFO L341 CegarLoopForPetriNet]: 57 programPoint places, 529 predicate places. [2020-10-09 14:23:45,991 INFO L481 AbstractCegarLoop]: Abstraction has has 586 places, 3183 transitions, 56052 flow [2020-10-09 14:23:45,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-09 14:23:45,991 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:23:45,992 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 3, 3, 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] [2020-10-09 14:23:46,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:23:46,594 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:23:46,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:23:46,595 INFO L82 PathProgramCache]: Analyzing trace with hash 361414969, now seen corresponding path program 5 times [2020-10-09 14:23:46,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:23:46,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862866018] [2020-10-09 14:23:46,596 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2020-10-09 14:23:46,639 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2020-10-09 14:23:46,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:23:46,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-09 14:23:46,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:23:47,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:23:47,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:23:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:23:47,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:23:47,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:47,556 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:47,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:47,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:47,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:47,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:47,983 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,105 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:23:48,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862866018] [2020-10-09 14:23:48,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [244771066] [2020-10-09 14:23:48,363 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:23:48,468 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2020-10-09 14:23:48,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:23:48,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-09 14:23:48,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:23:48,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:23:48,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:23:48,553 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:23:48,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:23:48,554 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,556 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:23:48,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819412325] [2020-10-09 14:23:48,600 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:23:48,650 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2020-10-09 14:23:48,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:23:48,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-09 14:23:48,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:23:48,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:23:48,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:23:48,755 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:23:48,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:23:48,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,765 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,768 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:23:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:23:48,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:23:48,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 25 [2020-10-09 14:23:48,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134757469] [2020-10-09 14:23:48,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-09 14:23:48,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:23:48,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-09 14:23:48,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2020-10-09 14:23:50,341 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 57 [2020-10-09 14:23:50,343 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 3183 transitions, 56052 flow. Second operand 25 states. [2020-10-09 14:23:50,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:23:50,343 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 57 [2020-10-09 14:23:50,343 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:23:55,973 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 24 [2020-10-09 14:24:03,726 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 28 [2020-10-09 14:24:07,484 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 26 [2020-10-09 14:24:18,189 INFO L129 PetriNetUnfolder]: 2822/20148 cut-off events. [2020-10-09 14:24:18,189 INFO L130 PetriNetUnfolder]: For 942622/943501 co-relation queries the response was YES. [2020-10-09 14:24:19,317 INFO L80 FinitePrefix]: Finished finitePrefix Result has 76291 conditions, 20148 events. 2822/20148 cut-off events. For 942622/943501 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 281897 event pairs, 0 based on Foata normal form. 271/18233 useless extension candidates. Maximal degree in co-relation 76068. Up to 3024 conditions per place. [2020-10-09 14:24:19,408 INFO L132 encePairwiseOnDemand]: 50/57 looper letters, 987 selfloop transitions, 3525 changer transitions 158/4706 dead transitions. [2020-10-09 14:24:19,408 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 4706 transitions, 95506 flow [2020-10-09 14:24:19,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2020-10-09 14:24:19,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-09 14:24:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 5794 transitions. [2020-10-09 14:24:19,418 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8400753950993185 [2020-10-09 14:24:19,418 INFO L72 ComplementDD]: Start complementDD. Operand 121 states and 5794 transitions. [2020-10-09 14:24:19,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 5794 transitions. [2020-10-09 14:24:19,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:24:19,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 121 states and 5794 transitions. [2020-10-09 14:24:19,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 122 states. [2020-10-09 14:24:19,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 122 states. [2020-10-09 14:24:19,433 INFO L81 ComplementDD]: Finished complementDD. Result 122 states. [2020-10-09 14:24:19,433 INFO L185 Difference]: Start difference. First operand has 586 places, 3183 transitions, 56052 flow. Second operand 121 states and 5794 transitions. [2020-10-09 14:24:19,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 4706 transitions, 95506 flow [2020-10-09 14:24:28,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 4706 transitions, 93655 flow, removed 804 selfloop flow, removed 54 redundant places. [2020-10-09 14:24:28,603 INFO L241 Difference]: Finished difference. Result has 695 places, 4485 transitions, 87242 flow [2020-10-09 14:24:28,606 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=54879, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2468, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=121, PETRI_FLOW=87242, PETRI_PLACES=695, PETRI_TRANSITIONS=4485} [2020-10-09 14:24:28,607 INFO L341 CegarLoopForPetriNet]: 57 programPoint places, 638 predicate places. [2020-10-09 14:24:28,607 INFO L481 AbstractCegarLoop]: Abstraction has has 695 places, 4485 transitions, 87242 flow [2020-10-09 14:24:28,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-09 14:24:28,607 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:24:28,607 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 14:24:29,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:24:29,220 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:24:29,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:24:29,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1215005947, now seen corresponding path program 6 times [2020-10-09 14:24:29,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:24:29,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049618095] [2020-10-09 14:24:29,222 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2020-10-09 14:24:29,266 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2020-10-09 14:24:29,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:24:29,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-09 14:24:29,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:24:31,628 WARN L860 $PredicateComparison]: unable to prove that (exists ((aux_mod_v_~i~0_159_38 Int) (aux_div_v_~i~0_159_38 Int) (v_~i~0_160 Int)) (and (<= c_~i~0 (+ v_~i~0_160 c_~j~0)) (<= 0 aux_mod_v_~i~0_159_38) (< aux_mod_v_~i~0_159_38 2) (<= (+ (* 2 aux_mod_v_~i~0_159_38) c_~j~0) (+ (* 4 aux_div_v_~i~0_159_38) (* 2 v_~i~0_160) 3)) (<= (+ (* 3 aux_mod_v_~i~0_159_38) v_~i~0_160) (+ (* 6 aux_div_v_~i~0_159_38) 4)) (<= aux_div_v_~i~0_159_38 1))) is different from true [2020-10-09 14:24:31,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:24:31,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:24:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:24:31,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:24:32,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:24:32,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:24:32,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:24:32,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:24:32,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:24:32,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:24:32,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:24:37,276 WARN L193 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 53 [2020-10-09 14:24:37,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:24:39,901 WARN L193 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 55 [2020-10-09 14:24:40,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:24:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:24:40,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049618095] [2020-10-09 14:24:40,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [606436538] [2020-10-09 14:24:40,748 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:24:40,846 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2020-10-09 14:24:40,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:24:40,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-09 14:24:40,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:24:42,982 WARN L860 $PredicateComparison]: unable to prove that (exists ((aux_mod_v_~i~0_159_38 Int) (v_~i~0_169 Int) (aux_div_v_~i~0_159_38 Int)) (and (<= 0 aux_mod_v_~i~0_159_38) (< aux_mod_v_~i~0_159_38 2) (<= c_~i~0 (+ v_~i~0_169 c_~j~0)) (<= (+ (* 2 aux_mod_v_~i~0_159_38) c_~j~0) (+ (* 2 v_~i~0_169) (* 4 aux_div_v_~i~0_159_38) 3)) (<= aux_div_v_~i~0_159_38 1) (<= (+ (* 3 aux_mod_v_~i~0_159_38) v_~i~0_169) (+ (* 6 aux_div_v_~i~0_159_38) 4)))) is different from true [2020-10-09 14:24:42,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:24:43,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:24:43,139 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:24:43,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:24:43,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:24:43,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:24:43,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:24:43,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:24:43,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:24:43,155 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:24:43,158 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:24:49,777 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-10-09 14:24:49,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:24:58,549 WARN L193 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 45 [2020-10-09 14:24:58,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:24:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:24:58,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675563301] [2020-10-09 14:24:58,988 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:24:59,064 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2020-10-09 14:24:59,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:24:59,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-09 14:24:59,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:25:20,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:25:22,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:25:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:25:22,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:25:22,547 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:25:22,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:25:22,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:25:22,554 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:25:22,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:25:22,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:25:22,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:25:27,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:25:27,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:25:29,224 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:25:29,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:25:29,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 30 [2020-10-09 14:25:29,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968221009] [2020-10-09 14:25:29,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-10-09 14:25:29,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:25:29,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-10-09 14:25:29,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=579, Unknown=19, NotChecked=106, Total=870 [2020-10-09 14:25:39,373 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 57 [2020-10-09 14:25:39,374 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 4485 transitions, 87242 flow. Second operand 30 states. [2020-10-09 14:25:39,374 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:25:39,374 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 57 [2020-10-09 14:25:39,375 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:26:17,206 WARN L193 SmtUtils]: Spent 2.80 s on a formula simplification. DAG size of input: 145 DAG size of output: 49 [2020-10-09 14:26:41,314 WARN L193 SmtUtils]: Spent 17.68 s on a formula simplification. DAG size of input: 155 DAG size of output: 51 [2020-10-09 14:26:48,113 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 32 [2020-10-09 14:26:51,143 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 34 [2020-10-09 14:26:52,523 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2020-10-09 14:26:56,070 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 67 DAG size of output: 41 [2020-10-09 14:27:00,241 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (* 3 c_~i~0) c_~j~0)) (.cse6 (* c_~i~0 (- 2))) (.cse7 (* c_~j~0 (- 1)))) (and (exists ((aux_mod_v_~i~0_159_38 Int) (v_~i~0_178 Int) (aux_div_v_~i~0_159_38 Int)) (and (<= 0 aux_mod_v_~i~0_159_38) (<= c_~i~0 (+ v_~i~0_178 c_~j~0)) (< aux_mod_v_~i~0_159_38 2) (<= (+ (* 2 aux_mod_v_~i~0_159_38) c_~j~0) (+ (* 2 v_~i~0_178) (* 4 aux_div_v_~i~0_159_38) 3)) (<= (+ (* 3 aux_mod_v_~i~0_159_38) v_~i~0_178) (+ (* 6 aux_div_v_~i~0_159_38) 4)) (<= aux_div_v_~i~0_159_38 1))) (forall ((aux_div_aux_div_v_~i~0_172_51_64 Int) (aux_mod_v_~i~0_172_51 Int)) (or (< c_~i~0 (+ (* 3 aux_div_aux_div_v_~i~0_172_51_64) aux_mod_v_~i~0_172_51 185)) (< aux_mod_v_~i~0_172_51 0) (< (+ (* 11 aux_div_aux_div_v_~i~0_172_51_64) (* 4 aux_mod_v_~i~0_172_51) (* 5 c_~j~0) 552) 0) (<= 3 aux_mod_v_~i~0_172_51))) (forall ((aux_mod_v_~i~0_163_51 Int) (aux_div_aux_div_v_~i~0_163_51_64 Int)) (or (< (+ (* 4 aux_mod_v_~i~0_163_51) (* 11 aux_div_aux_div_v_~i~0_163_51_64) (* 5 c_~j~0) 552) 0) (< aux_mod_v_~i~0_163_51 0) (< (+ c_~i~0 c_~j~0) (+ aux_mod_v_~i~0_163_51 (* 3 aux_div_aux_div_v_~i~0_163_51_64) 185)) (<= 3 aux_mod_v_~i~0_163_51))) (forall ((aux_div_v_~i~0_163_51 Int) (aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_163_51_78 Int)) (let ((.cse1 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91)) (.cse0 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55))) (let ((.cse2 (* 2 aux_div_aux_mod_v_~i~0_163_51_78)) (.cse3 (+ (* 2 aux_div_v_~i~0_163_51) .cse1 .cse0 c_~j~0))) (or (< 0 .cse0) (<= (+ .cse1 .cse0 2) .cse2) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_163_51_78)) (+ aux_div_v_~i~0_163_51 3)) (< (+ c_~i~0 (* 2 c_~j~0)) aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91) (< 372 .cse3) (<= (+ .cse0 2) 0) (< .cse2 (+ .cse1 .cse0)) (<= .cse3 370))))) (forall ((aux_mod_v_~i~0_163_51 Int) (aux_div_aux_div_v_~i~0_163_51_64 Int) (v_~j~0_135 Int)) (or (< (+ (* 4 aux_mod_v_~i~0_163_51) (* 11 aux_div_aux_div_v_~i~0_163_51_64) (* 5 v_~j~0_135) 552) 0) (< aux_mod_v_~i~0_163_51 0) (< 1 v_~j~0_135) (< (+ c_~i~0 v_~j~0_135) (+ aux_mod_v_~i~0_163_51 (* 3 aux_div_aux_div_v_~i~0_163_51_64) 185)) (<= 3 aux_mod_v_~i~0_163_51))) (forall ((aux_div_v_~i~0_172_51 Int) (aux_div_aux_mod_v_~i~0_172_51_42 Int)) (let ((.cse4 (* 2 aux_div_aux_mod_v_~i~0_172_51_42))) (or (<= (+ c_~j~0 .cse4 2) 0) (< 0 (+ c_~j~0 .cse4)) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_172_51_42) 555) (* 4 aux_div_v_~i~0_172_51)) (< (+ aux_div_v_~i~0_172_51 c_~i~0 (* 2 c_~j~0)) (+ aux_div_aux_mod_v_~i~0_172_51_42 186))))) (forall ((aux_div_aux_div_v_~i~0_172_51_64 Int) (aux_mod_v_~i~0_172_51 Int)) (or (< aux_mod_v_~i~0_172_51 0) (< (+ (* 11 aux_div_aux_div_v_~i~0_172_51_64) (* 4 aux_mod_v_~i~0_172_51) (* 5 c_~j~0) 552) 0) (<= 3 aux_mod_v_~i~0_172_51) (< (+ c_~i~0 c_~j~0) (+ (* 3 aux_div_aux_div_v_~i~0_172_51_64) aux_mod_v_~i~0_172_51 185)))) (forall ((aux_mod_v_~i~0_163_51 Int) (aux_div_aux_div_v_~i~0_163_51_64 Int)) (or (< c_~i~0 (+ aux_mod_v_~i~0_163_51 (* 3 aux_div_aux_div_v_~i~0_163_51_64) 185)) (< (+ (* 4 aux_mod_v_~i~0_163_51) (* 11 aux_div_aux_div_v_~i~0_163_51_64) (* 5 c_~j~0) 552) 0) (< aux_mod_v_~i~0_163_51 0) (<= 3 aux_mod_v_~i~0_163_51))) (exists ((aux_mod_v_~i~0_159_38 Int) (aux_div_v_~i~0_159_38 Int) (v_~i~0_160 Int)) (and (<= c_~i~0 (+ v_~i~0_160 c_~j~0)) (<= 0 aux_mod_v_~i~0_159_38) (< aux_mod_v_~i~0_159_38 2) (<= (+ (* 2 aux_mod_v_~i~0_159_38) c_~j~0) (+ (* 4 aux_div_v_~i~0_159_38) (* 2 v_~i~0_160) 3)) (<= (+ (* 3 aux_mod_v_~i~0_159_38) v_~i~0_160) (+ (* 6 aux_div_v_~i~0_159_38) 4)) (<= aux_div_v_~i~0_159_38 1))) (< .cse5 (+ (div (+ .cse6 .cse7 372) 2) 3)) (exists ((aux_mod_v_~i~0_159_38 Int) (v_~i~0_169 Int) (aux_div_v_~i~0_159_38 Int)) (and (<= 0 aux_mod_v_~i~0_159_38) (< aux_mod_v_~i~0_159_38 2) (<= c_~i~0 (+ v_~i~0_169 c_~j~0)) (<= (+ (* 2 aux_mod_v_~i~0_159_38) c_~j~0) (+ (* 2 v_~i~0_169) (* 4 aux_div_v_~i~0_159_38) 3)) (<= aux_div_v_~i~0_159_38 1) (<= (+ (* 3 aux_mod_v_~i~0_159_38) v_~i~0_169) (+ (* 6 aux_div_v_~i~0_159_38) 4)))) (forall ((aux_div_v_~i~0_163_51 Int) (aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_163_51_78 Int)) (let ((.cse9 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91)) (.cse8 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55))) (let ((.cse10 (* 2 aux_div_aux_mod_v_~i~0_163_51_78)) (.cse11 (+ (* 2 aux_div_v_~i~0_163_51) .cse9 .cse8 c_~j~0))) (or (< 0 .cse8) (<= (+ .cse9 .cse8 2) .cse10) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_163_51_78)) (+ aux_div_v_~i~0_163_51 3)) (< 372 .cse11) (<= (+ .cse8 2) 0) (< (+ c_~i~0 c_~j~0) aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91) (< .cse10 (+ .cse9 .cse8)) (<= .cse11 370))))) (forall ((aux_div_v_~i~0_172_51 Int) (aux_div_aux_mod_v_~i~0_172_51_42 Int)) (let ((.cse12 (* 2 aux_div_aux_mod_v_~i~0_172_51_42))) (or (<= (+ c_~j~0 .cse12 2) 0) (< (+ aux_div_v_~i~0_172_51 c_~i~0 c_~j~0) (+ aux_div_aux_mod_v_~i~0_172_51_42 186)) (< 0 (+ c_~j~0 .cse12)) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_172_51_42) 555) (* 4 aux_div_v_~i~0_172_51))))) (< .cse5 (+ (div (+ .cse6 .cse7 370) 3) 3)))) is different from false [2020-10-09 14:27:06,155 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 49 [2020-10-09 14:27:16,798 WARN L193 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2020-10-09 14:27:18,936 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (* 3 c_~i~0) c_~j~0)) (.cse6 (* c_~i~0 (- 2))) (.cse7 (* c_~j~0 (- 1)))) (and (exists ((aux_mod_v_~i~0_159_38 Int) (aux_div_v_~i~0_159_38 Int) (v_~i~0_160 Int)) (and (<= 0 aux_mod_v_~i~0_159_38) (< aux_mod_v_~i~0_159_38 2) (<= (+ (* 2 aux_mod_v_~i~0_159_38) c_~j~0) (+ (* 4 aux_div_v_~i~0_159_38) (* 2 v_~i~0_160) 3)) (<= (+ (* 3 aux_mod_v_~i~0_159_38) v_~i~0_160) (+ (* 6 aux_div_v_~i~0_159_38) 4)) (<= aux_div_v_~i~0_159_38 1))) (exists ((aux_mod_v_~i~0_159_38 Int) (v_~i~0_178 Int) (aux_div_v_~i~0_159_38 Int)) (and (<= 0 aux_mod_v_~i~0_159_38) (<= c_~i~0 (+ v_~i~0_178 c_~j~0)) (< aux_mod_v_~i~0_159_38 2) (<= (+ (* 2 aux_mod_v_~i~0_159_38) c_~j~0) (+ (* 2 v_~i~0_178) (* 4 aux_div_v_~i~0_159_38) 3)) (<= (+ (* 3 aux_mod_v_~i~0_159_38) v_~i~0_178) (+ (* 6 aux_div_v_~i~0_159_38) 4)) (<= aux_div_v_~i~0_159_38 1))) (forall ((aux_div_aux_div_v_~i~0_172_51_64 Int) (aux_mod_v_~i~0_172_51 Int)) (or (< c_~i~0 (+ (* 3 aux_div_aux_div_v_~i~0_172_51_64) aux_mod_v_~i~0_172_51 185)) (< aux_mod_v_~i~0_172_51 0) (< (+ (* 11 aux_div_aux_div_v_~i~0_172_51_64) (* 4 aux_mod_v_~i~0_172_51) (* 5 c_~j~0) 552) 0) (<= 3 aux_mod_v_~i~0_172_51))) (forall ((aux_mod_v_~i~0_163_51 Int) (aux_div_aux_div_v_~i~0_163_51_64 Int)) (or (< (+ (* 4 aux_mod_v_~i~0_163_51) (* 11 aux_div_aux_div_v_~i~0_163_51_64) (* 5 c_~j~0) 552) 0) (< aux_mod_v_~i~0_163_51 0) (< (+ c_~i~0 c_~j~0) (+ aux_mod_v_~i~0_163_51 (* 3 aux_div_aux_div_v_~i~0_163_51_64) 185)) (<= 3 aux_mod_v_~i~0_163_51))) (forall ((aux_div_v_~i~0_163_51 Int) (aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_163_51_78 Int)) (let ((.cse1 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91)) (.cse0 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55))) (let ((.cse2 (* 2 aux_div_aux_mod_v_~i~0_163_51_78)) (.cse3 (+ (* 2 aux_div_v_~i~0_163_51) .cse1 .cse0 c_~j~0))) (or (< 0 .cse0) (<= (+ .cse1 .cse0 2) .cse2) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_163_51_78)) (+ aux_div_v_~i~0_163_51 3)) (< (+ c_~i~0 (* 2 c_~j~0)) aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91) (< 372 .cse3) (<= (+ .cse0 2) 0) (< .cse2 (+ .cse1 .cse0)) (<= .cse3 370))))) (forall ((aux_mod_v_~i~0_163_51 Int) (aux_div_aux_div_v_~i~0_163_51_64 Int) (v_~j~0_135 Int)) (or (< (+ (* 4 aux_mod_v_~i~0_163_51) (* 11 aux_div_aux_div_v_~i~0_163_51_64) (* 5 v_~j~0_135) 552) 0) (< aux_mod_v_~i~0_163_51 0) (< 1 v_~j~0_135) (< (+ c_~i~0 v_~j~0_135) (+ aux_mod_v_~i~0_163_51 (* 3 aux_div_aux_div_v_~i~0_163_51_64) 185)) (<= 3 aux_mod_v_~i~0_163_51))) (forall ((aux_div_v_~i~0_172_51 Int) (aux_div_aux_mod_v_~i~0_172_51_42 Int)) (let ((.cse4 (* 2 aux_div_aux_mod_v_~i~0_172_51_42))) (or (<= (+ c_~j~0 .cse4 2) 0) (< 0 (+ c_~j~0 .cse4)) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_172_51_42) 555) (* 4 aux_div_v_~i~0_172_51)) (< (+ aux_div_v_~i~0_172_51 c_~i~0 (* 2 c_~j~0)) (+ aux_div_aux_mod_v_~i~0_172_51_42 186))))) (forall ((aux_div_aux_div_v_~i~0_172_51_64 Int) (aux_mod_v_~i~0_172_51 Int)) (or (< aux_mod_v_~i~0_172_51 0) (< (+ (* 11 aux_div_aux_div_v_~i~0_172_51_64) (* 4 aux_mod_v_~i~0_172_51) (* 5 c_~j~0) 552) 0) (<= 3 aux_mod_v_~i~0_172_51) (< (+ c_~i~0 c_~j~0) (+ (* 3 aux_div_aux_div_v_~i~0_172_51_64) aux_mod_v_~i~0_172_51 185)))) (forall ((aux_mod_v_~i~0_163_51 Int) (aux_div_aux_div_v_~i~0_163_51_64 Int)) (or (< c_~i~0 (+ aux_mod_v_~i~0_163_51 (* 3 aux_div_aux_div_v_~i~0_163_51_64) 185)) (< (+ (* 4 aux_mod_v_~i~0_163_51) (* 11 aux_div_aux_div_v_~i~0_163_51_64) (* 5 c_~j~0) 552) 0) (< aux_mod_v_~i~0_163_51 0) (<= 3 aux_mod_v_~i~0_163_51))) (exists ((aux_mod_v_~i~0_159_38 Int) (aux_div_v_~i~0_159_38 Int) (v_~i~0_160 Int)) (and (<= c_~i~0 (+ v_~i~0_160 c_~j~0)) (<= 0 aux_mod_v_~i~0_159_38) (< aux_mod_v_~i~0_159_38 2) (<= (+ (* 2 aux_mod_v_~i~0_159_38) c_~j~0) (+ (* 4 aux_div_v_~i~0_159_38) (* 2 v_~i~0_160) 3)) (<= (+ (* 3 aux_mod_v_~i~0_159_38) v_~i~0_160) (+ (* 6 aux_div_v_~i~0_159_38) 4)) (<= aux_div_v_~i~0_159_38 1))) (< .cse5 (+ (div (+ .cse6 .cse7 372) 2) 3)) (exists ((aux_mod_v_~i~0_159_38 Int) (v_~i~0_169 Int) (aux_div_v_~i~0_159_38 Int)) (and (<= 0 aux_mod_v_~i~0_159_38) (< aux_mod_v_~i~0_159_38 2) (<= c_~i~0 (+ v_~i~0_169 c_~j~0)) (<= (+ (* 2 aux_mod_v_~i~0_159_38) c_~j~0) (+ (* 2 v_~i~0_169) (* 4 aux_div_v_~i~0_159_38) 3)) (<= aux_div_v_~i~0_159_38 1) (<= (+ (* 3 aux_mod_v_~i~0_159_38) v_~i~0_169) (+ (* 6 aux_div_v_~i~0_159_38) 4)))) (forall ((aux_div_v_~i~0_163_51 Int) (aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_163_51_78 Int)) (let ((.cse9 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91)) (.cse8 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55))) (let ((.cse10 (* 2 aux_div_aux_mod_v_~i~0_163_51_78)) (.cse11 (+ (* 2 aux_div_v_~i~0_163_51) .cse9 .cse8 c_~j~0))) (or (< 0 .cse8) (<= (+ .cse9 .cse8 2) .cse10) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_163_51_78)) (+ aux_div_v_~i~0_163_51 3)) (< 372 .cse11) (<= (+ .cse8 2) 0) (< (+ c_~i~0 c_~j~0) aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91) (< .cse10 (+ .cse9 .cse8)) (<= .cse11 370))))) (= c_ULTIMATE.start_main_~condI~0 0) (forall ((aux_div_v_~i~0_172_51 Int) (aux_div_aux_mod_v_~i~0_172_51_42 Int)) (let ((.cse12 (* 2 aux_div_aux_mod_v_~i~0_172_51_42))) (or (<= (+ c_~j~0 .cse12 2) 0) (< (+ aux_div_v_~i~0_172_51 c_~i~0 c_~j~0) (+ aux_div_aux_mod_v_~i~0_172_51_42 186)) (< 0 (+ c_~j~0 .cse12)) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_172_51_42) 555) (* 4 aux_div_v_~i~0_172_51))))) (< .cse5 (+ (div (+ .cse6 .cse7 370) 3) 3)))) is different from false [2020-10-09 14:27:23,165 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~j~0 (- 1)))) (let ((.cse0 (+ c_~i~0 c_~j~0)) (.cse1 (+ .cse4 376)) (.cse2 (+ (* 2 c_~i~0) c_~j~0)) (.cse3 (* c_~i~0 (- 1))) (.cse5 (+ (* 3 c_~i~0) c_~j~0)) (.cse6 (* c_~i~0 (- 2)))) (and (exists ((aux_mod_v_~i~0_159_38 Int) (aux_div_v_~i~0_159_38 Int) (v_~i~0_160 Int)) (and (<= 0 aux_mod_v_~i~0_159_38) (< aux_mod_v_~i~0_159_38 2) (<= (+ (* 2 aux_mod_v_~i~0_159_38) c_~j~0) (+ (* 4 aux_div_v_~i~0_159_38) (* 2 v_~i~0_160) 3)) (<= (+ (* 3 aux_mod_v_~i~0_159_38) v_~i~0_160) (+ (* 6 aux_div_v_~i~0_159_38) 4)) (<= aux_div_v_~i~0_159_38 1))) (forall ((aux_div_aux_div_v_~i~0_172_51_64 Int) (aux_mod_v_~i~0_172_51 Int)) (or (< c_~i~0 (+ (* 3 aux_div_aux_div_v_~i~0_172_51_64) aux_mod_v_~i~0_172_51 185)) (< aux_mod_v_~i~0_172_51 0) (< (+ (* 11 aux_div_aux_div_v_~i~0_172_51_64) (* 4 aux_mod_v_~i~0_172_51) (* 5 c_~j~0) 552) 0) (<= 3 aux_mod_v_~i~0_172_51))) (< .cse0 377) (< .cse0 (+ (div .cse1 2) 1)) (< .cse2 377) (< c_~i~0 377) (< .cse0 (+ (div .cse1 3) 1)) (< .cse2 (+ (div (+ .cse3 .cse4 373) 3) 2)) (< .cse5 377) (< c_~j~0 377) (forall ((aux_mod_v_~i~0_163_51 Int) (aux_div_aux_div_v_~i~0_163_51_64 Int) (v_~j~0_135 Int)) (or (< (+ (* 4 aux_mod_v_~i~0_163_51) (* 11 aux_div_aux_div_v_~i~0_163_51_64) (* 5 v_~j~0_135) 552) 0) (< aux_mod_v_~i~0_163_51 0) (< 1 v_~j~0_135) (< (+ c_~i~0 v_~j~0_135) (+ aux_mod_v_~i~0_163_51 (* 3 aux_div_aux_div_v_~i~0_163_51_64) 185)) (<= 3 aux_mod_v_~i~0_163_51))) (forall ((aux_mod_v_~i~0_163_51 Int) (aux_div_aux_div_v_~i~0_163_51_64 Int)) (or (< c_~i~0 (+ aux_mod_v_~i~0_163_51 (* 3 aux_div_aux_div_v_~i~0_163_51_64) 185)) (< (+ (* 4 aux_mod_v_~i~0_163_51) (* 11 aux_div_aux_div_v_~i~0_163_51_64) (* 5 c_~j~0) 552) 0) (< aux_mod_v_~i~0_163_51 0) (<= 3 aux_mod_v_~i~0_163_51))) (< .cse5 (+ (div (+ .cse6 .cse4 372) 2) 3)) (< .cse2 (+ (div (+ .cse3 .cse4 374) 2) 2)) (forall ((aux_div_v_~i~0_163_51 Int) (aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_163_51_78 Int)) (let ((.cse8 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91)) (.cse7 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55))) (let ((.cse9 (* 2 aux_div_aux_mod_v_~i~0_163_51_78)) (.cse10 (+ (* 2 aux_div_v_~i~0_163_51) .cse8 .cse7 c_~j~0))) (or (< 0 .cse7) (<= (+ .cse8 .cse7 2) .cse9) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_163_51_78)) (+ aux_div_v_~i~0_163_51 3)) (< 372 .cse10) (<= (+ .cse7 2) 0) (< (+ c_~i~0 c_~j~0) aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91) (< .cse9 (+ .cse8 .cse7)) (<= .cse10 370))))) (= c_ULTIMATE.start_main_~condI~0 0) (forall ((aux_div_v_~i~0_172_51 Int) (aux_div_aux_mod_v_~i~0_172_51_42 Int)) (let ((.cse11 (* 2 aux_div_aux_mod_v_~i~0_172_51_42))) (or (<= (+ c_~j~0 .cse11 2) 0) (< (+ aux_div_v_~i~0_172_51 c_~i~0 c_~j~0) (+ aux_div_aux_mod_v_~i~0_172_51_42 186)) (< 0 (+ c_~j~0 .cse11)) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_172_51_42) 555) (* 4 aux_div_v_~i~0_172_51))))) (< .cse5 (+ (div (+ .cse6 .cse4 370) 3) 3))))) is different from false [2020-10-09 14:27:25,836 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~j~0 (- 1)))) (let ((.cse0 (+ c_~i~0 c_~j~0)) (.cse1 (+ .cse4 376)) (.cse2 (+ (* 2 c_~i~0) c_~j~0)) (.cse3 (* c_~i~0 (- 1))) (.cse5 (+ (* 3 c_~i~0) c_~j~0)) (.cse6 (* c_~i~0 (- 2)))) (and (forall ((aux_div_aux_div_v_~i~0_172_51_64 Int) (aux_mod_v_~i~0_172_51 Int)) (or (< c_~i~0 (+ (* 3 aux_div_aux_div_v_~i~0_172_51_64) aux_mod_v_~i~0_172_51 185)) (< aux_mod_v_~i~0_172_51 0) (< (+ (* 11 aux_div_aux_div_v_~i~0_172_51_64) (* 4 aux_mod_v_~i~0_172_51) (* 5 c_~j~0) 552) 0) (<= 3 aux_mod_v_~i~0_172_51))) (< .cse0 377) (< .cse0 (+ (div .cse1 2) 1)) (< .cse2 377) (< c_~i~0 377) (< .cse0 (+ (div .cse1 3) 1)) (< .cse2 (+ (div (+ .cse3 .cse4 373) 3) 2)) (< .cse5 377) (< c_~j~0 377) (forall ((aux_mod_v_~i~0_163_51 Int) (aux_div_aux_div_v_~i~0_163_51_64 Int) (v_~j~0_135 Int)) (or (< (+ (* 4 aux_mod_v_~i~0_163_51) (* 11 aux_div_aux_div_v_~i~0_163_51_64) (* 5 v_~j~0_135) 552) 0) (< aux_mod_v_~i~0_163_51 0) (< 1 v_~j~0_135) (< (+ c_~i~0 v_~j~0_135) (+ aux_mod_v_~i~0_163_51 (* 3 aux_div_aux_div_v_~i~0_163_51_64) 185)) (<= 3 aux_mod_v_~i~0_163_51))) (forall ((aux_mod_v_~i~0_163_51 Int) (aux_div_aux_div_v_~i~0_163_51_64 Int)) (or (< c_~i~0 (+ aux_mod_v_~i~0_163_51 (* 3 aux_div_aux_div_v_~i~0_163_51_64) 185)) (< (+ (* 4 aux_mod_v_~i~0_163_51) (* 11 aux_div_aux_div_v_~i~0_163_51_64) (* 5 c_~j~0) 552) 0) (< aux_mod_v_~i~0_163_51 0) (<= 3 aux_mod_v_~i~0_163_51))) (< .cse5 (+ (div (+ .cse6 .cse4 372) 2) 3)) (< .cse2 (+ (div (+ .cse3 .cse4 374) 2) 2)) (forall ((aux_div_v_~i~0_163_51 Int) (aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_163_51_78 Int)) (let ((.cse8 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91)) (.cse7 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55))) (let ((.cse9 (* 2 aux_div_aux_mod_v_~i~0_163_51_78)) (.cse10 (+ (* 2 aux_div_v_~i~0_163_51) .cse8 .cse7 c_~j~0))) (or (< 0 .cse7) (<= (+ .cse8 .cse7 2) .cse9) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_163_51_78)) (+ aux_div_v_~i~0_163_51 3)) (< 372 .cse10) (<= (+ .cse7 2) 0) (< (+ c_~i~0 c_~j~0) aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91) (< .cse9 (+ .cse8 .cse7)) (<= .cse10 370))))) (forall ((aux_div_v_~i~0_172_51 Int) (aux_div_aux_mod_v_~i~0_172_51_42 Int)) (let ((.cse11 (* 2 aux_div_aux_mod_v_~i~0_172_51_42))) (or (<= (+ c_~j~0 .cse11 2) 0) (< (+ aux_div_v_~i~0_172_51 c_~i~0 c_~j~0) (+ aux_div_aux_mod_v_~i~0_172_51_42 186)) (< 0 (+ c_~j~0 .cse11)) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_172_51_42) 555) (* 4 aux_div_v_~i~0_172_51))))) (< .cse5 (+ (div (+ .cse6 .cse4 370) 3) 3))))) is different from false [2020-10-09 14:27:26,651 WARN L193 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 50 [2020-10-09 14:27:27,401 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 52 [2020-10-09 14:27:28,467 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 30 [2020-10-09 14:27:33,418 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 28 [2020-10-09 14:27:33,892 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 25 [2020-10-09 14:27:37,096 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2020-10-09 14:27:41,946 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 43 [2020-10-09 14:27:44,468 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 3 c_~i~0) c_~j~0)) (.cse1 (* c_~i~0 (- 2))) (.cse2 (* c_~j~0 (- 1)))) (and (exists ((aux_mod_v_~i~0_159_38 Int) (v_~i~0_178 Int) (aux_div_v_~i~0_159_38 Int)) (and (<= 0 aux_mod_v_~i~0_159_38) (<= c_~i~0 (+ v_~i~0_178 c_~j~0)) (< aux_mod_v_~i~0_159_38 2) (<= (+ (* 2 aux_mod_v_~i~0_159_38) c_~j~0) (+ (* 2 v_~i~0_178) (* 4 aux_div_v_~i~0_159_38) 3)) (<= (+ (* 3 aux_mod_v_~i~0_159_38) v_~i~0_178) (+ (* 6 aux_div_v_~i~0_159_38) 4)) (<= aux_div_v_~i~0_159_38 1))) (forall ((aux_div_aux_div_v_~i~0_172_51_64 Int) (aux_mod_v_~i~0_172_51 Int)) (or (< c_~i~0 (+ (* 3 aux_div_aux_div_v_~i~0_172_51_64) aux_mod_v_~i~0_172_51 185)) (< aux_mod_v_~i~0_172_51 0) (< (+ (* 11 aux_div_aux_div_v_~i~0_172_51_64) (* 4 aux_mod_v_~i~0_172_51) (* 5 c_~j~0) 552) 0) (<= 3 aux_mod_v_~i~0_172_51))) (forall ((aux_mod_v_~i~0_163_51 Int) (aux_div_aux_div_v_~i~0_163_51_64 Int)) (or (< c_~i~0 (+ aux_mod_v_~i~0_163_51 (* 3 aux_div_aux_div_v_~i~0_163_51_64) 185)) (< (+ (* 4 aux_mod_v_~i~0_163_51) (* 11 aux_div_aux_div_v_~i~0_163_51_64) (* 5 c_~j~0) 552) 0) (< aux_mod_v_~i~0_163_51 0) (<= 3 aux_mod_v_~i~0_163_51))) (exists ((aux_mod_v_~i~0_159_38 Int) (aux_div_v_~i~0_159_38 Int) (v_~i~0_160 Int)) (and (<= c_~i~0 (+ v_~i~0_160 c_~j~0)) (<= 0 aux_mod_v_~i~0_159_38) (< aux_mod_v_~i~0_159_38 2) (<= (+ (* 2 aux_mod_v_~i~0_159_38) c_~j~0) (+ (* 4 aux_div_v_~i~0_159_38) (* 2 v_~i~0_160) 3)) (<= (+ (* 3 aux_mod_v_~i~0_159_38) v_~i~0_160) (+ (* 6 aux_div_v_~i~0_159_38) 4)) (<= aux_div_v_~i~0_159_38 1))) (< .cse0 (+ (div (+ .cse1 .cse2 372) 2) 3)) (exists ((aux_mod_v_~i~0_159_38 Int) (v_~i~0_169 Int) (aux_div_v_~i~0_159_38 Int)) (and (<= 0 aux_mod_v_~i~0_159_38) (< aux_mod_v_~i~0_159_38 2) (<= c_~i~0 (+ v_~i~0_169 c_~j~0)) (<= (+ (* 2 aux_mod_v_~i~0_159_38) c_~j~0) (+ (* 2 v_~i~0_169) (* 4 aux_div_v_~i~0_159_38) 3)) (<= aux_div_v_~i~0_159_38 1) (<= (+ (* 3 aux_mod_v_~i~0_159_38) v_~i~0_169) (+ (* 6 aux_div_v_~i~0_159_38) 4)))) (forall ((aux_div_v_~i~0_163_51 Int) (aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_163_51_78 Int)) (let ((.cse4 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91)) (.cse3 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55))) (let ((.cse5 (* 2 aux_div_aux_mod_v_~i~0_163_51_78)) (.cse6 (+ (* 2 aux_div_v_~i~0_163_51) .cse4 .cse3 c_~j~0))) (or (< 0 .cse3) (<= (+ .cse4 .cse3 2) .cse5) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_163_51_78)) (+ aux_div_v_~i~0_163_51 3)) (< 372 .cse6) (<= (+ .cse3 2) 0) (< (+ c_~i~0 c_~j~0) aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91) (< .cse5 (+ .cse4 .cse3)) (<= .cse6 370))))) (forall ((aux_div_v_~i~0_172_51 Int) (aux_div_aux_mod_v_~i~0_172_51_42 Int)) (let ((.cse7 (* 2 aux_div_aux_mod_v_~i~0_172_51_42))) (or (<= (+ c_~j~0 .cse7 2) 0) (< (+ aux_div_v_~i~0_172_51 c_~i~0 c_~j~0) (+ aux_div_aux_mod_v_~i~0_172_51_42 186)) (< 0 (+ c_~j~0 .cse7)) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_172_51_42) 555) (* 4 aux_div_v_~i~0_172_51))))) (< .cse0 (+ (div (+ .cse1 .cse2 370) 3) 3)) (forall ((aux_mod_v_~i~0_163_51 Int) (aux_div_aux_div_v_~i~0_163_51_64 Int) (v_~j~0_135 Int)) (or (< (+ (* 4 aux_mod_v_~i~0_163_51) (* 11 aux_div_aux_div_v_~i~0_163_51_64) (* 5 v_~j~0_135) 552) 0) (< aux_mod_v_~i~0_163_51 0) (< 1 v_~j~0_135) (< (+ c_~i~0 v_~j~0_135) (+ aux_mod_v_~i~0_163_51 (* 3 aux_div_aux_div_v_~i~0_163_51_64) 185)) (<= 3 aux_mod_v_~i~0_163_51))))) is different from false [2020-10-09 14:27:46,575 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((aux_mod_v_~i~0_159_38 Int) (v_~i~0_178 Int) (aux_div_v_~i~0_159_38 Int)) (and (<= 0 aux_mod_v_~i~0_159_38) (<= c_~i~0 (+ v_~i~0_178 c_~j~0)) (< aux_mod_v_~i~0_159_38 2) (<= (+ (* 2 aux_mod_v_~i~0_159_38) c_~j~0) (+ (* 2 v_~i~0_178) (* 4 aux_div_v_~i~0_159_38) 3)) (<= (+ (* 3 aux_mod_v_~i~0_159_38) v_~i~0_178) (+ (* 6 aux_div_v_~i~0_159_38) 4)) (<= aux_div_v_~i~0_159_38 1))) (exists ((aux_mod_v_~i~0_159_38 Int) (aux_div_v_~i~0_159_38 Int) (v_~i~0_160 Int)) (and (<= c_~i~0 (+ v_~i~0_160 c_~j~0)) (<= 0 aux_mod_v_~i~0_159_38) (< aux_mod_v_~i~0_159_38 2) (<= (+ (* 2 aux_mod_v_~i~0_159_38) c_~j~0) (+ (* 4 aux_div_v_~i~0_159_38) (* 2 v_~i~0_160) 3)) (<= (+ (* 3 aux_mod_v_~i~0_159_38) v_~i~0_160) (+ (* 6 aux_div_v_~i~0_159_38) 4)) (<= aux_div_v_~i~0_159_38 1))) (exists ((aux_mod_v_~i~0_159_38 Int) (v_~i~0_169 Int) (aux_div_v_~i~0_159_38 Int)) (and (<= 0 aux_mod_v_~i~0_159_38) (< aux_mod_v_~i~0_159_38 2) (<= c_~i~0 (+ v_~i~0_169 c_~j~0)) (<= (+ (* 2 aux_mod_v_~i~0_159_38) c_~j~0) (+ (* 2 v_~i~0_169) (* 4 aux_div_v_~i~0_159_38) 3)) (<= aux_div_v_~i~0_159_38 1) (<= (+ (* 3 aux_mod_v_~i~0_159_38) v_~i~0_169) (+ (* 6 aux_div_v_~i~0_159_38) 4))))) is different from true [2020-10-09 14:27:52,285 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2020-10-09 14:28:30,308 WARN L193 SmtUtils]: Spent 9.06 s on a formula simplification. DAG size of input: 154 DAG size of output: 50 [2020-10-09 14:28:37,288 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2020-10-09 14:28:37,890 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 18 [2020-10-09 14:28:38,336 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2020-10-09 14:28:42,891 WARN L193 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2020-10-09 14:29:10,525 WARN L193 SmtUtils]: Spent 14.30 s on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2020-10-09 14:29:15,001 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~j~0 (- 1)))) (let ((.cse0 (+ c_~i~0 c_~j~0)) (.cse1 (+ .cse8 376)) (.cse2 (+ (* 2 c_~i~0) c_~j~0)) (.cse7 (* c_~i~0 (- 1))) (.cse9 (+ (* 3 c_~i~0) c_~j~0)) (.cse11 (* c_~i~0 (- 2)))) (and (forall ((aux_div_aux_div_v_~i~0_172_51_64 Int) (aux_mod_v_~i~0_172_51 Int)) (or (< c_~i~0 (+ (* 3 aux_div_aux_div_v_~i~0_172_51_64) aux_mod_v_~i~0_172_51 185)) (< aux_mod_v_~i~0_172_51 0) (< (+ (* 11 aux_div_aux_div_v_~i~0_172_51_64) (* 4 aux_mod_v_~i~0_172_51) (* 5 c_~j~0) 552) 0) (<= 3 aux_mod_v_~i~0_172_51))) (< .cse0 377) (< .cse0 (+ (div .cse1 2) 1)) (forall ((aux_mod_v_~i~0_163_51 Int) (aux_div_aux_div_v_~i~0_163_51_64 Int)) (or (< (+ (* 4 aux_mod_v_~i~0_163_51) (* 11 aux_div_aux_div_v_~i~0_163_51_64) (* 5 c_~j~0) 552) 0) (< aux_mod_v_~i~0_163_51 0) (< (+ c_~i~0 c_~j~0) (+ aux_mod_v_~i~0_163_51 (* 3 aux_div_aux_div_v_~i~0_163_51_64) 185)) (<= 3 aux_mod_v_~i~0_163_51))) (< .cse2 377) (< c_~i~0 377) (<= c_~i~0 1) (forall ((aux_div_v_~i~0_163_51 Int) (aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_163_51_78 Int)) (let ((.cse4 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91)) (.cse3 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55))) (let ((.cse5 (* 2 aux_div_aux_mod_v_~i~0_163_51_78)) (.cse6 (+ (* 2 aux_div_v_~i~0_163_51) .cse4 .cse3 c_~j~0))) (or (< 0 .cse3) (<= (+ .cse4 .cse3 2) .cse5) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_163_51_78)) (+ aux_div_v_~i~0_163_51 3)) (< (+ c_~i~0 (* 2 c_~j~0)) aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91) (< 372 .cse6) (<= (+ .cse3 2) 0) (< .cse5 (+ .cse4 .cse3)) (<= .cse6 370))))) (< .cse0 (+ (div .cse1 3) 1)) (< .cse2 (+ (div (+ .cse7 .cse8 373) 3) 2)) (< .cse9 377) (< c_~j~0 377) (forall ((aux_div_v_~i~0_172_51 Int) (aux_div_aux_mod_v_~i~0_172_51_42 Int)) (let ((.cse10 (* 2 aux_div_aux_mod_v_~i~0_172_51_42))) (or (<= (+ c_~j~0 .cse10 2) 0) (< 0 (+ c_~j~0 .cse10)) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_172_51_42) 555) (* 4 aux_div_v_~i~0_172_51)) (< (+ aux_div_v_~i~0_172_51 c_~i~0 (* 2 c_~j~0)) (+ aux_div_aux_mod_v_~i~0_172_51_42 186))))) (forall ((aux_div_aux_div_v_~i~0_172_51_64 Int) (aux_mod_v_~i~0_172_51 Int)) (or (< aux_mod_v_~i~0_172_51 0) (< (+ (* 11 aux_div_aux_div_v_~i~0_172_51_64) (* 4 aux_mod_v_~i~0_172_51) (* 5 c_~j~0) 552) 0) (<= 3 aux_mod_v_~i~0_172_51) (< (+ c_~i~0 c_~j~0) (+ (* 3 aux_div_aux_div_v_~i~0_172_51_64) aux_mod_v_~i~0_172_51 185)))) (forall ((aux_mod_v_~i~0_163_51 Int) (aux_div_aux_div_v_~i~0_163_51_64 Int)) (or (< c_~i~0 (+ aux_mod_v_~i~0_163_51 (* 3 aux_div_aux_div_v_~i~0_163_51_64) 185)) (< (+ (* 4 aux_mod_v_~i~0_163_51) (* 11 aux_div_aux_div_v_~i~0_163_51_64) (* 5 c_~j~0) 552) 0) (< aux_mod_v_~i~0_163_51 0) (<= 3 aux_mod_v_~i~0_163_51))) (< .cse9 (+ (div (+ .cse11 .cse8 372) 2) 3)) (< .cse2 (+ (div (+ .cse7 .cse8 374) 2) 2)) (forall ((aux_div_v_~i~0_163_51 Int) (aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_163_51_78 Int)) (let ((.cse13 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91)) (.cse12 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55))) (let ((.cse14 (* 2 aux_div_aux_mod_v_~i~0_163_51_78)) (.cse15 (+ (* 2 aux_div_v_~i~0_163_51) .cse13 .cse12 c_~j~0))) (or (< 0 .cse12) (<= (+ .cse13 .cse12 2) .cse14) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_163_51_78)) (+ aux_div_v_~i~0_163_51 3)) (< 372 .cse15) (<= (+ .cse12 2) 0) (< (+ c_~i~0 c_~j~0) aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91) (< .cse14 (+ .cse13 .cse12)) (<= .cse15 370))))) (forall ((aux_div_v_~i~0_172_51 Int) (aux_div_aux_mod_v_~i~0_172_51_42 Int)) (let ((.cse16 (* 2 aux_div_aux_mod_v_~i~0_172_51_42))) (or (<= (+ c_~j~0 .cse16 2) 0) (< (+ aux_div_v_~i~0_172_51 c_~i~0 c_~j~0) (+ aux_div_aux_mod_v_~i~0_172_51_42 186)) (< 0 (+ c_~j~0 .cse16)) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_172_51_42) 555) (* 4 aux_div_v_~i~0_172_51))))) (< .cse9 (+ (div (+ .cse11 .cse8 370) 3) 3))))) is different from false [2020-10-09 14:29:17,273 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~j~0 (- 1)))) (let ((.cse0 (+ c_~i~0 c_~j~0)) (.cse1 (+ .cse8 376)) (.cse2 (+ (* 2 c_~i~0) c_~j~0)) (.cse7 (* c_~i~0 (- 1))) (.cse9 (+ (* 3 c_~i~0) c_~j~0)) (.cse11 (* c_~i~0 (- 2)))) (and (exists ((aux_mod_v_~i~0_159_38 Int) (aux_div_v_~i~0_159_38 Int) (v_~i~0_160 Int)) (and (<= 0 aux_mod_v_~i~0_159_38) (< aux_mod_v_~i~0_159_38 2) (<= (+ (* 2 aux_mod_v_~i~0_159_38) c_~j~0) (+ (* 4 aux_div_v_~i~0_159_38) (* 2 v_~i~0_160) 3)) (<= (+ (* 3 aux_mod_v_~i~0_159_38) v_~i~0_160) (+ (* 6 aux_div_v_~i~0_159_38) 4)) (<= aux_div_v_~i~0_159_38 1))) (forall ((aux_div_aux_div_v_~i~0_172_51_64 Int) (aux_mod_v_~i~0_172_51 Int)) (or (< c_~i~0 (+ (* 3 aux_div_aux_div_v_~i~0_172_51_64) aux_mod_v_~i~0_172_51 185)) (< aux_mod_v_~i~0_172_51 0) (< (+ (* 11 aux_div_aux_div_v_~i~0_172_51_64) (* 4 aux_mod_v_~i~0_172_51) (* 5 c_~j~0) 552) 0) (<= 3 aux_mod_v_~i~0_172_51))) (< .cse0 377) (< .cse0 (+ (div .cse1 2) 1)) (forall ((aux_mod_v_~i~0_163_51 Int) (aux_div_aux_div_v_~i~0_163_51_64 Int)) (or (< (+ (* 4 aux_mod_v_~i~0_163_51) (* 11 aux_div_aux_div_v_~i~0_163_51_64) (* 5 c_~j~0) 552) 0) (< aux_mod_v_~i~0_163_51 0) (< (+ c_~i~0 c_~j~0) (+ aux_mod_v_~i~0_163_51 (* 3 aux_div_aux_div_v_~i~0_163_51_64) 185)) (<= 3 aux_mod_v_~i~0_163_51))) (< .cse2 377) (< c_~i~0 377) (<= c_~i~0 1) (forall ((aux_div_v_~i~0_163_51 Int) (aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_163_51_78 Int)) (let ((.cse4 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91)) (.cse3 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55))) (let ((.cse5 (* 2 aux_div_aux_mod_v_~i~0_163_51_78)) (.cse6 (+ (* 2 aux_div_v_~i~0_163_51) .cse4 .cse3 c_~j~0))) (or (< 0 .cse3) (<= (+ .cse4 .cse3 2) .cse5) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_163_51_78)) (+ aux_div_v_~i~0_163_51 3)) (< (+ c_~i~0 (* 2 c_~j~0)) aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91) (< 372 .cse6) (<= (+ .cse3 2) 0) (< .cse5 (+ .cse4 .cse3)) (<= .cse6 370))))) (< .cse0 (+ (div .cse1 3) 1)) (< .cse2 (+ (div (+ .cse7 .cse8 373) 3) 2)) (< .cse9 377) (< c_~j~0 377) (forall ((aux_div_v_~i~0_172_51 Int) (aux_div_aux_mod_v_~i~0_172_51_42 Int)) (let ((.cse10 (* 2 aux_div_aux_mod_v_~i~0_172_51_42))) (or (<= (+ c_~j~0 .cse10 2) 0) (< 0 (+ c_~j~0 .cse10)) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_172_51_42) 555) (* 4 aux_div_v_~i~0_172_51)) (< (+ aux_div_v_~i~0_172_51 c_~i~0 (* 2 c_~j~0)) (+ aux_div_aux_mod_v_~i~0_172_51_42 186))))) (forall ((aux_div_aux_div_v_~i~0_172_51_64 Int) (aux_mod_v_~i~0_172_51 Int)) (or (< aux_mod_v_~i~0_172_51 0) (< (+ (* 11 aux_div_aux_div_v_~i~0_172_51_64) (* 4 aux_mod_v_~i~0_172_51) (* 5 c_~j~0) 552) 0) (<= 3 aux_mod_v_~i~0_172_51) (< (+ c_~i~0 c_~j~0) (+ (* 3 aux_div_aux_div_v_~i~0_172_51_64) aux_mod_v_~i~0_172_51 185)))) (forall ((aux_mod_v_~i~0_163_51 Int) (aux_div_aux_div_v_~i~0_163_51_64 Int)) (or (< c_~i~0 (+ aux_mod_v_~i~0_163_51 (* 3 aux_div_aux_div_v_~i~0_163_51_64) 185)) (< (+ (* 4 aux_mod_v_~i~0_163_51) (* 11 aux_div_aux_div_v_~i~0_163_51_64) (* 5 c_~j~0) 552) 0) (< aux_mod_v_~i~0_163_51 0) (<= 3 aux_mod_v_~i~0_163_51))) (< .cse9 (+ (div (+ .cse11 .cse8 372) 2) 3)) (< .cse2 (+ (div (+ .cse7 .cse8 374) 2) 2)) (forall ((aux_div_v_~i~0_163_51 Int) (aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55 Int) (aux_div_aux_mod_v_~i~0_163_51_78 Int)) (let ((.cse13 (* 2 aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91)) (.cse12 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_~i~0_163_51_78_91_55))) (let ((.cse14 (* 2 aux_div_aux_mod_v_~i~0_163_51_78)) (.cse15 (+ (* 2 aux_div_v_~i~0_163_51) .cse13 .cse12 c_~j~0))) (or (< 0 .cse12) (<= (+ .cse13 .cse12 2) .cse14) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_163_51_78)) (+ aux_div_v_~i~0_163_51 3)) (< 372 .cse15) (<= (+ .cse12 2) 0) (< (+ c_~i~0 c_~j~0) aux_div_aux_mod_aux_mod_v_~i~0_163_51_78_91) (< .cse14 (+ .cse13 .cse12)) (<= .cse15 370))))) (= c_ULTIMATE.start_main_~condI~0 0) (forall ((aux_div_v_~i~0_172_51 Int) (aux_div_aux_mod_v_~i~0_172_51_42 Int)) (let ((.cse16 (* 2 aux_div_aux_mod_v_~i~0_172_51_42))) (or (<= (+ c_~j~0 .cse16 2) 0) (< (+ aux_div_v_~i~0_172_51 c_~i~0 c_~j~0) (+ aux_div_aux_mod_v_~i~0_172_51_42 186)) (< 0 (+ c_~j~0 .cse16)) (< (+ c_~j~0 (* 3 aux_div_aux_mod_v_~i~0_172_51_42) 555) (* 4 aux_div_v_~i~0_172_51))))) (< .cse9 (+ (div (+ .cse11 .cse8 370) 3) 3))))) is different from false [2020-10-09 14:29:18,804 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 21 [2020-10-09 14:29:19,496 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2020-10-09 14:29:20,103 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2020-10-09 14:29:20,992 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2020-10-09 14:29:51,092 WARN L193 SmtUtils]: Spent 22.83 s on a formula simplification. DAG size of input: 117 DAG size of output: 92 [2020-10-09 14:29:54,020 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2020-10-09 14:29:58,871 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2020-10-09 14:30:00,765 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2020-10-09 14:30:18,348 WARN L193 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-10-09 14:30:19,368 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2020-10-09 14:30:22,347 WARN L193 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2020-10-09 14:30:27,560 WARN L193 SmtUtils]: Spent 2.80 s on a formula simplification. DAG size of input: 95 DAG size of output: 62 [2020-10-09 14:30:29,528 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2020-10-09 14:30:30,460 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2020-10-09 14:30:33,276 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2020-10-09 14:30:34,689 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2020-10-09 14:30:39,284 WARN L193 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 38 DAG size of output: 35 Received shutdown request... [2020-10-09 14:30:41,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2020-10-09 14:30:41,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3,24 cvc4 --incremental --print-success --lang smt --rewrite-divk,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:30:41,948 WARN L546 AbstractCegarLoop]: Verification canceled [2020-10-09 14:30:41,956 WARN L235 ceAbstractionStarter]: Timeout [2020-10-09 14:30:41,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 02:30:41 BasicIcfg [2020-10-09 14:30:41,956 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 14:30:41,958 INFO L168 Benchmark]: Toolchain (without parser) took 860359.05 ms. Allocated memory was 248.5 MB in the beginning and 2.6 GB in the end (delta: 2.3 GB). Free memory was 203.9 MB in the beginning and 558.9 MB in the end (delta: -355.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 14.2 GB. [2020-10-09 14:30:41,958 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 248.5 MB. Free memory is still 224.9 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 14:30:41,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 647.39 ms. Allocated memory was 248.5 MB in the beginning and 305.7 MB in the end (delta: 57.1 MB). Free memory was 203.9 MB in the beginning and 258.9 MB in the end (delta: -55.1 MB). Peak memory consumption was 26.7 MB. Max. memory is 14.2 GB. [2020-10-09 14:30:41,959 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.12 ms. Allocated memory is still 305.7 MB. Free memory was 258.9 MB in the beginning and 256.4 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:30:41,960 INFO L168 Benchmark]: Boogie Preprocessor took 29.16 ms. Allocated memory is still 305.7 MB. Free memory was 256.4 MB in the beginning and 253.9 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:30:41,960 INFO L168 Benchmark]: RCFGBuilder took 381.37 ms. Allocated memory is still 305.7 MB. Free memory was 253.9 MB in the beginning and 234.6 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 14.2 GB. [2020-10-09 14:30:41,961 INFO L168 Benchmark]: TraceAbstraction took 859245.50 ms. Allocated memory was 305.7 MB in the beginning and 2.6 GB in the end (delta: 2.3 GB). Free memory was 234.6 MB in the beginning and 558.9 MB in the end (delta: -324.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 14.2 GB. [2020-10-09 14:30:41,964 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.25 ms. Allocated memory is still 248.5 MB. Free memory is still 224.9 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 647.39 ms. Allocated memory was 248.5 MB in the beginning and 305.7 MB in the end (delta: 57.1 MB). Free memory was 203.9 MB in the beginning and 258.9 MB in the end (delta: -55.1 MB). Peak memory consumption was 26.7 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 50.12 ms. Allocated memory is still 305.7 MB. Free memory was 258.9 MB in the beginning and 256.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 29.16 ms. Allocated memory is still 305.7 MB. Free memory was 256.4 MB in the beginning and 253.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 381.37 ms. Allocated memory is still 305.7 MB. Free memory was 253.9 MB in the beginning and 234.6 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 859245.50 ms. Allocated memory was 305.7 MB in the beginning and 2.6 GB in the end (delta: 2.3 GB). Free memory was 234.6 MB in the beginning and 558.9 MB in the end (delta: -324.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 711]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 711). Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (30states, 45/57 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 20528 conditions, 5073 events (519/5072 cut-off events. For 48504/48765 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 76629 event pairs, 0 based on Foata normal form. 174/5563 useless extension candidates. Maximal degree in co-relation 20290. Up to 685 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 53 locations, 1 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: 859.0s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 766.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 26 SDtfs, 1024 SDslu, 393 SDs, 0 SdLazy, 4224 SolverSat, 1466 SolverUnsat, 56 SolverUnknown, 0 SolverNotchecked, 128.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3048 GetRequests, 2208 SyntacticMatches, 21 SemanticMatches, 819 ConstructedPredicates, 12 IntricatePredicates, 1 DeprecatedPredicates, 27769 ImplicationChecksByTransitivity, 643.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87242occurred in iteration=9, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 86.0s InterpolantComputationTime, 1223 NumberOfCodeBlocks, 1223 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 2398 ConstructedInterpolants, 222 QuantifiedInterpolants, 2128715 SizeOfPredicates, 97 NumberOfNonLiveVariables, 2786 ConjunctsInSsa, 309 ConjunctsInUnsatCore, 48 InterpolantComputations, 6 PerfectInterpolantSequences, 0/1242 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