/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/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:25:09,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:25:09,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:25:09,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:25:09,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:25:09,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:25:09,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:25:09,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:25:09,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:25:09,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:25:09,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:25:09,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:25:09,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:25:09,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:25:09,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:25:09,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:25:09,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:25:09,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:25:09,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:25:09,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:25:09,742 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:25:09,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:25:09,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:25:09,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:25:09,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:25:09,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:25:09,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:25:09,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:25:09,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:25:09,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:25:09,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:25:09,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:25:09,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:25:09,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:25:09,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:25:09,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:25:09,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:25:09,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:25:09,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:25:09,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:25:09,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:25:09,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:25:09,805 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:25:09,856 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:25:09,857 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:25:09,858 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:25:09,858 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:25:09,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:25:09,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:25:09,860 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:25:09,861 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:25:09,861 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:25:09,862 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:25:09,862 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:25:09,863 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:25:09,863 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:25:09,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:25:09,863 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:25:09,863 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:25:09,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:25:09,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:25:09,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:25:09,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:25:09,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:25:09,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:25:09,865 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:25:09,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:25:09,865 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:25:09,865 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:25:09,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:25:09,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:25:09,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:25:09,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:25:09,867 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:25:09,870 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:25:09,870 INFO L138 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 [2022-07-22 12:25:10,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:25:10,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:25:10,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:25:10,281 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:25:10,281 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:25:10,283 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-07-22 12:25:10,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a57c1e8/d71e9e6163d648f2b2089e367c7f3f76/FLAGd94bb0e29 [2022-07-22 12:25:11,001 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:25:11,002 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-07-22 12:25:11,014 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a57c1e8/d71e9e6163d648f2b2089e367c7f3f76/FLAGd94bb0e29 [2022-07-22 12:25:11,335 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a57c1e8/d71e9e6163d648f2b2089e367c7f3f76 [2022-07-22 12:25:11,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:25:11,346 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:25:11,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:25:11,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:25:11,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:25:11,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:25:11" (1/1) ... [2022-07-22 12:25:11,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c71d12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:11, skipping insertion in model container [2022-07-22 12:25:11,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:25:11" (1/1) ... [2022-07-22 12:25:11,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:25:11,405 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:25:11,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c[3107,3120] [2022-07-22 12:25:11,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:25:11,763 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:25:11,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c[3107,3120] [2022-07-22 12:25:11,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:25:11,847 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:25:11,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:11 WrapperNode [2022-07-22 12:25:11,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:25:11,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:25:11,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:25:11,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:25:11,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:11" (1/1) ... [2022-07-22 12:25:11,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:11" (1/1) ... [2022-07-22 12:25:11,901 INFO L137 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 158 [2022-07-22 12:25:11,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:25:11,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:25:11,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:25:11,903 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:25:11,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:11" (1/1) ... [2022-07-22 12:25:11,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:11" (1/1) ... [2022-07-22 12:25:11,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:11" (1/1) ... [2022-07-22 12:25:11,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:11" (1/1) ... [2022-07-22 12:25:11,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:11" (1/1) ... [2022-07-22 12:25:11,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:11" (1/1) ... [2022-07-22 12:25:11,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:11" (1/1) ... [2022-07-22 12:25:11,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:25:11,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:25:11,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:25:11,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:25:11,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:11" (1/1) ... [2022-07-22 12:25:11,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:11,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:11,993 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) [2022-07-22 12:25:12,010 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 [2022-07-22 12:25:12,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:25:12,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:25:12,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:25:12,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:25:12,061 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:25:12,061 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:25:12,061 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:25:12,061 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:25:12,061 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 12:25:12,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 12:25:12,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:25:12,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:25:12,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:25:12,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:25:12,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:25:12,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:25:12,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:25:12,065 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:25:12,172 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:25:12,174 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:25:12,513 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:25:12,605 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:25:12,605 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:25:12,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:25:12 BoogieIcfgContainer [2022-07-22 12:25:12,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:25:12,609 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:25:12,610 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:25:12,614 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:25:12,615 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:25:12,615 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:25:11" (1/3) ... [2022-07-22 12:25:12,616 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42701007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:25:12, skipping insertion in model container [2022-07-22 12:25:12,617 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:25:12,617 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:11" (2/3) ... [2022-07-22 12:25:12,617 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42701007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:25:12, skipping insertion in model container [2022-07-22 12:25:12,617 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:25:12,617 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:25:12" (3/3) ... [2022-07-22 12:25:12,619 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2022-07-22 12:25:12,757 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 12:25:12,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 138 places, 141 transitions, 306 flow [2022-07-22 12:25:12,865 INFO L129 PetriNetUnfolder]: 10/135 cut-off events. [2022-07-22 12:25:12,865 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:25:12,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 10/135 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-07-22 12:25:12,872 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 141 transitions, 306 flow [2022-07-22 12:25:12,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 135 transitions, 288 flow [2022-07-22 12:25:12,886 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:25:12,903 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 135 transitions, 288 flow [2022-07-22 12:25:12,907 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 135 transitions, 288 flow [2022-07-22 12:25:12,907 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 288 flow [2022-07-22 12:25:12,948 INFO L129 PetriNetUnfolder]: 10/135 cut-off events. [2022-07-22 12:25:12,949 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:25:12,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 10/135 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-07-22 12:25:12,957 INFO L116 LiptonReduction]: Number of co-enabled transitions 1308 [2022-07-22 12:25:18,135 INFO L131 LiptonReduction]: Checked pairs total: 2030 [2022-07-22 12:25:18,135 INFO L133 LiptonReduction]: Total number of compositions: 129 [2022-07-22 12:25:18,160 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:25:18,160 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:25:18,161 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:25:18,161 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:25:18,161 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:25:18,161 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:25:18,161 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:25:18,161 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:25:18,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:25:18,232 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 85 [2022-07-22 12:25:18,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:18,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:18,239 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:25:18,239 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:18,239 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:25:18,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 128 states, but on-demand construction may add more states [2022-07-22 12:25:18,251 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 85 [2022-07-22 12:25:18,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:18,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:18,252 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:25:18,252 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:18,258 INFO L748 eck$LassoCheckResult]: Stem: 141#[ULTIMATE.startENTRY]don't care [574] ULTIMATE.startENTRY-->L127-6: Formula: (let ((.cse0 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 1)) (.cse2 (select |v_#memory_int_In_5| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse2 1) 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= 0 |v_#NULL.base_Out_2|) (= v_~queue~0.offset_Out_2 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_2|) (= 48 (select .cse2 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= v_~queue~0.base_Out_2 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (select |v_#valid_In_5| 2) 1) (= |v_#length_Out_2| (store (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~back~0_Out_10 v_~front~0_Out_2) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= 2 (select |v_#length_In_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#length_In_5| 2) 26) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_1|) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) (= v_~v_assert~0_Out_2 1) (= (select |v_#valid_In_5| 1) 1) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~front~0=v_~front~0_Out_2, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~back~0=v_~back~0_Out_10, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~v_assert~0=v_~v_assert~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~sum~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 144#[L127-6]don't care [2022-07-22 12:25:18,259 INFO L750 eck$LassoCheckResult]: Loop: 144#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 144#[L127-6]don't care [2022-07-22 12:25:18,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:18,266 INFO L85 PathProgramCache]: Analyzing trace with hash 605, now seen corresponding path program 1 times [2022-07-22 12:25:18,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:18,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062719788] [2022-07-22 12:25:18,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:18,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:18,444 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:18,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:18,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:18,495 INFO L85 PathProgramCache]: Analyzing trace with hash 588, now seen corresponding path program 1 times [2022-07-22 12:25:18,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:18,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743497224] [2022-07-22 12:25:18,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:18,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:18,507 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:18,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:18,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:18,518 INFO L85 PathProgramCache]: Analyzing trace with hash 19312, now seen corresponding path program 1 times [2022-07-22 12:25:18,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:18,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731973206] [2022-07-22 12:25:18,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:18,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:18,563 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:18,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:19,403 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:25:19,404 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:25:19,404 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:25:19,405 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:25:19,405 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:25:19,405 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:19,405 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:25:19,405 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:25:19,406 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-send-receive.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:25:19,406 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:25:19,406 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:25:19,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:19,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:20,465 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:25:20,471 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:25:20,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:20,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:20,481 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) [2022-07-22 12:25:20,482 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 [2022-07-22 12:25:20,486 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 [2022-07-22 12:25:20,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:20,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:20,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:20,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:20,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:20,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:20,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:20,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:20,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:20,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:20,577 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) [2022-07-22 12:25:20,579 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 [2022-07-22 12:25:20,579 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 [2022-07-22 12:25:20,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:20,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:20,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:20,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:20,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:20,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:20,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:20,631 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 [2022-07-22 12:25:20,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:20,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:20,633 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) [2022-07-22 12:25:20,634 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 [2022-07-22 12:25:20,635 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 [2022-07-22 12:25:20,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:20,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:20,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:20,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:20,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:20,644 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:20,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:20,685 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 [2022-07-22 12:25:20,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:20,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:20,687 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) [2022-07-22 12:25:20,688 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 [2022-07-22 12:25:20,689 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 [2022-07-22 12:25:20,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:20,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:20,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:20,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:20,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:20,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:20,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:20,707 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:20,729 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 [2022-07-22 12:25:20,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:20,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:20,731 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) [2022-07-22 12:25:20,732 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 [2022-07-22 12:25:20,733 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 [2022-07-22 12:25:20,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:20,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:20,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:20,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:20,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:20,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:20,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:20,797 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 [2022-07-22 12:25:20,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:20,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:20,799 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) [2022-07-22 12:25:20,805 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 [2022-07-22 12:25:20,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:20,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:20,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:20,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:20,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:20,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:20,821 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 [2022-07-22 12:25:20,830 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:20,868 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 [2022-07-22 12:25:20,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:20,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:20,870 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) [2022-07-22 12:25:20,874 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 [2022-07-22 12:25:20,878 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 [2022-07-22 12:25:20,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:20,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:20,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:20,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:20,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:20,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:20,906 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:25:20,938 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-22 12:25:20,939 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-07-22 12:25:20,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:20,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:20,946 INFO L229 MonitoredProcess]: Starting monitored process 9 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) [2022-07-22 12:25:20,952 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:25:20,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 12:25:20,983 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:25:20,983 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:25:20,984 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1, ULTIMATE.start_create_fresh_int_array_~i~0#1) = -1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 4*ULTIMATE.start_create_fresh_int_array_~i~0#1 Supporting invariants [] [2022-07-22 12:25:21,026 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 [2022-07-22 12:25:21,136 INFO L257 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 12:25:21,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:21,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:25:21,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:21,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:25:21,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:25:21,281 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:25:21,283 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 128 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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) [2022-07-22 12:25:21,333 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 128 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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) Result 130 states and 358 transitions. Complement of second has 3 states. [2022-07-22 12:25:21,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:25:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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) [2022-07-22 12:25:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:25:21,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:25:21,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:21,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:25:21,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:21,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:25:21,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:21,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 358 transitions. [2022-07-22 12:25:21,355 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 84 [2022-07-22 12:25:21,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 114 states and 322 transitions. [2022-07-22 12:25:21,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2022-07-22 12:25:21,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2022-07-22 12:25:21,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 322 transitions. [2022-07-22 12:25:21,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:25:21,370 INFO L220 hiAutomatonCegarLoop]: Abstraction has 114 states and 322 transitions. [2022-07-22 12:25:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 322 transitions. [2022-07-22 12:25:21,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-07-22 12:25:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 114 states have (on average 2.824561403508772) internal successors, (322), 113 states have internal predecessors, (322), 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) [2022-07-22 12:25:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 322 transitions. [2022-07-22 12:25:21,416 INFO L242 hiAutomatonCegarLoop]: Abstraction has 114 states and 322 transitions. [2022-07-22 12:25:21,416 INFO L425 stractBuchiCegarLoop]: Abstraction has 114 states and 322 transitions. [2022-07-22 12:25:21,416 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:25:21,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 322 transitions. [2022-07-22 12:25:21,420 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 84 [2022-07-22 12:25:21,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:21,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:21,421 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:25:21,421 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:25:21,422 INFO L748 eck$LassoCheckResult]: Stem: 858#[ULTIMATE.startENTRY]don't care [574] ULTIMATE.startENTRY-->L127-6: Formula: (let ((.cse0 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 1)) (.cse2 (select |v_#memory_int_In_5| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse2 1) 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= 0 |v_#NULL.base_Out_2|) (= v_~queue~0.offset_Out_2 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_2|) (= 48 (select .cse2 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= v_~queue~0.base_Out_2 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (select |v_#valid_In_5| 2) 1) (= |v_#length_Out_2| (store (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~back~0_Out_10 v_~front~0_Out_2) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= 2 (select |v_#length_In_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#length_In_5| 2) 26) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_1|) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) (= v_~v_assert~0_Out_2 1) (= (select |v_#valid_In_5| 1) 1) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~front~0=v_~front~0_Out_2, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~back~0=v_~back~0_Out_10, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~v_assert~0=v_~v_assert~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~sum~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 854#[L127-6]don't care [551] L127-6-->L110-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_30|)) (= (select |v_#valid_148| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) 1) (= (store |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23| (store (select |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_109|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_117| |v_ULTIMATE.start_main_~#t1~0#1.base_23|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| v_~queue~0.base_56) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| v_~queue~0.offset_56)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_110|, #length=|v_#length_117|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|} OutVars{~queue~0.offset=v_~queue~0.offset_56, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ~queue~0.base=v_~queue~0.base_56, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_21|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_109|, #length=|v_#length_117|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 838#[L110-3]don't care [436] L110-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_10|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 840#[thread1ENTRY, L110-4]don't care [402] thread1ENTRY-->L59: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork0_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 762#[L59, L110-4]don't care [2022-07-22 12:25:21,423 INFO L750 eck$LassoCheckResult]: Loop: 762#[L59, L110-4]don't care [491] L59-->L56: Formula: (let ((.cse0 (* v_~front~0_51 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_40))) (and (<= (+ .cse0 4 v_~queue~0.offset_40) (select |v_#length_69| v_~queue~0.base_40)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~front~0_51) (< v_~front~0_51 v_~n~0_28) (< v_~front~0_51 v_~back~0_77)) 1 0)) (= v_~sum~0_33 (+ v_~sum~0_34 (select (select |v_#memory_int_59| v_~queue~0.base_40) .cse1))) (= (+ v_~front~0_51 1) v_~front~0_50) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= (select |v_#valid_84| v_~queue~0.base_40) 1) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_15| 256) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (<= 0 .cse1)))) InVars {~sum~0=v_~sum~0_34, ~queue~0.offset=v_~queue~0.offset_40, #valid=|v_#valid_84|, ~back~0=v_~back~0_77, #memory_int=|v_#memory_int_59|, #length=|v_#length_69|, ~queue~0.base=v_~queue~0.base_40, ~n~0=v_~n~0_28, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|, ~front~0=v_~front~0_51} OutVars{~queue~0.offset=v_~queue~0.offset_40, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_9|, ~back~0=v_~back~0_77, ~queue~0.base=v_~queue~0.base_40, ~sum~0=v_~sum~0_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, #length=|v_#length_69|, ~n~0=v_~n~0_28, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_9|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|, ~front~0=v_~front~0_50} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] 766#[L56, L110-4]don't care [409] L56-->L59: Formula: (= v_~v_assert~0_2 |v_thread1Thread1of1ForFork0_~cond~0#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 762#[L59, L110-4]don't care [2022-07-22 12:25:21,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:21,424 INFO L85 PathProgramCache]: Analyzing trace with hash 18566984, now seen corresponding path program 1 times [2022-07-22 12:25:21,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:21,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494852826] [2022-07-22 12:25:21,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:21,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:21,470 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:21,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:21,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:21,505 INFO L85 PathProgramCache]: Analyzing trace with hash 16591, now seen corresponding path program 1 times [2022-07-22 12:25:21,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:21,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380644598] [2022-07-22 12:25:21,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:21,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:21,517 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:21,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:21,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:21,533 INFO L85 PathProgramCache]: Analyzing trace with hash 663018070, now seen corresponding path program 1 times [2022-07-22 12:25:21,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:21,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365408135] [2022-07-22 12:25:21,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:21,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:25:21,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:25:21,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365408135] [2022-07-22 12:25:21,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365408135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:25:21,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:25:21,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:25:21,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494743750] [2022-07-22 12:25:21,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:25:21,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:25:21,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:25:21,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:25:21,790 INFO L87 Difference]: Start difference. First operand 114 states and 322 transitions. cyclomatic complexity: 245 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-07-22 12:25:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:25:21,909 INFO L93 Difference]: Finished difference Result 177 states and 457 transitions. [2022-07-22 12:25:21,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 457 transitions. [2022-07-22 12:25:21,926 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 84 [2022-07-22 12:25:21,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 114 states and 321 transitions. [2022-07-22 12:25:21,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2022-07-22 12:25:21,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2022-07-22 12:25:21,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 321 transitions. [2022-07-22 12:25:21,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:25:21,940 INFO L220 hiAutomatonCegarLoop]: Abstraction has 114 states and 321 transitions. [2022-07-22 12:25:21,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 321 transitions. [2022-07-22 12:25:21,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-07-22 12:25:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 114 states have (on average 2.8157894736842106) internal successors, (321), 113 states have internal predecessors, (321), 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) [2022-07-22 12:25:21,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 321 transitions. [2022-07-22 12:25:21,967 INFO L242 hiAutomatonCegarLoop]: Abstraction has 114 states and 321 transitions. [2022-07-22 12:25:21,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:25:21,968 INFO L425 stractBuchiCegarLoop]: Abstraction has 114 states and 321 transitions. [2022-07-22 12:25:21,968 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:25:21,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 321 transitions. [2022-07-22 12:25:21,971 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 84 [2022-07-22 12:25:21,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:21,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:21,972 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:25:21,972 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:25:21,973 INFO L748 eck$LassoCheckResult]: Stem: 1274#[ULTIMATE.startENTRY]don't care [574] ULTIMATE.startENTRY-->L127-6: Formula: (let ((.cse0 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 1)) (.cse2 (select |v_#memory_int_In_5| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse2 1) 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= 0 |v_#NULL.base_Out_2|) (= v_~queue~0.offset_Out_2 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_2|) (= 48 (select .cse2 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= v_~queue~0.base_Out_2 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (select |v_#valid_In_5| 2) 1) (= |v_#length_Out_2| (store (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~back~0_Out_10 v_~front~0_Out_2) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= 2 (select |v_#length_In_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#length_In_5| 2) 26) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_1|) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) (= v_~v_assert~0_Out_2 1) (= (select |v_#valid_In_5| 1) 1) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~front~0=v_~front~0_Out_2, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~back~0=v_~back~0_Out_10, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~v_assert~0=v_~v_assert~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~sum~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1270#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 1272#[L127-6]don't care [551] L127-6-->L110-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_30|)) (= (select |v_#valid_148| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) 1) (= (store |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23| (store (select |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_109|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_117| |v_ULTIMATE.start_main_~#t1~0#1.base_23|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| v_~queue~0.base_56) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| v_~queue~0.offset_56)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_110|, #length=|v_#length_117|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|} OutVars{~queue~0.offset=v_~queue~0.offset_56, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ~queue~0.base=v_~queue~0.base_56, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_21|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_109|, #length=|v_#length_117|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 1254#[L110-3]don't care [436] L110-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_10|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 1256#[thread1ENTRY, L110-4]don't care [402] thread1ENTRY-->L59: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork0_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 1182#[L59, L110-4]don't care [2022-07-22 12:25:21,973 INFO L750 eck$LassoCheckResult]: Loop: 1182#[L59, L110-4]don't care [491] L59-->L56: Formula: (let ((.cse0 (* v_~front~0_51 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_40))) (and (<= (+ .cse0 4 v_~queue~0.offset_40) (select |v_#length_69| v_~queue~0.base_40)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~front~0_51) (< v_~front~0_51 v_~n~0_28) (< v_~front~0_51 v_~back~0_77)) 1 0)) (= v_~sum~0_33 (+ v_~sum~0_34 (select (select |v_#memory_int_59| v_~queue~0.base_40) .cse1))) (= (+ v_~front~0_51 1) v_~front~0_50) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= (select |v_#valid_84| v_~queue~0.base_40) 1) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_15| 256) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (<= 0 .cse1)))) InVars {~sum~0=v_~sum~0_34, ~queue~0.offset=v_~queue~0.offset_40, #valid=|v_#valid_84|, ~back~0=v_~back~0_77, #memory_int=|v_#memory_int_59|, #length=|v_#length_69|, ~queue~0.base=v_~queue~0.base_40, ~n~0=v_~n~0_28, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|, ~front~0=v_~front~0_51} OutVars{~queue~0.offset=v_~queue~0.offset_40, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_9|, ~back~0=v_~back~0_77, ~queue~0.base=v_~queue~0.base_40, ~sum~0=v_~sum~0_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, #length=|v_#length_69|, ~n~0=v_~n~0_28, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_9|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|, ~front~0=v_~front~0_50} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] 1186#[L56, L110-4]don't care [409] L56-->L59: Formula: (= v_~v_assert~0_2 |v_thread1Thread1of1ForFork0_~cond~0#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 1182#[L59, L110-4]don't care [2022-07-22 12:25:21,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:21,974 INFO L85 PathProgramCache]: Analyzing trace with hash 575867221, now seen corresponding path program 1 times [2022-07-22 12:25:21,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:21,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349026774] [2022-07-22 12:25:21,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:21,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:22,067 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:22,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:22,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:22,120 INFO L85 PathProgramCache]: Analyzing trace with hash 16591, now seen corresponding path program 2 times [2022-07-22 12:25:22,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:22,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166594882] [2022-07-22 12:25:22,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:22,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:22,140 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:22,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:22,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:22,152 INFO L85 PathProgramCache]: Analyzing trace with hash -642366173, now seen corresponding path program 1 times [2022-07-22 12:25:22,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:22,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748597708] [2022-07-22 12:25:22,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:22,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:25:22,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:25:22,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748597708] [2022-07-22 12:25:22,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748597708] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:25:22,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:25:22,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:25:22,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060003029] [2022-07-22 12:25:22,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:25:22,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:25:22,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:25:22,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:25:22,316 INFO L87 Difference]: Start difference. First operand 114 states and 321 transitions. cyclomatic complexity: 244 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) [2022-07-22 12:25:22,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:25:22,370 INFO L93 Difference]: Finished difference Result 140 states and 379 transitions. [2022-07-22 12:25:22,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 379 transitions. [2022-07-22 12:25:22,373 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 68 [2022-07-22 12:25:22,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 128 states and 349 transitions. [2022-07-22 12:25:22,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2022-07-22 12:25:22,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2022-07-22 12:25:22,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 349 transitions. [2022-07-22 12:25:22,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:25:22,407 INFO L220 hiAutomatonCegarLoop]: Abstraction has 128 states and 349 transitions. [2022-07-22 12:25:22,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 349 transitions. [2022-07-22 12:25:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 118. [2022-07-22 12:25:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 2.7711864406779663) internal successors, (327), 117 states have internal predecessors, (327), 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) [2022-07-22 12:25:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 327 transitions. [2022-07-22 12:25:22,421 INFO L242 hiAutomatonCegarLoop]: Abstraction has 118 states and 327 transitions. [2022-07-22 12:25:22,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:25:22,422 INFO L425 stractBuchiCegarLoop]: Abstraction has 118 states and 327 transitions. [2022-07-22 12:25:22,422 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:25:22,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 327 transitions. [2022-07-22 12:25:22,424 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 68 [2022-07-22 12:25:22,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:22,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:22,425 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:25:22,425 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:25:22,426 INFO L748 eck$LassoCheckResult]: Stem: 1654#[ULTIMATE.startENTRY]don't care [574] ULTIMATE.startENTRY-->L127-6: Formula: (let ((.cse0 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 1)) (.cse2 (select |v_#memory_int_In_5| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse2 1) 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= 0 |v_#NULL.base_Out_2|) (= v_~queue~0.offset_Out_2 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_2|) (= 48 (select .cse2 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= v_~queue~0.base_Out_2 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (select |v_#valid_In_5| 2) 1) (= |v_#length_Out_2| (store (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~back~0_Out_10 v_~front~0_Out_2) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= 2 (select |v_#length_In_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#length_In_5| 2) 26) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_1|) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) (= v_~v_assert~0_Out_2 1) (= (select |v_#valid_In_5| 1) 1) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~front~0=v_~front~0_Out_2, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~back~0=v_~back~0_Out_10, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~v_assert~0=v_~v_assert~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~sum~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1648#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 1650#[L127-6]don't care [551] L127-6-->L110-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_30|)) (= (select |v_#valid_148| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) 1) (= (store |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23| (store (select |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_109|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_117| |v_ULTIMATE.start_main_~#t1~0#1.base_23|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| v_~queue~0.base_56) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| v_~queue~0.offset_56)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_110|, #length=|v_#length_117|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|} OutVars{~queue~0.offset=v_~queue~0.offset_56, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ~queue~0.base=v_~queue~0.base_56, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_21|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_109|, #length=|v_#length_117|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 1634#[L110-3]don't care [436] L110-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_10|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 1636#[thread1ENTRY, L110-4]don't care [542] L110-4-->L111-3: Formula: (and (= (select |v_#valid_130| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (= |v_ULTIMATE.start_main_#t~pre12#1_21| |v_#pthreadsForks_35|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_99| |v_ULTIMATE.start_main_~#t2~0#1.base_23|)) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= (store |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre12#1_21|)) |v_#memory_int_95|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, #memory_int=|v_#memory_int_96|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_21|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_9|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_95|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 1478#[thread1ENTRY, L111-3]don't care [439] L111-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_10|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_10|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_12|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_14|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~b~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1482#[L111-4, thread1ENTRY, thread2ENTRY]don't care [483] thread2ENTRY-->L86: Formula: (and (= |v_thread2Thread1of1ForFork1_~b~0#1_17| 1) (= |v_thread2Thread1of1ForFork1_~cond~1#1_13| v_~v_assert~0_13)) InVars {~v_assert~0=v_~v_assert~0_13} OutVars{~v_assert~0=v_~v_assert~0_13, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_13|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~b~0#1] 1646#[L111-4, L86, thread1ENTRY]don't care [570] L86-->L81: Formula: (and (let ((.cse9 (* v_~back~0_In_3 4))) (let ((.cse8 (+ v_~queue~0.offset_In_3 .cse9))) (let ((.cse0 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)) (.cse1 (<= 0 .cse8)) (.cse2 (= (+ v_~back~0_In_3 1) v_~back~0_Out_6)) (.cse3 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_In_3| 256) 0)) (.cse4 (<= (+ v_~queue~0.offset_In_3 4 .cse9) (select |v_#length_In_3| v_~queue~0.base_In_3))) (.cse5 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse8)) (.cse6 (= (select |v_#valid_In_3| v_~queue~0.base_In_3) 1)) (.cse7 (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (= .cse5 1) 1 0)) .cse6 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post6#1_In_3| |v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|) .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem3#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|) .cse3 .cse4 (= (ite (= (- 1) .cse5) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post4#1_In_3| |v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|) .cse6 .cse7))))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_In_3| 256) 0)) (not (= (ite (and (<= 0 v_~back~0_In_3) (< v_~back~0_In_3 v_~n~0_In_1)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_In_3|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_In_3|, ~back~0=v_~back~0_In_3, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_In_3|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|, ~back~0=v_~back~0_Out_6, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] 1626#[L111-4, thread1ENTRY, L81]don't care [2022-07-22 12:25:22,427 INFO L750 eck$LassoCheckResult]: Loop: 1626#[L111-4, thread1ENTRY, L81]don't care [525] L81-->L86: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~1#1_19| v_~v_assert~0_17) (= (ite (= (ite (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_20| 256) 0) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~b~0#1_19|)) InVars {~v_assert~0=v_~v_assert~0_17, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_20|} OutVars{~v_assert~0=v_~v_assert~0_17, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_19|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~b~0#1] 1628#[L111-4, L86, thread1ENTRY]don't care [570] L86-->L81: Formula: (and (let ((.cse9 (* v_~back~0_In_3 4))) (let ((.cse8 (+ v_~queue~0.offset_In_3 .cse9))) (let ((.cse0 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)) (.cse1 (<= 0 .cse8)) (.cse2 (= (+ v_~back~0_In_3 1) v_~back~0_Out_6)) (.cse3 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_In_3| 256) 0)) (.cse4 (<= (+ v_~queue~0.offset_In_3 4 .cse9) (select |v_#length_In_3| v_~queue~0.base_In_3))) (.cse5 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse8)) (.cse6 (= (select |v_#valid_In_3| v_~queue~0.base_In_3) 1)) (.cse7 (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (= .cse5 1) 1 0)) .cse6 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post6#1_In_3| |v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|) .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem3#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|) .cse3 .cse4 (= (ite (= (- 1) .cse5) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post4#1_In_3| |v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|) .cse6 .cse7))))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_In_3| 256) 0)) (not (= (ite (and (<= 0 v_~back~0_In_3) (< v_~back~0_In_3 v_~n~0_In_1)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_In_3|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_In_3|, ~back~0=v_~back~0_In_3, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_In_3|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|, ~back~0=v_~back~0_Out_6, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] 1626#[L111-4, thread1ENTRY, L81]don't care [2022-07-22 12:25:22,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:22,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1565608749, now seen corresponding path program 1 times [2022-07-22 12:25:22,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:22,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828586610] [2022-07-22 12:25:22,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:22,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:22,472 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:22,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:22,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:22,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:22,545 INFO L85 PathProgramCache]: Analyzing trace with hash 17806, now seen corresponding path program 1 times [2022-07-22 12:25:22,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:22,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563106151] [2022-07-22 12:25:22,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:22,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:22,574 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:22,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:22,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:22,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1311471034, now seen corresponding path program 1 times [2022-07-22 12:25:22,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:22,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841114433] [2022-07-22 12:25:22,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:22,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:25:22,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:25:22,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841114433] [2022-07-22 12:25:22,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841114433] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:25:22,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831298625] [2022-07-22 12:25:22,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:22,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:25:22,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:22,702 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 12:25:22,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 12:25:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:22,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-22 12:25:22,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:23,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-22 12:25:23,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2022-07-22 12:25:23,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:25:23,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:25:23,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 142 [2022-07-22 12:25:23,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 138 [2022-07-22 12:25:23,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 134 [2022-07-22 12:25:23,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:25:23,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831298625] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:25:23,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:25:23,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2022-07-22 12:25:23,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090362075] [2022-07-22 12:25:23,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:25:23,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:25:23,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 12:25:23,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-07-22 12:25:23,783 INFO L87 Difference]: Start difference. First operand 118 states and 327 transitions. cyclomatic complexity: 238 Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 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) [2022-07-22 12:25:24,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:25:24,253 INFO L93 Difference]: Finished difference Result 262 states and 687 transitions. [2022-07-22 12:25:24,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 262 states and 687 transitions. [2022-07-22 12:25:24,257 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 108 [2022-07-22 12:25:24,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 262 states to 212 states and 563 transitions. [2022-07-22 12:25:24,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2022-07-22 12:25:24,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 210 [2022-07-22 12:25:24,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 563 transitions. [2022-07-22 12:25:24,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:25:24,264 INFO L220 hiAutomatonCegarLoop]: Abstraction has 212 states and 563 transitions. [2022-07-22 12:25:24,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 563 transitions. [2022-07-22 12:25:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 184. [2022-07-22 12:25:24,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 184 states have (on average 2.739130434782609) internal successors, (504), 183 states have internal predecessors, (504), 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) [2022-07-22 12:25:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 504 transitions. [2022-07-22 12:25:24,278 INFO L242 hiAutomatonCegarLoop]: Abstraction has 184 states and 504 transitions. [2022-07-22 12:25:24,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 12:25:24,279 INFO L425 stractBuchiCegarLoop]: Abstraction has 184 states and 504 transitions. [2022-07-22 12:25:24,279 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:25:24,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 504 transitions. [2022-07-22 12:25:24,281 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 92 [2022-07-22 12:25:24,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:24,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:24,282 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:25:24,282 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:25:24,283 INFO L748 eck$LassoCheckResult]: Stem: 2283#[ULTIMATE.startENTRY]don't care [574] ULTIMATE.startENTRY-->L127-6: Formula: (let ((.cse0 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 1)) (.cse2 (select |v_#memory_int_In_5| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse2 1) 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= 0 |v_#NULL.base_Out_2|) (= v_~queue~0.offset_Out_2 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_2|) (= 48 (select .cse2 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= v_~queue~0.base_Out_2 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (select |v_#valid_In_5| 2) 1) (= |v_#length_Out_2| (store (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~back~0_Out_10 v_~front~0_Out_2) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= 2 (select |v_#length_In_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#length_In_5| 2) 26) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_1|) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) (= v_~v_assert~0_Out_2 1) (= (select |v_#valid_In_5| 1) 1) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~front~0=v_~front~0_Out_2, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~back~0=v_~back~0_Out_10, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~v_assert~0=v_~v_assert~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~sum~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2271#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 2273#[L127-6]don't care [551] L127-6-->L110-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_30|)) (= (select |v_#valid_148| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) 1) (= (store |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23| (store (select |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_109|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_117| |v_ULTIMATE.start_main_~#t1~0#1.base_23|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| v_~queue~0.base_56) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| v_~queue~0.offset_56)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_110|, #length=|v_#length_117|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|} OutVars{~queue~0.offset=v_~queue~0.offset_56, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ~queue~0.base=v_~queue~0.base_56, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_21|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_109|, #length=|v_#length_117|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 2245#[L110-3]don't care [436] L110-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_10|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 2247#[thread1ENTRY, L110-4]don't care [402] thread1ENTRY-->L59: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork0_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 2135#[L59, L110-4]don't care [542] L110-4-->L111-3: Formula: (and (= (select |v_#valid_130| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (= |v_ULTIMATE.start_main_#t~pre12#1_21| |v_#pthreadsForks_35|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_99| |v_ULTIMATE.start_main_~#t2~0#1.base_23|)) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= (store |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre12#1_21|)) |v_#memory_int_95|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, #memory_int=|v_#memory_int_96|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_21|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_9|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_95|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 2073#[L59, L111-3]don't care [439] L111-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_10|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_10|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_12|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_14|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~b~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 2253#[L111-4, thread2ENTRY, L59]don't care [483] thread2ENTRY-->L86: Formula: (and (= |v_thread2Thread1of1ForFork1_~b~0#1_17| 1) (= |v_thread2Thread1of1ForFork1_~cond~1#1_13| v_~v_assert~0_13)) InVars {~v_assert~0=v_~v_assert~0_13} OutVars{~v_assert~0=v_~v_assert~0_13, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_13|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~b~0#1] 2255#[L111-4, L86, L59]don't care [570] L86-->L81: Formula: (and (let ((.cse9 (* v_~back~0_In_3 4))) (let ((.cse8 (+ v_~queue~0.offset_In_3 .cse9))) (let ((.cse0 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)) (.cse1 (<= 0 .cse8)) (.cse2 (= (+ v_~back~0_In_3 1) v_~back~0_Out_6)) (.cse3 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_In_3| 256) 0)) (.cse4 (<= (+ v_~queue~0.offset_In_3 4 .cse9) (select |v_#length_In_3| v_~queue~0.base_In_3))) (.cse5 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse8)) (.cse6 (= (select |v_#valid_In_3| v_~queue~0.base_In_3) 1)) (.cse7 (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (= .cse5 1) 1 0)) .cse6 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post6#1_In_3| |v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|) .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem3#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|) .cse3 .cse4 (= (ite (= (- 1) .cse5) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post4#1_In_3| |v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|) .cse6 .cse7))))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_In_3| 256) 0)) (not (= (ite (and (<= 0 v_~back~0_In_3) (< v_~back~0_In_3 v_~n~0_In_1)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_In_3|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_In_3|, ~back~0=v_~back~0_In_3, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_In_3|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|, ~back~0=v_~back~0_Out_6, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] 2267#[L111-4, L81, L59]don't care [2022-07-22 12:25:24,284 INFO L750 eck$LassoCheckResult]: Loop: 2267#[L111-4, L81, L59]don't care [491] L59-->L56: Formula: (let ((.cse0 (* v_~front~0_51 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_40))) (and (<= (+ .cse0 4 v_~queue~0.offset_40) (select |v_#length_69| v_~queue~0.base_40)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~front~0_51) (< v_~front~0_51 v_~n~0_28) (< v_~front~0_51 v_~back~0_77)) 1 0)) (= v_~sum~0_33 (+ v_~sum~0_34 (select (select |v_#memory_int_59| v_~queue~0.base_40) .cse1))) (= (+ v_~front~0_51 1) v_~front~0_50) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= (select |v_#valid_84| v_~queue~0.base_40) 1) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_15| 256) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (<= 0 .cse1)))) InVars {~sum~0=v_~sum~0_34, ~queue~0.offset=v_~queue~0.offset_40, #valid=|v_#valid_84|, ~back~0=v_~back~0_77, #memory_int=|v_#memory_int_59|, #length=|v_#length_69|, ~queue~0.base=v_~queue~0.base_40, ~n~0=v_~n~0_28, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|, ~front~0=v_~front~0_51} OutVars{~queue~0.offset=v_~queue~0.offset_40, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_9|, ~back~0=v_~back~0_77, ~queue~0.base=v_~queue~0.base_40, ~sum~0=v_~sum~0_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, #length=|v_#length_69|, ~n~0=v_~n~0_28, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_9|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|, ~front~0=v_~front~0_50} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] 2269#[L56, L111-4, L81]don't care [409] L56-->L59: Formula: (= v_~v_assert~0_2 |v_thread1Thread1of1ForFork0_~cond~0#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 2267#[L111-4, L81, L59]don't care [2022-07-22 12:25:24,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:24,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1162962085, now seen corresponding path program 1 times [2022-07-22 12:25:24,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:24,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632060635] [2022-07-22 12:25:24,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:24,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,346 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:24,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:24,434 INFO L85 PathProgramCache]: Analyzing trace with hash 16591, now seen corresponding path program 3 times [2022-07-22 12:25:24,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:24,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273823971] [2022-07-22 12:25:24,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:24,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,449 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:24,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:24,463 INFO L85 PathProgramCache]: Analyzing trace with hash 915082355, now seen corresponding path program 1 times [2022-07-22 12:25:24,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:24,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700934453] [2022-07-22 12:25:24,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:24,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,532 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:26,963 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:25:26,963 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:25:26,963 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:25:26,963 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:25:26,963 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:25:26,963 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:26,963 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:25:26,964 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:25:26,964 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-send-receive.wvr.c_BEv2_Iteration5_Lasso [2022-07-22 12:25:26,964 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:25:26,964 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:25:26,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:26,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:26,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:26,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:26,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:26,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:26,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:26,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:28,916 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:25:28,917 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:25:28,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:28,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:28,920 INFO L229 MonitoredProcess]: Starting monitored process 11 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) [2022-07-22 12:25:28,938 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 [2022-07-22 12:25:28,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 12:25:28,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:28,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:28,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:28,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:28,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:28,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:28,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:29,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:29,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:29,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:29,006 INFO L229 MonitoredProcess]: Starting monitored process 12 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) [2022-07-22 12:25:29,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 12:25:29,010 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 [2022-07-22 12:25:29,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:29,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:29,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:29,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:29,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:29,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:29,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:29,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:29,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-22 12:25:29,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:29,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:29,071 INFO L229 MonitoredProcess]: Starting monitored process 13 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) [2022-07-22 12:25:29,077 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 [2022-07-22 12:25:29,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:29,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:29,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:29,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:29,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:29,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:29,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:29,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 12:25:29,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:29,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:29,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:29,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:29,140 INFO L229 MonitoredProcess]: Starting monitored process 14 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) [2022-07-22 12:25:29,145 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 [2022-07-22 12:25:29,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 12:25:29,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:29,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:29,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:29,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:29,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:29,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:29,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:29,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:29,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-22 12:25:29,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:29,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:29,178 INFO L229 MonitoredProcess]: Starting monitored process 15 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) [2022-07-22 12:25:29,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 12:25:29,179 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 [2022-07-22 12:25:29,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:29,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:29,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:29,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:29,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:29,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:29,197 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:29,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:29,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:29,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:29,220 INFO L229 MonitoredProcess]: Starting monitored process 16 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) [2022-07-22 12:25:29,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 12:25:29,221 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 [2022-07-22 12:25:29,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:29,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:29,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:29,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:29,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:29,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:29,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:29,230 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:29,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:29,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:29,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:29,253 INFO L229 MonitoredProcess]: Starting monitored process 17 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) [2022-07-22 12:25:29,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 12:25:29,261 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 [2022-07-22 12:25:29,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:29,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:29,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:29,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:29,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:29,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:29,287 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:29,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:29,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:29,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:29,323 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2022-07-22 12:25:29,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 12:25:29,325 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 [2022-07-22 12:25:29,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:29,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:29,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:29,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:29,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:29,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:29,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:29,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-07-22 12:25:29,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:29,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:29,395 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2022-07-22 12:25:29,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 12:25:29,397 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 [2022-07-22 12:25:29,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:29,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:29,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:29,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:29,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:29,405 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:29,408 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:29,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:29,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:29,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:29,431 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2022-07-22 12:25:29,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 12:25:29,436 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 [2022-07-22 12:25:29,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:29,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:29,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:29,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:29,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:29,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:29,447 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:29,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-22 12:25:29,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:29,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:29,470 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2022-07-22 12:25:29,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 12:25:29,475 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 [2022-07-22 12:25:29,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:29,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:29,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:29,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:29,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:29,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:29,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:29,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:29,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:29,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:29,511 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2022-07-22 12:25:29,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 12:25:29,516 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 [2022-07-22 12:25:29,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:29,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:29,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:29,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:29,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:29,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:29,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:29,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:29,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:29,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:29,551 INFO L229 MonitoredProcess]: Starting monitored process 23 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) [2022-07-22 12:25:29,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 12:25:29,553 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 [2022-07-22 12:25:29,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:29,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:29,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:29,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:29,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:29,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:29,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:29,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:29,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:29,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:29,588 INFO L229 MonitoredProcess]: Starting monitored process 24 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) [2022-07-22 12:25:29,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 12:25:29,590 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 [2022-07-22 12:25:29,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:29,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:29,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:29,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:29,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:29,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:29,635 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:25:29,678 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-22 12:25:29,678 INFO L444 ModelExtractionUtils]: 22 out of 40 variables were initially zero. Simplification set additionally 15 variables to zero. [2022-07-22 12:25:29,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:29,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:29,685 INFO L229 MonitoredProcess]: Starting monitored process 25 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) [2022-07-22 12:25:29,689 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:25:29,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 12:25:29,700 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:25:29,700 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:25:29,700 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~back~0, ~front~0) = 1*~back~0 - 1*~front~0 Supporting invariants [] [2022-07-22 12:25:29,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:29,900 INFO L257 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2022-07-22 12:25:29,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:29,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:25:29,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:29,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 12:25:29,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:25:30,002 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:25:30,002 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 184 states and 504 transitions. cyclomatic complexity: 361 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-07-22 12:25:30,063 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 184 states and 504 transitions. cyclomatic complexity: 361. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Result 325 states and 931 transitions. Complement of second has 3 states. [2022-07-22 12:25:30,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:25:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-07-22 12:25:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 17 transitions. [2022-07-22 12:25:30,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 17 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 12:25:30,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:30,065 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:25:30,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:30,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:25:30,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:30,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 12:25:30,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:25:30,155 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:25:30,155 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 184 states and 504 transitions. cyclomatic complexity: 361 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-07-22 12:25:30,231 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 184 states and 504 transitions. cyclomatic complexity: 361. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Result 415 states and 1179 transitions. Complement of second has 5 states. [2022-07-22 12:25:30,231 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 [2022-07-22 12:25:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-07-22 12:25:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-07-22 12:25:30,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 12:25:30,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:30,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-22 12:25:30,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:30,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 9 letters. Loop has 4 letters. [2022-07-22 12:25:30,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:30,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 415 states and 1179 transitions. [2022-07-22 12:25:30,241 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 92 [2022-07-22 12:25:30,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 415 states to 378 states and 1079 transitions. [2022-07-22 12:25:30,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2022-07-22 12:25:30,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2022-07-22 12:25:30,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 378 states and 1079 transitions. [2022-07-22 12:25:30,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:25:30,249 INFO L220 hiAutomatonCegarLoop]: Abstraction has 378 states and 1079 transitions. [2022-07-22 12:25:30,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states and 1079 transitions. [2022-07-22 12:25:30,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 266. [2022-07-22 12:25:30,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 266 states have (on average 2.887218045112782) internal successors, (768), 265 states have internal predecessors, (768), 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) [2022-07-22 12:25:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 768 transitions. [2022-07-22 12:25:30,266 INFO L242 hiAutomatonCegarLoop]: Abstraction has 266 states and 768 transitions. [2022-07-22 12:25:30,266 INFO L425 stractBuchiCegarLoop]: Abstraction has 266 states and 768 transitions. [2022-07-22 12:25:30,266 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:25:30,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 266 states and 768 transitions. [2022-07-22 12:25:30,269 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 92 [2022-07-22 12:25:30,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:30,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:30,270 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:25:30,270 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:25:30,271 INFO L748 eck$LassoCheckResult]: Stem: 3735#[ULTIMATE.startENTRY]don't care [574] ULTIMATE.startENTRY-->L127-6: Formula: (let ((.cse0 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 1)) (.cse2 (select |v_#memory_int_In_5| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse2 1) 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= 0 |v_#NULL.base_Out_2|) (= v_~queue~0.offset_Out_2 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_2|) (= 48 (select .cse2 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= v_~queue~0.base_Out_2 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (select |v_#valid_In_5| 2) 1) (= |v_#length_Out_2| (store (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~back~0_Out_10 v_~front~0_Out_2) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= 2 (select |v_#length_In_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#length_In_5| 2) 26) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_1|) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) (= v_~v_assert~0_Out_2 1) (= (select |v_#valid_In_5| 1) 1) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~front~0=v_~front~0_Out_2, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~back~0=v_~back~0_Out_10, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~v_assert~0=v_~v_assert~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~sum~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3715#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 3717#[L127-6]don't care [551] L127-6-->L110-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_30|)) (= (select |v_#valid_148| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) 1) (= (store |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23| (store (select |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_109|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_117| |v_ULTIMATE.start_main_~#t1~0#1.base_23|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| v_~queue~0.base_56) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| v_~queue~0.offset_56)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_110|, #length=|v_#length_117|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|} OutVars{~queue~0.offset=v_~queue~0.offset_56, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ~queue~0.base=v_~queue~0.base_56, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_21|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_109|, #length=|v_#length_117|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 3657#[L110-3]don't care [436] L110-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_10|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 3659#[thread1ENTRY, L110-4]don't care [542] L110-4-->L111-3: Formula: (and (= (select |v_#valid_130| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (= |v_ULTIMATE.start_main_#t~pre12#1_21| |v_#pthreadsForks_35|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_99| |v_ULTIMATE.start_main_~#t2~0#1.base_23|)) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= (store |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre12#1_21|)) |v_#memory_int_95|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, #memory_int=|v_#memory_int_96|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_21|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_9|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_95|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 3431#[thread1ENTRY, L111-3]don't care [439] L111-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_10|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_10|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_12|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_14|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~b~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 3435#[L111-4, thread1ENTRY, thread2ENTRY]don't care [483] thread2ENTRY-->L86: Formula: (and (= |v_thread2Thread1of1ForFork1_~b~0#1_17| 1) (= |v_thread2Thread1of1ForFork1_~cond~1#1_13| v_~v_assert~0_13)) InVars {~v_assert~0=v_~v_assert~0_13} OutVars{~v_assert~0=v_~v_assert~0_13, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_13|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~b~0#1] 3699#[L111-4, L86, thread1ENTRY]don't care [570] L86-->L81: Formula: (and (let ((.cse9 (* v_~back~0_In_3 4))) (let ((.cse8 (+ v_~queue~0.offset_In_3 .cse9))) (let ((.cse0 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)) (.cse1 (<= 0 .cse8)) (.cse2 (= (+ v_~back~0_In_3 1) v_~back~0_Out_6)) (.cse3 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_In_3| 256) 0)) (.cse4 (<= (+ v_~queue~0.offset_In_3 4 .cse9) (select |v_#length_In_3| v_~queue~0.base_In_3))) (.cse5 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse8)) (.cse6 (= (select |v_#valid_In_3| v_~queue~0.base_In_3) 1)) (.cse7 (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (= .cse5 1) 1 0)) .cse6 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post6#1_In_3| |v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|) .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem3#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|) .cse3 .cse4 (= (ite (= (- 1) .cse5) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post4#1_In_3| |v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|) .cse6 .cse7))))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_In_3| 256) 0)) (not (= (ite (and (<= 0 v_~back~0_In_3) (< v_~back~0_In_3 v_~n~0_In_1)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_In_3|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_In_3|, ~back~0=v_~back~0_In_3, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_In_3|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|, ~back~0=v_~back~0_Out_6, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] 3701#[L111-4, thread1ENTRY, L81]don't care [402] thread1ENTRY-->L59: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork0_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 3851#[L111-4, L81, L59]don't care [2022-07-22 12:25:30,272 INFO L750 eck$LassoCheckResult]: Loop: 3851#[L111-4, L81, L59]don't care [491] L59-->L56: Formula: (let ((.cse0 (* v_~front~0_51 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_40))) (and (<= (+ .cse0 4 v_~queue~0.offset_40) (select |v_#length_69| v_~queue~0.base_40)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~front~0_51) (< v_~front~0_51 v_~n~0_28) (< v_~front~0_51 v_~back~0_77)) 1 0)) (= v_~sum~0_33 (+ v_~sum~0_34 (select (select |v_#memory_int_59| v_~queue~0.base_40) .cse1))) (= (+ v_~front~0_51 1) v_~front~0_50) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= (select |v_#valid_84| v_~queue~0.base_40) 1) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_15| 256) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (<= 0 .cse1)))) InVars {~sum~0=v_~sum~0_34, ~queue~0.offset=v_~queue~0.offset_40, #valid=|v_#valid_84|, ~back~0=v_~back~0_77, #memory_int=|v_#memory_int_59|, #length=|v_#length_69|, ~queue~0.base=v_~queue~0.base_40, ~n~0=v_~n~0_28, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|, ~front~0=v_~front~0_51} OutVars{~queue~0.offset=v_~queue~0.offset_40, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_9|, ~back~0=v_~back~0_77, ~queue~0.base=v_~queue~0.base_40, ~sum~0=v_~sum~0_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, #length=|v_#length_69|, ~n~0=v_~n~0_28, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_9|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|, ~front~0=v_~front~0_50} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] 3849#[L56, L111-4, L81]don't care [409] L56-->L59: Formula: (= v_~v_assert~0_2 |v_thread1Thread1of1ForFork0_~cond~0#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 3851#[L111-4, L81, L59]don't care [2022-07-22 12:25:30,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:30,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1289231365, now seen corresponding path program 2 times [2022-07-22 12:25:30,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:30,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430868186] [2022-07-22 12:25:30,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:30,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:30,308 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:30,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:30,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash 16591, now seen corresponding path program 4 times [2022-07-22 12:25:30,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:30,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071578845] [2022-07-22 12:25:30,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:30,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:30,346 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:30,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:30,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:30,391 INFO L85 PathProgramCache]: Analyzing trace with hash 2000776147, now seen corresponding path program 2 times [2022-07-22 12:25:30,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:30,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487490218] [2022-07-22 12:25:30,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:30,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:30,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:30,491 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:30,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:32,908 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:25:32,908 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:25:32,908 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:25:32,908 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:25:32,908 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:25:32,909 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:32,909 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:25:32,909 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:25:32,909 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-send-receive.wvr.c_BEv2_Iteration6_Lasso [2022-07-22 12:25:32,909 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:25:32,909 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:25:32,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:32,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:34,039 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:25:34,043 INFO L158 Benchmark]: Toolchain (without parser) took 22701.84ms. Allocated memory was 160.4MB in the beginning and 319.8MB in the end (delta: 159.4MB). Free memory was 134.0MB in the beginning and 214.1MB in the end (delta: -80.0MB). Peak memory consumption was 156.8MB. Max. memory is 8.0GB. [2022-07-22 12:25:34,044 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 160.4MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:25:34,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.46ms. Allocated memory is still 160.4MB. Free memory was 133.5MB in the beginning and 122.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:25:34,045 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.89ms. Allocated memory is still 160.4MB. Free memory was 122.4MB in the beginning and 120.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:25:34,045 INFO L158 Benchmark]: Boogie Preprocessor took 35.14ms. Allocated memory is still 160.4MB. Free memory was 120.4MB in the beginning and 118.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:25:34,046 INFO L158 Benchmark]: RCFGBuilder took 670.28ms. Allocated memory is still 160.4MB. Free memory was 118.8MB in the beginning and 98.4MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-07-22 12:25:34,046 INFO L158 Benchmark]: BuchiAutomizer took 21432.59ms. Allocated memory was 160.4MB in the beginning and 319.8MB in the end (delta: 159.4MB). Free memory was 98.3MB in the beginning and 214.1MB in the end (delta: -115.8MB). Peak memory consumption was 121.2MB. Max. memory is 8.0GB. [2022-07-22 12:25:34,049 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 160.4MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 498.46ms. Allocated memory is still 160.4MB. Free memory was 133.5MB in the beginning and 122.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.89ms. Allocated memory is still 160.4MB. Free memory was 122.4MB in the beginning and 120.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.14ms. Allocated memory is still 160.4MB. Free memory was 120.4MB in the beginning and 118.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 670.28ms. Allocated memory is still 160.4MB. Free memory was 118.8MB in the beginning and 98.4MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 21432.59ms. Allocated memory was 160.4MB in the beginning and 319.8MB in the end (delta: 159.4MB). Free memory was 98.3MB in the beginning and 214.1MB in the end (delta: -115.8MB). Peak memory consumption was 121.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 135 PlacesBefore, 31 PlacesAfterwards, 135 TransitionsBefore, 24 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 8 FixpointIterations, 74 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 6 ConcurrentYvCompositions, 7 ChoiceCompositions, 129 TotalNumberOfCompositions, 2030 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1569, positive: 1516, positive conditional: 0, positive unconditional: 1516, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 899, positive: 883, positive conditional: 0, positive unconditional: 883, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 899, positive: 883, positive conditional: 0, positive unconditional: 883, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 106, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1569, positive: 633, positive conditional: 0, positive unconditional: 633, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 899, unknown conditional: 0, unknown unconditional: 899] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:25:34,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-22 12:25:34,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...