/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/triangular-longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 14:48:13,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 14:48:13,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 14:48:13,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 14:48:13,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 14:48:13,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 14:48:13,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 14:48:13,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 14:48:13,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 14:48:13,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 14:48:13,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 14:48:13,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 14:48:13,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 14:48:13,790 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 14:48:13,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 14:48:13,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 14:48:13,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 14:48:13,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 14:48:13,803 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 14:48:13,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 14:48:13,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 14:48:13,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 14:48:13,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 14:48:13,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 14:48:13,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 14:48:13,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 14:48:13,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 14:48:13,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 14:48:13,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 14:48:13,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 14:48:13,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 14:48:13,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 14:48:13,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 14:48:13,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 14:48:13,853 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 14:48:13,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 14:48:13,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 14:48:13,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 14:48:13,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 14:48:13,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 14:48:13,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 14:48:13,860 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:48:13,919 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 14:48:13,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 14:48:13,923 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 14:48:13,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 14:48:13,924 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 14:48:13,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 14:48:13,924 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 14:48:13,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 14:48:13,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 14:48:13,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 14:48:13,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 14:48:13,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 14:48:13,927 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 14:48:13,928 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 14:48:13,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 14:48:13,929 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 14:48:13,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 14:48:13,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 14:48:13,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 14:48:13,930 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 14:48:13,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 14:48:13,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 14:48:13,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 14:48:13,931 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 14:48:13,931 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 14:48:13,931 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-10-09 14:48:13,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 14:48:13,931 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-09 14:48:13,932 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-09 14:48:13,932 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 14:48:14,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 14:48:14,389 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 14:48:14,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 14:48:14,398 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 14:48:14,399 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 14:48:14,401 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-2.i [2020-10-09 14:48:14,489 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/424ed3a6c/a65fab9f8fcb45f081eb16f48fa9bea8/FLAG59ba0ae9f [2020-10-09 14:48:15,212 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 14:48:15,213 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2020-10-09 14:48:15,230 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/424ed3a6c/a65fab9f8fcb45f081eb16f48fa9bea8/FLAG59ba0ae9f [2020-10-09 14:48:15,452 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/424ed3a6c/a65fab9f8fcb45f081eb16f48fa9bea8 [2020-10-09 14:48:15,462 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 14:48:15,464 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 14:48:15,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 14:48:15,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 14:48:15,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 14:48:15,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 02:48:15" (1/1) ... [2020-10-09 14:48:15,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e354c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:48:15, skipping insertion in model container [2020-10-09 14:48:15,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 02:48:15" (1/1) ... [2020-10-09 14:48:15,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 14:48:15,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 14:48:16,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 14:48:16,249 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 14:48:16,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 14:48:16,373 INFO L208 MainTranslator]: Completed translation [2020-10-09 14:48:16,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:48:16 WrapperNode [2020-10-09 14:48:16,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 14:48:16,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 14:48:16,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 14:48:16,380 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 14:48:16,391 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:48:16" (1/1) ... [2020-10-09 14:48:16,442 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:48:16" (1/1) ... [2020-10-09 14:48:16,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 14:48:16,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 14:48:16,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 14:48:16,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 14:48:16,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:48:16" (1/1) ... [2020-10-09 14:48:16,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:48:16" (1/1) ... [2020-10-09 14:48:16,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:48:16" (1/1) ... [2020-10-09 14:48:16,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:48:16" (1/1) ... [2020-10-09 14:48:16,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:48:16" (1/1) ... [2020-10-09 14:48:16,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:48:16" (1/1) ... [2020-10-09 14:48:16,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:48:16" (1/1) ... [2020-10-09 14:48:16,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 14:48:16,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 14:48:16,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 14:48:16,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 14:48:16,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:48:16" (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:48:16,593 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-10-09 14:48:16,593 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-10-09 14:48:16,593 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-10-09 14:48:16,593 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-10-09 14:48:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 14:48:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 14:48:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 14:48:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 14:48:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 14:48:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 14:48:16,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 14:48:16,597 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:48:16,953 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 14:48:16,954 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-09 14:48:16,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 02:48:16 BoogieIcfgContainer [2020-10-09 14:48:16,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 14:48:16,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 14:48:16,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 14:48:16,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 14:48:16,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 02:48:15" (1/3) ... [2020-10-09 14:48:16,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660ef4da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 02:48:16, skipping insertion in model container [2020-10-09 14:48:16,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 02:48:16" (2/3) ... [2020-10-09 14:48:16,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660ef4da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 02:48:16, skipping insertion in model container [2020-10-09 14:48:16,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 02:48:16" (3/3) ... [2020-10-09 14:48:16,973 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2020-10-09 14:48:16,998 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 14:48:17,012 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-09 14:48:17,015 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 14:48:17,056 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,056 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,056 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,056 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,057 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,057 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,057 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,058 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,058 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,058 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,059 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,059 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,059 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,059 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,060 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,060 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,060 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,061 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,061 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,061 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,062 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,062 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,062 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,063 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,063 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,063 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,063 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,064 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,069 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,070 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,070 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,070 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,070 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,071 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,077 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,078 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,078 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,079 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,080 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,080 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 14:48:17,106 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-10-09 14:48:17,138 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 14:48:17,138 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 14:48:17,138 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 14:48:17,138 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 14:48:17,139 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 14:48:17,139 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 14:48:17,139 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 14:48:17,139 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 14:48:17,158 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 57 places, 55 transitions, 120 flow [2020-10-09 14:48:17,204 INFO L129 PetriNetUnfolder]: 5/53 cut-off events. [2020-10-09 14:48:17,205 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 14:48:17,211 INFO L80 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 53 events. 5/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2020-10-09 14:48:17,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 55 transitions, 120 flow [2020-10-09 14:48:17,220 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 53 transitions, 112 flow [2020-10-09 14:48:17,237 INFO L129 PetriNetUnfolder]: 4/43 cut-off events. [2020-10-09 14:48:17,237 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 14:48:17,237 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:48:17,239 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:48:17,239 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:48:17,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:48:17,247 INFO L82 PathProgramCache]: Analyzing trace with hash 305903693, now seen corresponding path program 1 times [2020-10-09 14:48:17,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:48:17,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14072060] [2020-10-09 14:48:17,266 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:48:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:48:17,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 14:48:17,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:17,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:17,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:17,574 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:48:17,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:17,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:17,659 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:48:17,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14072060] [2020-10-09 14:48:17,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:48:17,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2020-10-09 14:48:17,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645301345] [2020-10-09 14:48:17,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 14:48:17,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:48:17,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 14:48:17,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-09 14:48:17,842 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 55 [2020-10-09 14:48:17,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 112 flow. Second operand 9 states. [2020-10-09 14:48:17,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:48:17,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 55 [2020-10-09 14:48:17,849 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:48:18,303 INFO L129 PetriNetUnfolder]: 73/340 cut-off events. [2020-10-09 14:48:18,304 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 14:48:18,308 INFO L80 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 340 events. 73/340 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1887 event pairs, 0 based on Foata normal form. 78/390 useless extension candidates. Maximal degree in co-relation 444. Up to 45 conditions per place. [2020-10-09 14:48:18,312 INFO L132 encePairwiseOnDemand]: 44/55 looper letters, 17 selfloop transitions, 16 changer transitions 18/92 dead transitions. [2020-10-09 14:48:18,313 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 92 transitions, 292 flow [2020-10-09 14:48:18,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-09 14:48:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-09 14:48:18,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 775 transitions. [2020-10-09 14:48:18,342 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8806818181818182 [2020-10-09 14:48:18,343 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 775 transitions. [2020-10-09 14:48:18,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 775 transitions. [2020-10-09 14:48:18,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:48:18,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 775 transitions. [2020-10-09 14:48:18,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-09 14:48:18,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-09 14:48:18,387 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-09 14:48:18,391 INFO L185 Difference]: Start difference. First operand has 55 places, 53 transitions, 112 flow. Second operand 16 states and 775 transitions. [2020-10-09 14:48:18,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 92 transitions, 292 flow [2020-10-09 14:48:18,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 92 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-09 14:48:18,412 INFO L241 Difference]: Finished difference. Result has 82 places, 67 transitions, 250 flow [2020-10-09 14:48:18,416 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=250, PETRI_PLACES=82, PETRI_TRANSITIONS=67} [2020-10-09 14:48:18,417 INFO L341 CegarLoopForPetriNet]: 55 programPoint places, 27 predicate places. [2020-10-09 14:48:18,426 INFO L481 AbstractCegarLoop]: Abstraction has has 82 places, 67 transitions, 250 flow [2020-10-09 14:48:18,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 14:48:18,428 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:48:18,428 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] [2020-10-09 14:48:18,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-09 14:48:18,633 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:48:18,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:48:18,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1723906183, now seen corresponding path program 1 times [2020-10-09 14:48:18,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:48:18,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371061779] [2020-10-09 14:48:18,636 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:48:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:48:18,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-09 14:48:18,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:18,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:18,788 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:48:18,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:18,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:18,864 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:48:18,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371061779] [2020-10-09 14:48:18,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 14:48:18,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2020-10-09 14:48:18,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519398838] [2020-10-09 14:48:18,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-09 14:48:18,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:48:18,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-09 14:48:18,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-09 14:48:19,162 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 55 [2020-10-09 14:48:19,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 67 transitions, 250 flow. Second operand 11 states. [2020-10-09 14:48:19,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:48:19,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 55 [2020-10-09 14:48:19,164 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:48:19,703 INFO L129 PetriNetUnfolder]: 96/452 cut-off events. [2020-10-09 14:48:19,704 INFO L130 PetriNetUnfolder]: For 1731/1846 co-relation queries the response was YES. [2020-10-09 14:48:19,709 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 452 events. 96/452 cut-off events. For 1731/1846 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2535 event pairs, 1 based on Foata normal form. 25/434 useless extension candidates. Maximal degree in co-relation 1171. Up to 68 conditions per place. [2020-10-09 14:48:19,714 INFO L132 encePairwiseOnDemand]: 48/55 looper letters, 31 selfloop transitions, 42 changer transitions 43/150 dead transitions. [2020-10-09 14:48:19,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 150 transitions, 1174 flow [2020-10-09 14:48:19,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-09 14:48:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-09 14:48:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1062 transitions. [2020-10-09 14:48:19,721 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8395256916996048 [2020-10-09 14:48:19,721 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1062 transitions. [2020-10-09 14:48:19,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1062 transitions. [2020-10-09 14:48:19,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:48:19,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1062 transitions. [2020-10-09 14:48:19,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 24 states. [2020-10-09 14:48:19,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 24 states. [2020-10-09 14:48:19,730 INFO L81 ComplementDD]: Finished complementDD. Result 24 states. [2020-10-09 14:48:19,730 INFO L185 Difference]: Start difference. First operand has 82 places, 67 transitions, 250 flow. Second operand 23 states and 1062 transitions. [2020-10-09 14:48:19,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 150 transitions, 1174 flow [2020-10-09 14:48:19,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 150 transitions, 1098 flow, removed 37 selfloop flow, removed 5 redundant places. [2020-10-09 14:48:19,750 INFO L241 Difference]: Finished difference. Result has 113 places, 92 transitions, 713 flow [2020-10-09 14:48:19,750 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=713, PETRI_PLACES=113, PETRI_TRANSITIONS=92} [2020-10-09 14:48:19,751 INFO L341 CegarLoopForPetriNet]: 55 programPoint places, 58 predicate places. [2020-10-09 14:48:19,752 INFO L481 AbstractCegarLoop]: Abstraction has has 113 places, 92 transitions, 713 flow [2020-10-09 14:48:19,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-09 14:48:19,752 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:48:19,753 INFO L255 CegarLoopForPetriNet]: trace histogram [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:48:19,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-09 14:48:19,968 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:48:19,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:48:19,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1269320736, now seen corresponding path program 1 times [2020-10-09 14:48:19,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:48:19,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402772333] [2020-10-09 14:48:19,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-09 14:48:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:48:20,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-09 14:48:20,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:20,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:48:20,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:20,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:20,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:20,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:20,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402772333] [2020-10-09 14:48:20,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [884463951] [2020-10-09 14:48:20,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:48:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:48:20,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-09 14:48:20,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:20,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:48:20,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:20,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:20,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:20,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:20,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782275580] [2020-10-09 14:48:20,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:48:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:48:20,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-09 14:48:20,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:20,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:48:20,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:20,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:20,448 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:20,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:48:20,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 13 [2020-10-09 14:48:20,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587286645] [2020-10-09 14:48:20,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-09 14:48:20,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:48:20,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-09 14:48:20,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-09 14:48:20,697 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 55 [2020-10-09 14:48:20,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 92 transitions, 713 flow. Second operand 13 states. [2020-10-09 14:48:20,698 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:48:20,699 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 55 [2020-10-09 14:48:20,699 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:48:21,446 INFO L129 PetriNetUnfolder]: 98/500 cut-off events. [2020-10-09 14:48:21,446 INFO L130 PetriNetUnfolder]: For 4940/5111 co-relation queries the response was YES. [2020-10-09 14:48:21,451 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1786 conditions, 500 events. 98/500 cut-off events. For 4940/5111 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2760 event pairs, 2 based on Foata normal form. 42/490 useless extension candidates. Maximal degree in co-relation 1732. Up to 78 conditions per place. [2020-10-09 14:48:21,457 INFO L132 encePairwiseOnDemand]: 48/55 looper letters, 44 selfloop transitions, 56 changer transitions 25/159 dead transitions. [2020-10-09 14:48:21,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 159 transitions, 2058 flow [2020-10-09 14:48:21,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-09 14:48:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-09 14:48:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1192 transitions. [2020-10-09 14:48:21,465 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8335664335664336 [2020-10-09 14:48:21,466 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1192 transitions. [2020-10-09 14:48:21,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1192 transitions. [2020-10-09 14:48:21,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:48:21,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1192 transitions. [2020-10-09 14:48:21,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 27 states. [2020-10-09 14:48:21,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 27 states. [2020-10-09 14:48:21,477 INFO L81 ComplementDD]: Finished complementDD. Result 27 states. [2020-10-09 14:48:21,477 INFO L185 Difference]: Start difference. First operand has 113 places, 92 transitions, 713 flow. Second operand 26 states and 1192 transitions. [2020-10-09 14:48:21,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 159 transitions, 2058 flow [2020-10-09 14:48:21,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 159 transitions, 1606 flow, removed 211 selfloop flow, removed 11 redundant places. [2020-10-09 14:48:21,507 INFO L241 Difference]: Finished difference. Result has 127 places, 114 transitions, 1030 flow [2020-10-09 14:48:21,508 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1030, PETRI_PLACES=127, PETRI_TRANSITIONS=114} [2020-10-09 14:48:21,508 INFO L341 CegarLoopForPetriNet]: 55 programPoint places, 72 predicate places. [2020-10-09 14:48:21,508 INFO L481 AbstractCegarLoop]: Abstraction has has 127 places, 114 transitions, 1030 flow [2020-10-09 14:48:21,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-09 14:48:21,509 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:48:21,509 INFO L255 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 14:48:22,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3,5 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:48:22,128 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:48:22,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:48:22,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1653313534, now seen corresponding path program 1 times [2020-10-09 14:48:22,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:48:22,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264339153] [2020-10-09 14:48:22,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-09 14:48:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:48:22,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-09 14:48:22,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:22,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:48:22,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:22,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:22,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:22,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264339153] [2020-10-09 14:48:22,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2103312224] [2020-10-09 14:48:22,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:48:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:48:22,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-09 14:48:22,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:22,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:48:22,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:22,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:22,530 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:22,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604315490] [2020-10-09 14:48:22,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:48:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:48:22,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-09 14:48:22,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:22,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:48:22,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:22,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:22,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:22,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:48:22,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 15 [2020-10-09 14:48:22,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140177591] [2020-10-09 14:48:22,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-09 14:48:22,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:48:22,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-09 14:48:22,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-10-09 14:48:22,803 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 55 [2020-10-09 14:48:22,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 114 transitions, 1030 flow. Second operand 15 states. [2020-10-09 14:48:22,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:48:22,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 55 [2020-10-09 14:48:22,805 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:48:23,626 INFO L129 PetriNetUnfolder]: 111/618 cut-off events. [2020-10-09 14:48:23,626 INFO L130 PetriNetUnfolder]: For 8357/8454 co-relation queries the response was YES. [2020-10-09 14:48:23,631 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2387 conditions, 618 events. 111/618 cut-off events. For 8357/8454 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3476 event pairs, 0 based on Foata normal form. 50/607 useless extension candidates. Maximal degree in co-relation 2323. Up to 78 conditions per place. [2020-10-09 14:48:23,639 INFO L132 encePairwiseOnDemand]: 48/55 looper letters, 36 selfloop transitions, 86 changer transitions 26/182 dead transitions. [2020-10-09 14:48:23,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 182 transitions, 2905 flow [2020-10-09 14:48:23,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-10-09 14:48:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-09 14:48:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1421 transitions. [2020-10-09 14:48:23,644 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8334310850439882 [2020-10-09 14:48:23,644 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 1421 transitions. [2020-10-09 14:48:23,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 1421 transitions. [2020-10-09 14:48:23,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:48:23,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 1421 transitions. [2020-10-09 14:48:23,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 32 states. [2020-10-09 14:48:23,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 32 states. [2020-10-09 14:48:23,652 INFO L81 ComplementDD]: Finished complementDD. Result 32 states. [2020-10-09 14:48:23,652 INFO L185 Difference]: Start difference. First operand has 127 places, 114 transitions, 1030 flow. Second operand 31 states and 1421 transitions. [2020-10-09 14:48:23,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 182 transitions, 2905 flow [2020-10-09 14:48:23,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 182 transitions, 2478 flow, removed 205 selfloop flow, removed 10 redundant places. [2020-10-09 14:48:23,686 INFO L241 Difference]: Finished difference. Result has 157 places, 142 transitions, 1593 flow [2020-10-09 14:48:23,686 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1593, PETRI_PLACES=157, PETRI_TRANSITIONS=142} [2020-10-09 14:48:23,686 INFO L341 CegarLoopForPetriNet]: 55 programPoint places, 102 predicate places. [2020-10-09 14:48:23,687 INFO L481 AbstractCegarLoop]: Abstraction has has 157 places, 142 transitions, 1593 flow [2020-10-09 14:48:23,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-09 14:48:23,687 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:48:23,687 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] [2020-10-09 14:48:24,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 mathsat -unsat_core_generation=3,8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:48:24,302 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:48:24,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:48:24,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1286568708, now seen corresponding path program 2 times [2020-10-09 14:48:24,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:48:24,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91855104] [2020-10-09 14:48:24,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-10-09 14:48:24,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-09 14:48:24,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:48:24,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-09 14:48:24,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:24,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:24,451 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:48:24,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:24,629 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:48:24,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91855104] [2020-10-09 14:48:24,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1677278518] [2020-10-09 14:48:24,630 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 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:48:24,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-09 14:48:24,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:48:24,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-09 14:48:24,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:24,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:24,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:24,812 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:48:24,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:24,815 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:24,836 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:48:24,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941274345] [2020-10-09 14:48:24,838 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:48:24,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-09 14:48:24,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:48:24,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-09 14:48:24,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:24,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:24,918 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:48:24,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:24,938 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:48:24,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:48:24,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13, 13] total 24 [2020-10-09 14:48:24,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668012223] [2020-10-09 14:48:24,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-09 14:48:24,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:48:24,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-09 14:48:24,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2020-10-09 14:48:25,027 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 55 [2020-10-09 14:48:25,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 142 transitions, 1593 flow. Second operand 24 states. [2020-10-09 14:48:25,029 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:48:25,029 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 55 [2020-10-09 14:48:25,029 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:48:26,820 INFO L129 PetriNetUnfolder]: 147/817 cut-off events. [2020-10-09 14:48:26,822 INFO L130 PetriNetUnfolder]: For 16115/16241 co-relation queries the response was YES. [2020-10-09 14:48:26,833 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3561 conditions, 817 events. 147/817 cut-off events. For 16115/16241 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4498 event pairs, 0 based on Foata normal form. 49/785 useless extension candidates. Maximal degree in co-relation 3486. Up to 101 conditions per place. [2020-10-09 14:48:26,843 INFO L132 encePairwiseOnDemand]: 48/55 looper letters, 60 selfloop transitions, 122 changer transitions 29/245 dead transitions. [2020-10-09 14:48:26,843 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 245 transitions, 4781 flow [2020-10-09 14:48:26,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2020-10-09 14:48:26,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-09 14:48:26,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 2153 transitions. [2020-10-09 14:48:26,854 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8328820116054159 [2020-10-09 14:48:26,854 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 2153 transitions. [2020-10-09 14:48:26,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 2153 transitions. [2020-10-09 14:48:26,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:48:26,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 2153 transitions. [2020-10-09 14:48:26,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 48 states. [2020-10-09 14:48:26,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 48 states. [2020-10-09 14:48:26,873 INFO L81 ComplementDD]: Finished complementDD. Result 48 states. [2020-10-09 14:48:26,873 INFO L185 Difference]: Start difference. First operand has 157 places, 142 transitions, 1593 flow. Second operand 47 states and 2153 transitions. [2020-10-09 14:48:26,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 245 transitions, 4781 flow [2020-10-09 14:48:26,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 245 transitions, 3805 flow, removed 438 selfloop flow, removed 21 redundant places. [2020-10-09 14:48:26,937 INFO L241 Difference]: Finished difference. Result has 197 places, 186 transitions, 2238 flow [2020-10-09 14:48:26,938 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=2238, PETRI_PLACES=197, PETRI_TRANSITIONS=186} [2020-10-09 14:48:26,938 INFO L341 CegarLoopForPetriNet]: 55 programPoint places, 142 predicate places. [2020-10-09 14:48:26,938 INFO L481 AbstractCegarLoop]: Abstraction has has 197 places, 186 transitions, 2238 flow [2020-10-09 14:48:26,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-09 14:48:26,939 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:48:26,939 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 14:48:27,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:48:27,554 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:48:27,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:48:27,555 INFO L82 PathProgramCache]: Analyzing trace with hash -226858967, now seen corresponding path program 3 times [2020-10-09 14:48:27,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:48:27,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682420029] [2020-10-09 14:48:27,556 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 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-10-09 14:48:27,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2020-10-09 14:48:27,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:48:27,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-09 14:48:27,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:27,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:27,946 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:27,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:28,002 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,087 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,115 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,142 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,228 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,268 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,488 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:28,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682420029] [2020-10-09 14:48:28,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1924459441] [2020-10-09 14:48:28,489 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 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:48:28,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2020-10-09 14:48:28,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:48:28,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-09 14:48:28,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:28,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:28,674 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:28,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:28,676 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,697 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,704 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,716 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,724 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,728 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,753 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:28,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033931220] [2020-10-09 14:48:28,754 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:48:28,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2020-10-09 14:48:28,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:48:28,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-09 14:48:28,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:28,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:28,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:28,889 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,893 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,912 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,919 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,926 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:28,946 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:28,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:48:28,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19, 19, 19, 19] total 35 [2020-10-09 14:48:28,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447335883] [2020-10-09 14:48:28,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-10-09 14:48:28,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:48:28,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-10-09 14:48:28,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2020-10-09 14:48:29,386 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 55 [2020-10-09 14:48:29,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 186 transitions, 2238 flow. Second operand 35 states. [2020-10-09 14:48:29,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:48:29,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 55 [2020-10-09 14:48:29,388 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:48:31,070 INFO L129 PetriNetUnfolder]: 221/1434 cut-off events. [2020-10-09 14:48:31,070 INFO L130 PetriNetUnfolder]: For 50134/50227 co-relation queries the response was YES. [2020-10-09 14:48:31,086 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6886 conditions, 1434 events. 221/1434 cut-off events. For 50134/50227 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8796 event pairs, 0 based on Foata normal form. 46/1327 useless extension candidates. Maximal degree in co-relation 6798. Up to 168 conditions per place. [2020-10-09 14:48:31,098 INFO L132 encePairwiseOnDemand]: 48/55 looper letters, 147 selfloop transitions, 113 changer transitions 50/344 dead transitions. [2020-10-09 14:48:31,098 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 344 transitions, 8294 flow [2020-10-09 14:48:31,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2020-10-09 14:48:31,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-09 14:48:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 2559 transitions. [2020-10-09 14:48:31,103 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8308441558441558 [2020-10-09 14:48:31,103 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 2559 transitions. [2020-10-09 14:48:31,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 2559 transitions. [2020-10-09 14:48:31,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:48:31,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 2559 transitions. [2020-10-09 14:48:31,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 57 states. [2020-10-09 14:48:31,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 57 states. [2020-10-09 14:48:31,112 INFO L81 ComplementDD]: Finished complementDD. Result 57 states. [2020-10-09 14:48:31,112 INFO L185 Difference]: Start difference. First operand has 197 places, 186 transitions, 2238 flow. Second operand 56 states and 2559 transitions. [2020-10-09 14:48:31,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 344 transitions, 8294 flow [2020-10-09 14:48:31,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 344 transitions, 6421 flow, removed 903 selfloop flow, removed 22 redundant places. [2020-10-09 14:48:31,191 INFO L241 Difference]: Finished difference. Result has 253 places, 246 transitions, 2963 flow [2020-10-09 14:48:31,192 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=2963, PETRI_PLACES=253, PETRI_TRANSITIONS=246} [2020-10-09 14:48:31,192 INFO L341 CegarLoopForPetriNet]: 55 programPoint places, 198 predicate places. [2020-10-09 14:48:31,192 INFO L481 AbstractCegarLoop]: Abstraction has has 253 places, 246 transitions, 2963 flow [2020-10-09 14:48:31,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-10-09 14:48:31,193 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:48:31,193 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 14:48:31,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3,14 cvc4 --incremental --print-success --lang smt --rewrite-divk,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:48:31,801 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:48:31,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:48:31,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1060204081, now seen corresponding path program 4 times [2020-10-09 14:48:31,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:48:31,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396153644] [2020-10-09 14:48:31,803 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 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-10-09 14:48:31,861 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-09 14:48:31,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:48:31,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-09 14:48:31,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:31,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:48:32,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:32,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:32,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,210 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,234 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,352 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,379 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,411 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:32,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396153644] [2020-10-09 14:48:32,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [760845513] [2020-10-09 14:48:32,586 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 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:48:32,708 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-09 14:48:32,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:48:32,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-09 14:48:32,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:32,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:48:32,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:32,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:32,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,764 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,770 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:32,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65599505] [2020-10-09 14:48:32,809 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:48:32,875 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-09 14:48:32,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:48:32,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-09 14:48:32,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:32,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:48:32,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:32,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:32,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,934 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,937 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,947 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,950 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,953 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:32,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:48:32,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19, 19, 19, 19] total 35 [2020-10-09 14:48:32,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993045834] [2020-10-09 14:48:32,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-10-09 14:48:32,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:48:32,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-10-09 14:48:32,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2020-10-09 14:48:33,786 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 55 [2020-10-09 14:48:33,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 246 transitions, 2963 flow. Second operand 35 states. [2020-10-09 14:48:33,789 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:48:33,789 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 55 [2020-10-09 14:48:33,789 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:48:36,559 INFO L129 PetriNetUnfolder]: 278/1820 cut-off events. [2020-10-09 14:48:36,560 INFO L130 PetriNetUnfolder]: For 127572/128213 co-relation queries the response was YES. [2020-10-09 14:48:36,579 INFO L80 FinitePrefix]: Finished finitePrefix Result has 10771 conditions, 1820 events. 278/1820 cut-off events. For 127572/128213 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 12282 event pairs, 0 based on Foata normal form. 55/1686 useless extension candidates. Maximal degree in co-relation 10662. Up to 224 conditions per place. [2020-10-09 14:48:36,597 INFO L132 encePairwiseOnDemand]: 48/55 looper letters, 101 selfloop transitions, 216 changer transitions 50/401 dead transitions. [2020-10-09 14:48:36,597 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 401 transitions, 11319 flow [2020-10-09 14:48:36,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2020-10-09 14:48:36,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-09 14:48:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 2835 transitions. [2020-10-09 14:48:36,607 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8313782991202346 [2020-10-09 14:48:36,607 INFO L72 ComplementDD]: Start complementDD. Operand 62 states and 2835 transitions. [2020-10-09 14:48:36,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 2835 transitions. [2020-10-09 14:48:36,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:48:36,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 62 states and 2835 transitions. [2020-10-09 14:48:36,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 63 states. [2020-10-09 14:48:36,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 63 states. [2020-10-09 14:48:36,621 INFO L81 ComplementDD]: Finished complementDD. Result 63 states. [2020-10-09 14:48:36,621 INFO L185 Difference]: Start difference. First operand has 253 places, 246 transitions, 2963 flow. Second operand 62 states and 2835 transitions. [2020-10-09 14:48:36,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 401 transitions, 11319 flow [2020-10-09 14:48:36,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 401 transitions, 9299 flow, removed 970 selfloop flow, removed 28 redundant places. [2020-10-09 14:48:36,818 INFO L241 Difference]: Finished difference. Result has 304 places, 304 transitions, 4351 flow [2020-10-09 14:48:36,818 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2343, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=4351, PETRI_PLACES=304, PETRI_TRANSITIONS=304} [2020-10-09 14:48:36,819 INFO L341 CegarLoopForPetriNet]: 55 programPoint places, 249 predicate places. [2020-10-09 14:48:36,819 INFO L481 AbstractCegarLoop]: Abstraction has has 304 places, 304 transitions, 4351 flow [2020-10-09 14:48:36,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-10-09 14:48:36,819 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:48:36,819 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 14:48:37,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:48:37,421 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:48:37,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:48:37,422 INFO L82 PathProgramCache]: Analyzing trace with hash -2077891861, now seen corresponding path program 5 times [2020-10-09 14:48:37,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:48:37,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499634727] [2020-10-09 14:48:37,424 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 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2020-10-09 14:48:37,482 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2020-10-09 14:48:37,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:48:37,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-09 14:48:37,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:37,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:48:37,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:37,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:37,728 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:37,752 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:37,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:37,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:37,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:38,123 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:38,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499634727] [2020-10-09 14:48:38,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [526093244] [2020-10-09 14:48:38,124 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 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:48:38,245 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2020-10-09 14:48:38,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:48:38,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-09 14:48:38,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:38,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:48:38,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:38,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:38,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:38,294 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:38,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:38,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:38,308 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:38,332 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:38,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257815532] [2020-10-09 14:48:38,333 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:48:38,424 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2020-10-09 14:48:38,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:48:38,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-09 14:48:38,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:38,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:48:38,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:38,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:38,464 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:38,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:38,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:38,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:38,476 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:38,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:48:38,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19, 19, 19, 19] total 35 [2020-10-09 14:48:38,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337285894] [2020-10-09 14:48:38,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-10-09 14:48:38,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:48:38,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-10-09 14:48:38,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=975, Unknown=0, NotChecked=0, Total=1190 [2020-10-09 14:48:39,524 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 55 [2020-10-09 14:48:39,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 304 transitions, 4351 flow. Second operand 35 states. [2020-10-09 14:48:39,525 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:48:39,525 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 55 [2020-10-09 14:48:39,526 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:48:43,505 INFO L129 PetriNetUnfolder]: 339/2307 cut-off events. [2020-10-09 14:48:43,505 INFO L130 PetriNetUnfolder]: For 249036/249550 co-relation queries the response was YES. [2020-10-09 14:48:43,553 INFO L80 FinitePrefix]: Finished finitePrefix Result has 15927 conditions, 2307 events. 339/2307 cut-off events. For 249036/249550 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 16510 event pairs, 0 based on Foata normal form. 64/2129 useless extension candidates. Maximal degree in co-relation 15799. Up to 272 conditions per place. [2020-10-09 14:48:43,580 INFO L132 encePairwiseOnDemand]: 48/55 looper letters, 81 selfloop transitions, 299 changer transitions 53/467 dead transitions. [2020-10-09 14:48:43,580 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 467 transitions, 16600 flow [2020-10-09 14:48:43,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2020-10-09 14:48:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-09 14:48:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 3434 transitions. [2020-10-09 14:48:43,588 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8324848484848485 [2020-10-09 14:48:43,589 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 3434 transitions. [2020-10-09 14:48:43,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 3434 transitions. [2020-10-09 14:48:43,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:48:43,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 3434 transitions. [2020-10-09 14:48:43,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 76 states. [2020-10-09 14:48:43,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 76 states. [2020-10-09 14:48:43,607 INFO L81 ComplementDD]: Finished complementDD. Result 76 states. [2020-10-09 14:48:43,607 INFO L185 Difference]: Start difference. First operand has 304 places, 304 transitions, 4351 flow. Second operand 75 states and 3434 transitions. [2020-10-09 14:48:43,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 467 transitions, 16600 flow [2020-10-09 14:48:44,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 467 transitions, 13654 flow, removed 1398 selfloop flow, removed 34 redundant places. [2020-10-09 14:48:44,020 INFO L241 Difference]: Finished difference. Result has 370 places, 364 transitions, 6274 flow [2020-10-09 14:48:44,021 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=3313, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=240, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=75, PETRI_FLOW=6274, PETRI_PLACES=370, PETRI_TRANSITIONS=364} [2020-10-09 14:48:44,021 INFO L341 CegarLoopForPetriNet]: 55 programPoint places, 315 predicate places. [2020-10-09 14:48:44,021 INFO L481 AbstractCegarLoop]: Abstraction has has 370 places, 364 transitions, 6274 flow [2020-10-09 14:48:44,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-10-09 14:48:44,022 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:48:44,022 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 14:48:44,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3,21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:48:44,624 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:48:44,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:48:44,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1406830715, now seen corresponding path program 6 times [2020-10-09 14:48:44,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:48:44,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011196594] [2020-10-09 14:48:44,626 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 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2020-10-09 14:48:44,700 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2020-10-09 14:48:44,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:48:44,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 27 conjunts are in the unsatisfiable core [2020-10-09 14:48:44,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:44,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 443 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:45,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:45,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:45,746 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 443 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:45,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011196594] [2020-10-09 14:48:45,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1238618487] [2020-10-09 14:48:45,747 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 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:48:45,906 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2020-10-09 14:48:45,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:48:45,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 27 conjunts are in the unsatisfiable core [2020-10-09 14:48:45,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:45,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:45,942 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 443 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:45,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:45,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:45,979 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 443 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:45,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715086642] [2020-10-09 14:48:45,980 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:48:46,056 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2020-10-09 14:48:46,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:48:46,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 28 conjunts are in the unsatisfiable core [2020-10-09 14:48:46,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:46,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 443 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:46,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:46,131 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 443 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:46,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:48:46,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 26, 26] total 49 [2020-10-09 14:48:46,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408228028] [2020-10-09 14:48:46,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 49 states [2020-10-09 14:48:46,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:48:46,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2020-10-09 14:48:46,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=1811, Unknown=0, NotChecked=0, Total=2352 [2020-10-09 14:48:48,182 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 55 [2020-10-09 14:48:48,184 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 364 transitions, 6274 flow. Second operand 49 states. [2020-10-09 14:48:48,184 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:48:48,185 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 55 [2020-10-09 14:48:48,185 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:48:50,918 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2020-10-09 14:48:54,410 INFO L129 PetriNetUnfolder]: 487/3169 cut-off events. [2020-10-09 14:48:54,411 INFO L130 PetriNetUnfolder]: For 645495/647369 co-relation queries the response was YES. [2020-10-09 14:48:54,462 INFO L80 FinitePrefix]: Finished finitePrefix Result has 30808 conditions, 3169 events. 487/3169 cut-off events. For 645495/647369 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 22415 event pairs, 0 based on Foata normal form. 81/2922 useless extension candidates. Maximal degree in co-relation 30653. Up to 396 conditions per place. [2020-10-09 14:48:54,511 INFO L132 encePairwiseOnDemand]: 48/55 looper letters, 120 selfloop transitions, 424 changer transitions 74/652 dead transitions. [2020-10-09 14:48:54,511 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 652 transitions, 32967 flow [2020-10-09 14:48:54,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2020-10-09 14:48:54,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-10-09 14:48:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 5317 transitions. [2020-10-09 14:48:54,522 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8333855799373041 [2020-10-09 14:48:54,522 INFO L72 ComplementDD]: Start complementDD. Operand 116 states and 5317 transitions. [2020-10-09 14:48:54,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 5317 transitions. [2020-10-09 14:48:54,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:48:54,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 116 states and 5317 transitions. [2020-10-09 14:48:54,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 117 states. [2020-10-09 14:48:54,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 117 states. [2020-10-09 14:48:54,548 INFO L81 ComplementDD]: Finished complementDD. Result 117 states. [2020-10-09 14:48:54,548 INFO L185 Difference]: Start difference. First operand has 370 places, 364 transitions, 6274 flow. Second operand 116 states and 5317 transitions. [2020-10-09 14:48:54,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 652 transitions, 32967 flow [2020-10-09 14:48:55,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 652 transitions, 26040 flow, removed 3349 selfloop flow, removed 38 redundant places. [2020-10-09 14:48:55,590 INFO L241 Difference]: Finished difference. Result has 500 places, 490 transitions, 10902 flow [2020-10-09 14:48:55,591 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=4297, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=299, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=116, PETRI_FLOW=10902, PETRI_PLACES=500, PETRI_TRANSITIONS=490} [2020-10-09 14:48:55,591 INFO L341 CegarLoopForPetriNet]: 55 programPoint places, 445 predicate places. [2020-10-09 14:48:55,591 INFO L481 AbstractCegarLoop]: Abstraction has has 500 places, 490 transitions, 10902 flow [2020-10-09 14:48:55,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2020-10-09 14:48:55,591 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:48:55,591 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 14:48:56,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:48:56,193 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:48:56,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:48:56,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1221485741, now seen corresponding path program 7 times [2020-10-09 14:48:56,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:48:56,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62566160] [2020-10-09 14:48:56,196 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2020-10-09 14:48:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:48:56,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 44 conjunts are in the unsatisfiable core [2020-10-09 14:48:56,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:56,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:48:57,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 0 proven. 1602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:57,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:57,178 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:58,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 0 proven. 1602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:58,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62566160] [2020-10-09 14:48:58,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1451403271] [2020-10-09 14:48:58,409 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:48:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:48:58,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 44 conjunts are in the unsatisfiable core [2020-10-09 14:48:58,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:58,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:48:58,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 0 proven. 1602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:58,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:58,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:58,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 0 proven. 1602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:58,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243733107] [2020-10-09 14:48:58,966 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-09 14:48:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 14:48:59,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 44 conjunts are in the unsatisfiable core [2020-10-09 14:48:59,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:48:59,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 14:48:59,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:48:59,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 0 proven. 1602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:59,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:48:59,154 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 14:48:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 0 proven. 1602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 14:48:59,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-10-09 14:48:59,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43, 43, 43, 43] total 83 [2020-10-09 14:48:59,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851966021] [2020-10-09 14:48:59,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 83 states [2020-10-09 14:48:59,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:48:59,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2020-10-09 14:48:59,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1573, Invalid=5233, Unknown=0, NotChecked=0, Total=6806 [2020-10-09 14:49:09,255 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 55 [2020-10-09 14:49:09,259 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 490 transitions, 10902 flow. Second operand 83 states. [2020-10-09 14:49:09,259 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:49:09,259 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 55 [2020-10-09 14:49:09,259 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:49:16,292 INFO L129 PetriNetUnfolder]: 526/3614 cut-off events. [2020-10-09 14:49:16,292 INFO L130 PetriNetUnfolder]: For 1323589/1324653 co-relation queries the response was YES. [2020-10-09 14:49:16,374 INFO L80 FinitePrefix]: Finished finitePrefix Result has 40573 conditions, 3614 events. 526/3614 cut-off events. For 1323589/1324653 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 25941 event pairs, 2 based on Foata normal form. 66/3296 useless extension candidates. Maximal degree in co-relation 40364. Up to 441 conditions per place. [2020-10-09 14:49:16,445 INFO L132 encePairwiseOnDemand]: 48/55 looper letters, 124 selfloop transitions, 487 changer transitions 17/662 dead transitions. [2020-10-09 14:49:16,446 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 662 transitions, 31415 flow [2020-10-09 14:49:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2020-10-09 14:49:16,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-10-09 14:49:16,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 4101 transitions. [2020-10-09 14:49:16,453 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8284848484848485 [2020-10-09 14:49:16,454 INFO L72 ComplementDD]: Start complementDD. Operand 90 states and 4101 transitions. [2020-10-09 14:49:16,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 4101 transitions. [2020-10-09 14:49:16,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:49:16,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 90 states and 4101 transitions. [2020-10-09 14:49:16,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 91 states. [2020-10-09 14:49:16,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 91 states. [2020-10-09 14:49:16,471 INFO L81 ComplementDD]: Finished complementDD. Result 91 states. [2020-10-09 14:49:16,472 INFO L185 Difference]: Start difference. First operand has 500 places, 490 transitions, 10902 flow. Second operand 90 states and 4101 transitions. [2020-10-09 14:49:16,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 662 transitions, 31415 flow [2020-10-09 14:49:18,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 662 transitions, 20724 flow, removed 5128 selfloop flow, removed 62 redundant places. [2020-10-09 14:49:19,006 INFO L241 Difference]: Finished difference. Result has 517 places, 569 transitions, 9003 flow [2020-10-09 14:49:19,007 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=6254, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=411, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=9003, PETRI_PLACES=517, PETRI_TRANSITIONS=569} [2020-10-09 14:49:19,008 INFO L341 CegarLoopForPetriNet]: 55 programPoint places, 462 predicate places. [2020-10-09 14:49:19,008 INFO L481 AbstractCegarLoop]: Abstraction has has 517 places, 569 transitions, 9003 flow [2020-10-09 14:49:19,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2020-10-09 14:49:19,008 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:49:19,008 INFO L255 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 20, 20, 19, 19, 18, 18, 18, 1, 1, 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:49:19,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 mathsat -unsat_core_generation=3 [2020-10-09 14:49:19,611 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:49:19,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:49:19,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1773708269, now seen corresponding path program 8 times [2020-10-09 14:49:19,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:49:19,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035695834] [2020-10-09 14:49:19,615 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 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2020-10-09 14:49:19,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-09 14:49:19,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:49:19,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 46 conjunts are in the unsatisfiable core [2020-10-09 14:49:19,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:49:20,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 14:49:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 0 proven. 1786 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-09 14:49:20,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:49:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 0 proven. 1786 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-09 14:49:22,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035695834] [2020-10-09 14:49:22,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1084291275] [2020-10-09 14:49:22,038 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 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:49:22,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-09 14:49:22,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 14:49:22,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 42 conjunts are in the unsatisfiable core [2020-10-09 14:49:22,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 14:49:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 1752 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-10-09 14:49:24,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 14:49:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 1752 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-10-09 14:49:26,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2020-10-09 14:49:26,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43, 43] imperfect sequences [44, 44] total 87 [2020-10-09 14:49:26,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969297600] [2020-10-09 14:49:26,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 43 states [2020-10-09 14:49:26,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 14:49:26,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2020-10-09 14:49:26,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=936, Invalid=6546, Unknown=0, NotChecked=0, Total=7482 [2020-10-09 14:49:27,224 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 55 [2020-10-09 14:49:27,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 569 transitions, 9003 flow. Second operand 43 states. [2020-10-09 14:49:27,226 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 14:49:27,226 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 55 [2020-10-09 14:49:27,226 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 14:49:57,858 INFO L129 PetriNetUnfolder]: 7160/36244 cut-off events. [2020-10-09 14:49:57,858 INFO L130 PetriNetUnfolder]: For 8093138/8093618 co-relation queries the response was YES. [2020-10-09 14:49:59,731 INFO L80 FinitePrefix]: Finished finitePrefix Result has 300761 conditions, 36244 events. 7160/36244 cut-off events. For 8093138/8093618 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 455623 event pairs, 1593 based on Foata normal form. 93/32130 useless extension candidates. Maximal degree in co-relation 300565. Up to 4741 conditions per place. [2020-10-09 14:50:00,067 INFO L132 encePairwiseOnDemand]: 49/55 looper letters, 22 selfloop transitions, 81 changer transitions 155/660 dead transitions. [2020-10-09 14:50:00,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 660 transitions, 9161 flow [2020-10-09 14:50:00,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2020-10-09 14:50:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-09 14:50:00,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 2939 transitions. [2020-10-09 14:50:00,072 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8481962481962482 [2020-10-09 14:50:00,073 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 2939 transitions. [2020-10-09 14:50:00,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 2939 transitions. [2020-10-09 14:50:00,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 14:50:00,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 2939 transitions. [2020-10-09 14:50:00,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 64 states. [2020-10-09 14:50:00,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 64 states. [2020-10-09 14:50:00,083 INFO L81 ComplementDD]: Finished complementDD. Result 64 states. [2020-10-09 14:50:00,083 INFO L185 Difference]: Start difference. First operand has 517 places, 569 transitions, 9003 flow. Second operand 63 states and 2939 transitions. [2020-10-09 14:50:00,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 660 transitions, 9161 flow [2020-10-09 14:50:13,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 660 transitions, 7871 flow, removed 454 selfloop flow, removed 42 redundant places. [2020-10-09 14:50:13,082 INFO L241 Difference]: Finished difference. Result has 533 places, 486 transitions, 5406 flow [2020-10-09 14:50:13,083 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=7473, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=5406, PETRI_PLACES=533, PETRI_TRANSITIONS=486} [2020-10-09 14:50:13,084 INFO L341 CegarLoopForPetriNet]: 55 programPoint places, 478 predicate places. [2020-10-09 14:50:13,084 INFO L481 AbstractCegarLoop]: Abstraction has has 533 places, 486 transitions, 5406 flow [2020-10-09 14:50:13,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2020-10-09 14:50:13,084 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 14:50:13,084 INFO L255 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 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:50:13,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3,29 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-09 14:50:13,494 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 14:50:13,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 14:50:13,495 INFO L82 PathProgramCache]: Analyzing trace with hash -651687982, now seen corresponding path program 9 times [2020-10-09 14:50:13,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 14:50:13,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201774084] [2020-10-09 14:50:13,497 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 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2020-10-09 14:50:13,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2020-10-09 14:50:13,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-09 14:50:13,620 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 14:50:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 14:50:13,668 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 14:50:14,005 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 14:50:14,005 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 14:50:14,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2020-10-09 14:50:14,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 02:50:14 BasicIcfg [2020-10-09 14:50:14,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 14:50:14,497 INFO L168 Benchmark]: Toolchain (without parser) took 119033.83 ms. Allocated memory was 249.0 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 204.2 MB in the beginning and 913.0 MB in the end (delta: -708.9 MB). Peak memory consumption was 2.2 GB. Max. memory is 14.2 GB. [2020-10-09 14:50:14,498 INFO L168 Benchmark]: CDTParser took 1.24 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 14:50:14,499 INFO L168 Benchmark]: CACSL2BoogieTranslator took 912.98 ms. Allocated memory was 249.0 MB in the beginning and 305.7 MB in the end (delta: 56.6 MB). Free memory was 204.2 MB in the beginning and 261.1 MB in the end (delta: -56.9 MB). Peak memory consumption was 32.8 MB. Max. memory is 14.2 GB. [2020-10-09 14:50:14,500 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.41 ms. Allocated memory is still 305.7 MB. Free memory is still 261.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 14:50:14,500 INFO L168 Benchmark]: Boogie Preprocessor took 33.14 ms. Allocated memory is still 305.7 MB. Free memory was 261.1 MB in the beginning and 258.6 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:50:14,501 INFO L168 Benchmark]: RCFGBuilder took 451.73 ms. Allocated memory is still 305.7 MB. Free memory was 258.6 MB in the beginning and 236.6 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 14.2 GB. [2020-10-09 14:50:14,502 INFO L168 Benchmark]: TraceAbstraction took 117532.83 ms. Allocated memory was 305.7 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 236.6 MB in the beginning and 913.0 MB in the end (delta: -676.4 MB). Peak memory consumption was 2.2 GB. Max. memory is 14.2 GB. [2020-10-09 14:50:14,505 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.24 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 912.98 ms. Allocated memory was 249.0 MB in the beginning and 305.7 MB in the end (delta: 56.6 MB). Free memory was 204.2 MB in the beginning and 261.1 MB in the end (delta: -56.9 MB). Peak memory consumption was 32.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 95.41 ms. Allocated memory is still 305.7 MB. Free memory is still 261.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * Boogie Preprocessor took 33.14 ms. Allocated memory is still 305.7 MB. Free memory was 261.1 MB in the beginning and 258.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 451.73 ms. Allocated memory is still 305.7 MB. Free memory was 258.6 MB in the beginning and 236.6 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 117532.83 ms. Allocated memory was 305.7 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 236.6 MB in the beginning and 913.0 MB in the end (delta: -676.4 MB). Peak memory consumption was 2.2 GB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 703]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L675] 0 int i = 3, j = 6; VAL [i=3, j=6] [L693] 0 pthread_t id1, id2; VAL [i=3, j=6] [L694] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L677] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, i=7, j=6, k=0] [L695] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0] [L697] 0 int condI = i >= (2*20 +6); VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0] [L685] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=0] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=0, k=1] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=1] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=1] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=1] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=2] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=2] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=2, k=3] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=3] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=3] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=3, k=4] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=4] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=4] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=4, k=5] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=4, k=6] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=6, k=4] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=6, k=5] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=5, k=6] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=7, k=5] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=5, k=7] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=7, k=6] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=6] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=7] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=7, k=8] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=8] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=8] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=8, k=9] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=10] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=10] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=9] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=10] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=10, k=11] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=11] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=11] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=11] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=11] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=11] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=12] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=12] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=12, k=13] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=13] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=13] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=13] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=14] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=14] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=14, k=14] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=14] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=14] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=14, k=15] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=15] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=16] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=16] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=16, k=17] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=17] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=17, k=18] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=18] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=18] [L677] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=18] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L685] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L700] 0 int condJ = j >= (2*20 +6); VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L702] COND TRUE 0 condI || condJ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L703] 0 __VERIFIER_error() VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 51 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: UNSAFE, OverallTime: 117.0s, OverallIterations: 12, TraceHistogramMax: 21, AutomataDifference: 93.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 45 SDtfs, 1269 SDslu, 941 SDs, 0 SdLazy, 3647 SolverSat, 1885 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5883 GetRequests, 4914 SyntacticMatches, 80 SemanticMatches, 889 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33865 ImplicationChecksByTransitivity, 29.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10902occurred 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.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 2932 NumberOfCodeBlocks, 2932 NumberOfCodeBlocksAsserted, 137 NumberOfCheckSat, 5368 ConstructedInterpolants, 0 QuantifiedInterpolants, 2477486 SizeOfPredicates, 513 NumberOfNonLiveVariables, 5286 ConjunctsInSsa, 600 ConjunctsInUnsatCore, 56 InterpolantComputations, 6 PerfectInterpolantSequences, 3592/22854 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 proved your program to be incorrect! Received shutdown request...