./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76982ccfa15d5420010caf48ff31900a394710bc42d46403e291e5b0b2cbfb5b --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 02:53:44,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 02:53:44,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 02:53:44,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 02:53:44,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 02:53:44,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 02:53:44,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 02:53:44,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 02:53:44,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 02:53:44,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 02:53:44,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 02:53:44,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 02:53:44,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 02:53:44,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 02:53:44,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 02:53:44,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 02:53:44,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 02:53:44,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 02:53:44,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 02:53:44,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 02:53:44,950 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 02:53:44,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 02:53:44,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 02:53:44,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 02:53:44,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 02:53:44,962 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 02:53:44,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 02:53:44,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 02:53:44,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 02:53:44,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 02:53:44,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 02:53:44,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 02:53:44,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 02:53:44,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 02:53:44,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 02:53:44,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 02:53:44,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 02:53:44,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 02:53:44,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 02:53:44,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 02:53:44,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 02:53:44,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 02:53:44,976 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 02:53:44,997 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 02:53:44,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 02:53:44,998 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 02:53:44,998 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 02:53:45,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 02:53:45,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 02:53:45,001 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 02:53:45,001 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 02:53:45,001 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 02:53:45,002 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 02:53:45,002 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 02:53:45,002 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 02:53:45,002 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 02:53:45,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 02:53:45,002 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 02:53:45,002 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 02:53:45,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 02:53:45,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 02:53:45,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 02:53:45,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 02:53:45,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 02:53:45,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 02:53:45,003 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 02:53:45,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 02:53:45,004 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 02:53:45,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 02:53:45,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 02:53:45,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 02:53:45,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 02:53:45,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 02:53:45,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 02:53:45,007 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 02:53:45,007 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76982ccfa15d5420010caf48ff31900a394710bc42d46403e291e5b0b2cbfb5b [2022-07-22 02:53:45,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 02:53:45,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 02:53:45,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 02:53:45,359 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 02:53:45,359 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 02:53:45,361 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2022-07-22 02:53:45,408 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2b01950f/2d48eb77ec824f5b81928db6cdf18a1c/FLAG6bf84bdd2 [2022-07-22 02:53:45,773 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 02:53:45,773 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2022-07-22 02:53:45,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2b01950f/2d48eb77ec824f5b81928db6cdf18a1c/FLAG6bf84bdd2 [2022-07-22 02:53:46,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2b01950f/2d48eb77ec824f5b81928db6cdf18a1c [2022-07-22 02:53:46,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 02:53:46,178 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 02:53:46,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 02:53:46,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 02:53:46,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 02:53:46,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:53:46" (1/1) ... [2022-07-22 02:53:46,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e7bb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:46, skipping insertion in model container [2022-07-22 02:53:46,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:53:46" (1/1) ... [2022-07-22 02:53:46,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 02:53:46,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 02:53:46,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c[6803,6816] [2022-07-22 02:53:46,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:53:46,335 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 02:53:46,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c[6803,6816] [2022-07-22 02:53:46,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:53:46,416 INFO L208 MainTranslator]: Completed translation [2022-07-22 02:53:46,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:46 WrapperNode [2022-07-22 02:53:46,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 02:53:46,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 02:53:46,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 02:53:46,417 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 02:53:46,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:46" (1/1) ... [2022-07-22 02:53:46,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:46" (1/1) ... [2022-07-22 02:53:46,464 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240 [2022-07-22 02:53:46,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 02:53:46,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 02:53:46,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 02:53:46,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 02:53:46,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:46" (1/1) ... [2022-07-22 02:53:46,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:46" (1/1) ... [2022-07-22 02:53:46,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:46" (1/1) ... [2022-07-22 02:53:46,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:46" (1/1) ... [2022-07-22 02:53:46,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:46" (1/1) ... [2022-07-22 02:53:46,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:46" (1/1) ... [2022-07-22 02:53:46,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:46" (1/1) ... [2022-07-22 02:53:46,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 02:53:46,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 02:53:46,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 02:53:46,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 02:53:46,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:46" (1/1) ... [2022-07-22 02:53:46,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:53:46,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:53:46,546 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 02:53:46,564 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 02:53:46,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 02:53:46,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 02:53:46,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 02:53:46,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 02:53:46,676 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 02:53:46,677 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 02:53:46,912 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 02:53:46,918 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 02:53:46,918 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 02:53:46,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:53:46 BoogieIcfgContainer [2022-07-22 02:53:46,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 02:53:46,920 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 02:53:46,920 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 02:53:46,922 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 02:53:46,922 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:53:46,923 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 02:53:46" (1/3) ... [2022-07-22 02:53:46,923 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ec54cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:53:46, skipping insertion in model container [2022-07-22 02:53:46,923 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:53:46,924 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:46" (2/3) ... [2022-07-22 02:53:46,924 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ec54cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:53:46, skipping insertion in model container [2022-07-22 02:53:46,924 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:53:46,924 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:53:46" (3/3) ... [2022-07-22 02:53:46,925 INFO L354 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2022-07-22 02:53:46,976 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 02:53:46,977 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 02:53:46,977 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 02:53:46,977 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 02:53:46,977 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 02:53:46,977 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 02:53:46,977 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 02:53:46,978 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 02:53:46,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 78 states, 77 states have (on average 1.6623376623376624) internal successors, (128), 77 states have internal predecessors, (128), 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 02:53:46,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2022-07-22 02:53:46,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:53:46,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:53:47,003 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:53:47,003 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:53:47,003 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 02:53:47,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 78 states, 77 states have (on average 1.6623376623376624) internal successors, (128), 77 states have internal predecessors, (128), 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 02:53:47,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2022-07-22 02:53:47,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:53:47,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:53:47,007 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:53:47,008 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:53:47,012 INFO L752 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(47, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 37#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 11#L159true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 36#L159-1true init_#res#1 := init_~tmp~0#1; 21#L228true main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; 39#L275true assume 0 == main_~i2~0#1;assume false; 53#L275-2true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 16#L283-2true [2022-07-22 02:53:47,013 INFO L754 eck$LassoCheckResult]: Loop: 16#L283-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 75#L57true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 5#L61true assume !(node1_~m1~0#1 != ~nomsg~0); 44#L61-1true ~mode1~0 := 0; 61#L57-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 45#L92true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 24#L95true assume !(node2_~m2~0#1 != ~nomsg~0); 31#L95-1true ~mode2~0 := 0; 71#L92-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 4#L126true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 50#L129true assume !(node3_~m3~0#1 != ~nomsg~0); 42#L129-1true ~mode3~0 := 0; 72#L126-2true assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 69#L236true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 73#L236-1true check_#res#1 := check_~tmp~1#1; 74#L248true main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 13#L307true assume !(0 == assert_~arg#1 % 256); 17#L302true assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; 16#L283-2true [2022-07-22 02:53:47,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:53:47,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1898425706, now seen corresponding path program 1 times [2022-07-22 02:53:47,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:53:47,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594142927] [2022-07-22 02:53:47,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:53:47,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:53:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:53:47,131 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 02:53:47,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:53:47,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594142927] [2022-07-22 02:53:47,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594142927] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:53:47,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:53:47,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 02:53:47,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289845356] [2022-07-22 02:53:47,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:53:47,139 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:53:47,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:53:47,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1437480316, now seen corresponding path program 1 times [2022-07-22 02:53:47,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:53:47,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962442345] [2022-07-22 02:53:47,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:53:47,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:53:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:53:47,305 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 02:53:47,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:53:47,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962442345] [2022-07-22 02:53:47,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962442345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:53:47,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:53:47,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:53:47,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273549410] [2022-07-22 02:53:47,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:53:47,309 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:53:47,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:53:47,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 02:53:47,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 02:53:47,336 INFO L87 Difference]: Start difference. First operand has 78 states, 77 states have (on average 1.6623376623376624) internal successors, (128), 77 states have internal predecessors, (128), 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) Second operand has 2 states, 2 states have (on average 3.5) 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 02:53:47,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:53:47,353 INFO L93 Difference]: Finished difference Result 78 states and 125 transitions. [2022-07-22 02:53:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 02:53:47,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 125 transitions. [2022-07-22 02:53:47,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-07-22 02:53:47,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 73 states and 120 transitions. [2022-07-22 02:53:47,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2022-07-22 02:53:47,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2022-07-22 02:53:47,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 120 transitions. [2022-07-22 02:53:47,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:53:47,375 INFO L369 hiAutomatonCegarLoop]: Abstraction has 73 states and 120 transitions. [2022-07-22 02:53:47,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 120 transitions. [2022-07-22 02:53:47,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-07-22 02:53:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.643835616438356) internal successors, (120), 72 states have internal predecessors, (120), 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 02:53:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2022-07-22 02:53:47,397 INFO L392 hiAutomatonCegarLoop]: Abstraction has 73 states and 120 transitions. [2022-07-22 02:53:47,397 INFO L374 stractBuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2022-07-22 02:53:47,397 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 02:53:47,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 120 transitions. [2022-07-22 02:53:47,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-07-22 02:53:47,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:53:47,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:53:47,399 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:53:47,399 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:53:47,399 INFO L752 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(47, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 215#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 187#L159 assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 173#L159-1 init_#res#1 := init_~tmp~0#1; 199#L228 main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; 200#L275 assume !(0 == main_~i2~0#1); 219#L275-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 195#L283-2 [2022-07-22 02:53:47,400 INFO L754 eck$LassoCheckResult]: Loop: 195#L283-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 196#L57 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 174#L61 assume !(node1_~m1~0#1 != ~nomsg~0); 176#L61-1 ~mode1~0 := 0; 227#L57-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 228#L92 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 204#L95 assume !(node2_~m2~0#1 != ~nomsg~0); 184#L95-1 ~mode2~0 := 0; 211#L92-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 169#L126 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 170#L129 assume !(node3_~m3~0#1 != ~nomsg~0); 221#L129-1 ~mode3~0 := 0; 222#L126-2 assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 236#L236 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 210#L236-1 check_#res#1 := check_~tmp~1#1; 239#L248 main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 189#L307 assume !(0 == assert_~arg#1 % 256); 190#L302 assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; 195#L283-2 [2022-07-22 02:53:47,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:53:47,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1898425768, now seen corresponding path program 1 times [2022-07-22 02:53:47,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:53:47,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713612608] [2022-07-22 02:53:47,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:53:47,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:53:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:53:47,456 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 02:53:47,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:53:47,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713612608] [2022-07-22 02:53:47,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713612608] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:53:47,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:53:47,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:53:47,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178099964] [2022-07-22 02:53:47,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:53:47,458 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:53:47,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:53:47,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1437480316, now seen corresponding path program 2 times [2022-07-22 02:53:47,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:53:47,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894425538] [2022-07-22 02:53:47,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:53:47,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:53:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:53:47,519 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 02:53:47,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:53:47,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894425538] [2022-07-22 02:53:47,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894425538] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:53:47,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:53:47,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:53:47,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270987099] [2022-07-22 02:53:47,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:53:47,520 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:53:47,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:53:47,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 02:53:47,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 02:53:47,521 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. cyclomatic complexity: 48 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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 02:53:47,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:53:47,608 INFO L93 Difference]: Finished difference Result 126 states and 202 transitions. [2022-07-22 02:53:47,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 02:53:47,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 202 transitions. [2022-07-22 02:53:47,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-07-22 02:53:47,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 123 states and 183 transitions. [2022-07-22 02:53:47,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2022-07-22 02:53:47,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2022-07-22 02:53:47,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 183 transitions. [2022-07-22 02:53:47,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:53:47,613 INFO L369 hiAutomatonCegarLoop]: Abstraction has 123 states and 183 transitions. [2022-07-22 02:53:47,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 183 transitions. [2022-07-22 02:53:47,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 73. [2022-07-22 02:53:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 72 states have internal predecessors, (103), 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 02:53:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2022-07-22 02:53:47,616 INFO L392 hiAutomatonCegarLoop]: Abstraction has 73 states and 103 transitions. [2022-07-22 02:53:47,617 INFO L374 stractBuchiCegarLoop]: Abstraction has 73 states and 103 transitions. [2022-07-22 02:53:47,617 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 02:53:47,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 103 transitions. [2022-07-22 02:53:47,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-07-22 02:53:47,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:53:47,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:53:47,618 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:53:47,618 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:53:47,619 INFO L752 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(47, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 429#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 401#L159 assume 0 == ~r1~0; 402#L160 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 407#L161 assume ~id1~0 >= 0; 408#L162 assume 0 == ~st1~0; 426#L163 assume ~send1~0 == ~id1~0; 411#L164 assume 0 == ~mode1~0 % 256; 405#L165 assume ~id2~0 >= 0; 406#L166 assume 0 == ~st2~0; 415#L167 assume ~send2~0 == ~id2~0; 395#L168 assume 0 == ~mode2~0 % 256; 396#L169 assume ~id3~0 >= 0; 449#L170 assume 0 == ~st3~0; 434#L171 assume ~send3~0 == ~id3~0; 430#L172 assume 0 == ~mode3~0 % 256; 431#L173 assume ~id1~0 != ~id2~0; 448#L174 assume ~id1~0 != ~id3~0; 386#L175 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 387#L159-1 init_#res#1 := init_~tmp~0#1; 413#L228 main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; 414#L275 assume !(0 == main_~i2~0#1); 432#L275-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 409#L283-2 [2022-07-22 02:53:47,619 INFO L754 eck$LassoCheckResult]: Loop: 409#L283-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 410#L57 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 388#L61 assume !(node1_~m1~0#1 != ~nomsg~0); 390#L61-1 ~mode1~0 := 0; 439#L57-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 440#L92 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 418#L95 assume !(node2_~m2~0#1 != ~nomsg~0); 398#L95-1 ~mode2~0 := 0; 425#L92-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 383#L126 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 384#L129 assume !(node3_~m3~0#1 != ~nomsg~0); 435#L129-1 ~mode3~0 := 0; 436#L126-2 assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 452#L236 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 424#L236-1 check_#res#1 := check_~tmp~1#1; 453#L248 main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 403#L307 assume !(0 == assert_~arg#1 % 256); 404#L302 assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; 409#L283-2 [2022-07-22 02:53:47,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:53:47,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 1 times [2022-07-22 02:53:47,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:53:47,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74326649] [2022-07-22 02:53:47,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:53:47,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:53:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:53:47,638 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:53:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:53:47,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:53:47,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:53:47,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1437480316, now seen corresponding path program 3 times [2022-07-22 02:53:47,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:53:47,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038631995] [2022-07-22 02:53:47,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:53:47,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:53:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:53:47,741 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 02:53:47,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:53:47,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038631995] [2022-07-22 02:53:47,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038631995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:53:47,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:53:47,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:53:47,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977245031] [2022-07-22 02:53:47,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:53:47,743 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:53:47,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:53:47,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 02:53:47,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 02:53:47,750 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. cyclomatic complexity: 31 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 02:53:47,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:53:47,790 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2022-07-22 02:53:47,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 02:53:47,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 105 transitions. [2022-07-22 02:53:47,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-07-22 02:53:47,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 73 states and 101 transitions. [2022-07-22 02:53:47,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2022-07-22 02:53:47,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2022-07-22 02:53:47,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 101 transitions. [2022-07-22 02:53:47,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:53:47,803 INFO L369 hiAutomatonCegarLoop]: Abstraction has 73 states and 101 transitions. [2022-07-22 02:53:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 101 transitions. [2022-07-22 02:53:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-07-22 02:53:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 72 states have internal predecessors, (101), 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 02:53:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2022-07-22 02:53:47,815 INFO L392 hiAutomatonCegarLoop]: Abstraction has 73 states and 101 transitions. [2022-07-22 02:53:47,815 INFO L374 stractBuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2022-07-22 02:53:47,815 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 02:53:47,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 101 transitions. [2022-07-22 02:53:47,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-07-22 02:53:47,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:53:47,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:53:47,818 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:53:47,820 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:53:47,820 INFO L752 eck$LassoCheckResult]: Stem: 607#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(47, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 590#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 562#L159 assume 0 == ~r1~0; 563#L160 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 568#L161 assume ~id1~0 >= 0; 569#L162 assume 0 == ~st1~0; 587#L163 assume ~send1~0 == ~id1~0; 573#L164 assume 0 == ~mode1~0 % 256; 566#L165 assume ~id2~0 >= 0; 567#L166 assume 0 == ~st2~0; 578#L167 assume ~send2~0 == ~id2~0; 556#L168 assume 0 == ~mode2~0 % 256; 557#L169 assume ~id3~0 >= 0; 610#L170 assume 0 == ~st3~0; 595#L171 assume ~send3~0 == ~id3~0; 591#L172 assume 0 == ~mode3~0 % 256; 592#L173 assume ~id1~0 != ~id2~0; 609#L174 assume ~id1~0 != ~id3~0; 547#L175 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 548#L159-1 init_#res#1 := init_~tmp~0#1; 574#L228 main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; 575#L275 assume !(0 == main_~i2~0#1); 593#L275-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 570#L283-2 [2022-07-22 02:53:47,820 INFO L754 eck$LassoCheckResult]: Loop: 570#L283-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 571#L57 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 549#L61 assume !(node1_~m1~0#1 != ~nomsg~0); 551#L61-1 ~mode1~0 := 0; 602#L57-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 603#L92 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 579#L95 assume !(node2_~m2~0#1 != ~nomsg~0); 559#L95-1 ~mode2~0 := 0; 586#L92-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 544#L126 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 545#L129 assume !(node3_~m3~0#1 != ~nomsg~0); 596#L129-1 ~mode3~0 := 0; 597#L126-2 assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 611#L236 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 588#L237 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 585#L236-1 check_#res#1 := check_~tmp~1#1; 614#L248 main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 564#L307 assume !(0 == assert_~arg#1 % 256); 565#L302 assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; 570#L283-2 [2022-07-22 02:53:47,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:53:47,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 2 times [2022-07-22 02:53:47,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:53:47,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639476483] [2022-07-22 02:53:47,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:53:47,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:53:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:53:47,848 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:53:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:53:47,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:53:47,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:53:47,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1995544096, now seen corresponding path program 1 times [2022-07-22 02:53:47,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:53:47,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349597015] [2022-07-22 02:53:47,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:53:47,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:53:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:53:47,881 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:53:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:53:47,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:53:47,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:53:47,891 INFO L85 PathProgramCache]: Analyzing trace with hash 964547683, now seen corresponding path program 1 times [2022-07-22 02:53:47,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:53:47,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143457163] [2022-07-22 02:53:47,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:53:47,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:53:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:53:47,954 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 02:53:47,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:53:47,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143457163] [2022-07-22 02:53:47,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143457163] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:53:47,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:53:47,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:53:47,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933702616] [2022-07-22 02:53:47,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:53:48,443 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:53:48,444 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:53:48,444 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:53:48,444 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:53:48,444 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 02:53:48,445 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:53:48,445 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:53:48,445 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:53:48,445 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-07-22 02:53:48,445 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:53:48,445 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:53:48,459 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 02:53:48,465 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 02:53:48,469 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 02:53:48,471 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 02:53:48,472 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 02:53:48,476 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 02:53:48,478 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 02:53:48,480 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 02:53:48,482 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 02:53:48,486 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 02:53:48,491 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 02:53:48,493 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 02:53:48,503 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 02:53:48,505 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 02:53:48,508 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 02:53:48,510 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 02:53:48,525 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 02:53:48,862 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:53:48,863 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 02:53:48,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:53:48,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:53:48,866 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 02:53:48,876 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 02:53:48,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:53:48,877 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:53:48,925 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 02:53:48,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:53:48,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:53:48,926 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 02:53:48,945 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 02:53:48,946 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 02:53:48,946 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:53:49,127 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 02:53:49,131 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 02:53:49,131 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:53:49,131 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:53:49,131 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:53:49,131 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:53:49,131 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:53:49,131 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:53:49,131 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:53:49,131 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:53:49,131 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-07-22 02:53:49,131 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:53:49,132 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:53:49,134 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 02:53:49,142 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 02:53:49,147 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 02:53:49,151 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 02:53:49,156 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 02:53:49,158 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 02:53:49,178 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 02:53:49,182 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 02:53:49,184 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 02:53:49,189 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 02:53:49,191 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 02:53:49,203 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 02:53:49,205 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 02:53:49,210 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 02:53:49,212 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 02:53:49,214 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 02:53:49,216 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 02:53:49,571 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:53:49,573 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 02:53:49,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:53:49,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:53:49,592 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 02:53:49,611 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 02:53:49,614 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 02:53:49,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:53:49,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:53:49,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:53:49,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:53:49,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:53:49,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:53:49,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:53:49,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:53:49,655 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 02:53:49,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:53:49,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:53:49,657 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 02:53:49,664 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 02:53:49,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:53:49,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:53:49,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:53:49,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:53:49,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:53:49,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:53:49,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:53:49,674 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 02:53:49,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:53:49,717 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 02:53:49,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:53:49,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:53:49,718 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 02:53:49,720 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 02:53:49,721 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 02:53:49,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:53:49,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:53:49,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:53:49,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:53:49,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:53:49,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:53:49,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:53:49,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:53:49,763 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 02:53:49,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:53:49,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:53:49,765 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 02:53:49,767 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 02:53:49,768 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 02:53:49,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:53:49,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:53:49,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:53:49,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:53:49,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:53:49,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:53:49,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:53:49,780 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 02:53:49,784 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 02:53:49,784 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 02:53:49,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:53:49,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:53:49,786 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 02:53:49,787 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 02:53:49,811 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 02:53:49,811 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 02:53:49,811 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 02:53:49,812 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 11 Supporting invariants [] [2022-07-22 02:53:49,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-22 02:53:49,829 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 02:53:49,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:53:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:53:49,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:53:49,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:53:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:53:49,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 02:53:49,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:53:49,995 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 02:53:49,998 INFO L152 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 02:53:49,998 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 101 transitions. cyclomatic complexity: 29 Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 02:53:50,050 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 101 transitions. cyclomatic complexity: 29. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 123 states and 180 transitions. Complement of second has 4 states. [2022-07-22 02:53:50,051 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 02:53:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 02:53:50,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-07-22 02:53:50,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 23 letters. Loop has 19 letters. [2022-07-22 02:53:50,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:53:50,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 42 letters. Loop has 19 letters. [2022-07-22 02:53:50,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:53:50,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 23 letters. Loop has 38 letters. [2022-07-22 02:53:50,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:53:50,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 180 transitions. [2022-07-22 02:53:50,060 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 02:53:50,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 0 states and 0 transitions. [2022-07-22 02:53:50,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-22 02:53:50,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-22 02:53:50,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-22 02:53:50,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:53:50,061 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 02:53:50,061 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 02:53:50,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:53:50,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:53:50,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:53:50,062 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 02:53:50,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:53:50,063 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-07-22 02:53:50,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 02:53:50,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-07-22 02:53:50,065 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 02:53:50,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 02:53:50,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-22 02:53:50,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-22 02:53:50,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-22 02:53:50,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:53:50,067 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 02:53:50,067 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 02:53:50,067 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 02:53:50,067 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 02:53:50,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-22 02:53:50,068 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 02:53:50,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-22 02:53:50,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 02:53:50 BoogieIcfgContainer [2022-07-22 02:53:50,077 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 02:53:50,078 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 02:53:50,078 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 02:53:50,078 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 02:53:50,079 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:53:46" (3/4) ... [2022-07-22 02:53:50,081 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 02:53:50,081 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 02:53:50,083 INFO L158 Benchmark]: Toolchain (without parser) took 3904.28ms. Allocated memory was 65.0MB in the beginning and 98.6MB in the end (delta: 33.6MB). Free memory was 45.1MB in the beginning and 50.0MB in the end (delta: -4.9MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2022-07-22 02:53:50,083 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 65.0MB. Free memory was 46.8MB in the beginning and 46.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 02:53:50,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.95ms. Allocated memory is still 65.0MB. Free memory was 44.9MB in the beginning and 46.8MB in the end (delta: -2.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-22 02:53:50,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.12ms. Allocated memory is still 65.0MB. Free memory was 46.6MB in the beginning and 44.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 02:53:50,084 INFO L158 Benchmark]: Boogie Preprocessor took 44.44ms. Allocated memory is still 65.0MB. Free memory was 44.5MB in the beginning and 42.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 02:53:50,091 INFO L158 Benchmark]: RCFGBuilder took 409.39ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 42.9MB in the beginning and 60.3MB in the end (delta: -17.4MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2022-07-22 02:53:50,092 INFO L158 Benchmark]: BuchiAutomizer took 3157.54ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 60.0MB in the beginning and 50.6MB in the end (delta: 9.3MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2022-07-22 02:53:50,094 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 98.6MB. Free memory was 50.6MB in the beginning and 50.0MB in the end (delta: 638.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 02:53:50,095 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.16ms. Allocated memory is still 65.0MB. Free memory was 46.8MB in the beginning and 46.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.95ms. Allocated memory is still 65.0MB. Free memory was 44.9MB in the beginning and 46.8MB in the end (delta: -2.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.12ms. Allocated memory is still 65.0MB. Free memory was 46.6MB in the beginning and 44.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.44ms. Allocated memory is still 65.0MB. Free memory was 44.5MB in the beginning and 42.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 409.39ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 42.9MB in the beginning and 60.3MB in the end (delta: -17.4MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3157.54ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 60.0MB in the beginning and 50.6MB in the end (delta: 9.3MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 98.6MB. Free memory was 50.6MB in the beginning and 50.0MB in the end (delta: 638.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 50 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 1140 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 699 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 441 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital123 mio100 ax100 hnf100 lsp30 ukn100 mio100 lsp100 div171 bol100 ite100 ukn100 eq152 hnf97 smp76 dnf105 smp94 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 64ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-22 02:53:50,145 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 02:53:50,365 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE