./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array20_alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/termination-15/array20_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash ea5bfa8a156bc44b081b7e322054bf4f8b50233fa79918ee2b9ae09354893d3a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:34:37,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:34:37,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:34:37,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:34:37,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:34:37,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:34:37,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:34:37,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:34:37,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:34:37,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:34:37,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:34:37,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:34:37,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:34:37,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:34:37,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:34:37,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:34:37,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:34:37,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:34:37,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:34:37,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:34:37,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:34:37,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:34:37,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:34:37,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:34:37,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:34:37,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:34:37,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:34:37,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:34:37,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:34:37,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:34:37,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:34:37,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:34:37,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:34:37,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:34:37,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:34:37,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:34:37,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:34:37,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:34:37,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:34:37,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:34:37,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:34:37,992 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:34:38,006 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:34:38,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:34:38,011 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:34:38,011 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:34:38,012 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:34:38,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:34:38,013 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:34:38,013 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:34:38,013 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:34:38,013 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:34:38,014 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:34:38,014 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:34:38,014 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:34:38,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:34:38,015 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:34:38,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:34:38,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:34:38,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:34:38,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:34:38,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:34:38,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:34:38,016 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:34:38,016 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:34:38,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:34:38,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:34:38,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:34:38,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:34:38,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:34:38,017 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:34:38,018 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ea5bfa8a156bc44b081b7e322054bf4f8b50233fa79918ee2b9ae09354893d3a [2022-02-21 03:34:38,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:34:38,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:34:38,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:34:38,241 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:34:38,247 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:34:38,247 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array20_alloca.i [2022-02-21 03:34:38,286 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d62de8ee/3aa34ceea6a84981aeb400ab30693339/FLAG745e49a80 [2022-02-21 03:34:38,688 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:34:38,690 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array20_alloca.i [2022-02-21 03:34:38,699 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d62de8ee/3aa34ceea6a84981aeb400ab30693339/FLAG745e49a80 [2022-02-21 03:34:39,059 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d62de8ee/3aa34ceea6a84981aeb400ab30693339 [2022-02-21 03:34:39,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:34:39,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:34:39,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:34:39,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:34:39,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:34:39,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:34:39" (1/1) ... [2022-02-21 03:34:39,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1237ddce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:39, skipping insertion in model container [2022-02-21 03:34:39,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:34:39" (1/1) ... [2022-02-21 03:34:39,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:34:39,110 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:34:39,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:34:39,362 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:34:39,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:34:39,425 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:34:39,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:39 WrapperNode [2022-02-21 03:34:39,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:34:39,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:34:39,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:34:39,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:34:39,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:39" (1/1) ... [2022-02-21 03:34:39,447 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:39" (1/1) ... [2022-02-21 03:34:39,468 INFO L137 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-02-21 03:34:39,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:34:39,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:34:39,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:34:39,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:34:39,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:39" (1/1) ... [2022-02-21 03:34:39,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:39" (1/1) ... [2022-02-21 03:34:39,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:39" (1/1) ... [2022-02-21 03:34:39,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:39" (1/1) ... [2022-02-21 03:34:39,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:39" (1/1) ... [2022-02-21 03:34:39,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:39" (1/1) ... [2022-02-21 03:34:39,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:39" (1/1) ... [2022-02-21 03:34:39,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:34:39,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:34:39,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:34:39,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:34:39,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:39" (1/1) ... [2022-02-21 03:34:39,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:39,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:39,529 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-02-21 03:34:39,557 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-02-21 03:34:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:34:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:34:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:34:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:34:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:34:39,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:34:39,633 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:34:39,634 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:34:39,814 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:34:39,818 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:34:39,818 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:34:39,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:34:39 BoogieIcfgContainer [2022-02-21 03:34:39,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:34:39,820 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:34:39,820 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:34:39,824 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:34:39,824 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:39,825 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:34:39" (1/3) ... [2022-02-21 03:34:39,826 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29c887b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:34:39, skipping insertion in model container [2022-02-21 03:34:39,826 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:39,826 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:39" (2/3) ... [2022-02-21 03:34:39,826 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29c887b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:34:39, skipping insertion in model container [2022-02-21 03:34:39,826 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:39,826 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:34:39" (3/3) ... [2022-02-21 03:34:39,827 INFO L388 chiAutomizerObserver]: Analyzing ICFG array20_alloca.i [2022-02-21 03:34:39,866 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:34:39,866 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:34:39,867 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:34:39,867 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:34:39,867 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:34:39,867 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:34:39,867 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:34:39,867 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:34:39,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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-02-21 03:34:39,898 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:34:39,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:39,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:39,902 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:34:39,902 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:34:39,902 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:34:39,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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-02-21 03:34:39,905 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:34:39,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:39,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:39,906 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:34:39,906 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:34:39,910 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 12#L367true assume !(main_~length~0#1 < 1); 10#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 6#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 8#L370-3true [2022-02-21 03:34:39,911 INFO L793 eck$LassoCheckResult]: Loop: 8#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13#L372true assume main_#t~mem209#1 < 1;havoc main_#t~mem209#1;call write~int(1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15#L370-2true main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 8#L370-3true [2022-02-21 03:34:39,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:39,915 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2022-02-21 03:34:39,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:39,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311827619] [2022-02-21 03:34:39,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:39,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:40,004 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:40,042 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:40,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:40,045 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2022-02-21 03:34:40,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:40,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638165259] [2022-02-21 03:34:40,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:40,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:40,078 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:40,090 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:40,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:40,092 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2022-02-21 03:34:40,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:40,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356451049] [2022-02-21 03:34:40,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:40,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:40,116 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:40,129 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:40,413 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:34:40,413 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:34:40,413 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:34:40,414 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:34:40,414 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:34:40,414 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:40,414 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:34:40,414 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:34:40,414 INFO L133 ssoRankerPreferences]: Filename of dumped script: array20_alloca.i_Iteration1_Lasso [2022-02-21 03:34:40,414 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:34:40,415 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:34:40,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:40,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:40,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:40,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:40,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:40,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:40,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:40,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:40,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:40,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:40,897 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:34:40,901 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:34:40,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:40,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:40,910 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-02-21 03:34:40,911 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-02-21 03:34:40,912 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-02-21 03:34:40,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:40,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:40,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:40,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:40,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:40,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:40,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:40,929 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:40,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:34:40,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:40,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:40,949 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-02-21 03:34:40,953 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-02-21 03:34:40,954 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-02-21 03:34:40,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:40,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:40,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:40,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:40,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:40,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:40,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:41,020 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-02-21 03:34:41,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:41,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:41,023 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-02-21 03:34:41,024 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-02-21 03:34:41,030 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-02-21 03:34:41,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:41,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:41,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:41,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:41,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:41,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:41,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:41,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:41,089 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-02-21 03:34:41,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:41,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:41,103 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-02-21 03:34:41,104 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-02-21 03:34:41,149 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-02-21 03:34:41,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:41,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:41,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:41,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:41,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:41,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:41,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:41,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:41,189 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-02-21 03:34:41,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:41,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:41,193 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-02-21 03:34:41,194 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-02-21 03:34:41,197 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-02-21 03:34:41,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:41,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:41,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:41,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:41,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:41,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:41,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:41,237 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-02-21 03:34:41,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:41,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:41,239 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-02-21 03:34:41,240 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-02-21 03:34:41,242 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-02-21 03:34:41,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:41,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:41,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:41,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:41,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:41,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:41,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:41,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:41,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:41,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:41,284 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-02-21 03:34:41,285 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-02-21 03:34:41,286 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-02-21 03:34:41,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:41,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:41,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:41,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:41,298 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:41,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:41,315 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:34:41,331 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-02-21 03:34:41,331 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-02-21 03:34:41,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:41,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:41,344 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:41,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:34:41,407 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:34:41,422 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:34:41,422 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:34:41,422 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~arr~0#1.offset) = -4*ULTIMATE.start_main_~i~0#1 + 2*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 1*ULTIMATE.start_main_~arr~0#1.offset Supporting invariants [] [2022-02-21 03:34:41,454 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-02-21 03:34:41,470 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-02-21 03:34:41,474 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);" "assume main_#t~mem209#1 < 1;havoc main_#t~mem209#1;call write~int(1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1;" [2022-02-21 03:34:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:41,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:41,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:34:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:41,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:41,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {24#unseeded} is VALID [2022-02-21 03:34:41,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {24#unseeded} is VALID [2022-02-21 03:34:41,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#unseeded} assume !(main_~length~0#1 < 1); {24#unseeded} is VALID [2022-02-21 03:34:41,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#unseeded} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {24#unseeded} is VALID [2022-02-21 03:34:41,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#unseeded} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {24#unseeded} is VALID [2022-02-21 03:34:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:41,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:34:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:41,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:41,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(>= oldRank0 (+ (* 2 (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* (- 4) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|)))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {69#(and (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (>= oldRank0 (+ (* 2 (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~i~0#1| (- 4)) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= 0 (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))} is VALID [2022-02-21 03:34:41,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {69#(and (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (>= oldRank0 (+ (* 2 (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~i~0#1| (- 4)) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= 0 (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))} assume main_#t~mem209#1 < 1;havoc main_#t~mem209#1;call write~int(1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {69#(and (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (>= oldRank0 (+ (* 2 (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~i~0#1| (- 4)) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= 0 (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))} is VALID [2022-02-21 03:34:41,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {69#(and (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (>= oldRank0 (+ (* 2 (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~i~0#1| (- 4)) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= 0 (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {52#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* (- 4) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|)))))} is VALID [2022-02-21 03:34:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:41,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-02-21 03:34:41,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:41,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:41,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,648 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-02-21 03:34:41,649 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-02-21 03:34:41,718 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 32 states and 44 transitions. Complement of second has 7 states. [2022-02-21 03:34:41,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:34:41,719 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:41,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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-02-21 03:34:41,720 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:34:41,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:41,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:41,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-02-21 03:34:41,723 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:34:41,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:41,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:41,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2022-02-21 03:34:41,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:34:41,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:41,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:41,726 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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-02-21 03:34:41,727 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:34:41,728 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:34:41,728 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-02-21 03:34:41,729 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:34:41,729 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:41,730 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 44 transitions. cyclomatic complexity: 16 [2022-02-21 03:34:41,730 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:34:41,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:41,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:41,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:41,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:41,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:41,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:41,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:34:41,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:34:41,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:34:41,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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) Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:34:41,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:34:41,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:34:41,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:34:41,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:34:41,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:34:41,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:41,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:41,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:41,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:34:41,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:34:41,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:34:41,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:41,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:41,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:41,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:34:41,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:34:41,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:34:41,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:34:41,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:34:41,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:34:41,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:41,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:41,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:41,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:41,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:41,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:41,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:34:41,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:34:41,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:34:41,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,742 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-02-21 03:34:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-02-21 03:34:41,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:41,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:34:41,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:34:41,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:41,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 44 transitions. cyclomatic complexity: 16 [2022-02-21 03:34:41,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:34:41,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 11 states and 15 transitions. [2022-02-21 03:34:41,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:34:41,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:34:41,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2022-02-21 03:34:41,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:41,753 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-02-21 03:34:41,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2022-02-21 03:34:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-21 03:34:41,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:41,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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-02-21 03:34:41,769 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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-02-21 03:34:41,770 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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-02-21 03:34:41,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:41,772 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2022-02-21 03:34:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2022-02-21 03:34:41,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:41,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:41,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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 11 states and 15 transitions. [2022-02-21 03:34:41,774 INFO L87 Difference]: Start difference. First operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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 11 states and 15 transitions. [2022-02-21 03:34:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:41,774 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2022-02-21 03:34:41,774 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2022-02-21 03:34:41,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:41,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:41,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:41,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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-02-21 03:34:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2022-02-21 03:34:41,776 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-02-21 03:34:41,776 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-02-21 03:34:41,776 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:34:41,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2022-02-21 03:34:41,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:34:41,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:41,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:41,777 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:41,778 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:34:41,778 INFO L791 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 125#L367 assume !(main_~length~0#1 < 1); 120#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 121#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 122#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 123#L370-4 main_~j~0#1 := 1; 124#L377-2 [2022-02-21 03:34:41,778 INFO L793 eck$LassoCheckResult]: Loop: 124#L377-2 assume !!(1 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_~j~0#1 := main_~j~0#1 * main_#t~mem210#1;havoc main_#t~mem210#1; 124#L377-2 [2022-02-21 03:34:41,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:41,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2022-02-21 03:34:41,779 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:41,779 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220545379] [2022-02-21 03:34:41,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:41,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:41,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {154#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {154#true} is VALID [2022-02-21 03:34:41,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {154#true} is VALID [2022-02-21 03:34:41,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume !(main_~length~0#1 < 1); {156#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 03:34:41,818 INFO L290 TraceCheckUtils]: 3: Hoare triple {156#(<= 1 |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {156#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 03:34:41,831 INFO L290 TraceCheckUtils]: 4: Hoare triple {156#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {157#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 03:34:41,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} assume !(main_~i~0#1 < main_~length~0#1); {155#false} is VALID [2022-02-21 03:34:41,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {155#false} main_~j~0#1 := 1; {155#false} is VALID [2022-02-21 03:34:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:41,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:41,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220545379] [2022-02-21 03:34:41,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220545379] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:34:41,834 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:34:41,834 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:34:41,834 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052143406] [2022-02-21 03:34:41,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:34:41,836 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:34:41,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:41,836 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 1 times [2022-02-21 03:34:41,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:41,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560024478] [2022-02-21 03:34:41,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:41,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:41,842 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:34:41,842 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [444697464] [2022-02-21 03:34:41,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:41,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:34:41,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:41,844 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:34:41,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 03:34:41,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-21 03:34:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:41,874 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:41,879 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:41,919 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:41,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:34:41,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:34:41,922 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-02-21 03:34:41,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:41,961 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:34:41,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:34:41,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-02-21 03:34:41,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:41,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2022-02-21 03:34:41,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:34:41,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 17 transitions. [2022-02-21 03:34:41,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:34:41,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:34:41,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2022-02-21 03:34:41,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:41,972 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:34:41,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2022-02-21 03:34:41,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2022-02-21 03:34:41,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:41,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-02-21 03:34:41,974 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-02-21 03:34:41,974 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-02-21 03:34:41,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:41,975 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:34:41,975 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:34:41,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:41,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:41,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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 13 states and 17 transitions. [2022-02-21 03:34:41,976 INFO L87 Difference]: Start difference. First operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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 13 states and 17 transitions. [2022-02-21 03:34:41,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:41,976 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:34:41,976 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:34:41,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:41,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:41,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:41,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-02-21 03:34:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2022-02-21 03:34:41,978 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 03:34:41,978 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 03:34:41,978 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:34:41,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:34:41,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:34:41,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:41,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:41,979 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:41,979 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:34:41,979 INFO L791 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 174#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 180#L367 assume !(main_~length~0#1 < 1); 175#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 176#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 177#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 181#L372 assume !(main_#t~mem209#1 < 1);havoc main_#t~mem209#1; 183#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 182#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 178#L370-4 main_~j~0#1 := 1; 179#L377-2 [2022-02-21 03:34:41,979 INFO L793 eck$LassoCheckResult]: Loop: 179#L377-2 assume !!(1 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_~j~0#1 := main_~j~0#1 * main_#t~mem210#1;havoc main_#t~mem210#1; 179#L377-2 [2022-02-21 03:34:41,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:41,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2022-02-21 03:34:41,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:41,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774493563] [2022-02-21 03:34:41,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:41,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:41,992 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:42,001 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:42,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:42,002 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 2 times [2022-02-21 03:34:42,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:42,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718674520] [2022-02-21 03:34:42,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:42,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:42,006 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:34:42,006 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [915723941] [2022-02-21 03:34:42,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:34:42,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:34:42,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:42,008 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:34:42,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-21 03:34:42,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 03:34:42,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-21 03:34:42,033 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:42,037 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:42,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:42,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1329989554, now seen corresponding path program 1 times [2022-02-21 03:34:42,038 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:42,038 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686522964] [2022-02-21 03:34:42,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:42,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:42,054 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:34:42,054 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1314650450] [2022-02-21 03:34:42,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:42,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:34:42,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:42,072 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:34:42,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-21 03:34:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:42,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:34:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:42,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:42,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {217#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {217#true} is VALID [2022-02-21 03:34:42,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {217#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {217#true} is VALID [2022-02-21 03:34:42,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {217#true} assume !(main_~length~0#1 < 1); {217#true} is VALID [2022-02-21 03:34:42,196 INFO L290 TraceCheckUtils]: 3: Hoare triple {217#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {217#true} is VALID [2022-02-21 03:34:42,197 INFO L290 TraceCheckUtils]: 4: Hoare triple {217#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {234#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:42,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {234#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:42,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {234#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 1);havoc main_#t~mem209#1; {234#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:42,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {234#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {244#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:34:42,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~length~0#1); {248#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:34:42,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {248#(<= |ULTIMATE.start_main_~length~0#1| 1)} main_~j~0#1 := 1; {252#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:34:42,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(1 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_~j~0#1 := main_~j~0#1 * main_#t~mem210#1;havoc main_#t~mem210#1; {218#false} is VALID [2022-02-21 03:34:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:42,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:34:42,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {256#(not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|))} assume !!(1 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_~j~0#1 := main_~j~0#1 * main_#t~mem210#1;havoc main_#t~mem210#1; {218#false} is VALID [2022-02-21 03:34:42,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {248#(<= |ULTIMATE.start_main_~length~0#1| 1)} main_~j~0#1 := 1; {256#(not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 03:34:42,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~length~0#1); {248#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:34:42,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {234#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {244#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:34:42,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {234#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 1);havoc main_#t~mem209#1; {234#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:42,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {234#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:42,277 INFO L290 TraceCheckUtils]: 4: Hoare triple {217#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {234#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:42,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {217#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {217#true} is VALID [2022-02-21 03:34:42,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {217#true} assume !(main_~length~0#1 < 1); {217#true} is VALID [2022-02-21 03:34:42,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {217#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {217#true} is VALID [2022-02-21 03:34:42,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {217#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {217#true} is VALID [2022-02-21 03:34:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:42,278 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:42,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686522964] [2022-02-21 03:34:42,278 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:34:42,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314650450] [2022-02-21 03:34:42,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314650450] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:34:42,278 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:34:42,279 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-02-21 03:34:42,279 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067781248] [2022-02-21 03:34:42,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:34:42,317 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:42,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:34:42,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:34:42,318 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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-02-21 03:34:42,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:42,430 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2022-02-21 03:34:42,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:34:42,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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-02-21 03:34:42,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:42,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2022-02-21 03:34:42,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:34:42,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 16 states and 20 transitions. [2022-02-21 03:34:42,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:34:42,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:34:42,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2022-02-21 03:34:42,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:42,442 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-02-21 03:34:42,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2022-02-21 03:34:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2022-02-21 03:34:42,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:42,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 20 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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-02-21 03:34:42,443 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 20 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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-02-21 03:34:42,443 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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-02-21 03:34:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:42,444 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2022-02-21 03:34:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-02-21 03:34:42,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:42,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:42,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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 16 states and 20 transitions. [2022-02-21 03:34:42,446 INFO L87 Difference]: Start difference. First operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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 16 states and 20 transitions. [2022-02-21 03:34:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:42,447 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2022-02-21 03:34:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-02-21 03:34:42,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:42,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:42,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:42,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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-02-21 03:34:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2022-02-21 03:34:42,448 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2022-02-21 03:34:42,448 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2022-02-21 03:34:42,448 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:34:42,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2022-02-21 03:34:42,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:34:42,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:42,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:42,449 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:42,449 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:34:42,450 INFO L791 eck$LassoCheckResult]: Stem: 316#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 317#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 321#L367 assume !(main_~length~0#1 < 1); 314#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 315#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 318#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 322#L372 assume !(main_#t~mem209#1 < 1);havoc main_#t~mem209#1; 327#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 323#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 324#L372 assume !(main_#t~mem209#1 < 1);havoc main_#t~mem209#1; 325#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 326#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 319#L370-4 main_~j~0#1 := 1; 320#L377-2 [2022-02-21 03:34:42,450 INFO L793 eck$LassoCheckResult]: Loop: 320#L377-2 assume !!(1 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_~j~0#1 := main_~j~0#1 * main_#t~mem210#1;havoc main_#t~mem210#1; 320#L377-2 [2022-02-21 03:34:42,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:42,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1781949270, now seen corresponding path program 2 times [2022-02-21 03:34:42,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:42,451 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633632125] [2022-02-21 03:34:42,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:42,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:42,466 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:42,476 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:42,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:42,477 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 3 times [2022-02-21 03:34:42,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:42,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741261253] [2022-02-21 03:34:42,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:42,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:42,480 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:34:42,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124415157] [2022-02-21 03:34:42,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:34:42,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:34:42,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:42,482 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:34:42,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-21 03:34:42,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-21 03:34:42,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-21 03:34:42,506 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:42,510 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:42,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:42,511 INFO L85 PathProgramCache]: Analyzing trace with hash -594147436, now seen corresponding path program 2 times [2022-02-21 03:34:42,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:42,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979317150] [2022-02-21 03:34:42,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:42,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:42,523 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:34:42,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [925537502] [2022-02-21 03:34:42,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:34:42,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:34:42,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:42,526 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:34:42,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-21 03:34:42,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:34:42,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-21 03:34:42,569 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:42,595 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:42,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:34:42 BoogieIcfgContainer [2022-02-21 03:34:42,909 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:34:42,909 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:34:42,909 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:34:42,909 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:34:42,910 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:34:39" (3/4) ... [2022-02-21 03:34:42,911 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-02-21 03:34:42,932 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:34:42,932 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:34:42,933 INFO L158 Benchmark]: Toolchain (without parser) took 3868.76ms. Allocated memory was 98.6MB in the beginning and 125.8MB in the end (delta: 27.3MB). Free memory was 76.1MB in the beginning and 67.0MB in the end (delta: 9.1MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2022-02-21 03:34:42,933 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 77.6MB. Free memory is still 57.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:34:42,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.09ms. Allocated memory is still 98.6MB. Free memory was 75.8MB in the beginning and 64.5MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:34:42,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.44ms. Allocated memory is still 98.6MB. Free memory was 64.5MB in the beginning and 62.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:34:42,934 INFO L158 Benchmark]: Boogie Preprocessor took 34.82ms. Allocated memory is still 98.6MB. Free memory was 62.4MB in the beginning and 61.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:34:42,934 INFO L158 Benchmark]: RCFGBuilder took 314.63ms. Allocated memory is still 98.6MB. Free memory was 61.2MB in the beginning and 49.8MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:34:42,935 INFO L158 Benchmark]: BuchiAutomizer took 3088.76ms. Allocated memory was 98.6MB in the beginning and 125.8MB in the end (delta: 27.3MB). Free memory was 49.8MB in the beginning and 68.0MB in the end (delta: -18.2MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2022-02-21 03:34:42,935 INFO L158 Benchmark]: Witness Printer took 23.16ms. Allocated memory is still 125.8MB. Free memory was 68.0MB in the beginning and 67.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:34:42,936 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 77.6MB. Free memory is still 57.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.09ms. Allocated memory is still 98.6MB. Free memory was 75.8MB in the beginning and 64.5MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.44ms. Allocated memory is still 98.6MB. Free memory was 64.5MB in the beginning and 62.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.82ms. Allocated memory is still 98.6MB. Free memory was 62.4MB in the beginning and 61.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 314.63ms. Allocated memory is still 98.6MB. Free memory was 61.2MB in the beginning and 49.8MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3088.76ms. Allocated memory was 98.6MB in the beginning and 125.8MB in the end (delta: 27.3MB). Free memory was 49.8MB in the beginning and 68.0MB in the end (delta: -18.2MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Witness Printer took 23.16ms. Allocated memory is still 125.8MB. Free memory was 68.0MB in the beginning and 67.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 2 * unknown-#length-unknown[arr] + -4 * i + -1 * arr and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. The remainder module has 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 65 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 30 mSDtfsCounter, 65 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital102 mio100 ax100 hnf100 lsp91 ukn83 mio100 lsp61 div100 bol100 ite100 ukn100 eq166 hnf91 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 40ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {j=1, arr=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@13a567fc=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2fb98ac=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2fb98ac=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@570a351d=0, \result=0, length=2, i=2, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@39ff73d1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@47e3dbb=0, arr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@56ae353e=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i