/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/sumsumbank.bpl


--------------------------------------------------------------------------------


This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m
[2023-10-12 17:37:23,984 INFO  L172        SettingsManager]: Resetting all preferences to default values...
[2023-10-12 17:37:24,084 INFO  L100        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf
[2023-10-12 17:37:24,114 INFO  L114        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-12 17:37:24,115 INFO  L135        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-12 17:37:24,115 INFO  L137        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-12 17:37:24,116 INFO  L135        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-12 17:37:24,117 INFO  L137        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-12 17:37:24,117 INFO  L137        SettingsManager]:  * Use SBE=true
[2023-10-12 17:37:24,120 INFO  L135        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2023-10-12 17:37:24,121 INFO  L137        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2023-10-12 17:37:24,121 INFO  L137        SettingsManager]:  * Use old map elimination=false
[2023-10-12 17:37:24,121 INFO  L137        SettingsManager]:  * Use external solver (rank synthesis)=false
[2023-10-12 17:37:24,122 INFO  L137        SettingsManager]:  * Use only trivial implications for array writes=true
[2023-10-12 17:37:24,123 INFO  L137        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2023-10-12 17:37:24,123 INFO  L135        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-12 17:37:24,123 INFO  L137        SettingsManager]:  * sizeof long=4
[2023-10-12 17:37:24,124 INFO  L137        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-12 17:37:24,124 INFO  L137        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-12 17:37:24,124 INFO  L137        SettingsManager]:  * sizeof POINTER=4
[2023-10-12 17:37:24,124 INFO  L137        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-12 17:37:24,125 INFO  L137        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2023-10-12 17:37:24,126 INFO  L137        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2023-10-12 17:37:24,126 INFO  L137        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2023-10-12 17:37:24,126 INFO  L137        SettingsManager]:  * sizeof long double=12
[2023-10-12 17:37:24,126 INFO  L137        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-12 17:37:24,126 INFO  L137        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2023-10-12 17:37:24,127 INFO  L137        SettingsManager]:  * Use constant arrays=true
[2023-10-12 17:37:24,127 INFO  L137        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2023-10-12 17:37:24,127 INFO  L135        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-12 17:37:24,128 INFO  L137        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-12 17:37:24,128 INFO  L135        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-12 17:37:24,128 INFO  L137        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-12 17:37:24,130 INFO  L135        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2023-10-12 17:37:24,130 INFO  L137        SettingsManager]:  * TransformationType=MODULO_NEIGHBOR
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> RABIN_PETRI_NET
[2023-10-12 17:37:24,375 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-12 17:37:24,399 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-12 17:37:24,401 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-12 17:37:24,402 INFO  L270        PluginConnector]: Initializing Boogie PL CUP Parser...
[2023-10-12 17:37:24,402 INFO  L274        PluginConnector]: Boogie PL CUP Parser initialized
[2023-10-12 17:37:24,403 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsumbank.bpl
[2023-10-12 17:37:24,404 INFO  L110           BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsumbank.bpl'
[2023-10-12 17:37:24,430 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-12 17:37:24,432 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2023-10-12 17:37:24,433 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-12 17:37:24,433 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-12 17:37:24,433 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-12 17:37:24,444 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sumsumbank.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:24" (1/1) ...
[2023-10-12 17:37:24,451 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sumsumbank.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:24" (1/1) ...
[2023-10-12 17:37:24,459 INFO  L138                Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0
[2023-10-12 17:37:24,461 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-12 17:37:24,462 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-12 17:37:24,463 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-12 17:37:24,463 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-10-12 17:37:24,471 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sumsumbank.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:24" (1/1) ...
[2023-10-12 17:37:24,471 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sumsumbank.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:24" (1/1) ...
[2023-10-12 17:37:24,473 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sumsumbank.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:24" (1/1) ...
[2023-10-12 17:37:24,473 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sumsumbank.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:24" (1/1) ...
[2023-10-12 17:37:24,476 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sumsumbank.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:24" (1/1) ...
[2023-10-12 17:37:24,478 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sumsumbank.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:24" (1/1) ...
[2023-10-12 17:37:24,479 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sumsumbank.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:24" (1/1) ...
[2023-10-12 17:37:24,479 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sumsumbank.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:24" (1/1) ...
[2023-10-12 17:37:24,480 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-12 17:37:24,482 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-12 17:37:24,482 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-10-12 17:37:24,482 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-10-12 17:37:24,483 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sumsumbank.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:24" (1/1) ...
[2023-10-12 17:37:24,489 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-10-12 17:37:24,496 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-10-12 17:37:24,511 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-10-12 17:37:24,516 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2023-10-12 17:37:24,542 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure sum1 given in one single declaration
[2023-10-12 17:37:24,542 INFO  L130     BoogieDeclarations]: Found specification of procedure sum1
[2023-10-12 17:37:24,546 INFO  L138     BoogieDeclarations]: Found implementation of procedure sum1
[2023-10-12 17:37:24,546 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure sum2 given in one single declaration
[2023-10-12 17:37:24,547 INFO  L130     BoogieDeclarations]: Found specification of procedure sum2
[2023-10-12 17:37:24,547 INFO  L138     BoogieDeclarations]: Found implementation of procedure sum2
[2023-10-12 17:37:24,547 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure bank given in one single declaration
[2023-10-12 17:37:24,547 INFO  L130     BoogieDeclarations]: Found specification of procedure bank
[2023-10-12 17:37:24,548 INFO  L138     BoogieDeclarations]: Found implementation of procedure bank
[2023-10-12 17:37:24,548 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration
[2023-10-12 17:37:24,548 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-12 17:37:24,548 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-12 17:37:24,549 WARN  L210             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-10-12 17:37:24,596 INFO  L236             CfgBuilder]: Building ICFG
[2023-10-12 17:37:24,598 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-12 17:37:24,736 INFO  L277             CfgBuilder]: Performing block encoding
[2023-10-12 17:37:24,753 INFO  L297             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-12 17:37:24,753 INFO  L302             CfgBuilder]: Removed 1 assume(true) statements.
[2023-10-12 17:37:24,756 INFO  L201        PluginConnector]: Adding new model sumsumbank.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:24 BoogieIcfgContainer
[2023-10-12 17:37:24,756 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-12 17:37:24,757 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2023-10-12 17:37:24,758 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2023-10-12 17:37:24,761 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2023-10-12 17:37:24,761 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2023-10-12 17:37:24,762 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsumbank.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:24" (1/2) ...
[2023-10-12 17:37:24,763 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45347119 and model type sumsumbank.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:37:24, skipping insertion in model container
[2023-10-12 17:37:24,763 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2023-10-12 17:37:24,764 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsumbank.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:24" (2/2) ...
[2023-10-12 17:37:24,768 INFO  L332   chiAutomizerObserver]: Analyzing ICFG sumsumbank.bpl
[2023-10-12 17:37:24,854 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-12 17:37:24,884 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 79 flow
[2023-10-12 17:37:24,911 INFO  L124   PetriNetUnfolderBase]: 3/23 cut-off events.
[2023-10-12 17:37:24,911 INFO  L125   PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2023-10-12 17:37:24,916 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35 conditions, 23 events. 3/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 40 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. 
[2023-10-12 17:37:24,916 INFO  L82        GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 79 flow
[2023-10-12 17:37:24,920 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 61 flow
[2023-10-12 17:37:24,923 INFO  L115   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2023-10-12 17:37:24,950 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 23 transitions, 61 flow
[2023-10-12 17:37:24,952 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 23 transitions, 61 flow
[2023-10-12 17:37:24,953 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 61 flow
[2023-10-12 17:37:24,958 INFO  L124   PetriNetUnfolderBase]: 3/23 cut-off events.
[2023-10-12 17:37:24,958 INFO  L125   PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2023-10-12 17:37:24,959 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35 conditions, 23 events. 3/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 40 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. 
[2023-10-12 17:37:24,959 INFO  L119        LiptonReduction]: Number of co-enabled transitions 222
[2023-10-12 17:37:25,101 INFO  L134        LiptonReduction]: Checked pairs total: 214
[2023-10-12 17:37:25,101 INFO  L136        LiptonReduction]: Total number of compositions: 5
[2023-10-12 17:37:25,113 INFO  L305   stractBuchiCegarLoop]: Interprodecural is true
[2023-10-12 17:37:25,113 INFO  L306   stractBuchiCegarLoop]: Hoare is false
[2023-10-12 17:37:25,113 INFO  L307   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2023-10-12 17:37:25,113 INFO  L308   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2023-10-12 17:37:25,113 INFO  L309   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2023-10-12 17:37:25,113 INFO  L310   stractBuchiCegarLoop]: Difference is false
[2023-10-12 17:37:25,114 INFO  L311   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2023-10-12 17:37:25,114 INFO  L315   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ========
[2023-10-12 17:37:25,114 INFO  L67            RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 18 transitions, 51 flow
[2023-10-12 17:37:25,118 ERROR L47    etriNetUnfolderRabin]: [1:1A:[78] $Ultimate##0-->$Ultimate##0: Formula: (= v_sum1Thread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{sum1Thread1of1ForFork0_x=v_sum1Thread1of1ForFork0_x_2, sum1Thread1of1ForFork0_thidvar0=v_sum1Thread1of1ForFork0_thidvar0_2}  AuxVars[]  AssignedVars[sum1Thread1of1ForFork0_x, sum1Thread1of1ForFork0_thidvar0][11], 2:2A:[61] $Ultimate##0-->L19: Formula: (= v_sum1_1 0)  InVars {}  OutVars{sum1=v_sum1_1}  AuxVars[]  AssignedVars[sum1][9], 5:3A:[62] L19-->L21-1: Formula: (= v_i1_1 0)  InVars {}  OutVars{i1=v_i1_1}  AuxVars[]  AssignedVars[i1][4]][6:4A:[89] L21-1-->L21-1: Formula: (and (< v_i1_15 v_N_7) (= (+ (select v_A_7 v_i1_15) v_sum1_14) v_sum1_13) (= v_i1_14 (+ v_i1_15 1)))  InVars {sum1=v_sum1_14, A=v_A_7, N=v_N_7, i1=v_i1_15}  OutVars{sum1=v_sum1_13, A=v_A_7, N=v_N_7, i1=v_i1_14}  AuxVars[]  AssignedVars[sum1, i1][16]]
[2023-10-12 17:37:25,119 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-10-12 17:37:25,120 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2023-10-12 17:37:25,120 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-10-12 17:37:25,120 INFO  L72            RabinIsEmpty]: Finished rabinIsEmpty language is not empty
[2023-10-12 17:37:25,122 INFO  L337   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2023-10-12 17:37:25,123 INFO  L67            RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 18 transitions, 51 flow
[2023-10-12 17:37:25,124 ERROR L47    etriNetUnfolderRabin]: [1:1A:[78] $Ultimate##0-->$Ultimate##0: Formula: (= v_sum1Thread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{sum1Thread1of1ForFork0_x=v_sum1Thread1of1ForFork0_x_2, sum1Thread1of1ForFork0_thidvar0=v_sum1Thread1of1ForFork0_thidvar0_2}  AuxVars[]  AssignedVars[sum1Thread1of1ForFork0_x, sum1Thread1of1ForFork0_thidvar0][11], 2:2A:[61] $Ultimate##0-->L19: Formula: (= v_sum1_1 0)  InVars {}  OutVars{sum1=v_sum1_1}  AuxVars[]  AssignedVars[sum1][9], 5:3A:[62] L19-->L21-1: Formula: (= v_i1_1 0)  InVars {}  OutVars{i1=v_i1_1}  AuxVars[]  AssignedVars[i1][4]][6:4A:[89] L21-1-->L21-1: Formula: (and (< v_i1_15 v_N_7) (= (+ (select v_A_7 v_i1_15) v_sum1_14) v_sum1_13) (= v_i1_14 (+ v_i1_15 1)))  InVars {sum1=v_sum1_14, A=v_A_7, N=v_N_7, i1=v_i1_15}  OutVars{sum1=v_sum1_13, A=v_A_7, N=v_N_7, i1=v_i1_14}  AuxVars[]  AssignedVars[sum1, i1][16]]
[2023-10-12 17:37:25,125 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-10-12 17:37:25,125 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2023-10-12 17:37:25,125 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-10-12 17:37:25,125 INFO  L72            RabinIsEmpty]: Finished rabinIsEmpty language is not empty
[2023-10-12 17:37:25,129 INFO  L748   eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [78] $Ultimate##0-->$Ultimate##0: Formula: (= v_sum1Thread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{sum1Thread1of1ForFork0_x=v_sum1Thread1of1ForFork0_x_2, sum1Thread1of1ForFork0_thidvar0=v_sum1Thread1of1ForFork0_thidvar0_2}  AuxVars[]  AssignedVars[sum1Thread1of1ForFork0_x, sum1Thread1of1ForFork0_thidvar0] 39#[L57, $Ultimate##0]true [61] $Ultimate##0-->L19: Formula: (= v_sum1_1 0)  InVars {}  OutVars{sum1=v_sum1_1}  AuxVars[]  AssignedVars[sum1] 41#[L19, L57]true [62] L19-->L21-1: Formula: (= v_i1_1 0)  InVars {}  OutVars{i1=v_i1_1}  AuxVars[]  AssignedVars[i1] 43#[L21-1, L57]true 
[2023-10-12 17:37:25,130 INFO  L750   eck$LassoCheckResult]: Loop: 43#[L21-1, L57]true [89] L21-1-->L21-1: Formula: (and (< v_i1_15 v_N_7) (= (+ (select v_A_7 v_i1_15) v_sum1_14) v_sum1_13) (= v_i1_14 (+ v_i1_15 1)))  InVars {sum1=v_sum1_14, A=v_A_7, N=v_N_7, i1=v_i1_15}  OutVars{sum1=v_sum1_13, A=v_A_7, N=v_N_7, i1=v_i1_14}  AuxVars[]  AssignedVars[sum1, i1] 43#[L21-1, L57]true 
[2023-10-12 17:37:25,134 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:37:25,134 INFO  L85        PathProgramCache]: Analyzing trace with hash 106702, now seen corresponding path program 1 times
[2023-10-12 17:37:25,142 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-12 17:37:25,142 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169097527]
[2023-10-12 17:37:25,142 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-12 17:37:25,143 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-12 17:37:25,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:25,217 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:37:25,234 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:25,254 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-12 17:37:25,257 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:37:25,257 INFO  L85        PathProgramCache]: Analyzing trace with hash 120, now seen corresponding path program 1 times
[2023-10-12 17:37:25,257 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-12 17:37:25,257 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069184025]
[2023-10-12 17:37:25,257 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-12 17:37:25,258 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-12 17:37:25,267 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:25,267 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:37:25,270 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:25,272 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-12 17:37:25,273 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:37:25,274 INFO  L85        PathProgramCache]: Analyzing trace with hash 3307851, now seen corresponding path program 1 times
[2023-10-12 17:37:25,274 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-12 17:37:25,274 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609090722]
[2023-10-12 17:37:25,274 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-12 17:37:25,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-12 17:37:25,281 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:25,281 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:37:25,286 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:25,289 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-12 17:37:25,352 INFO  L210          LassoAnalysis]: Preferences:
[2023-10-12 17:37:25,353 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2023-10-12 17:37:25,353 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2023-10-12 17:37:25,353 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2023-10-12 17:37:25,353 INFO  L129   ssoRankerPreferences]: Use exernal solver: false
[2023-10-12 17:37:25,353 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-10-12 17:37:25,354 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2023-10-12 17:37:25,354 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2023-10-12 17:37:25,354 INFO  L133   ssoRankerPreferences]: Filename of dumped script: sumsumbank.bpl_BEv2_Iteration1_Lasso
[2023-10-12 17:37:25,354 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2023-10-12 17:37:25,354 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2023-10-12 17:37:25,367 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2023-10-12 17:37:25,375 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2023-10-12 17:37:25,379 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2023-10-12 17:37:25,445 INFO  L294          LassoAnalysis]: Preprocessing complete.
[2023-10-12 17:37:25,449 INFO  L490          LassoAnalysis]: Using template 'affine'.
[2023-10-12 17:37:25,450 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-10-12 17:37:25,450 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-10-12 17:37:25,457 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-10-12 17:37:25,464 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2023-10-12 17:37:25,472 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2023-10-12 17:37:25,472 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2023-10-12 17:37:25,473 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2023-10-12 17:37:25,473 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2023-10-12 17:37:25,473 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2023-10-12 17:37:25,475 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2023-10-12 17:37:25,475 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2023-10-12 17:37:25,478 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process
[2023-10-12 17:37:25,481 INFO  L527          LassoAnalysis]: Proving termination failed for this template and these settings.
[2023-10-12 17:37:25,485 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0
[2023-10-12 17:37:25,486 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-10-12 17:37:25,486 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-10-12 17:37:25,489 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-10-12 17:37:25,500 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2023-10-12 17:37:25,507 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2023-10-12 17:37:25,508 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2023-10-12 17:37:25,508 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2023-10-12 17:37:25,508 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2023-10-12 17:37:25,509 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process
[2023-10-12 17:37:25,512 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2023-10-12 17:37:25,513 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2023-10-12 17:37:25,533 INFO  L527          LassoAnalysis]: Proving termination failed for this template and these settings.
[2023-10-12 17:37:25,539 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0
[2023-10-12 17:37:25,539 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-10-12 17:37:25,540 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-10-12 17:37:25,541 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-10-12 17:37:25,545 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process
[2023-10-12 17:37:25,546 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2023-10-12 17:37:25,553 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2023-10-12 17:37:25,553 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2023-10-12 17:37:25,554 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2023-10-12 17:37:25,554 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2023-10-12 17:37:25,561 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2023-10-12 17:37:25,562 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2023-10-12 17:37:25,581 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2023-10-12 17:37:25,594 INFO  L443   ModelExtractionUtils]: Simplification made 4 calls to the SMT solver.
[2023-10-12 17:37:25,594 INFO  L444   ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero.
[2023-10-12 17:37:25,595 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-10-12 17:37:25,596 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-10-12 17:37:25,597 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-10-12 17:37:25,599 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process
[2023-10-12 17:37:25,600 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2023-10-12 17:37:25,611 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2023-10-12 17:37:25,612 INFO  L513          LassoAnalysis]: Proved termination.
[2023-10-12 17:37:25,612 INFO  L515          LassoAnalysis]: Termination argument consisting of:
Ranking function f(i1, N) = -1*i1 + 1*N
Supporting invariants []
[2023-10-12 17:37:25,615 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0
[2023-10-12 17:37:25,618 INFO  L156   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2023-10-12 17:37:25,652 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:37:25,660 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-12 17:37:25,662 INFO  L262         TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core
[2023-10-12 17:37:25,662 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-10-12 17:37:25,675 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-12 17:37:25,675 WARN  L260         TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-12 17:37:25,676 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-10-12 17:37:25,676 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-12 17:37:25,707 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates 
[2023-10-12 17:37:25,786 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 
[2023-10-12 17:37:25,791 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-12 17:37:25,794 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions.
[2023-10-12 17:37:25,796 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 100 transitions. Stem has 3 letters. Loop has 1 letters.
[2023-10-12 17:37:25,796 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2023-10-12 17:37:25,796 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 100 transitions. Stem has 4 letters. Loop has 1 letters.
[2023-10-12 17:37:25,796 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2023-10-12 17:37:25,796 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 100 transitions. Stem has 3 letters. Loop has 2 letters.
[2023-10-12 17:37:25,798 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2023-10-12 17:37:25,798 INFO  L430   stractBuchiCegarLoop]: Abstraction has has 29 places, 72 transitions, 348 flow
[2023-10-12 17:37:25,798 INFO  L337   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2023-10-12 17:37:25,798 INFO  L67            RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 72 transitions, 348 flow
[2023-10-12 17:37:25,805 ERROR L47    etriNetUnfolderRabin]: [1:1A:[78] $Ultimate##0-->$Ultimate##0: Formula: (= v_sum1Thread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{sum1Thread1of1ForFork0_x=v_sum1Thread1of1ForFork0_x_2, sum1Thread1of1ForFork0_thidvar0=v_sum1Thread1of1ForFork0_thidvar0_2}  AuxVars[]  AssignedVars[sum1Thread1of1ForFork0_x, sum1Thread1of1ForFork0_thidvar0][44], 3:2A:[81] L57-->$Ultimate##0: Formula: (and (= 2 v_sum2Thread1of1ForFork1_thidvar0_2) (= 2 v_sum2Thread1of1ForFork1_thidvar1_2))  InVars {}  OutVars{sum2Thread1of1ForFork1_thidvar0=v_sum2Thread1of1ForFork1_thidvar0_2, sum2Thread1of1ForFork1_thidvar1=v_sum2Thread1of1ForFork1_thidvar1_2, sum2Thread1of1ForFork1_y=v_sum2Thread1of1ForFork1_y_2}  AuxVars[]  AssignedVars[sum2Thread1of1ForFork1_thidvar0, sum2Thread1of1ForFork1_thidvar1, sum2Thread1of1ForFork1_y][48], 10:3A:[67] $Ultimate##0-->L34: Formula: (= v_sum2_3 0)  InVars {}  OutVars{sum2=v_sum2_3}  AuxVars[]  AssignedVars[sum2][40], 13:4A:[68] L34-->L36-1: Formula: (= v_i2_6 0)  InVars {}  OutVars{i2=v_i2_6}  AuxVars[]  AssignedVars[i2][0]][14:5A:[91] L36-1-->L36-1: Formula: (and (= (+ v_i2_17 1) v_i2_16) (< v_i2_17 v_N_11) (= (+ (select v_A_11 v_i2_17) v_sum2_17) v_sum2_16))  InVars {A=v_A_11, sum2=v_sum2_17, N=v_N_11, i2=v_i2_17}  OutVars{A=v_A_11, sum2=v_sum2_16, N=v_N_11, i2=v_i2_16}  AuxVars[]  AssignedVars[sum2, i2][52]]
[2023-10-12 17:37:25,807 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-10-12 17:37:25,807 INFO  L124   PetriNetUnfolderBase]: 5/13 cut-off events.
[2023-10-12 17:37:25,807 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2023-10-12 17:37:25,807 INFO  L72            RabinIsEmpty]: Finished rabinIsEmpty language is not empty
[2023-10-12 17:37:25,808 INFO  L748   eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [78] $Ultimate##0-->$Ultimate##0: Formula: (= v_sum1Thread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{sum1Thread1of1ForFork0_x=v_sum1Thread1of1ForFork0_x_2, sum1Thread1of1ForFork0_thidvar0=v_sum1Thread1of1ForFork0_thidvar0_2}  AuxVars[]  AssignedVars[sum1Thread1of1ForFork0_x, sum1Thread1of1ForFork0_thidvar0] 39#[L57, $Ultimate##0]true [81] L57-->$Ultimate##0: Formula: (and (= 2 v_sum2Thread1of1ForFork1_thidvar0_2) (= 2 v_sum2Thread1of1ForFork1_thidvar1_2))  InVars {}  OutVars{sum2Thread1of1ForFork1_thidvar0=v_sum2Thread1of1ForFork1_thidvar0_2, sum2Thread1of1ForFork1_thidvar1=v_sum2Thread1of1ForFork1_thidvar1_2, sum2Thread1of1ForFork1_y=v_sum2Thread1of1ForFork1_y_2}  AuxVars[]  AssignedVars[sum2Thread1of1ForFork1_thidvar0, sum2Thread1of1ForFork1_thidvar1, sum2Thread1of1ForFork1_y] 82#[$Ultimate##0, L58, $Ultimate##0]true [67] $Ultimate##0-->L34: Formula: (= v_sum2_3 0)  InVars {}  OutVars{sum2=v_sum2_3}  AuxVars[]  AssignedVars[sum2] 84#[L34, L58, $Ultimate##0]true [68] L34-->L36-1: Formula: (= v_i2_6 0)  InVars {}  OutVars{i2=v_i2_6}  AuxVars[]  AssignedVars[i2] 86#[L36-1, L58, $Ultimate##0]true 
[2023-10-12 17:37:25,808 INFO  L750   eck$LassoCheckResult]: Loop: 86#[L36-1, L58, $Ultimate##0]true [91] L36-1-->L36-1: Formula: (and (= (+ v_i2_17 1) v_i2_16) (< v_i2_17 v_N_11) (= (+ (select v_A_11 v_i2_17) v_sum2_17) v_sum2_16))  InVars {A=v_A_11, sum2=v_sum2_17, N=v_N_11, i2=v_i2_17}  OutVars{A=v_A_11, sum2=v_sum2_16, N=v_N_11, i2=v_i2_16}  AuxVars[]  AssignedVars[sum2, i2] 86#[L36-1, L58, $Ultimate##0]true 
[2023-10-12 17:37:25,809 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:37:25,810 INFO  L85        PathProgramCache]: Analyzing trace with hash 3327205, now seen corresponding path program 1 times
[2023-10-12 17:37:25,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-12 17:37:25,811 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771011357]
[2023-10-12 17:37:25,811 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-12 17:37:25,811 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-12 17:37:25,815 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:25,816 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:37:25,818 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:25,820 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-12 17:37:25,820 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:37:25,820 INFO  L85        PathProgramCache]: Analyzing trace with hash 122, now seen corresponding path program 1 times
[2023-10-12 17:37:25,820 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-12 17:37:25,821 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158403849]
[2023-10-12 17:37:25,821 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-12 17:37:25,821 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-12 17:37:25,825 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:25,825 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:37:25,827 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:25,829 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-12 17:37:25,829 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:37:25,829 INFO  L85        PathProgramCache]: Analyzing trace with hash 103143446, now seen corresponding path program 1 times
[2023-10-12 17:37:25,830 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-12 17:37:25,830 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228714397]
[2023-10-12 17:37:25,830 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-12 17:37:25,830 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-12 17:37:25,836 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:25,836 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:37:25,840 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:25,843 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-12 17:37:25,889 INFO  L210          LassoAnalysis]: Preferences:
[2023-10-12 17:37:25,890 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2023-10-12 17:37:25,890 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2023-10-12 17:37:25,890 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2023-10-12 17:37:25,890 INFO  L129   ssoRankerPreferences]: Use exernal solver: false
[2023-10-12 17:37:25,890 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-10-12 17:37:25,890 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2023-10-12 17:37:25,890 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2023-10-12 17:37:25,890 INFO  L133   ssoRankerPreferences]: Filename of dumped script: sumsumbank.bpl_BEv2_Iteration2_Lasso
[2023-10-12 17:37:25,890 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2023-10-12 17:37:25,891 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2023-10-12 17:37:25,892 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2023-10-12 17:37:25,907 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2023-10-12 17:37:25,910 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2023-10-12 17:37:25,912 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2023-10-12 17:37:25,915 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2023-10-12 17:37:25,918 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2023-10-12 17:37:25,976 INFO  L294          LassoAnalysis]: Preprocessing complete.
[2023-10-12 17:37:25,976 INFO  L490          LassoAnalysis]: Using template 'affine'.
[2023-10-12 17:37:25,977 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-10-12 17:37:25,977 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-10-12 17:37:25,978 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-10-12 17:37:25,992 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2023-10-12 17:37:25,999 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2023-10-12 17:37:26,000 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2023-10-12 17:37:26,000 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2023-10-12 17:37:26,000 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2023-10-12 17:37:26,003 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2023-10-12 17:37:26,003 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2023-10-12 17:37:26,009 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process
[2023-10-12 17:37:26,021 INFO  L527          LassoAnalysis]: Proving termination failed for this template and these settings.
[2023-10-12 17:37:26,029 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0
[2023-10-12 17:37:26,030 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-10-12 17:37:26,030 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-10-12 17:37:26,163 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-10-12 17:37:26,164 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process
[2023-10-12 17:37:26,233 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2023-10-12 17:37:26,240 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2023-10-12 17:37:26,240 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2023-10-12 17:37:26,240 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2023-10-12 17:37:26,241 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2023-10-12 17:37:26,244 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2023-10-12 17:37:26,244 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2023-10-12 17:37:26,268 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2023-10-12 17:37:26,272 INFO  L443   ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2023-10-12 17:37:26,273 INFO  L444   ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero.
[2023-10-12 17:37:26,273 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-10-12 17:37:26,273 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-10-12 17:37:26,274 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-10-12 17:37:26,276 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process
[2023-10-12 17:37:26,277 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2023-10-12 17:37:26,284 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2023-10-12 17:37:26,284 INFO  L513          LassoAnalysis]: Proved termination.
[2023-10-12 17:37:26,284 INFO  L515          LassoAnalysis]: Termination argument consisting of:
Ranking function f(N, i2) = 1*N - 1*i2
Supporting invariants []
[2023-10-12 17:37:26,289 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0
[2023-10-12 17:37:26,290 INFO  L156   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2023-10-12 17:37:26,306 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:37:26,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-12 17:37:26,313 INFO  L262         TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core
[2023-10-12 17:37:26,313 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-10-12 17:37:26,322 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-12 17:37:26,323 WARN  L260         TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-12 17:37:26,323 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-10-12 17:37:26,324 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-12 17:37:26,324 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates 
[2023-10-12 17:37:26,372 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 
[2023-10-12 17:37:26,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-12 17:37:26,374 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions.
[2023-10-12 17:37:26,374 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 100 transitions. Stem has 4 letters. Loop has 1 letters.
[2023-10-12 17:37:26,375 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2023-10-12 17:37:26,375 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 100 transitions. Stem has 5 letters. Loop has 1 letters.
[2023-10-12 17:37:26,375 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2023-10-12 17:37:26,375 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 100 transitions. Stem has 4 letters. Loop has 2 letters.
[2023-10-12 17:37:26,375 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2023-10-12 17:37:26,375 INFO  L430   stractBuchiCegarLoop]: Abstraction has has 33 places, 288 transitions, 1968 flow
[2023-10-12 17:37:26,375 INFO  L337   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2023-10-12 17:37:26,376 INFO  L67            RabinIsEmpty]: Start rabinIsEmpty. Operand has 33 places, 288 transitions, 1968 flow
[2023-10-12 17:37:26,381 ERROR L47    etriNetUnfolderRabin]: [1:1A:[78] $Ultimate##0-->$Ultimate##0: Formula: (= v_sum1Thread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{sum1Thread1of1ForFork0_x=v_sum1Thread1of1ForFork0_x_2, sum1Thread1of1ForFork0_thidvar0=v_sum1Thread1of1ForFork0_thidvar0_2}  AuxVars[]  AssignedVars[sum1Thread1of1ForFork0_x, sum1Thread1of1ForFork0_thidvar0][178], 3:2A:[81] L57-->$Ultimate##0: Formula: (and (= 2 v_sum2Thread1of1ForFork1_thidvar0_2) (= 2 v_sum2Thread1of1ForFork1_thidvar1_2))  InVars {}  OutVars{sum2Thread1of1ForFork1_thidvar0=v_sum2Thread1of1ForFork1_thidvar0_2, sum2Thread1of1ForFork1_thidvar1=v_sum2Thread1of1ForFork1_thidvar1_2, sum2Thread1of1ForFork1_y=v_sum2Thread1of1ForFork1_y_2}  AuxVars[]  AssignedVars[sum2Thread1of1ForFork1_thidvar0, sum2Thread1of1ForFork1_thidvar1, sum2Thread1of1ForFork1_y][194], 5:3A:[84] L58-->L46: Formula: (and (= 3 v_bankThread1of1ForFork2_thidvar2_2) (= 3 v_bankThread1of1ForFork2_thidvar0_2) (= 3 v_bankThread1of1ForFork2_thidvar1_2))  InVars {}  OutVars{bankThread1of1ForFork2_thidvar0=v_bankThread1of1ForFork2_thidvar0_2, bankThread1of1ForFork2_thidvar1=v_bankThread1of1ForFork2_thidvar1_2, bankThread1of1ForFork2_thidvar2=v_bankThread1of1ForFork2_thidvar2_2}  AuxVars[]  AssignedVars[bankThread1of1ForFork2_thidvar0, bankThread1of1ForFork2_thidvar1, bankThread1of1ForFork2_thidvar2][50]][16:4A:[74] L46-->L48: Formula: (= v_B_1 (store v_B_2 (+ (- 1) v_i1_7) v_sum1_4))  InVars {sum1=v_sum1_4, i1=v_i1_7, B=v_B_2}  OutVars{sum1=v_sum1_4, i1=v_i1_7, B=v_B_1}  AuxVars[]  AssignedVars[B][98], 17:5A:[75] L48-->L46: Formula: (= v_B_3 (store v_B_4 (+ (- 1) v_i2_7) v_sum2_4))  InVars {sum2=v_sum2_4, i2=v_i2_7, B=v_B_4}  OutVars{sum2=v_sum2_4, i2=v_i2_7, B=v_B_3}  AuxVars[]  AssignedVars[B][114]]
[2023-10-12 17:37:26,381 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-10-12 17:37:26,381 INFO  L124   PetriNetUnfolderBase]: 6/16 cut-off events.
[2023-10-12 17:37:26,381 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2023-10-12 17:37:26,382 INFO  L72            RabinIsEmpty]: Finished rabinIsEmpty language is not empty
[2023-10-12 17:37:26,382 INFO  L748   eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [78] $Ultimate##0-->$Ultimate##0: Formula: (= v_sum1Thread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{sum1Thread1of1ForFork0_x=v_sum1Thread1of1ForFork0_x_2, sum1Thread1of1ForFork0_thidvar0=v_sum1Thread1of1ForFork0_thidvar0_2}  AuxVars[]  AssignedVars[sum1Thread1of1ForFork0_x, sum1Thread1of1ForFork0_thidvar0] 39#[L57, $Ultimate##0]true [81] L57-->$Ultimate##0: Formula: (and (= 2 v_sum2Thread1of1ForFork1_thidvar0_2) (= 2 v_sum2Thread1of1ForFork1_thidvar1_2))  InVars {}  OutVars{sum2Thread1of1ForFork1_thidvar0=v_sum2Thread1of1ForFork1_thidvar0_2, sum2Thread1of1ForFork1_thidvar1=v_sum2Thread1of1ForFork1_thidvar1_2, sum2Thread1of1ForFork1_y=v_sum2Thread1of1ForFork1_y_2}  AuxVars[]  AssignedVars[sum2Thread1of1ForFork1_thidvar0, sum2Thread1of1ForFork1_thidvar1, sum2Thread1of1ForFork1_y] 82#[$Ultimate##0, L58, $Ultimate##0]true [84] L58-->L46: Formula: (and (= 3 v_bankThread1of1ForFork2_thidvar2_2) (= 3 v_bankThread1of1ForFork2_thidvar0_2) (= 3 v_bankThread1of1ForFork2_thidvar1_2))  InVars {}  OutVars{bankThread1of1ForFork2_thidvar0=v_bankThread1of1ForFork2_thidvar0_2, bankThread1of1ForFork2_thidvar1=v_bankThread1of1ForFork2_thidvar1_2, bankThread1of1ForFork2_thidvar2=v_bankThread1of1ForFork2_thidvar2_2}  AuxVars[]  AssignedVars[bankThread1of1ForFork2_thidvar0, bankThread1of1ForFork2_thidvar1, bankThread1of1ForFork2_thidvar2] 123#[L59, $Ultimate##0, L46, $Ultimate##0]true 
[2023-10-12 17:37:26,382 INFO  L750   eck$LassoCheckResult]: Loop: 123#[L59, $Ultimate##0, L46, $Ultimate##0]true [74] L46-->L48: Formula: (= v_B_1 (store v_B_2 (+ (- 1) v_i1_7) v_sum1_4))  InVars {sum1=v_sum1_4, i1=v_i1_7, B=v_B_2}  OutVars{sum1=v_sum1_4, i1=v_i1_7, B=v_B_1}  AuxVars[]  AssignedVars[B] 126#[L59, $Ultimate##0, L48, $Ultimate##0]true [75] L48-->L46: Formula: (= v_B_3 (store v_B_4 (+ (- 1) v_i2_7) v_sum2_4))  InVars {sum2=v_sum2_4, i2=v_i2_7, B=v_B_4}  OutVars{sum2=v_sum2_4, i2=v_i2_7, B=v_B_3}  AuxVars[]  AssignedVars[B] 123#[L59, $Ultimate##0, L46, $Ultimate##0]true 
[2023-10-12 17:37:26,383 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:37:26,383 INFO  L85        PathProgramCache]: Analyzing trace with hash 107344, now seen corresponding path program 1 times
[2023-10-12 17:37:26,383 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-12 17:37:26,383 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032296466]
[2023-10-12 17:37:26,384 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-12 17:37:26,384 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-12 17:37:26,388 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:26,388 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:37:26,390 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:26,392 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-12 17:37:26,392 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:37:26,392 INFO  L85        PathProgramCache]: Analyzing trace with hash 3330, now seen corresponding path program 1 times
[2023-10-12 17:37:26,393 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-12 17:37:26,393 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797171470]
[2023-10-12 17:37:26,393 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-12 17:37:26,393 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-12 17:37:26,398 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:26,398 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:37:26,401 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:26,402 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-12 17:37:26,403 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:37:26,403 INFO  L85        PathProgramCache]: Analyzing trace with hash 103159953, now seen corresponding path program 1 times
[2023-10-12 17:37:26,403 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-12 17:37:26,403 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020984360]
[2023-10-12 17:37:26,403 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-12 17:37:26,404 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-12 17:37:26,413 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:26,413 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:37:26,416 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:26,418 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-12 17:37:26,514 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:26,514 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:37:26,518 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:37:26,543 INFO  L201        PluginConnector]: Adding new model sumsumbank.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:26 BoogieIcfgContainer
[2023-10-12 17:37:26,544 INFO  L131        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2023-10-12 17:37:26,545 INFO  L158              Benchmark]: Toolchain (without parser) took 2112.64ms. Allocated memory was 175.1MB in the beginning and 245.4MB in the end (delta: 70.3MB). Free memory was 128.5MB in the beginning and 151.8MB in the end (delta: -23.3MB). Peak memory consumption was 46.8MB. Max. memory is 8.0GB.
[2023-10-12 17:37:26,545 INFO  L158              Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 175.1MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 8.0GB.
[2023-10-12 17:37:26,547 INFO  L158              Benchmark]: Boogie Procedure Inliner took 27.98ms. Allocated memory is still 175.1MB. Free memory was 128.3MB in the beginning and 126.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2023-10-12 17:37:26,547 INFO  L158              Benchmark]: Boogie Preprocessor took 18.51ms. Allocated memory is still 175.1MB. Free memory was 126.7MB in the beginning and 125.8MB in the end (delta: 986.6kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2023-10-12 17:37:26,548 INFO  L158              Benchmark]: RCFGBuilder took 274.23ms. Allocated memory is still 175.1MB. Free memory was 125.7MB in the beginning and 115.9MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
[2023-10-12 17:37:26,548 INFO  L158              Benchmark]: BuchiAutomizer took 1786.47ms. Allocated memory was 175.1MB in the beginning and 245.4MB in the end (delta: 70.3MB). Free memory was 115.7MB in the beginning and 151.8MB in the end (delta: -36.1MB). Peak memory consumption was 34.2MB. Max. memory is 8.0GB.
[2023-10-12 17:37:26,550 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * Boogie PL CUP Parser took 0.27ms. Allocated memory is still 175.1MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 27.98ms. Allocated memory is still 175.1MB. Free memory was 128.3MB in the beginning and 126.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 18.51ms. Allocated memory is still 175.1MB. Free memory was 126.7MB in the beginning and 125.8MB in the end (delta: 986.6kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
 * RCFGBuilder took 274.23ms. Allocated memory is still 175.1MB. Free memory was 125.7MB in the beginning and 115.9MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
 * BuchiAutomizer took 1786.47ms. Allocated memory was 175.1MB in the beginning and 245.4MB in the end (delta: 70.3MB). Free memory was 115.7MB in the beginning and 151.8MB in the end (delta: -36.1MB). Peak memory consumption was 34.2MB. Max. memory is 8.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Constructed decomposition of program
    Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i1 and consists of 3 locations. One deterministic module has affine ranking function -1 * i2 + N and consists of 3 locations.  The remainder module has 1968 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 1.6s and 3 iterations.  TraceHistogramMax:0. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1.	Nontrivial modules had stage [2, 0, 0, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 0/0	HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94 IncrementalHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 78 mSDtfsCounter, 94 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown	LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks:   Lassos: inital29 mio100 ax100 hnf100 lsp80 ukn91 mio100 lsp57 div100 bol100 ite100 ukn100 eq183 hnf95 smp100 dnf100 smp100 tf100 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 47ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0	LassoNonterminationAnalysisSatUnbounded: 0	LassoNonterminationAnalysisUnsat: 0	LassoNonterminationAnalysisUnknown: 0	LassoNonterminationAnalysisTime: 0.0s	InitialAbstractionConstructionTime: 0.2s
  - TerminationAnalysisResult: Nontermination possible
    Buchi Automizer proved that your program is nonterminating for some inputs
  - LassoShapedNonTerminationArgument [Line: 46]: Nontermination argument in form of an infinite program execution.
    Nontermination argument in form of an infinite program execution.
Stem:
[L57]  FORK  0  fork 1 sum1();
[L58]  FORK  0  fork 2, 2 sum2();
[L59]  FORK  0  fork 3, 3, 3 bank();
Loop:
[L47]        B[i1 - 1] := sum1;
[L48]        B[i2 - 1] := sum2;
End of lasso representation.
  - StatisticsResult: NonterminationArgumentStatistics
    Fixpoint
  - NonterminatingLassoResult [Line: 46]: Nonterminating execution
    Found a nonterminating execution for the following lasso shaped sequence of statements.
Stem:
[L57]  FORK  0  fork 1 sum1();
[L58]  FORK  0  fork 2, 2 sum2();
[L59]  FORK  0  fork 3, 3, 3 bank();
Loop:
[L47]        B[i1 - 1] := sum1;
[L48]        B[i2 - 1] := sum2;
End of lasso representation.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 25 PlacesAfterwards, 23 TransitionsBefore, 18 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 214 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 142, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 109, independent: 103, independent conditional: 0, independent unconditional: 103, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 109, independent: 103, independent conditional: 0, independent unconditional: 103, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 142, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 109, unknown conditional: 0, unknown unconditional: 109] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
RESULT: Ultimate proved your program to be incorrect!
[2023-10-12 17:37:26,565 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0
[2023-10-12 17:37:26,764 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0
[2023-10-12 17:37:26,966 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0
Received shutdown request...