./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/pipeline.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/systemc/pipeline.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 79bbe68806c3ba3852cd8c209d4ce80dca551636a131cc65daaf97524d927c63 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:21:35,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:21:35,572 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:21:35,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:21:35,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:21:35,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:21:35,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:21:35,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:21:35,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:21:35,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:21:35,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:21:35,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:21:35,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:21:35,611 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:21:35,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:21:35,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:21:35,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:21:35,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:21:35,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:21:35,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:21:35,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:21:35,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:21:35,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:21:35,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:21:35,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:21:35,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:21:35,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:21:35,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:21:35,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:21:35,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:21:35,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:21:35,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:21:35,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:21:35,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:21:35,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:21:35,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:21:35,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:21:35,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:21:35,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:21:35,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:21:35,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:21:35,640 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:21:35,657 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:21:35,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:21:35,657 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:21:35,657 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:21:35,658 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:21:35,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:21:35,658 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:21:35,658 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:21:35,659 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:21:35,659 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:21:35,660 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:21:35,660 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:21:35,660 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:21:35,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:21:35,660 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:21:35,660 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:21:35,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:21:35,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:21:35,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:21:35,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:21:35,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:21:35,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:21:35,661 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:21:35,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:21:35,662 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:21:35,662 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:21:35,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:21:35,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:21:35,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:21:35,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:21:35,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:21:35,663 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:21:35,663 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 79bbe68806c3ba3852cd8c209d4ce80dca551636a131cc65daaf97524d927c63 [2022-02-21 04:21:35,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:21:35,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:21:35,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:21:35,867 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:21:35,867 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:21:35,868 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pipeline.cil-1.c [2022-02-21 04:21:35,910 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715ec3032/0b0b6c56506d4478b7eeb339c14057ad/FLAG72ddbf516 [2022-02-21 04:21:36,297 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:21:36,297 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pipeline.cil-1.c [2022-02-21 04:21:36,322 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715ec3032/0b0b6c56506d4478b7eeb339c14057ad/FLAG72ddbf516 [2022-02-21 04:21:36,330 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715ec3032/0b0b6c56506d4478b7eeb339c14057ad [2022-02-21 04:21:36,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:21:36,333 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:21:36,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:21:36,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:21:36,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:21:36,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:21:36" (1/1) ... [2022-02-21 04:21:36,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f32ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:36, skipping insertion in model container [2022-02-21 04:21:36,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:21:36" (1/1) ... [2022-02-21 04:21:36,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:21:36,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:21:36,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pipeline.cil-1.c[640,653] [2022-02-21 04:21:36,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:21:36,573 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:21:36,593 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pipeline.cil-1.c[640,653] [2022-02-21 04:21:36,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:21:36,657 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:21:36,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:36 WrapperNode [2022-02-21 04:21:36,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:21:36,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:21:36,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:21:36,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:21:36,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:36" (1/1) ... [2022-02-21 04:21:36,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:36" (1/1) ... [2022-02-21 04:21:36,736 INFO L137 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 12, calls inlined = 24, statements flattened = 1037 [2022-02-21 04:21:36,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:21:36,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:21:36,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:21:36,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:21:36,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:36" (1/1) ... [2022-02-21 04:21:36,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:36" (1/1) ... [2022-02-21 04:21:36,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:36" (1/1) ... [2022-02-21 04:21:36,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:36" (1/1) ... [2022-02-21 04:21:36,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:36" (1/1) ... [2022-02-21 04:21:36,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:36" (1/1) ... [2022-02-21 04:21:36,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:36" (1/1) ... [2022-02-21 04:21:36,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:21:36,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:21:36,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:21:36,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:21:36,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:36" (1/1) ... [2022-02-21 04:21:36,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:36,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:21:36,849 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 04:21:36,883 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 04:21:36,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:21:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:21:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:21:36,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:21:36,988 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:21:36,989 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:21:37,677 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:21:37,685 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:21:37,685 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-02-21 04:21:37,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:21:37 BoogieIcfgContainer [2022-02-21 04:21:37,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:21:37,688 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:21:37,688 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:21:37,691 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:21:37,691 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:21:37,691 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:21:36" (1/3) ... [2022-02-21 04:21:37,692 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17efafe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:21:37, skipping insertion in model container [2022-02-21 04:21:37,692 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:21:37,692 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:36" (2/3) ... [2022-02-21 04:21:37,693 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17efafe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:21:37, skipping insertion in model container [2022-02-21 04:21:37,693 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:21:37,693 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:21:37" (3/3) ... [2022-02-21 04:21:37,694 INFO L388 chiAutomizerObserver]: Analyzing ICFG pipeline.cil-1.c [2022-02-21 04:21:37,721 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:21:37,722 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:21:37,722 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:21:37,722 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:21:37,722 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:21:37,722 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:21:37,722 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:21:37,722 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:21:37,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 422 states, 421 states have (on average 1.814726840855107) internal successors, (764), 421 states have internal predecessors, (764), 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 04:21:37,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 360 [2022-02-21 04:21:37,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:37,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:37,856 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:37,857 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:37,857 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:21:37,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 422 states, 421 states have (on average 1.814726840855107) internal successors, (764), 421 states have internal predecessors, (764), 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 04:21:37,915 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 360 [2022-02-21 04:21:37,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:37,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:37,918 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:37,919 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:37,925 INFO L791 eck$LassoCheckResult]: Stem: 414#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 359#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 31#L256true assume !(1 == ~main_in1_req_up~0); 10#L256-2true assume !(1 == ~main_in2_req_up~0); 25#L267-1true assume !(1 == ~main_sum_req_up~0); 303#L278-1true assume !(1 == ~main_diff_req_up~0); 3#L289-1true assume !(1 == ~main_pres_req_up~0); 255#L300-1true assume !(1 == ~main_dbl_req_up~0); 149#L311-1true assume !(1 == ~main_zero_req_up~0); 328#L322-1true assume !(1 == ~main_clk_req_up~0); 194#L333-1true assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 125#L351-1true assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 19#L356-1true assume 1 == ~S2_presdbl_i~0;~S2_presdbl_st~0 := 0; 119#L361-1true assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 341#L366-1true assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 113#L371-1true assume !(0 == ~main_in1_ev~0); 44#L376-1true assume !(0 == ~main_in2_ev~0); 305#L381-1true assume !(0 == ~main_sum_ev~0); 133#L386-1true assume !(0 == ~main_diff_ev~0); 323#L391-1true assume !(0 == ~main_pres_ev~0); 229#L396-1true assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; 81#L401-1true assume !(0 == ~main_zero_ev~0); 87#L406-1true assume !(0 == ~main_clk_ev~0); 354#L411-1true assume !(0 == ~main_clk_pos_edge~0); 338#L416-1true assume !(0 == ~main_clk_neg_edge~0); 394#L421-1true assume !(1 == ~main_clk_pos_edge~0); 291#L426-1true assume !(1 == ~main_clk_pos_edge~0); 106#L431-1true assume !(1 == ~main_clk_pos_edge~0); 234#L436-1true assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; 95#L441-1true assume !(1 == ~main_clk_pos_edge~0); 386#L446-1true assume !(1 == ~main_in1_ev~0); 277#L451-1true assume !(1 == ~main_in2_ev~0); 395#L456-1true assume !(1 == ~main_sum_ev~0); 138#L461-1true assume !(1 == ~main_diff_ev~0); 381#L466-1true assume !(1 == ~main_pres_ev~0); 406#L471-1true assume !(1 == ~main_dbl_ev~0); 26#L476-1true assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 195#L481-1true assume !(1 == ~main_clk_ev~0); 92#L486-1true assume !(1 == ~main_clk_pos_edge~0); 28#L491-1true assume !(1 == ~main_clk_neg_edge~0); 250#L742-1true [2022-02-21 04:21:37,930 INFO L793 eck$LassoCheckResult]: Loop: 250#L742-1true assume !false; 376#L503true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 206#L229true assume false; 239#L245true assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 256#L509true assume !(1 == ~main_in1_req_up~0); 173#L509-2true assume !(1 == ~main_in2_req_up~0); 339#L520-1true assume !(1 == ~main_sum_req_up~0); 220#L531-1true assume !(1 == ~main_diff_req_up~0); 144#L542-1true assume !(1 == ~main_pres_req_up~0); 393#L553-1true assume !(1 == ~main_dbl_req_up~0); 159#L564-1true assume !(1 == ~main_zero_req_up~0); 245#L575-1true assume !(1 == ~main_clk_req_up~0); 343#L586-1true start_simulation_~kernel_st~0#1 := 3; 369#L605true assume !(0 == ~main_in1_ev~0); 287#L605-2true assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; 17#L610-1true assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; 193#L615-1true assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 190#L620-1true assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; 186#L625-1true assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; 270#L630-1true assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 329#L635-1true assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 327#L640-1true assume !(0 == ~main_clk_pos_edge~0); 85#L645-1true assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; 112#L650-1true assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0; 132#L655-1true assume 1 == ~main_clk_pos_edge~0;~S1_addsub_st~0 := 0; 204#L660-1true assume 1 == ~main_clk_pos_edge~0;~S2_presdbl_st~0 := 0; 240#L665-1true assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; 290#L670-1true assume 1 == ~main_clk_pos_edge~0;~D_print_st~0 := 0; 182#L675-1true assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; 237#L680-1true assume !(1 == ~main_in2_ev~0); 312#L685-1true assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 215#L690-1true assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 405#L695-1true assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; 275#L700-1true assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; 268#L705-1true assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 375#L710-1true assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 178#L715-1true assume 1 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 2; 135#L720-1true assume !(1 == ~main_clk_neg_edge~0); 165#L725-1true assume 0 == ~N_generate_st~0; 250#L742-1true [2022-02-21 04:21:37,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:37,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1291793407, now seen corresponding path program 1 times [2022-02-21 04:21:37,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:37,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308827085] [2022-02-21 04:21:37,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:37,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:38,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {426#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; {426#true} is VALID [2022-02-21 04:21:38,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {426#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; {428#(= ~main_in1_req_up~0 ~S2_presdbl_i~0)} is VALID [2022-02-21 04:21:38,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#(= ~main_in1_req_up~0 ~S2_presdbl_i~0)} assume !(1 == ~main_in1_req_up~0); {429#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,157 INFO L290 TraceCheckUtils]: 3: Hoare triple {429#(not (= ~S2_presdbl_i~0 1))} assume !(1 == ~main_in2_req_up~0); {429#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,157 INFO L290 TraceCheckUtils]: 4: Hoare triple {429#(not (= ~S2_presdbl_i~0 1))} assume !(1 == ~main_sum_req_up~0); {429#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {429#(not (= ~S2_presdbl_i~0 1))} assume !(1 == ~main_diff_req_up~0); {429#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {429#(not (= ~S2_presdbl_i~0 1))} assume !(1 == ~main_pres_req_up~0); {429#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {429#(not (= ~S2_presdbl_i~0 1))} assume !(1 == ~main_dbl_req_up~0); {429#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {429#(not (= ~S2_presdbl_i~0 1))} assume !(1 == ~main_zero_req_up~0); {429#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {429#(not (= ~S2_presdbl_i~0 1))} assume !(1 == ~main_clk_req_up~0); {429#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {429#(not (= ~S2_presdbl_i~0 1))} assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; {429#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {429#(not (= ~S2_presdbl_i~0 1))} assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; {429#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {429#(not (= ~S2_presdbl_i~0 1))} assume 1 == ~S2_presdbl_i~0;~S2_presdbl_st~0 := 0; {427#false} is VALID [2022-02-21 04:21:38,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {427#false} assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; {427#false} is VALID [2022-02-21 04:21:38,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {427#false} assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; {427#false} is VALID [2022-02-21 04:21:38,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {427#false} assume !(0 == ~main_in1_ev~0); {427#false} is VALID [2022-02-21 04:21:38,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {427#false} assume !(0 == ~main_in2_ev~0); {427#false} is VALID [2022-02-21 04:21:38,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {427#false} assume !(0 == ~main_sum_ev~0); {427#false} is VALID [2022-02-21 04:21:38,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {427#false} assume !(0 == ~main_diff_ev~0); {427#false} is VALID [2022-02-21 04:21:38,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {427#false} assume !(0 == ~main_pres_ev~0); {427#false} is VALID [2022-02-21 04:21:38,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {427#false} assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; {427#false} is VALID [2022-02-21 04:21:38,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {427#false} assume !(0 == ~main_zero_ev~0); {427#false} is VALID [2022-02-21 04:21:38,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {427#false} assume !(0 == ~main_clk_ev~0); {427#false} is VALID [2022-02-21 04:21:38,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {427#false} assume !(0 == ~main_clk_pos_edge~0); {427#false} is VALID [2022-02-21 04:21:38,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {427#false} assume !(0 == ~main_clk_neg_edge~0); {427#false} is VALID [2022-02-21 04:21:38,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {427#false} assume !(1 == ~main_clk_pos_edge~0); {427#false} is VALID [2022-02-21 04:21:38,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {427#false} assume !(1 == ~main_clk_pos_edge~0); {427#false} is VALID [2022-02-21 04:21:38,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {427#false} assume !(1 == ~main_clk_pos_edge~0); {427#false} is VALID [2022-02-21 04:21:38,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {427#false} assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; {427#false} is VALID [2022-02-21 04:21:38,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {427#false} assume !(1 == ~main_clk_pos_edge~0); {427#false} is VALID [2022-02-21 04:21:38,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {427#false} assume !(1 == ~main_in1_ev~0); {427#false} is VALID [2022-02-21 04:21:38,166 INFO L290 TraceCheckUtils]: 31: Hoare triple {427#false} assume !(1 == ~main_in2_ev~0); {427#false} is VALID [2022-02-21 04:21:38,166 INFO L290 TraceCheckUtils]: 32: Hoare triple {427#false} assume !(1 == ~main_sum_ev~0); {427#false} is VALID [2022-02-21 04:21:38,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {427#false} assume !(1 == ~main_diff_ev~0); {427#false} is VALID [2022-02-21 04:21:38,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {427#false} assume !(1 == ~main_pres_ev~0); {427#false} is VALID [2022-02-21 04:21:38,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {427#false} assume !(1 == ~main_dbl_ev~0); {427#false} is VALID [2022-02-21 04:21:38,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {427#false} assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; {427#false} is VALID [2022-02-21 04:21:38,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {427#false} assume !(1 == ~main_clk_ev~0); {427#false} is VALID [2022-02-21 04:21:38,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {427#false} assume !(1 == ~main_clk_pos_edge~0); {427#false} is VALID [2022-02-21 04:21:38,167 INFO L290 TraceCheckUtils]: 39: Hoare triple {427#false} assume !(1 == ~main_clk_neg_edge~0); {427#false} is VALID [2022-02-21 04:21:38,168 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 04:21:38,169 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:38,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308827085] [2022-02-21 04:21:38,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308827085] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:38,170 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:38,170 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:21:38,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145490822] [2022-02-21 04:21:38,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:38,178 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:38,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:38,180 INFO L85 PathProgramCache]: Analyzing trace with hash -727719859, now seen corresponding path program 1 times [2022-02-21 04:21:38,180 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:38,181 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515796432] [2022-02-21 04:21:38,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:38,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:38,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {430#true} assume !false; {430#true} is VALID [2022-02-21 04:21:38,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; {430#true} is VALID [2022-02-21 04:21:38,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {430#true} assume false; {431#false} is VALID [2022-02-21 04:21:38,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {431#false} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; {431#false} is VALID [2022-02-21 04:21:38,197 INFO L290 TraceCheckUtils]: 4: Hoare triple {431#false} assume !(1 == ~main_in1_req_up~0); {431#false} is VALID [2022-02-21 04:21:38,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {431#false} assume !(1 == ~main_in2_req_up~0); {431#false} is VALID [2022-02-21 04:21:38,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {431#false} assume !(1 == ~main_sum_req_up~0); {431#false} is VALID [2022-02-21 04:21:38,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {431#false} assume !(1 == ~main_diff_req_up~0); {431#false} is VALID [2022-02-21 04:21:38,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {431#false} assume !(1 == ~main_pres_req_up~0); {431#false} is VALID [2022-02-21 04:21:38,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {431#false} assume !(1 == ~main_dbl_req_up~0); {431#false} is VALID [2022-02-21 04:21:38,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {431#false} assume !(1 == ~main_zero_req_up~0); {431#false} is VALID [2022-02-21 04:21:38,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {431#false} assume !(1 == ~main_clk_req_up~0); {431#false} is VALID [2022-02-21 04:21:38,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {431#false} start_simulation_~kernel_st~0#1 := 3; {431#false} is VALID [2022-02-21 04:21:38,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {431#false} assume !(0 == ~main_in1_ev~0); {431#false} is VALID [2022-02-21 04:21:38,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {431#false} assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; {431#false} is VALID [2022-02-21 04:21:38,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {431#false} assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; {431#false} is VALID [2022-02-21 04:21:38,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {431#false} assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; {431#false} is VALID [2022-02-21 04:21:38,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {431#false} assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; {431#false} is VALID [2022-02-21 04:21:38,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {431#false} assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; {431#false} is VALID [2022-02-21 04:21:38,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {431#false} assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; {431#false} is VALID [2022-02-21 04:21:38,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {431#false} assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; {431#false} is VALID [2022-02-21 04:21:38,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {431#false} assume !(0 == ~main_clk_pos_edge~0); {431#false} is VALID [2022-02-21 04:21:38,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {431#false} assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; {431#false} is VALID [2022-02-21 04:21:38,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {431#false} assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0; {431#false} is VALID [2022-02-21 04:21:38,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {431#false} assume 1 == ~main_clk_pos_edge~0;~S1_addsub_st~0 := 0; {431#false} is VALID [2022-02-21 04:21:38,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {431#false} assume 1 == ~main_clk_pos_edge~0;~S2_presdbl_st~0 := 0; {431#false} is VALID [2022-02-21 04:21:38,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {431#false} assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; {431#false} is VALID [2022-02-21 04:21:38,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {431#false} assume 1 == ~main_clk_pos_edge~0;~D_print_st~0 := 0; {431#false} is VALID [2022-02-21 04:21:38,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {431#false} assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; {431#false} is VALID [2022-02-21 04:21:38,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {431#false} assume !(1 == ~main_in2_ev~0); {431#false} is VALID [2022-02-21 04:21:38,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {431#false} assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; {431#false} is VALID [2022-02-21 04:21:38,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {431#false} assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; {431#false} is VALID [2022-02-21 04:21:38,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {431#false} assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; {431#false} is VALID [2022-02-21 04:21:38,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {431#false} assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; {431#false} is VALID [2022-02-21 04:21:38,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {431#false} assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; {431#false} is VALID [2022-02-21 04:21:38,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {431#false} assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; {431#false} is VALID [2022-02-21 04:21:38,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {431#false} assume 1 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 2; {431#false} is VALID [2022-02-21 04:21:38,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {431#false} assume !(1 == ~main_clk_neg_edge~0); {431#false} is VALID [2022-02-21 04:21:38,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {431#false} assume 0 == ~N_generate_st~0; {431#false} is VALID [2022-02-21 04:21:38,209 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 04:21:38,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:38,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515796432] [2022-02-21 04:21:38,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515796432] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:38,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:38,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 04:21:38,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273673574] [2022-02-21 04:21:38,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:38,211 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:38,212 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:38,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 04:21:38,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 04:21:38,241 INFO L87 Difference]: Start difference. First operand has 422 states, 421 states have (on average 1.814726840855107) internal successors, (764), 421 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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 04:21:38,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:38,521 INFO L93 Difference]: Finished difference Result 417 states and 745 transitions. [2022-02-21 04:21:38,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:21:38,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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 04:21:38,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:38,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 417 states and 745 transitions. [2022-02-21 04:21:38,563 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 358 [2022-02-21 04:21:38,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 417 states to 416 states and 744 transitions. [2022-02-21 04:21:38,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 416 [2022-02-21 04:21:38,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 416 [2022-02-21 04:21:38,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 416 states and 744 transitions. [2022-02-21 04:21:38,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:38,579 INFO L681 BuchiCegarLoop]: Abstraction has 416 states and 744 transitions. [2022-02-21 04:21:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states and 744 transitions. [2022-02-21 04:21:38,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2022-02-21 04:21:38,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:38,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 416 states and 744 transitions. Second operand has 416 states, 416 states have (on average 1.7884615384615385) internal successors, (744), 415 states have internal predecessors, (744), 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 04:21:38,630 INFO L74 IsIncluded]: Start isIncluded. First operand 416 states and 744 transitions. Second operand has 416 states, 416 states have (on average 1.7884615384615385) internal successors, (744), 415 states have internal predecessors, (744), 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 04:21:38,632 INFO L87 Difference]: Start difference. First operand 416 states and 744 transitions. Second operand has 416 states, 416 states have (on average 1.7884615384615385) internal successors, (744), 415 states have internal predecessors, (744), 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 04:21:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:38,645 INFO L93 Difference]: Finished difference Result 416 states and 744 transitions. [2022-02-21 04:21:38,646 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 744 transitions. [2022-02-21 04:21:38,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:38,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:38,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 416 states, 416 states have (on average 1.7884615384615385) internal successors, (744), 415 states have internal predecessors, (744), 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 416 states and 744 transitions. [2022-02-21 04:21:38,650 INFO L87 Difference]: Start difference. First operand has 416 states, 416 states have (on average 1.7884615384615385) internal successors, (744), 415 states have internal predecessors, (744), 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 416 states and 744 transitions. [2022-02-21 04:21:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:38,660 INFO L93 Difference]: Finished difference Result 416 states and 744 transitions. [2022-02-21 04:21:38,661 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 744 transitions. [2022-02-21 04:21:38,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:38,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:38,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:38,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 416 states have (on average 1.7884615384615385) internal successors, (744), 415 states have internal predecessors, (744), 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 04:21:38,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 744 transitions. [2022-02-21 04:21:38,674 INFO L704 BuchiCegarLoop]: Abstraction has 416 states and 744 transitions. [2022-02-21 04:21:38,674 INFO L587 BuchiCegarLoop]: Abstraction has 416 states and 744 transitions. [2022-02-21 04:21:38,674 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:21:38,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 416 states and 744 transitions. [2022-02-21 04:21:38,676 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 358 [2022-02-21 04:21:38,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:38,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:38,677 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:38,677 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:38,678 INFO L791 eck$LassoCheckResult]: Stem: 1264#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 1256#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 909#L256 assume !(1 == ~main_in1_req_up~0); 866#L256-2 assume !(1 == ~main_in2_req_up~0); 868#L267-1 assume !(1 == ~main_sum_req_up~0); 897#L278-1 assume !(1 == ~main_diff_req_up~0); 849#L289-1 assume !(1 == ~main_pres_req_up~0); 850#L300-1 assume !(1 == ~main_dbl_req_up~0); 957#L311-1 assume !(1 == ~main_zero_req_up~0); 1102#L322-1 assume !(1 == ~main_clk_req_up~0); 1076#L333-1 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 1067#L351-1 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 886#L356-1 assume 1 == ~S2_presdbl_i~0;~S2_presdbl_st~0 := 0; 887#L361-1 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 1061#L366-1 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 1055#L371-1 assume !(0 == ~main_in1_ev~0); 937#L376-1 assume !(0 == ~main_in2_ev~0); 938#L381-1 assume !(0 == ~main_sum_ev~0); 1078#L386-1 assume !(0 == ~main_diff_ev~0); 1079#L391-1 assume !(0 == ~main_pres_ev~0); 1186#L396-1 assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; 1006#L401-1 assume !(0 == ~main_zero_ev~0); 1007#L406-1 assume !(0 == ~main_clk_ev~0); 1016#L411-1 assume !(0 == ~main_clk_pos_edge~0); 1247#L416-1 assume !(0 == ~main_clk_neg_edge~0); 1248#L421-1 assume !(1 == ~main_clk_pos_edge~0); 1233#L426-1 assume !(1 == ~main_clk_pos_edge~0); 1044#L431-1 assume !(1 == ~main_clk_pos_edge~0); 1045#L436-1 assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; 1025#L441-1 assume !(1 == ~main_clk_pos_edge~0); 1026#L446-1 assume !(1 == ~main_in1_ev~0); 1225#L451-1 assume !(1 == ~main_in2_ev~0); 1226#L456-1 assume !(1 == ~main_sum_ev~0); 1087#L461-1 assume !(1 == ~main_diff_ev~0); 1088#L466-1 assume !(1 == ~main_pres_ev~0); 1261#L471-1 assume !(1 == ~main_dbl_ev~0); 899#L476-1 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 900#L481-1 assume !(1 == ~main_clk_ev~0); 1023#L486-1 assume !(1 == ~main_clk_pos_edge~0); 904#L491-1 assume !(1 == ~main_clk_neg_edge~0); 905#L742-1 [2022-02-21 04:21:38,678 INFO L793 eck$LassoCheckResult]: Loop: 905#L742-1 assume !false; 1205#L503 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 941#L229 assume !false; 1164#L147 assume !(0 == ~N_generate_st~0); 969#L151 assume !(0 == ~S1_addsub_st~0); 970#L154 assume !(0 == ~S2_presdbl_st~0); 859#L157 assume !(0 == ~S3_zero_st~0); 861#L160 assume !(0 == ~D_print_st~0); 1195#L245 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1196#L509 assume !(1 == ~main_in1_req_up~0); 863#L509-2 assume !(1 == ~main_in2_req_up~0); 1132#L520-1 assume !(1 == ~main_sum_req_up~0); 1178#L531-1 assume !(1 == ~main_diff_req_up~0); 1096#L542-1 assume !(1 == ~main_pres_req_up~0); 870#L553-1 assume !(1 == ~main_dbl_req_up~0); 1105#L564-1 assume !(1 == ~main_zero_req_up~0); 1115#L575-1 assume !(1 == ~main_clk_req_up~0); 1200#L586-1 start_simulation_~kernel_st~0#1 := 3; 1249#L605 assume !(0 == ~main_in1_ev~0); 1232#L605-2 assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; 883#L610-1 assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; 884#L615-1 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 1155#L620-1 assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; 1150#L625-1 assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; 1151#L630-1 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 1220#L635-1 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 1243#L640-1 assume !(0 == ~main_clk_pos_edge~0); 1014#L645-1 assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; 1015#L650-1 assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0; 1054#L655-1 assume 1 == ~main_clk_pos_edge~0;~S1_addsub_st~0 := 0; 1077#L660-1 assume 1 == ~main_clk_pos_edge~0;~S2_presdbl_st~0 := 0; 1163#L665-1 assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; 1197#L670-1 assume 1 == ~main_clk_pos_edge~0;~D_print_st~0 := 0; 1143#L675-1 assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; 1144#L680-1 assume !(1 == ~main_in2_ev~0); 1193#L685-1 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 1173#L690-1 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 1174#L695-1 assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; 1221#L700-1 assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; 1218#L705-1 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 1219#L710-1 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 1139#L715-1 assume 1 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 2; 1083#L720-1 assume !(1 == ~main_clk_neg_edge~0); 1084#L725-1 assume 0 == ~N_generate_st~0; 905#L742-1 [2022-02-21 04:21:38,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:38,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1291793407, now seen corresponding path program 2 times [2022-02-21 04:21:38,679 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:38,679 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364298980] [2022-02-21 04:21:38,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:38,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:38,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {2100#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; {2100#true} is VALID [2022-02-21 04:21:38,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {2100#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; {2102#(= ~main_in1_req_up~0 ~S2_presdbl_i~0)} is VALID [2022-02-21 04:21:38,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {2102#(= ~main_in1_req_up~0 ~S2_presdbl_i~0)} assume !(1 == ~main_in1_req_up~0); {2103#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,720 INFO L290 TraceCheckUtils]: 3: Hoare triple {2103#(not (= ~S2_presdbl_i~0 1))} assume !(1 == ~main_in2_req_up~0); {2103#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,720 INFO L290 TraceCheckUtils]: 4: Hoare triple {2103#(not (= ~S2_presdbl_i~0 1))} assume !(1 == ~main_sum_req_up~0); {2103#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {2103#(not (= ~S2_presdbl_i~0 1))} assume !(1 == ~main_diff_req_up~0); {2103#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {2103#(not (= ~S2_presdbl_i~0 1))} assume !(1 == ~main_pres_req_up~0); {2103#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {2103#(not (= ~S2_presdbl_i~0 1))} assume !(1 == ~main_dbl_req_up~0); {2103#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {2103#(not (= ~S2_presdbl_i~0 1))} assume !(1 == ~main_zero_req_up~0); {2103#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {2103#(not (= ~S2_presdbl_i~0 1))} assume !(1 == ~main_clk_req_up~0); {2103#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {2103#(not (= ~S2_presdbl_i~0 1))} assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; {2103#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {2103#(not (= ~S2_presdbl_i~0 1))} assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; {2103#(not (= ~S2_presdbl_i~0 1))} is VALID [2022-02-21 04:21:38,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {2103#(not (= ~S2_presdbl_i~0 1))} assume 1 == ~S2_presdbl_i~0;~S2_presdbl_st~0 := 0; {2101#false} is VALID [2022-02-21 04:21:38,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {2101#false} assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; {2101#false} is VALID [2022-02-21 04:21:38,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {2101#false} assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; {2101#false} is VALID [2022-02-21 04:21:38,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {2101#false} assume !(0 == ~main_in1_ev~0); {2101#false} is VALID [2022-02-21 04:21:38,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {2101#false} assume !(0 == ~main_in2_ev~0); {2101#false} is VALID [2022-02-21 04:21:38,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {2101#false} assume !(0 == ~main_sum_ev~0); {2101#false} is VALID [2022-02-21 04:21:38,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {2101#false} assume !(0 == ~main_diff_ev~0); {2101#false} is VALID [2022-02-21 04:21:38,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {2101#false} assume !(0 == ~main_pres_ev~0); {2101#false} is VALID [2022-02-21 04:21:38,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {2101#false} assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; {2101#false} is VALID [2022-02-21 04:21:38,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {2101#false} assume !(0 == ~main_zero_ev~0); {2101#false} is VALID [2022-02-21 04:21:38,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {2101#false} assume !(0 == ~main_clk_ev~0); {2101#false} is VALID [2022-02-21 04:21:38,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {2101#false} assume !(0 == ~main_clk_pos_edge~0); {2101#false} is VALID [2022-02-21 04:21:38,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {2101#false} assume !(0 == ~main_clk_neg_edge~0); {2101#false} is VALID [2022-02-21 04:21:38,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {2101#false} assume !(1 == ~main_clk_pos_edge~0); {2101#false} is VALID [2022-02-21 04:21:38,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {2101#false} assume !(1 == ~main_clk_pos_edge~0); {2101#false} is VALID [2022-02-21 04:21:38,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {2101#false} assume !(1 == ~main_clk_pos_edge~0); {2101#false} is VALID [2022-02-21 04:21:38,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {2101#false} assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; {2101#false} is VALID [2022-02-21 04:21:38,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {2101#false} assume !(1 == ~main_clk_pos_edge~0); {2101#false} is VALID [2022-02-21 04:21:38,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {2101#false} assume !(1 == ~main_in1_ev~0); {2101#false} is VALID [2022-02-21 04:21:38,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {2101#false} assume !(1 == ~main_in2_ev~0); {2101#false} is VALID [2022-02-21 04:21:38,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {2101#false} assume !(1 == ~main_sum_ev~0); {2101#false} is VALID [2022-02-21 04:21:38,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {2101#false} assume !(1 == ~main_diff_ev~0); {2101#false} is VALID [2022-02-21 04:21:38,727 INFO L290 TraceCheckUtils]: 34: Hoare triple {2101#false} assume !(1 == ~main_pres_ev~0); {2101#false} is VALID [2022-02-21 04:21:38,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {2101#false} assume !(1 == ~main_dbl_ev~0); {2101#false} is VALID [2022-02-21 04:21:38,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {2101#false} assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; {2101#false} is VALID [2022-02-21 04:21:38,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {2101#false} assume !(1 == ~main_clk_ev~0); {2101#false} is VALID [2022-02-21 04:21:38,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {2101#false} assume !(1 == ~main_clk_pos_edge~0); {2101#false} is VALID [2022-02-21 04:21:38,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {2101#false} assume !(1 == ~main_clk_neg_edge~0); {2101#false} is VALID [2022-02-21 04:21:38,728 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 04:21:38,728 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:38,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364298980] [2022-02-21 04:21:38,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364298980] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:38,728 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:38,729 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:21:38,729 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071400244] [2022-02-21 04:21:38,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:38,729 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:38,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:38,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1802774254, now seen corresponding path program 1 times [2022-02-21 04:21:38,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:38,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184942240] [2022-02-21 04:21:38,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:38,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:38,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {2104#true} assume !false; {2104#true} is VALID [2022-02-21 04:21:38,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {2104#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; {2104#true} is VALID [2022-02-21 04:21:38,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {2104#true} assume !false; {2104#true} is VALID [2022-02-21 04:21:38,759 INFO L290 TraceCheckUtils]: 3: Hoare triple {2104#true} assume !(0 == ~N_generate_st~0); {2104#true} is VALID [2022-02-21 04:21:38,759 INFO L290 TraceCheckUtils]: 4: Hoare triple {2104#true} assume !(0 == ~S1_addsub_st~0); {2104#true} is VALID [2022-02-21 04:21:38,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {2104#true} assume !(0 == ~S2_presdbl_st~0); {2104#true} is VALID [2022-02-21 04:21:38,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {2104#true} assume !(0 == ~S3_zero_st~0); {2104#true} is VALID [2022-02-21 04:21:38,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {2104#true} assume !(0 == ~D_print_st~0); {2104#true} is VALID [2022-02-21 04:21:38,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {2104#true} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; {2104#true} is VALID [2022-02-21 04:21:38,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {2104#true} assume !(1 == ~main_in1_req_up~0); {2104#true} is VALID [2022-02-21 04:21:38,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {2104#true} assume !(1 == ~main_in2_req_up~0); {2104#true} is VALID [2022-02-21 04:21:38,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {2104#true} assume !(1 == ~main_sum_req_up~0); {2104#true} is VALID [2022-02-21 04:21:38,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {2104#true} assume !(1 == ~main_diff_req_up~0); {2104#true} is VALID [2022-02-21 04:21:38,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#true} assume !(1 == ~main_pres_req_up~0); {2104#true} is VALID [2022-02-21 04:21:38,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {2104#true} assume !(1 == ~main_dbl_req_up~0); {2104#true} is VALID [2022-02-21 04:21:38,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {2104#true} assume !(1 == ~main_zero_req_up~0); {2104#true} is VALID [2022-02-21 04:21:38,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {2104#true} assume !(1 == ~main_clk_req_up~0); {2104#true} is VALID [2022-02-21 04:21:38,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {2104#true} start_simulation_~kernel_st~0#1 := 3; {2104#true} is VALID [2022-02-21 04:21:38,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {2104#true} assume !(0 == ~main_in1_ev~0); {2104#true} is VALID [2022-02-21 04:21:38,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {2104#true} assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:38,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:38,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:38,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:38,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:38,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:38,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:38,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(0 == ~main_clk_pos_edge~0); {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:38,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:38,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0; {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:38,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_clk_pos_edge~0;~S1_addsub_st~0 := 0; {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:38,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_clk_pos_edge~0;~S2_presdbl_st~0 := 0; {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:38,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:38,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_clk_pos_edge~0;~D_print_st~0 := 0; {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:38,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:38,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {2106#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_in2_ev~0); {2105#false} is VALID [2022-02-21 04:21:38,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {2105#false} assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; {2105#false} is VALID [2022-02-21 04:21:38,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {2105#false} assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; {2105#false} is VALID [2022-02-21 04:21:38,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {2105#false} assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; {2105#false} is VALID [2022-02-21 04:21:38,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {2105#false} assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; {2105#false} is VALID [2022-02-21 04:21:38,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {2105#false} assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; {2105#false} is VALID [2022-02-21 04:21:38,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {2105#false} assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; {2105#false} is VALID [2022-02-21 04:21:38,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {2105#false} assume 1 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 2; {2105#false} is VALID [2022-02-21 04:21:38,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {2105#false} assume !(1 == ~main_clk_neg_edge~0); {2105#false} is VALID [2022-02-21 04:21:38,768 INFO L290 TraceCheckUtils]: 43: Hoare triple {2105#false} assume 0 == ~N_generate_st~0; {2105#false} is VALID [2022-02-21 04:21:38,768 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 04:21:38,769 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:38,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184942240] [2022-02-21 04:21:38,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184942240] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:38,769 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:38,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:38,769 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113243598] [2022-02-21 04:21:38,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:38,770 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:38,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:38,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:21:38,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:21:38,771 INFO L87 Difference]: Start difference. First operand 416 states and 744 transitions. cyclomatic complexity: 330 Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 04:21:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:39,827 INFO L93 Difference]: Finished difference Result 760 states and 1352 transitions. [2022-02-21 04:21:39,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:21:39,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 04:21:39,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:39,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 760 states and 1352 transitions. [2022-02-21 04:21:39,872 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 703 [2022-02-21 04:21:39,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 760 states to 760 states and 1352 transitions. [2022-02-21 04:21:39,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 760 [2022-02-21 04:21:39,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 760 [2022-02-21 04:21:39,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 760 states and 1352 transitions. [2022-02-21 04:21:39,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:39,893 INFO L681 BuchiCegarLoop]: Abstraction has 760 states and 1352 transitions. [2022-02-21 04:21:39,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states and 1352 transitions. [2022-02-21 04:21:39,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2022-02-21 04:21:39,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:39,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 760 states and 1352 transitions. Second operand has 760 states, 760 states have (on average 1.7789473684210526) internal successors, (1352), 759 states have internal predecessors, (1352), 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 04:21:39,908 INFO L74 IsIncluded]: Start isIncluded. First operand 760 states and 1352 transitions. Second operand has 760 states, 760 states have (on average 1.7789473684210526) internal successors, (1352), 759 states have internal predecessors, (1352), 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 04:21:39,909 INFO L87 Difference]: Start difference. First operand 760 states and 1352 transitions. Second operand has 760 states, 760 states have (on average 1.7789473684210526) internal successors, (1352), 759 states have internal predecessors, (1352), 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 04:21:39,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:39,927 INFO L93 Difference]: Finished difference Result 760 states and 1352 transitions. [2022-02-21 04:21:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1352 transitions. [2022-02-21 04:21:39,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:39,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:39,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 760 states, 760 states have (on average 1.7789473684210526) internal successors, (1352), 759 states have internal predecessors, (1352), 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 760 states and 1352 transitions. [2022-02-21 04:21:39,932 INFO L87 Difference]: Start difference. First operand has 760 states, 760 states have (on average 1.7789473684210526) internal successors, (1352), 759 states have internal predecessors, (1352), 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 760 states and 1352 transitions. [2022-02-21 04:21:39,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:39,950 INFO L93 Difference]: Finished difference Result 760 states and 1352 transitions. [2022-02-21 04:21:39,950 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1352 transitions. [2022-02-21 04:21:39,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:39,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:39,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:39,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 760 states have (on average 1.7789473684210526) internal successors, (1352), 759 states have internal predecessors, (1352), 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 04:21:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1352 transitions. [2022-02-21 04:21:39,970 INFO L704 BuchiCegarLoop]: Abstraction has 760 states and 1352 transitions. [2022-02-21 04:21:39,970 INFO L587 BuchiCegarLoop]: Abstraction has 760 states and 1352 transitions. [2022-02-21 04:21:39,970 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:21:39,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 760 states and 1352 transitions. [2022-02-21 04:21:39,972 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 703 [2022-02-21 04:21:39,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:39,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:39,973 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:39,973 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:39,974 INFO L791 eck$LassoCheckResult]: Stem: 3295#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 3287#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 2930#L256 assume !(1 == ~main_in1_req_up~0); 2887#L256-2 assume !(1 == ~main_in2_req_up~0); 2889#L267-1 assume !(1 == ~main_sum_req_up~0); 2918#L278-1 assume !(1 == ~main_diff_req_up~0); 2870#L289-1 assume !(1 == ~main_pres_req_up~0); 2871#L300-1 assume !(1 == ~main_dbl_req_up~0); 2976#L311-1 assume !(1 == ~main_zero_req_up~0); 3124#L322-1 assume !(1 == ~main_clk_req_up~0); 3097#L333-1 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 3088#L351-1 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 2907#L356-1 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 2908#L361-1 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 3082#L366-1 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 3076#L371-1 assume !(0 == ~main_in1_ev~0); 2956#L376-1 assume !(0 == ~main_in2_ev~0); 2957#L381-1 assume !(0 == ~main_sum_ev~0); 3099#L386-1 assume !(0 == ~main_diff_ev~0); 3100#L391-1 assume !(0 == ~main_pres_ev~0); 3211#L396-1 assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; 3027#L401-1 assume !(0 == ~main_zero_ev~0); 3028#L406-1 assume !(0 == ~main_clk_ev~0); 3037#L411-1 assume !(0 == ~main_clk_pos_edge~0); 3278#L416-1 assume !(0 == ~main_clk_neg_edge~0); 3279#L421-1 assume !(1 == ~main_clk_pos_edge~0); 3262#L426-1 assume !(1 == ~main_clk_pos_edge~0); 3065#L431-1 assume !(1 == ~main_clk_pos_edge~0); 3066#L436-1 assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; 3045#L441-1 assume !(1 == ~main_clk_pos_edge~0); 3046#L446-1 assume !(1 == ~main_in1_ev~0); 3254#L451-1 assume !(1 == ~main_in2_ev~0); 3255#L456-1 assume !(1 == ~main_sum_ev~0); 3109#L461-1 assume !(1 == ~main_diff_ev~0); 3110#L466-1 assume !(1 == ~main_pres_ev~0); 3291#L471-1 assume !(1 == ~main_dbl_ev~0); 2920#L476-1 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 2921#L481-1 assume !(1 == ~main_clk_ev~0); 3044#L486-1 assume !(1 == ~main_clk_pos_edge~0); 2925#L491-1 assume !(1 == ~main_clk_neg_edge~0); 2926#L742-1 [2022-02-21 04:21:39,974 INFO L793 eck$LassoCheckResult]: Loop: 2926#L742-1 assume !false; 3578#L503 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 3573#L229 assume !false; 3571#L147 assume !(0 == ~N_generate_st~0); 3569#L151 assume !(0 == ~S1_addsub_st~0); 3567#L154 assume !(0 == ~S2_presdbl_st~0); 2880#L157 assume !(0 == ~S3_zero_st~0); 2882#L160 assume !(0 == ~D_print_st~0); 3221#L245 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 3222#L509 assume !(1 == ~main_in1_req_up~0); 3155#L509-2 assume !(1 == ~main_in2_req_up~0); 3156#L520-1 assume !(1 == ~main_sum_req_up~0); 3203#L531-1 assume !(1 == ~main_diff_req_up~0); 3118#L542-1 assume !(1 == ~main_pres_req_up~0); 2891#L553-1 assume !(1 == ~main_dbl_req_up~0); 3127#L564-1 assume !(1 == ~main_zero_req_up~0); 3138#L575-1 assume !(1 == ~main_clk_req_up~0); 3227#L586-1 start_simulation_~kernel_st~0#1 := 3; 3280#L605 assume !(0 == ~main_in1_ev~0); 3261#L605-2 assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; 2904#L610-1 assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; 2905#L615-1 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 3180#L620-1 assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; 3174#L625-1 assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; 3175#L630-1 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 3249#L635-1 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 3274#L640-1 assume !(0 == ~main_clk_pos_edge~0); 3035#L645-1 assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; 3036#L650-1 assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0; 3075#L655-1 assume 1 == ~main_clk_pos_edge~0;~S1_addsub_st~0 := 0; 3098#L660-1 assume 1 == ~main_clk_pos_edge~0;~S2_presdbl_st~0 := 0; 3188#L665-1 assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; 3223#L670-1 assume 1 == ~main_clk_pos_edge~0;~D_print_st~0 := 0; 3167#L675-1 assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; 3168#L680-1 assume !(1 == ~main_in2_ev~0); 3219#L685-1 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 3198#L690-1 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 3199#L695-1 assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; 3250#L700-1 assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; 3247#L705-1 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 3248#L710-1 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 3163#L715-1 assume 1 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 2; 3104#L720-1 assume !(1 == ~main_clk_neg_edge~0); 3105#L725-1 assume 0 == ~N_generate_st~0; 2926#L742-1 [2022-02-21 04:21:39,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:39,975 INFO L85 PathProgramCache]: Analyzing trace with hash 782320317, now seen corresponding path program 1 times [2022-02-21 04:21:39,975 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:39,975 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672659285] [2022-02-21 04:21:39,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:39,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:40,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {5153#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; {5153#true} is VALID [2022-02-21 04:21:40,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {5153#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:40,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} assume !(1 == ~main_in1_req_up~0); {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:40,020 INFO L290 TraceCheckUtils]: 3: Hoare triple {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} assume !(1 == ~main_in2_req_up~0); {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:40,020 INFO L290 TraceCheckUtils]: 4: Hoare triple {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} assume !(1 == ~main_sum_req_up~0); {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:40,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} assume !(1 == ~main_diff_req_up~0); {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:40,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} assume !(1 == ~main_pres_req_up~0); {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:40,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} assume !(1 == ~main_dbl_req_up~0); {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:40,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} assume !(1 == ~main_zero_req_up~0); {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:40,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} assume !(1 == ~main_clk_req_up~0); {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:40,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:40,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:40,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:40,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:40,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:40,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {5155#(= ~main_dbl_ev~0 ~main_in1_ev~0)} assume !(0 == ~main_in1_ev~0); {5156#(not (= ~main_dbl_ev~0 0))} is VALID [2022-02-21 04:21:40,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {5156#(not (= ~main_dbl_ev~0 0))} assume !(0 == ~main_in2_ev~0); {5156#(not (= ~main_dbl_ev~0 0))} is VALID [2022-02-21 04:21:40,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {5156#(not (= ~main_dbl_ev~0 0))} assume !(0 == ~main_sum_ev~0); {5156#(not (= ~main_dbl_ev~0 0))} is VALID [2022-02-21 04:21:40,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {5156#(not (= ~main_dbl_ev~0 0))} assume !(0 == ~main_diff_ev~0); {5156#(not (= ~main_dbl_ev~0 0))} is VALID [2022-02-21 04:21:40,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {5156#(not (= ~main_dbl_ev~0 0))} assume !(0 == ~main_pres_ev~0); {5156#(not (= ~main_dbl_ev~0 0))} is VALID [2022-02-21 04:21:40,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {5156#(not (= ~main_dbl_ev~0 0))} assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; {5154#false} is VALID [2022-02-21 04:21:40,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {5154#false} assume !(0 == ~main_zero_ev~0); {5154#false} is VALID [2022-02-21 04:21:40,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {5154#false} assume !(0 == ~main_clk_ev~0); {5154#false} is VALID [2022-02-21 04:21:40,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {5154#false} assume !(0 == ~main_clk_pos_edge~0); {5154#false} is VALID [2022-02-21 04:21:40,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {5154#false} assume !(0 == ~main_clk_neg_edge~0); {5154#false} is VALID [2022-02-21 04:21:40,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {5154#false} assume !(1 == ~main_clk_pos_edge~0); {5154#false} is VALID [2022-02-21 04:21:40,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {5154#false} assume !(1 == ~main_clk_pos_edge~0); {5154#false} is VALID [2022-02-21 04:21:40,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {5154#false} assume !(1 == ~main_clk_pos_edge~0); {5154#false} is VALID [2022-02-21 04:21:40,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {5154#false} assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; {5154#false} is VALID [2022-02-21 04:21:40,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {5154#false} assume !(1 == ~main_clk_pos_edge~0); {5154#false} is VALID [2022-02-21 04:21:40,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {5154#false} assume !(1 == ~main_in1_ev~0); {5154#false} is VALID [2022-02-21 04:21:40,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {5154#false} assume !(1 == ~main_in2_ev~0); {5154#false} is VALID [2022-02-21 04:21:40,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {5154#false} assume !(1 == ~main_sum_ev~0); {5154#false} is VALID [2022-02-21 04:21:40,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {5154#false} assume !(1 == ~main_diff_ev~0); {5154#false} is VALID [2022-02-21 04:21:40,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {5154#false} assume !(1 == ~main_pres_ev~0); {5154#false} is VALID [2022-02-21 04:21:40,027 INFO L290 TraceCheckUtils]: 35: Hoare triple {5154#false} assume !(1 == ~main_dbl_ev~0); {5154#false} is VALID [2022-02-21 04:21:40,028 INFO L290 TraceCheckUtils]: 36: Hoare triple {5154#false} assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; {5154#false} is VALID [2022-02-21 04:21:40,028 INFO L290 TraceCheckUtils]: 37: Hoare triple {5154#false} assume !(1 == ~main_clk_ev~0); {5154#false} is VALID [2022-02-21 04:21:40,028 INFO L290 TraceCheckUtils]: 38: Hoare triple {5154#false} assume !(1 == ~main_clk_pos_edge~0); {5154#false} is VALID [2022-02-21 04:21:40,028 INFO L290 TraceCheckUtils]: 39: Hoare triple {5154#false} assume !(1 == ~main_clk_neg_edge~0); {5154#false} is VALID [2022-02-21 04:21:40,028 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 04:21:40,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:40,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672659285] [2022-02-21 04:21:40,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672659285] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:40,029 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:40,029 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:21:40,029 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345148045] [2022-02-21 04:21:40,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:40,029 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:40,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:40,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1802774254, now seen corresponding path program 2 times [2022-02-21 04:21:40,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:40,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955320774] [2022-02-21 04:21:40,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:40,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:40,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {5157#true} assume !false; {5157#true} is VALID [2022-02-21 04:21:40,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {5157#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; {5157#true} is VALID [2022-02-21 04:21:40,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {5157#true} assume !false; {5157#true} is VALID [2022-02-21 04:21:40,053 INFO L290 TraceCheckUtils]: 3: Hoare triple {5157#true} assume !(0 == ~N_generate_st~0); {5157#true} is VALID [2022-02-21 04:21:40,053 INFO L290 TraceCheckUtils]: 4: Hoare triple {5157#true} assume !(0 == ~S1_addsub_st~0); {5157#true} is VALID [2022-02-21 04:21:40,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {5157#true} assume !(0 == ~S2_presdbl_st~0); {5157#true} is VALID [2022-02-21 04:21:40,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {5157#true} assume !(0 == ~S3_zero_st~0); {5157#true} is VALID [2022-02-21 04:21:40,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {5157#true} assume !(0 == ~D_print_st~0); {5157#true} is VALID [2022-02-21 04:21:40,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {5157#true} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; {5157#true} is VALID [2022-02-21 04:21:40,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {5157#true} assume !(1 == ~main_in1_req_up~0); {5157#true} is VALID [2022-02-21 04:21:40,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {5157#true} assume !(1 == ~main_in2_req_up~0); {5157#true} is VALID [2022-02-21 04:21:40,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {5157#true} assume !(1 == ~main_sum_req_up~0); {5157#true} is VALID [2022-02-21 04:21:40,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {5157#true} assume !(1 == ~main_diff_req_up~0); {5157#true} is VALID [2022-02-21 04:21:40,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {5157#true} assume !(1 == ~main_pres_req_up~0); {5157#true} is VALID [2022-02-21 04:21:40,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {5157#true} assume !(1 == ~main_dbl_req_up~0); {5157#true} is VALID [2022-02-21 04:21:40,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {5157#true} assume !(1 == ~main_zero_req_up~0); {5157#true} is VALID [2022-02-21 04:21:40,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {5157#true} assume !(1 == ~main_clk_req_up~0); {5157#true} is VALID [2022-02-21 04:21:40,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {5157#true} start_simulation_~kernel_st~0#1 := 3; {5157#true} is VALID [2022-02-21 04:21:40,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {5157#true} assume !(0 == ~main_in1_ev~0); {5157#true} is VALID [2022-02-21 04:21:40,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {5157#true} assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:40,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:40,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:40,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:40,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:40,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:40,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:40,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(0 == ~main_clk_pos_edge~0); {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:40,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:40,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0; {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:40,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_clk_pos_edge~0;~S1_addsub_st~0 := 0; {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:40,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_clk_pos_edge~0;~S2_presdbl_st~0 := 0; {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:40,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:40,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_clk_pos_edge~0;~D_print_st~0 := 0; {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:40,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:40,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {5159#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_in2_ev~0); {5158#false} is VALID [2022-02-21 04:21:40,060 INFO L290 TraceCheckUtils]: 35: Hoare triple {5158#false} assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; {5158#false} is VALID [2022-02-21 04:21:40,061 INFO L290 TraceCheckUtils]: 36: Hoare triple {5158#false} assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; {5158#false} is VALID [2022-02-21 04:21:40,061 INFO L290 TraceCheckUtils]: 37: Hoare triple {5158#false} assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; {5158#false} is VALID [2022-02-21 04:21:40,061 INFO L290 TraceCheckUtils]: 38: Hoare triple {5158#false} assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; {5158#false} is VALID [2022-02-21 04:21:40,061 INFO L290 TraceCheckUtils]: 39: Hoare triple {5158#false} assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; {5158#false} is VALID [2022-02-21 04:21:40,061 INFO L290 TraceCheckUtils]: 40: Hoare triple {5158#false} assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; {5158#false} is VALID [2022-02-21 04:21:40,061 INFO L290 TraceCheckUtils]: 41: Hoare triple {5158#false} assume 1 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 2; {5158#false} is VALID [2022-02-21 04:21:40,061 INFO L290 TraceCheckUtils]: 42: Hoare triple {5158#false} assume !(1 == ~main_clk_neg_edge~0); {5158#false} is VALID [2022-02-21 04:21:40,062 INFO L290 TraceCheckUtils]: 43: Hoare triple {5158#false} assume 0 == ~N_generate_st~0; {5158#false} is VALID [2022-02-21 04:21:40,062 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 04:21:40,062 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:40,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955320774] [2022-02-21 04:21:40,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955320774] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:40,062 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:40,063 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:40,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098278582] [2022-02-21 04:21:40,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:40,063 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:40,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:40,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:21:40,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:21:40,064 INFO L87 Difference]: Start difference. First operand 760 states and 1352 transitions. cyclomatic complexity: 596 Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 04:21:41,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:41,276 INFO L93 Difference]: Finished difference Result 1669 states and 2937 transitions. [2022-02-21 04:21:41,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:21:41,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 04:21:41,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:41,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1669 states and 2937 transitions. [2022-02-21 04:21:41,370 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1572 [2022-02-21 04:21:41,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1669 states to 1669 states and 2937 transitions. [2022-02-21 04:21:41,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1669 [2022-02-21 04:21:41,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1669 [2022-02-21 04:21:41,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1669 states and 2937 transitions. [2022-02-21 04:21:41,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:41,439 INFO L681 BuchiCegarLoop]: Abstraction has 1669 states and 2937 transitions. [2022-02-21 04:21:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states and 2937 transitions. [2022-02-21 04:21:41,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1669. [2022-02-21 04:21:41,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:41,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1669 states and 2937 transitions. Second operand has 1669 states, 1669 states have (on average 1.7597363690832835) internal successors, (2937), 1668 states have internal predecessors, (2937), 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 04:21:41,469 INFO L74 IsIncluded]: Start isIncluded. First operand 1669 states and 2937 transitions. Second operand has 1669 states, 1669 states have (on average 1.7597363690832835) internal successors, (2937), 1668 states have internal predecessors, (2937), 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 04:21:41,474 INFO L87 Difference]: Start difference. First operand 1669 states and 2937 transitions. Second operand has 1669 states, 1669 states have (on average 1.7597363690832835) internal successors, (2937), 1668 states have internal predecessors, (2937), 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 04:21:41,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:41,538 INFO L93 Difference]: Finished difference Result 1669 states and 2937 transitions. [2022-02-21 04:21:41,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2937 transitions. [2022-02-21 04:21:41,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:41,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:41,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 1669 states, 1669 states have (on average 1.7597363690832835) internal successors, (2937), 1668 states have internal predecessors, (2937), 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 1669 states and 2937 transitions. [2022-02-21 04:21:41,549 INFO L87 Difference]: Start difference. First operand has 1669 states, 1669 states have (on average 1.7597363690832835) internal successors, (2937), 1668 states have internal predecessors, (2937), 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 1669 states and 2937 transitions. [2022-02-21 04:21:41,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:41,614 INFO L93 Difference]: Finished difference Result 1669 states and 2937 transitions. [2022-02-21 04:21:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2937 transitions. [2022-02-21 04:21:41,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:41,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:41,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:41,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1669 states have (on average 1.7597363690832835) internal successors, (2937), 1668 states have internal predecessors, (2937), 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 04:21:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2937 transitions. [2022-02-21 04:21:41,684 INFO L704 BuchiCegarLoop]: Abstraction has 1669 states and 2937 transitions. [2022-02-21 04:21:41,684 INFO L587 BuchiCegarLoop]: Abstraction has 1669 states and 2937 transitions. [2022-02-21 04:21:41,685 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:21:41,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1669 states and 2937 transitions. [2022-02-21 04:21:41,690 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1572 [2022-02-21 04:21:41,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:41,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:41,691 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:41,691 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:41,691 INFO L791 eck$LassoCheckResult]: Stem: 7315#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 7291#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 6891#L256 assume !(1 == ~main_in1_req_up~0); 6848#L256-2 assume !(1 == ~main_in2_req_up~0); 6850#L267-1 assume !(1 == ~main_sum_req_up~0); 6879#L278-1 assume !(1 == ~main_diff_req_up~0); 6831#L289-1 assume !(1 == ~main_pres_req_up~0); 6832#L300-1 assume !(1 == ~main_dbl_req_up~0); 7098#L311-1 assume !(1 == ~main_zero_req_up~0); 7096#L322-1 assume !(1 == ~main_clk_req_up~0); 7328#L333-1 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 7327#L351-1 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 6868#L356-1 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 6869#L361-1 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 7050#L366-1 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 7044#L371-1 assume !(0 == ~main_in1_ev~0); 6918#L376-1 assume !(0 == ~main_in2_ev~0); 6919#L381-1 assume !(0 == ~main_sum_ev~0); 7322#L386-1 assume !(0 == ~main_diff_ev~0); 7269#L391-1 assume !(0 == ~main_pres_ev~0); 7192#L396-1 assume !(0 == ~main_dbl_ev~0); 6989#L401-1 assume !(0 == ~main_zero_ev~0); 6990#L406-1 assume !(0 == ~main_clk_ev~0); 7000#L411-1 assume !(0 == ~main_clk_pos_edge~0); 7278#L416-1 assume !(0 == ~main_clk_neg_edge~0); 7279#L421-1 assume !(1 == ~main_clk_pos_edge~0); 7249#L426-1 assume !(1 == ~main_clk_pos_edge~0); 7032#L431-1 assume !(1 == ~main_clk_pos_edge~0); 7033#L436-1 assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; 7198#L441-1 assume !(1 == ~main_clk_pos_edge~0); 8070#L446-1 assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; 7238#L451-1 assume !(1 == ~main_in2_ev~0); 7239#L456-1 assume !(1 == ~main_sum_ev~0); 7309#L461-1 assume !(1 == ~main_diff_ev~0); 8062#L466-1 assume !(1 == ~main_pres_ev~0); 8060#L471-1 assume !(1 == ~main_dbl_ev~0); 7314#L476-1 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 8057#L481-1 assume !(1 == ~main_clk_ev~0); 8055#L486-1 assume !(1 == ~main_clk_pos_edge~0); 8043#L491-1 assume !(1 == ~main_clk_neg_edge~0); 7476#L742-1 [2022-02-21 04:21:41,692 INFO L793 eck$LassoCheckResult]: Loop: 7476#L742-1 assume !false; 7472#L503 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 7469#L229 assume !false; 7465#L147 assume !(0 == ~N_generate_st~0); 7464#L151 assume !(0 == ~S1_addsub_st~0); 7428#L154 assume !(0 == ~S2_presdbl_st~0); 6841#L157 assume !(0 == ~S3_zero_st~0); 6843#L160 assume !(0 == ~D_print_st~0); 7253#L245 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 8450#L509 assume !(1 == ~main_in1_req_up~0); 8448#L509-2 assume !(1 == ~main_in2_req_up~0); 8445#L520-1 assume !(1 == ~main_sum_req_up~0); 8441#L531-1 assume !(1 == ~main_diff_req_up~0); 7474#L542-1 assume !(1 == ~main_pres_req_up~0); 7308#L553-1 assume !(1 == ~main_dbl_req_up~0); 7101#L564-1 assume !(1 == ~main_zero_req_up~0); 8431#L575-1 assume !(1 == ~main_clk_req_up~0); 8429#L586-1 start_simulation_~kernel_st~0#1 := 3; 8424#L605 assume !(0 == ~main_in1_ev~0); 8425#L605-2 assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; 6865#L610-1 assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; 6866#L615-1 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 7156#L620-1 assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; 7151#L625-1 assume !(0 == ~main_dbl_ev~0); 7152#L630-1 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 7233#L635-1 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 7270#L640-1 assume !(0 == ~main_clk_pos_edge~0); 6998#L645-1 assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; 6999#L650-1 assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0; 7043#L655-1 assume 1 == ~main_clk_pos_edge~0;~S1_addsub_st~0 := 0; 7068#L660-1 assume 1 == ~main_clk_pos_edge~0;~S2_presdbl_st~0 := 0; 7167#L665-1 assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; 7205#L670-1 assume 1 == ~main_clk_pos_edge~0;~D_print_st~0 := 0; 7144#L675-1 assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; 7145#L680-1 assume !(1 == ~main_in2_ev~0); 7201#L685-1 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 7178#L690-1 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 7179#L695-1 assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; 7234#L700-1 assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; 7231#L705-1 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 7232#L710-1 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 7139#L715-1 assume 1 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 2; 7074#L720-1 assume !(1 == ~main_clk_neg_edge~0); 7075#L725-1 assume 0 == ~N_generate_st~0; 7476#L742-1 [2022-02-21 04:21:41,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:41,692 INFO L85 PathProgramCache]: Analyzing trace with hash 357698877, now seen corresponding path program 1 times [2022-02-21 04:21:41,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:41,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099499011] [2022-02-21 04:21:41,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:41,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:41,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {11841#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; {11841#true} is VALID [2022-02-21 04:21:41,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {11841#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; {11841#true} is VALID [2022-02-21 04:21:41,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {11841#true} assume !(1 == ~main_in1_req_up~0); {11841#true} is VALID [2022-02-21 04:21:41,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {11841#true} assume !(1 == ~main_in2_req_up~0); {11841#true} is VALID [2022-02-21 04:21:41,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {11841#true} assume !(1 == ~main_sum_req_up~0); {11841#true} is VALID [2022-02-21 04:21:41,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {11841#true} assume !(1 == ~main_diff_req_up~0); {11841#true} is VALID [2022-02-21 04:21:41,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {11841#true} assume !(1 == ~main_pres_req_up~0); {11841#true} is VALID [2022-02-21 04:21:41,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {11841#true} assume !(1 == ~main_dbl_req_up~0); {11841#true} is VALID [2022-02-21 04:21:41,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {11841#true} assume !(1 == ~main_zero_req_up~0); {11841#true} is VALID [2022-02-21 04:21:41,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {11841#true} assume !(1 == ~main_clk_req_up~0); {11841#true} is VALID [2022-02-21 04:21:41,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {11841#true} assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; {11841#true} is VALID [2022-02-21 04:21:41,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {11841#true} assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; {11841#true} is VALID [2022-02-21 04:21:41,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {11841#true} assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; {11841#true} is VALID [2022-02-21 04:21:41,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {11841#true} assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; {11841#true} is VALID [2022-02-21 04:21:41,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {11841#true} assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; {11841#true} is VALID [2022-02-21 04:21:41,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {11841#true} assume !(0 == ~main_in1_ev~0); {11841#true} is VALID [2022-02-21 04:21:41,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {11841#true} assume !(0 == ~main_in2_ev~0); {11841#true} is VALID [2022-02-21 04:21:41,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {11841#true} assume !(0 == ~main_sum_ev~0); {11841#true} is VALID [2022-02-21 04:21:41,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {11841#true} assume !(0 == ~main_diff_ev~0); {11841#true} is VALID [2022-02-21 04:21:41,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {11841#true} assume !(0 == ~main_pres_ev~0); {11841#true} is VALID [2022-02-21 04:21:41,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {11841#true} assume !(0 == ~main_dbl_ev~0); {11841#true} is VALID [2022-02-21 04:21:41,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {11841#true} assume !(0 == ~main_zero_ev~0); {11841#true} is VALID [2022-02-21 04:21:41,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {11841#true} assume !(0 == ~main_clk_ev~0); {11841#true} is VALID [2022-02-21 04:21:41,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {11841#true} assume !(0 == ~main_clk_pos_edge~0); {11841#true} is VALID [2022-02-21 04:21:41,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {11841#true} assume !(0 == ~main_clk_neg_edge~0); {11841#true} is VALID [2022-02-21 04:21:41,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {11841#true} assume !(1 == ~main_clk_pos_edge~0); {11843#(not (= ~main_clk_pos_edge~0 1))} is VALID [2022-02-21 04:21:41,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {11843#(not (= ~main_clk_pos_edge~0 1))} assume !(1 == ~main_clk_pos_edge~0); {11843#(not (= ~main_clk_pos_edge~0 1))} is VALID [2022-02-21 04:21:41,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {11843#(not (= ~main_clk_pos_edge~0 1))} assume !(1 == ~main_clk_pos_edge~0); {11843#(not (= ~main_clk_pos_edge~0 1))} is VALID [2022-02-21 04:21:41,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {11843#(not (= ~main_clk_pos_edge~0 1))} assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; {11842#false} is VALID [2022-02-21 04:21:41,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {11842#false} assume !(1 == ~main_clk_pos_edge~0); {11842#false} is VALID [2022-02-21 04:21:41,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {11842#false} assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; {11842#false} is VALID [2022-02-21 04:21:41,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {11842#false} assume !(1 == ~main_in2_ev~0); {11842#false} is VALID [2022-02-21 04:21:41,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {11842#false} assume !(1 == ~main_sum_ev~0); {11842#false} is VALID [2022-02-21 04:21:41,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {11842#false} assume !(1 == ~main_diff_ev~0); {11842#false} is VALID [2022-02-21 04:21:41,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {11842#false} assume !(1 == ~main_pres_ev~0); {11842#false} is VALID [2022-02-21 04:21:41,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {11842#false} assume !(1 == ~main_dbl_ev~0); {11842#false} is VALID [2022-02-21 04:21:41,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {11842#false} assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; {11842#false} is VALID [2022-02-21 04:21:41,724 INFO L290 TraceCheckUtils]: 37: Hoare triple {11842#false} assume !(1 == ~main_clk_ev~0); {11842#false} is VALID [2022-02-21 04:21:41,724 INFO L290 TraceCheckUtils]: 38: Hoare triple {11842#false} assume !(1 == ~main_clk_pos_edge~0); {11842#false} is VALID [2022-02-21 04:21:41,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {11842#false} assume !(1 == ~main_clk_neg_edge~0); {11842#false} is VALID [2022-02-21 04:21:41,724 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 04:21:41,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:41,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099499011] [2022-02-21 04:21:41,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099499011] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:41,725 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:41,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:41,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397057696] [2022-02-21 04:21:41,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:41,725 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:41,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:41,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2069491216, now seen corresponding path program 1 times [2022-02-21 04:21:41,726 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:41,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636518377] [2022-02-21 04:21:41,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:41,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:41,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {11844#true} assume !false; {11844#true} is VALID [2022-02-21 04:21:41,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {11844#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; {11844#true} is VALID [2022-02-21 04:21:41,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {11844#true} assume !false; {11844#true} is VALID [2022-02-21 04:21:41,749 INFO L290 TraceCheckUtils]: 3: Hoare triple {11844#true} assume !(0 == ~N_generate_st~0); {11844#true} is VALID [2022-02-21 04:21:41,749 INFO L290 TraceCheckUtils]: 4: Hoare triple {11844#true} assume !(0 == ~S1_addsub_st~0); {11844#true} is VALID [2022-02-21 04:21:41,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {11844#true} assume !(0 == ~S2_presdbl_st~0); {11844#true} is VALID [2022-02-21 04:21:41,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {11844#true} assume !(0 == ~S3_zero_st~0); {11844#true} is VALID [2022-02-21 04:21:41,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {11844#true} assume !(0 == ~D_print_st~0); {11844#true} is VALID [2022-02-21 04:21:41,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {11844#true} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; {11844#true} is VALID [2022-02-21 04:21:41,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {11844#true} assume !(1 == ~main_in1_req_up~0); {11844#true} is VALID [2022-02-21 04:21:41,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {11844#true} assume !(1 == ~main_in2_req_up~0); {11844#true} is VALID [2022-02-21 04:21:41,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {11844#true} assume !(1 == ~main_sum_req_up~0); {11844#true} is VALID [2022-02-21 04:21:41,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {11844#true} assume !(1 == ~main_diff_req_up~0); {11844#true} is VALID [2022-02-21 04:21:41,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {11844#true} assume !(1 == ~main_pres_req_up~0); {11844#true} is VALID [2022-02-21 04:21:41,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {11844#true} assume !(1 == ~main_dbl_req_up~0); {11844#true} is VALID [2022-02-21 04:21:41,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {11844#true} assume !(1 == ~main_zero_req_up~0); {11844#true} is VALID [2022-02-21 04:21:41,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {11844#true} assume !(1 == ~main_clk_req_up~0); {11844#true} is VALID [2022-02-21 04:21:41,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {11844#true} start_simulation_~kernel_st~0#1 := 3; {11844#true} is VALID [2022-02-21 04:21:41,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {11844#true} assume !(0 == ~main_in1_ev~0); {11844#true} is VALID [2022-02-21 04:21:41,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {11844#true} assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:41,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:41,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:41,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:41,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(0 == ~main_dbl_ev~0); {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:41,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:41,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:41,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(0 == ~main_clk_pos_edge~0); {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:41,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:41,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0; {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:41,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_clk_pos_edge~0;~S1_addsub_st~0 := 0; {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:41,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_clk_pos_edge~0;~S2_presdbl_st~0 := 0; {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:41,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:41,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_clk_pos_edge~0;~D_print_st~0 := 0; {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:41,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:41,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {11846#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_in2_ev~0); {11845#false} is VALID [2022-02-21 04:21:41,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {11845#false} assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; {11845#false} is VALID [2022-02-21 04:21:41,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {11845#false} assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; {11845#false} is VALID [2022-02-21 04:21:41,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {11845#false} assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; {11845#false} is VALID [2022-02-21 04:21:41,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {11845#false} assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; {11845#false} is VALID [2022-02-21 04:21:41,767 INFO L290 TraceCheckUtils]: 39: Hoare triple {11845#false} assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; {11845#false} is VALID [2022-02-21 04:21:41,767 INFO L290 TraceCheckUtils]: 40: Hoare triple {11845#false} assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; {11845#false} is VALID [2022-02-21 04:21:41,767 INFO L290 TraceCheckUtils]: 41: Hoare triple {11845#false} assume 1 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 2; {11845#false} is VALID [2022-02-21 04:21:41,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {11845#false} assume !(1 == ~main_clk_neg_edge~0); {11845#false} is VALID [2022-02-21 04:21:41,768 INFO L290 TraceCheckUtils]: 43: Hoare triple {11845#false} assume 0 == ~N_generate_st~0; {11845#false} is VALID [2022-02-21 04:21:41,768 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 04:21:41,768 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:41,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636518377] [2022-02-21 04:21:41,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636518377] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:41,768 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:41,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:41,769 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314606151] [2022-02-21 04:21:41,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:41,769 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:41,769 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:41,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:21:41,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:21:41,770 INFO L87 Difference]: Start difference. First operand 1669 states and 2937 transitions. cyclomatic complexity: 1276 Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 04:21:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:42,405 INFO L93 Difference]: Finished difference Result 1999 states and 3465 transitions. [2022-02-21 04:21:42,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:21:42,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 04:21:42,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:42,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1999 states and 3465 transitions. [2022-02-21 04:21:42,514 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1872 [2022-02-21 04:21:42,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1999 states to 1999 states and 3465 transitions. [2022-02-21 04:21:42,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1999 [2022-02-21 04:21:42,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1999 [2022-02-21 04:21:42,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1999 states and 3465 transitions. [2022-02-21 04:21:42,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:42,605 INFO L681 BuchiCegarLoop]: Abstraction has 1999 states and 3465 transitions. [2022-02-21 04:21:42,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states and 3465 transitions. [2022-02-21 04:21:42,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1999. [2022-02-21 04:21:42,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:42,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1999 states and 3465 transitions. Second operand has 1999 states, 1999 states have (on average 1.7333666833416708) internal successors, (3465), 1998 states have internal predecessors, (3465), 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 04:21:42,637 INFO L74 IsIncluded]: Start isIncluded. First operand 1999 states and 3465 transitions. Second operand has 1999 states, 1999 states have (on average 1.7333666833416708) internal successors, (3465), 1998 states have internal predecessors, (3465), 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 04:21:42,650 INFO L87 Difference]: Start difference. First operand 1999 states and 3465 transitions. Second operand has 1999 states, 1999 states have (on average 1.7333666833416708) internal successors, (3465), 1998 states have internal predecessors, (3465), 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 04:21:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:42,741 INFO L93 Difference]: Finished difference Result 1999 states and 3465 transitions. [2022-02-21 04:21:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 3465 transitions. [2022-02-21 04:21:42,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:42,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:42,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 1999 states, 1999 states have (on average 1.7333666833416708) internal successors, (3465), 1998 states have internal predecessors, (3465), 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 1999 states and 3465 transitions. [2022-02-21 04:21:42,748 INFO L87 Difference]: Start difference. First operand has 1999 states, 1999 states have (on average 1.7333666833416708) internal successors, (3465), 1998 states have internal predecessors, (3465), 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 1999 states and 3465 transitions. [2022-02-21 04:21:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:42,834 INFO L93 Difference]: Finished difference Result 1999 states and 3465 transitions. [2022-02-21 04:21:42,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 3465 transitions. [2022-02-21 04:21:42,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:42,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:42,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:42,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1999 states, 1999 states have (on average 1.7333666833416708) internal successors, (3465), 1998 states have internal predecessors, (3465), 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 04:21:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 3465 transitions. [2022-02-21 04:21:42,925 INFO L704 BuchiCegarLoop]: Abstraction has 1999 states and 3465 transitions. [2022-02-21 04:21:42,925 INFO L587 BuchiCegarLoop]: Abstraction has 1999 states and 3465 transitions. [2022-02-21 04:21:42,925 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:21:42,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1999 states and 3465 transitions. [2022-02-21 04:21:42,931 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1872 [2022-02-21 04:21:42,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:42,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:42,932 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:42,932 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:42,932 INFO L791 eck$LassoCheckResult]: Stem: 14328#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 14310#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 13908#L256 assume !(1 == ~main_in1_req_up~0); 13863#L256-2 assume !(1 == ~main_in2_req_up~0); 13865#L267-1 assume !(1 == ~main_sum_req_up~0); 13894#L278-1 assume !(1 == ~main_diff_req_up~0); 13846#L289-1 assume !(1 == ~main_pres_req_up~0); 13847#L300-1 assume !(1 == ~main_dbl_req_up~0); 13959#L311-1 assume !(1 == ~main_zero_req_up~0); 14288#L322-1 assume !(1 == ~main_clk_req_up~0); 14087#L333-1 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 14074#L351-1 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 14075#L356-1 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 14337#L361-1 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 14298#L366-1 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 14063#L371-1 assume !(0 == ~main_in1_ev~0); 13935#L376-1 assume !(0 == ~main_in2_ev~0); 13936#L381-1 assume !(0 == ~main_sum_ev~0); 14334#L386-1 assume !(0 == ~main_diff_ev~0); 14285#L391-1 assume !(0 == ~main_pres_ev~0); 14214#L396-1 assume !(0 == ~main_dbl_ev~0); 14215#L401-1 assume !(0 == ~main_zero_ev~0); 15320#L406-1 assume !(0 == ~main_clk_ev~0); 15318#L411-1 assume 0 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 1; 15317#L416-1 assume !(0 == ~main_clk_neg_edge~0); 15315#L421-1 assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0; 15313#L426-1 assume 1 == ~main_clk_pos_edge~0;~S1_addsub_st~0 := 0; 15311#L431-1 assume 1 == ~main_clk_pos_edge~0;~S2_presdbl_st~0 := 0; 15309#L436-1 assume !(1 == ~main_clk_pos_edge~0); 15310#L441-1 assume !(1 == ~main_clk_pos_edge~0); 15308#L446-1 assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; 14260#L451-1 assume !(1 == ~main_in2_ev~0); 14261#L456-1 assume !(1 == ~main_sum_ev~0); 14100#L461-1 assume !(1 == ~main_diff_ev~0); 14101#L466-1 assume !(1 == ~main_pres_ev~0); 14320#L471-1 assume !(1 == ~main_dbl_ev~0); 13896#L476-1 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 13897#L481-1 assume !(1 == ~main_clk_ev~0); 14027#L486-1 assume !(1 == ~main_clk_pos_edge~0); 13901#L491-1 assume !(1 == ~main_clk_neg_edge~0); 13902#L742-1 [2022-02-21 04:21:42,932 INFO L793 eck$LassoCheckResult]: Loop: 13902#L742-1 assume !false; 14236#L503 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 13939#L229 assume !false; 14189#L147 assume !(0 == ~N_generate_st~0); 13972#L151 assume !(0 == ~S1_addsub_st~0); 13973#L154 assume !(0 == ~S2_presdbl_st~0); 13856#L157 assume !(0 == ~S3_zero_st~0); 13858#L160 assume !(0 == ~D_print_st~0); 14224#L245 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 14225#L509 assume !(1 == ~main_in1_req_up~0); 14153#L509-2 assume !(1 == ~main_in2_req_up~0); 14154#L520-1 assume !(1 == ~main_sum_req_up~0); 14206#L531-1 assume !(1 == ~main_diff_req_up~0); 14207#L542-1 assume !(1 == ~main_pres_req_up~0); 15684#L553-1 assume !(1 == ~main_dbl_req_up~0); 15680#L564-1 assume !(1 == ~main_zero_req_up~0); 15676#L575-1 assume !(1 == ~main_clk_req_up~0); 15673#L586-1 start_simulation_~kernel_st~0#1 := 3; 15671#L605 assume !(0 == ~main_in1_ev~0); 15669#L605-2 assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; 15667#L610-1 assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; 15665#L615-1 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 15663#L620-1 assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; 15660#L625-1 assume !(0 == ~main_dbl_ev~0); 15657#L630-1 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 15654#L635-1 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 15650#L640-1 assume !(0 == ~main_clk_pos_edge~0); 15651#L645-1 assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; 15739#L650-1 assume !(1 == ~main_clk_pos_edge~0); 14088#L655-1 assume !(1 == ~main_clk_pos_edge~0); 14089#L660-1 assume !(1 == ~main_clk_pos_edge~0); 15590#L665-1 assume !(1 == ~main_clk_pos_edge~0); 15225#L670-1 assume !(1 == ~main_clk_pos_edge~0); 15221#L675-1 assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; 15217#L680-1 assume !(1 == ~main_in2_ev~0); 15215#L685-1 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 15213#L690-1 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 15211#L695-1 assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; 15207#L700-1 assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; 15204#L705-1 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 15202#L710-1 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 15201#L715-1 assume !(1 == ~main_clk_pos_edge~0); 15136#L720-1 assume !(1 == ~main_clk_neg_edge~0); 15133#L725-1 assume 0 == ~N_generate_st~0; 13902#L742-1 [2022-02-21 04:21:42,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:42,933 INFO L85 PathProgramCache]: Analyzing trace with hash 787031863, now seen corresponding path program 1 times [2022-02-21 04:21:42,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:42,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391064439] [2022-02-21 04:21:42,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:42,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:42,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {19846#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; {19846#true} is VALID [2022-02-21 04:21:42,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {19846#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:42,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~main_in1_req_up~0); {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:42,959 INFO L290 TraceCheckUtils]: 3: Hoare triple {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~main_in2_req_up~0); {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:42,959 INFO L290 TraceCheckUtils]: 4: Hoare triple {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~main_sum_req_up~0); {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:42,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~main_diff_req_up~0); {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:42,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~main_pres_req_up~0); {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:42,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~main_dbl_req_up~0); {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:42,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~main_zero_req_up~0); {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:42,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~main_clk_req_up~0); {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:42,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:42,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:42,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:42,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:42,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:42,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {19848#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(0 == ~main_in1_ev~0); {19849#(not (= ~main_clk_pos_edge~0 0))} is VALID [2022-02-21 04:21:42,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {19849#(not (= ~main_clk_pos_edge~0 0))} assume !(0 == ~main_in2_ev~0); {19849#(not (= ~main_clk_pos_edge~0 0))} is VALID [2022-02-21 04:21:42,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {19849#(not (= ~main_clk_pos_edge~0 0))} assume !(0 == ~main_sum_ev~0); {19849#(not (= ~main_clk_pos_edge~0 0))} is VALID [2022-02-21 04:21:42,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {19849#(not (= ~main_clk_pos_edge~0 0))} assume !(0 == ~main_diff_ev~0); {19849#(not (= ~main_clk_pos_edge~0 0))} is VALID [2022-02-21 04:21:42,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {19849#(not (= ~main_clk_pos_edge~0 0))} assume !(0 == ~main_pres_ev~0); {19849#(not (= ~main_clk_pos_edge~0 0))} is VALID [2022-02-21 04:21:42,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {19849#(not (= ~main_clk_pos_edge~0 0))} assume !(0 == ~main_dbl_ev~0); {19849#(not (= ~main_clk_pos_edge~0 0))} is VALID [2022-02-21 04:21:42,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {19849#(not (= ~main_clk_pos_edge~0 0))} assume !(0 == ~main_zero_ev~0); {19849#(not (= ~main_clk_pos_edge~0 0))} is VALID [2022-02-21 04:21:42,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {19849#(not (= ~main_clk_pos_edge~0 0))} assume !(0 == ~main_clk_ev~0); {19849#(not (= ~main_clk_pos_edge~0 0))} is VALID [2022-02-21 04:21:42,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {19849#(not (= ~main_clk_pos_edge~0 0))} assume 0 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 1; {19847#false} is VALID [2022-02-21 04:21:42,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {19847#false} assume !(0 == ~main_clk_neg_edge~0); {19847#false} is VALID [2022-02-21 04:21:42,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {19847#false} assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0; {19847#false} is VALID [2022-02-21 04:21:42,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {19847#false} assume 1 == ~main_clk_pos_edge~0;~S1_addsub_st~0 := 0; {19847#false} is VALID [2022-02-21 04:21:42,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {19847#false} assume 1 == ~main_clk_pos_edge~0;~S2_presdbl_st~0 := 0; {19847#false} is VALID [2022-02-21 04:21:42,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {19847#false} assume !(1 == ~main_clk_pos_edge~0); {19847#false} is VALID [2022-02-21 04:21:42,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {19847#false} assume !(1 == ~main_clk_pos_edge~0); {19847#false} is VALID [2022-02-21 04:21:42,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {19847#false} assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; {19847#false} is VALID [2022-02-21 04:21:42,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {19847#false} assume !(1 == ~main_in2_ev~0); {19847#false} is VALID [2022-02-21 04:21:42,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {19847#false} assume !(1 == ~main_sum_ev~0); {19847#false} is VALID [2022-02-21 04:21:42,966 INFO L290 TraceCheckUtils]: 33: Hoare triple {19847#false} assume !(1 == ~main_diff_ev~0); {19847#false} is VALID [2022-02-21 04:21:42,966 INFO L290 TraceCheckUtils]: 34: Hoare triple {19847#false} assume !(1 == ~main_pres_ev~0); {19847#false} is VALID [2022-02-21 04:21:42,966 INFO L290 TraceCheckUtils]: 35: Hoare triple {19847#false} assume !(1 == ~main_dbl_ev~0); {19847#false} is VALID [2022-02-21 04:21:42,967 INFO L290 TraceCheckUtils]: 36: Hoare triple {19847#false} assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; {19847#false} is VALID [2022-02-21 04:21:42,967 INFO L290 TraceCheckUtils]: 37: Hoare triple {19847#false} assume !(1 == ~main_clk_ev~0); {19847#false} is VALID [2022-02-21 04:21:42,967 INFO L290 TraceCheckUtils]: 38: Hoare triple {19847#false} assume !(1 == ~main_clk_pos_edge~0); {19847#false} is VALID [2022-02-21 04:21:42,967 INFO L290 TraceCheckUtils]: 39: Hoare triple {19847#false} assume !(1 == ~main_clk_neg_edge~0); {19847#false} is VALID [2022-02-21 04:21:42,967 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 04:21:42,967 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:42,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391064439] [2022-02-21 04:21:42,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391064439] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:42,968 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:42,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:21:42,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101002857] [2022-02-21 04:21:42,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:42,968 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:42,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:42,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1415211856, now seen corresponding path program 1 times [2022-02-21 04:21:42,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:42,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453498119] [2022-02-21 04:21:42,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:42,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:43,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {19850#true} assume !false; {19850#true} is VALID [2022-02-21 04:21:43,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {19850#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; {19850#true} is VALID [2022-02-21 04:21:43,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {19850#true} assume !false; {19850#true} is VALID [2022-02-21 04:21:43,002 INFO L290 TraceCheckUtils]: 3: Hoare triple {19850#true} assume !(0 == ~N_generate_st~0); {19850#true} is VALID [2022-02-21 04:21:43,003 INFO L290 TraceCheckUtils]: 4: Hoare triple {19850#true} assume !(0 == ~S1_addsub_st~0); {19850#true} is VALID [2022-02-21 04:21:43,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {19850#true} assume !(0 == ~S2_presdbl_st~0); {19850#true} is VALID [2022-02-21 04:21:43,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {19850#true} assume !(0 == ~S3_zero_st~0); {19850#true} is VALID [2022-02-21 04:21:43,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {19850#true} assume !(0 == ~D_print_st~0); {19850#true} is VALID [2022-02-21 04:21:43,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {19850#true} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; {19850#true} is VALID [2022-02-21 04:21:43,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {19850#true} assume !(1 == ~main_in1_req_up~0); {19850#true} is VALID [2022-02-21 04:21:43,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {19850#true} assume !(1 == ~main_in2_req_up~0); {19850#true} is VALID [2022-02-21 04:21:43,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {19850#true} assume !(1 == ~main_sum_req_up~0); {19850#true} is VALID [2022-02-21 04:21:43,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {19850#true} assume !(1 == ~main_diff_req_up~0); {19850#true} is VALID [2022-02-21 04:21:43,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {19850#true} assume !(1 == ~main_pres_req_up~0); {19850#true} is VALID [2022-02-21 04:21:43,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {19850#true} assume !(1 == ~main_dbl_req_up~0); {19850#true} is VALID [2022-02-21 04:21:43,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {19850#true} assume !(1 == ~main_zero_req_up~0); {19850#true} is VALID [2022-02-21 04:21:43,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {19850#true} assume !(1 == ~main_clk_req_up~0); {19850#true} is VALID [2022-02-21 04:21:43,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {19850#true} start_simulation_~kernel_st~0#1 := 3; {19850#true} is VALID [2022-02-21 04:21:43,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {19850#true} assume !(0 == ~main_in1_ev~0); {19850#true} is VALID [2022-02-21 04:21:43,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {19850#true} assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:43,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:43,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:43,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:43,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(0 == ~main_dbl_ev~0); {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:43,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:43,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:43,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(0 == ~main_clk_pos_edge~0); {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:43,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:43,008 INFO L290 TraceCheckUtils]: 28: Hoare triple {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:43,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:43,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:43,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:43,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:43,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:43,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {19852#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_in2_ev~0); {19851#false} is VALID [2022-02-21 04:21:43,010 INFO L290 TraceCheckUtils]: 35: Hoare triple {19851#false} assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; {19851#false} is VALID [2022-02-21 04:21:43,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {19851#false} assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; {19851#false} is VALID [2022-02-21 04:21:43,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {19851#false} assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; {19851#false} is VALID [2022-02-21 04:21:43,010 INFO L290 TraceCheckUtils]: 38: Hoare triple {19851#false} assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; {19851#false} is VALID [2022-02-21 04:21:43,010 INFO L290 TraceCheckUtils]: 39: Hoare triple {19851#false} assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; {19851#false} is VALID [2022-02-21 04:21:43,010 INFO L290 TraceCheckUtils]: 40: Hoare triple {19851#false} assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; {19851#false} is VALID [2022-02-21 04:21:43,010 INFO L290 TraceCheckUtils]: 41: Hoare triple {19851#false} assume !(1 == ~main_clk_pos_edge~0); {19851#false} is VALID [2022-02-21 04:21:43,011 INFO L290 TraceCheckUtils]: 42: Hoare triple {19851#false} assume !(1 == ~main_clk_neg_edge~0); {19851#false} is VALID [2022-02-21 04:21:43,011 INFO L290 TraceCheckUtils]: 43: Hoare triple {19851#false} assume 0 == ~N_generate_st~0; {19851#false} is VALID [2022-02-21 04:21:43,011 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 04:21:43,011 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:43,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453498119] [2022-02-21 04:21:43,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453498119] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:43,012 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:43,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:43,012 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531680489] [2022-02-21 04:21:43,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:43,012 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:43,012 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:43,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:21:43,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:21:43,013 INFO L87 Difference]: Start difference. First operand 1999 states and 3465 transitions. cyclomatic complexity: 1474 Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 04:21:44,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:44,510 INFO L93 Difference]: Finished difference Result 4015 states and 6814 transitions. [2022-02-21 04:21:44,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:21:44,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 04:21:44,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:44,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4015 states and 6814 transitions. [2022-02-21 04:21:44,879 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 3762 [2022-02-21 04:21:45,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4015 states to 4015 states and 6814 transitions. [2022-02-21 04:21:45,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4015 [2022-02-21 04:21:45,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4015 [2022-02-21 04:21:45,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4015 states and 6814 transitions. [2022-02-21 04:21:45,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:45,217 INFO L681 BuchiCegarLoop]: Abstraction has 4015 states and 6814 transitions. [2022-02-21 04:21:45,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4015 states and 6814 transitions. [2022-02-21 04:21:45,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4015 to 3985. [2022-02-21 04:21:45,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:45,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4015 states and 6814 transitions. Second operand has 3985 states, 3985 states have (on average 1.6948557089084064) internal successors, (6754), 3984 states have internal predecessors, (6754), 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 04:21:45,268 INFO L74 IsIncluded]: Start isIncluded. First operand 4015 states and 6814 transitions. Second operand has 3985 states, 3985 states have (on average 1.6948557089084064) internal successors, (6754), 3984 states have internal predecessors, (6754), 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 04:21:45,272 INFO L87 Difference]: Start difference. First operand 4015 states and 6814 transitions. Second operand has 3985 states, 3985 states have (on average 1.6948557089084064) internal successors, (6754), 3984 states have internal predecessors, (6754), 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 04:21:45,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:45,605 INFO L93 Difference]: Finished difference Result 4015 states and 6814 transitions. [2022-02-21 04:21:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 4015 states and 6814 transitions. [2022-02-21 04:21:45,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:45,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:45,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 3985 states, 3985 states have (on average 1.6948557089084064) internal successors, (6754), 3984 states have internal predecessors, (6754), 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 4015 states and 6814 transitions. [2022-02-21 04:21:45,623 INFO L87 Difference]: Start difference. First operand has 3985 states, 3985 states have (on average 1.6948557089084064) internal successors, (6754), 3984 states have internal predecessors, (6754), 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 4015 states and 6814 transitions. [2022-02-21 04:21:45,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:45,960 INFO L93 Difference]: Finished difference Result 4015 states and 6814 transitions. [2022-02-21 04:21:45,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4015 states and 6814 transitions. [2022-02-21 04:21:45,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:45,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:45,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:45,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3985 states, 3985 states have (on average 1.6948557089084064) internal successors, (6754), 3984 states have internal predecessors, (6754), 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 04:21:46,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3985 states to 3985 states and 6754 transitions. [2022-02-21 04:21:46,333 INFO L704 BuchiCegarLoop]: Abstraction has 3985 states and 6754 transitions. [2022-02-21 04:21:46,333 INFO L587 BuchiCegarLoop]: Abstraction has 3985 states and 6754 transitions. [2022-02-21 04:21:46,333 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:21:46,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3985 states and 6754 transitions. [2022-02-21 04:21:46,368 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 3762 [2022-02-21 04:21:46,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:46,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:46,369 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:46,369 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:46,370 INFO L791 eck$LassoCheckResult]: Stem: 24394#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 24368#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 23931#L256 assume !(1 == ~main_in1_req_up~0); 23887#L256-2 assume !(1 == ~main_in2_req_up~0); 23889#L267-1 assume !(1 == ~main_sum_req_up~0); 23918#L278-1 assume !(1 == ~main_diff_req_up~0); 23870#L289-1 assume !(1 == ~main_pres_req_up~0); 23871#L300-1 assume !(1 == ~main_dbl_req_up~0); 24145#L311-1 assume !(1 == ~main_zero_req_up~0); 24142#L322-1 assume !(1 == ~main_clk_req_up~0); 24215#L333-1 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 24101#L351-1 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 24102#L356-1 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 25086#L361-1 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 24354#L366-1 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 24087#L371-1 assume !(0 == ~main_in1_ev~0); 24088#L376-1 assume !(0 == ~main_in2_ev~0); 24481#L381-1 assume !(0 == ~main_sum_ev~0); 24482#L386-1 assume !(0 == ~main_diff_ev~0); 24341#L391-1 assume !(0 == ~main_pres_ev~0); 24253#L396-1 assume !(0 == ~main_dbl_ev~0); 24032#L401-1 assume !(0 == ~main_zero_ev~0); 24033#L406-1 assume !(0 == ~main_clk_ev~0); 24042#L411-1 assume !(0 == ~main_clk_pos_edge~0); 24351#L416-1 assume !(0 == ~main_clk_neg_edge~0); 24352#L421-1 assume !(1 == ~main_clk_pos_edge~0); 24319#L426-1 assume !(1 == ~main_clk_pos_edge~0); 24074#L431-1 assume !(1 == ~main_clk_pos_edge~0); 24075#L436-1 assume !(1 == ~main_clk_pos_edge~0); 24053#L441-1 assume !(1 == ~main_clk_pos_edge~0); 24054#L446-1 assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; 24384#L451-1 assume !(1 == ~main_in2_ev~0); 25028#L456-1 assume !(1 == ~main_sum_ev~0); 25026#L461-1 assume !(1 == ~main_diff_ev~0); 24987#L466-1 assume !(1 == ~main_pres_ev~0); 24979#L471-1 assume !(1 == ~main_dbl_ev~0); 23920#L476-1 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 23921#L481-1 assume !(1 == ~main_clk_ev~0); 24789#L486-1 assume !(1 == ~main_clk_pos_edge~0); 24788#L491-1 assume !(1 == ~main_clk_neg_edge~0); 24909#L742-1 [2022-02-21 04:21:46,370 INFO L793 eck$LassoCheckResult]: Loop: 24909#L742-1 assume !false; 24908#L503 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 24904#L229 assume !false; 24902#L147 assume !(0 == ~N_generate_st~0); 24898#L151 assume !(0 == ~S1_addsub_st~0); 24899#L154 assume !(0 == ~S2_presdbl_st~0); 24900#L157 assume !(0 == ~S3_zero_st~0); 24901#L160 assume !(0 == ~D_print_st~0); 24903#L245 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 25112#L509 assume !(1 == ~main_in1_req_up~0); 25110#L509-2 assume !(1 == ~main_in2_req_up~0); 25107#L520-1 assume !(1 == ~main_sum_req_up~0); 25103#L531-1 assume !(1 == ~main_diff_req_up~0); 25093#L542-1 assume !(1 == ~main_pres_req_up~0); 25089#L553-1 assume !(1 == ~main_dbl_req_up~0); 25084#L564-1 assume !(1 == ~main_zero_req_up~0); 25078#L575-1 assume !(1 == ~main_clk_req_up~0); 25074#L586-1 start_simulation_~kernel_st~0#1 := 3; 25072#L605 assume !(0 == ~main_in1_ev~0); 25070#L605-2 assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; 25067#L610-1 assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; 25065#L615-1 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 25062#L620-1 assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; 25058#L625-1 assume !(0 == ~main_dbl_ev~0); 25052#L630-1 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 25048#L635-1 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 25046#L640-1 assume !(0 == ~main_clk_pos_edge~0); 25014#L645-1 assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; 25040#L650-1 assume !(1 == ~main_clk_pos_edge~0); 25010#L655-1 assume !(1 == ~main_clk_pos_edge~0); 25008#L660-1 assume !(1 == ~main_clk_pos_edge~0); 25005#L665-1 assume !(1 == ~main_clk_pos_edge~0); 24999#L670-1 assume !(1 == ~main_clk_pos_edge~0); 24997#L675-1 assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; 24996#L680-1 assume !(1 == ~main_in2_ev~0); 24994#L685-1 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 24992#L690-1 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 24991#L695-1 assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; 24985#L700-1 assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; 24978#L705-1 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 24976#L710-1 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 24974#L715-1 assume !(1 == ~main_clk_pos_edge~0); 24972#L720-1 assume !(1 == ~main_clk_neg_edge~0); 24915#L725-1 assume 0 == ~N_generate_st~0; 24909#L742-1 [2022-02-21 04:21:46,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:46,370 INFO L85 PathProgramCache]: Analyzing trace with hash 615864315, now seen corresponding path program 1 times [2022-02-21 04:21:46,370 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:46,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606049734] [2022-02-21 04:21:46,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:46,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:46,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {35888#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; {35888#true} is VALID [2022-02-21 04:21:46,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {35888#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~main_in1_req_up~0); {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~main_in2_req_up~0); {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,402 INFO L290 TraceCheckUtils]: 4: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~main_sum_req_up~0); {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~main_diff_req_up~0); {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~main_pres_req_up~0); {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~main_dbl_req_up~0); {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~main_zero_req_up~0); {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~main_clk_req_up~0); {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(0 == ~main_in1_ev~0); {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(0 == ~main_in2_ev~0); {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(0 == ~main_sum_ev~0); {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(0 == ~main_diff_ev~0); {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(0 == ~main_pres_ev~0); {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(0 == ~main_dbl_ev~0); {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(0 == ~main_zero_ev~0); {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(0 == ~main_clk_ev~0); {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(0 == ~main_clk_pos_edge~0); {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(0 == ~main_clk_neg_edge~0); {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:21:46,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {35890#(= ~main_clk_pos_edge~0 ~main_in1_ev~0)} assume !(1 == ~main_clk_pos_edge~0); {35891#(not (= ~main_in1_ev~0 1))} is VALID [2022-02-21 04:21:46,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {35891#(not (= ~main_in1_ev~0 1))} assume !(1 == ~main_clk_pos_edge~0); {35891#(not (= ~main_in1_ev~0 1))} is VALID [2022-02-21 04:21:46,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {35891#(not (= ~main_in1_ev~0 1))} assume !(1 == ~main_clk_pos_edge~0); {35891#(not (= ~main_in1_ev~0 1))} is VALID [2022-02-21 04:21:46,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {35891#(not (= ~main_in1_ev~0 1))} assume !(1 == ~main_clk_pos_edge~0); {35891#(not (= ~main_in1_ev~0 1))} is VALID [2022-02-21 04:21:46,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {35891#(not (= ~main_in1_ev~0 1))} assume !(1 == ~main_clk_pos_edge~0); {35891#(not (= ~main_in1_ev~0 1))} is VALID [2022-02-21 04:21:46,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {35891#(not (= ~main_in1_ev~0 1))} assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; {35889#false} is VALID [2022-02-21 04:21:46,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {35889#false} assume !(1 == ~main_in2_ev~0); {35889#false} is VALID [2022-02-21 04:21:46,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {35889#false} assume !(1 == ~main_sum_ev~0); {35889#false} is VALID [2022-02-21 04:21:46,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {35889#false} assume !(1 == ~main_diff_ev~0); {35889#false} is VALID [2022-02-21 04:21:46,411 INFO L290 TraceCheckUtils]: 34: Hoare triple {35889#false} assume !(1 == ~main_pres_ev~0); {35889#false} is VALID [2022-02-21 04:21:46,411 INFO L290 TraceCheckUtils]: 35: Hoare triple {35889#false} assume !(1 == ~main_dbl_ev~0); {35889#false} is VALID [2022-02-21 04:21:46,411 INFO L290 TraceCheckUtils]: 36: Hoare triple {35889#false} assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; {35889#false} is VALID [2022-02-21 04:21:46,411 INFO L290 TraceCheckUtils]: 37: Hoare triple {35889#false} assume !(1 == ~main_clk_ev~0); {35889#false} is VALID [2022-02-21 04:21:46,411 INFO L290 TraceCheckUtils]: 38: Hoare triple {35889#false} assume !(1 == ~main_clk_pos_edge~0); {35889#false} is VALID [2022-02-21 04:21:46,411 INFO L290 TraceCheckUtils]: 39: Hoare triple {35889#false} assume !(1 == ~main_clk_neg_edge~0); {35889#false} is VALID [2022-02-21 04:21:46,412 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 04:21:46,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:46,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606049734] [2022-02-21 04:21:46,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606049734] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:46,412 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:46,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:21:46,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614503960] [2022-02-21 04:21:46,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:46,413 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:46,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:46,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1415211856, now seen corresponding path program 2 times [2022-02-21 04:21:46,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:46,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671384371] [2022-02-21 04:21:46,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:46,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:46,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {35892#true} assume !false; {35892#true} is VALID [2022-02-21 04:21:46,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {35892#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; {35892#true} is VALID [2022-02-21 04:21:46,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {35892#true} assume !false; {35892#true} is VALID [2022-02-21 04:21:46,441 INFO L290 TraceCheckUtils]: 3: Hoare triple {35892#true} assume !(0 == ~N_generate_st~0); {35892#true} is VALID [2022-02-21 04:21:46,442 INFO L290 TraceCheckUtils]: 4: Hoare triple {35892#true} assume !(0 == ~S1_addsub_st~0); {35892#true} is VALID [2022-02-21 04:21:46,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {35892#true} assume !(0 == ~S2_presdbl_st~0); {35892#true} is VALID [2022-02-21 04:21:46,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {35892#true} assume !(0 == ~S3_zero_st~0); {35892#true} is VALID [2022-02-21 04:21:46,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {35892#true} assume !(0 == ~D_print_st~0); {35892#true} is VALID [2022-02-21 04:21:46,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {35892#true} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; {35892#true} is VALID [2022-02-21 04:21:46,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {35892#true} assume !(1 == ~main_in1_req_up~0); {35892#true} is VALID [2022-02-21 04:21:46,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {35892#true} assume !(1 == ~main_in2_req_up~0); {35892#true} is VALID [2022-02-21 04:21:46,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {35892#true} assume !(1 == ~main_sum_req_up~0); {35892#true} is VALID [2022-02-21 04:21:46,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {35892#true} assume !(1 == ~main_diff_req_up~0); {35892#true} is VALID [2022-02-21 04:21:46,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {35892#true} assume !(1 == ~main_pres_req_up~0); {35892#true} is VALID [2022-02-21 04:21:46,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {35892#true} assume !(1 == ~main_dbl_req_up~0); {35892#true} is VALID [2022-02-21 04:21:46,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {35892#true} assume !(1 == ~main_zero_req_up~0); {35892#true} is VALID [2022-02-21 04:21:46,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {35892#true} assume !(1 == ~main_clk_req_up~0); {35892#true} is VALID [2022-02-21 04:21:46,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {35892#true} start_simulation_~kernel_st~0#1 := 3; {35892#true} is VALID [2022-02-21 04:21:46,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {35892#true} assume !(0 == ~main_in1_ev~0); {35892#true} is VALID [2022-02-21 04:21:46,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {35892#true} assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:46,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:46,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:46,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:46,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(0 == ~main_dbl_ev~0); {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:46,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:46,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:46,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(0 == ~main_clk_pos_edge~0); {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:46,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:46,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:46,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:46,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:46,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:46,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:46,448 INFO L290 TraceCheckUtils]: 33: Hoare triple {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:46,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {35894#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_in2_ev~0); {35893#false} is VALID [2022-02-21 04:21:46,448 INFO L290 TraceCheckUtils]: 35: Hoare triple {35893#false} assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; {35893#false} is VALID [2022-02-21 04:21:46,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {35893#false} assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; {35893#false} is VALID [2022-02-21 04:21:46,448 INFO L290 TraceCheckUtils]: 37: Hoare triple {35893#false} assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; {35893#false} is VALID [2022-02-21 04:21:46,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {35893#false} assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; {35893#false} is VALID [2022-02-21 04:21:46,449 INFO L290 TraceCheckUtils]: 39: Hoare triple {35893#false} assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; {35893#false} is VALID [2022-02-21 04:21:46,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {35893#false} assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; {35893#false} is VALID [2022-02-21 04:21:46,449 INFO L290 TraceCheckUtils]: 41: Hoare triple {35893#false} assume !(1 == ~main_clk_pos_edge~0); {35893#false} is VALID [2022-02-21 04:21:46,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {35893#false} assume !(1 == ~main_clk_neg_edge~0); {35893#false} is VALID [2022-02-21 04:21:46,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {35893#false} assume 0 == ~N_generate_st~0; {35893#false} is VALID [2022-02-21 04:21:46,449 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 04:21:46,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:46,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671384371] [2022-02-21 04:21:46,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671384371] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:46,450 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:46,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:46,450 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662277960] [2022-02-21 04:21:46,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:46,450 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:46,451 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:46,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:21:46,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:21:46,451 INFO L87 Difference]: Start difference. First operand 3985 states and 6754 transitions. cyclomatic complexity: 2785 Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 04:21:48,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:48,208 INFO L93 Difference]: Finished difference Result 4445 states and 7522 transitions. [2022-02-21 04:21:48,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:21:48,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 04:21:48,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:48,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4445 states and 7522 transitions. [2022-02-21 04:21:48,615 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 4162 [2022-02-21 04:21:49,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4445 states to 4445 states and 7522 transitions. [2022-02-21 04:21:49,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4445 [2022-02-21 04:21:49,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4445 [2022-02-21 04:21:49,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4445 states and 7522 transitions. [2022-02-21 04:21:49,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:49,035 INFO L681 BuchiCegarLoop]: Abstraction has 4445 states and 7522 transitions. [2022-02-21 04:21:49,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4445 states and 7522 transitions. [2022-02-21 04:21:49,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4445 to 4415. [2022-02-21 04:21:49,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:49,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4445 states and 7522 transitions. Second operand has 4415 states, 4415 states have (on average 1.6901472253680634) internal successors, (7462), 4414 states have internal predecessors, (7462), 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 04:21:49,085 INFO L74 IsIncluded]: Start isIncluded. First operand 4445 states and 7522 transitions. Second operand has 4415 states, 4415 states have (on average 1.6901472253680634) internal successors, (7462), 4414 states have internal predecessors, (7462), 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 04:21:49,090 INFO L87 Difference]: Start difference. First operand 4445 states and 7522 transitions. Second operand has 4415 states, 4415 states have (on average 1.6901472253680634) internal successors, (7462), 4414 states have internal predecessors, (7462), 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 04:21:49,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:49,495 INFO L93 Difference]: Finished difference Result 4445 states and 7522 transitions. [2022-02-21 04:21:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 4445 states and 7522 transitions. [2022-02-21 04:21:49,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:49,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:49,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 4415 states, 4415 states have (on average 1.6901472253680634) internal successors, (7462), 4414 states have internal predecessors, (7462), 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 4445 states and 7522 transitions. [2022-02-21 04:21:49,509 INFO L87 Difference]: Start difference. First operand has 4415 states, 4415 states have (on average 1.6901472253680634) internal successors, (7462), 4414 states have internal predecessors, (7462), 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 4445 states and 7522 transitions. [2022-02-21 04:21:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:49,922 INFO L93 Difference]: Finished difference Result 4445 states and 7522 transitions. [2022-02-21 04:21:49,922 INFO L276 IsEmpty]: Start isEmpty. Operand 4445 states and 7522 transitions. [2022-02-21 04:21:49,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:49,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:49,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:49,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4415 states, 4415 states have (on average 1.6901472253680634) internal successors, (7462), 4414 states have internal predecessors, (7462), 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 04:21:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4415 states to 4415 states and 7462 transitions. [2022-02-21 04:21:50,360 INFO L704 BuchiCegarLoop]: Abstraction has 4415 states and 7462 transitions. [2022-02-21 04:21:50,360 INFO L587 BuchiCegarLoop]: Abstraction has 4415 states and 7462 transitions. [2022-02-21 04:21:50,360 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 04:21:50,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4415 states and 7462 transitions. [2022-02-21 04:21:50,370 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 4162 [2022-02-21 04:21:50,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:50,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:50,371 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:50,371 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:50,371 INFO L791 eck$LassoCheckResult]: Stem: 40851#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 40818#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 40404#L256 assume !(1 == ~main_in1_req_up~0); 40360#L256-2 assume !(1 == ~main_in2_req_up~0); 40362#L267-1 assume !(1 == ~main_sum_req_up~0); 40391#L278-1 assume !(1 == ~main_diff_req_up~0); 40343#L289-1 assume !(1 == ~main_pres_req_up~0); 40344#L300-1 assume !(1 == ~main_dbl_req_up~0); 40451#L311-1 assume !(1 == ~main_zero_req_up~0); 40797#L322-1 assume !(1 == ~main_clk_req_up~0); 40799#L333-1 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 42418#L351-1 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 42416#L356-1 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 42414#L361-1 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 42412#L366-1 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 42410#L371-1 assume !(0 == ~main_in1_ev~0); 42408#L376-1 assume !(0 == ~main_in2_ev~0); 42406#L381-1 assume !(0 == ~main_sum_ev~0); 42403#L386-1 assume !(0 == ~main_diff_ev~0); 42401#L391-1 assume !(0 == ~main_pres_ev~0); 42399#L396-1 assume !(0 == ~main_dbl_ev~0); 42397#L401-1 assume !(0 == ~main_zero_ev~0); 42395#L406-1 assume !(0 == ~main_clk_ev~0); 42392#L411-1 assume !(0 == ~main_clk_pos_edge~0); 42390#L416-1 assume !(0 == ~main_clk_neg_edge~0); 42388#L421-1 assume !(1 == ~main_clk_pos_edge~0); 42385#L426-1 assume !(1 == ~main_clk_pos_edge~0); 42383#L431-1 assume !(1 == ~main_clk_pos_edge~0); 42380#L436-1 assume !(1 == ~main_clk_pos_edge~0); 42377#L441-1 assume !(1 == ~main_clk_pos_edge~0); 42374#L446-1 assume !(1 == ~main_in1_ev~0); 42371#L451-1 assume !(1 == ~main_in2_ev~0); 42369#L456-1 assume !(1 == ~main_sum_ev~0); 42297#L461-1 assume !(1 == ~main_diff_ev~0); 42292#L466-1 assume !(1 == ~main_pres_ev~0); 42283#L471-1 assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; 42284#L476-1 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 43117#L481-1 assume !(1 == ~main_clk_ev~0); 43115#L486-1 assume !(1 == ~main_clk_pos_edge~0); 43101#L491-1 assume !(1 == ~main_clk_neg_edge~0); 43097#L742-1 [2022-02-21 04:21:50,371 INFO L793 eck$LassoCheckResult]: Loop: 43097#L742-1 assume !false; 43096#L503 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 43092#L229 assume !false; 43090#L147 assume !(0 == ~N_generate_st~0); 43086#L151 assume !(0 == ~S1_addsub_st~0); 43087#L154 assume !(0 == ~S2_presdbl_st~0); 43088#L157 assume !(0 == ~S3_zero_st~0); 43089#L160 assume !(0 == ~D_print_st~0); 43091#L245 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 43187#L509 assume !(1 == ~main_in1_req_up~0); 43185#L509-2 assume !(1 == ~main_in2_req_up~0); 43182#L520-1 assume !(1 == ~main_sum_req_up~0); 43178#L531-1 assume !(1 == ~main_diff_req_up~0); 43176#L542-1 assume !(1 == ~main_pres_req_up~0); 43172#L553-1 assume !(1 == ~main_dbl_req_up~0); 43168#L564-1 assume !(1 == ~main_zero_req_up~0); 43164#L575-1 assume !(1 == ~main_clk_req_up~0); 43161#L586-1 start_simulation_~kernel_st~0#1 := 3; 43159#L605 assume !(0 == ~main_in1_ev~0); 43157#L605-2 assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; 43155#L610-1 assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; 43153#L615-1 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 43151#L620-1 assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; 43149#L625-1 assume !(0 == ~main_dbl_ev~0); 43146#L630-1 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 43144#L635-1 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 43142#L640-1 assume !(0 == ~main_clk_pos_edge~0); 43140#L645-1 assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; 43138#L650-1 assume !(1 == ~main_clk_pos_edge~0); 43136#L655-1 assume !(1 == ~main_clk_pos_edge~0); 43134#L660-1 assume !(1 == ~main_clk_pos_edge~0); 43132#L665-1 assume !(1 == ~main_clk_pos_edge~0); 43130#L670-1 assume !(1 == ~main_clk_pos_edge~0); 43128#L675-1 assume !(1 == ~main_in1_ev~0); 43126#L680-1 assume !(1 == ~main_in2_ev~0); 43124#L685-1 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 43122#L690-1 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 43120#L695-1 assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; 43118#L700-1 assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; 42002#L705-1 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 43116#L710-1 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 43114#L715-1 assume !(1 == ~main_clk_pos_edge~0); 43113#L720-1 assume !(1 == ~main_clk_neg_edge~0); 43104#L725-1 assume 0 == ~N_generate_st~0; 43097#L742-1 [2022-02-21 04:21:50,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:50,372 INFO L85 PathProgramCache]: Analyzing trace with hash 220990263, now seen corresponding path program 1 times [2022-02-21 04:21:50,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:50,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973159801] [2022-02-21 04:21:50,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:50,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:50,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {53651#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; {53651#true} is VALID [2022-02-21 04:21:50,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {53651#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(1 == ~main_in1_req_up~0); {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,398 INFO L290 TraceCheckUtils]: 3: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(1 == ~main_in2_req_up~0); {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,398 INFO L290 TraceCheckUtils]: 4: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(1 == ~main_sum_req_up~0); {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(1 == ~main_diff_req_up~0); {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(1 == ~main_pres_req_up~0); {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(1 == ~main_dbl_req_up~0); {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(1 == ~main_zero_req_up~0); {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(1 == ~main_clk_req_up~0); {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(0 == ~main_in1_ev~0); {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(0 == ~main_in2_ev~0); {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(0 == ~main_sum_ev~0); {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(0 == ~main_diff_ev~0); {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(0 == ~main_pres_ev~0); {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(0 == ~main_dbl_ev~0); {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(0 == ~main_zero_ev~0); {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(0 == ~main_clk_ev~0); {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(0 == ~main_clk_pos_edge~0); {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(0 == ~main_clk_neg_edge~0); {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} is VALID [2022-02-21 04:21:50,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {53653#(= ~main_clk_pos_edge~0 ~main_dbl_ev~0)} assume !(1 == ~main_clk_pos_edge~0); {53654#(not (= ~main_dbl_ev~0 1))} is VALID [2022-02-21 04:21:50,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {53654#(not (= ~main_dbl_ev~0 1))} assume !(1 == ~main_clk_pos_edge~0); {53654#(not (= ~main_dbl_ev~0 1))} is VALID [2022-02-21 04:21:50,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {53654#(not (= ~main_dbl_ev~0 1))} assume !(1 == ~main_clk_pos_edge~0); {53654#(not (= ~main_dbl_ev~0 1))} is VALID [2022-02-21 04:21:50,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {53654#(not (= ~main_dbl_ev~0 1))} assume !(1 == ~main_clk_pos_edge~0); {53654#(not (= ~main_dbl_ev~0 1))} is VALID [2022-02-21 04:21:50,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {53654#(not (= ~main_dbl_ev~0 1))} assume !(1 == ~main_clk_pos_edge~0); {53654#(not (= ~main_dbl_ev~0 1))} is VALID [2022-02-21 04:21:50,407 INFO L290 TraceCheckUtils]: 30: Hoare triple {53654#(not (= ~main_dbl_ev~0 1))} assume !(1 == ~main_in1_ev~0); {53654#(not (= ~main_dbl_ev~0 1))} is VALID [2022-02-21 04:21:50,407 INFO L290 TraceCheckUtils]: 31: Hoare triple {53654#(not (= ~main_dbl_ev~0 1))} assume !(1 == ~main_in2_ev~0); {53654#(not (= ~main_dbl_ev~0 1))} is VALID [2022-02-21 04:21:50,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {53654#(not (= ~main_dbl_ev~0 1))} assume !(1 == ~main_sum_ev~0); {53654#(not (= ~main_dbl_ev~0 1))} is VALID [2022-02-21 04:21:50,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {53654#(not (= ~main_dbl_ev~0 1))} assume !(1 == ~main_diff_ev~0); {53654#(not (= ~main_dbl_ev~0 1))} is VALID [2022-02-21 04:21:50,408 INFO L290 TraceCheckUtils]: 34: Hoare triple {53654#(not (= ~main_dbl_ev~0 1))} assume !(1 == ~main_pres_ev~0); {53654#(not (= ~main_dbl_ev~0 1))} is VALID [2022-02-21 04:21:50,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {53654#(not (= ~main_dbl_ev~0 1))} assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; {53652#false} is VALID [2022-02-21 04:21:50,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {53652#false} assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; {53652#false} is VALID [2022-02-21 04:21:50,408 INFO L290 TraceCheckUtils]: 37: Hoare triple {53652#false} assume !(1 == ~main_clk_ev~0); {53652#false} is VALID [2022-02-21 04:21:50,409 INFO L290 TraceCheckUtils]: 38: Hoare triple {53652#false} assume !(1 == ~main_clk_pos_edge~0); {53652#false} is VALID [2022-02-21 04:21:50,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {53652#false} assume !(1 == ~main_clk_neg_edge~0); {53652#false} is VALID [2022-02-21 04:21:50,414 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 04:21:50,415 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:50,415 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973159801] [2022-02-21 04:21:50,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973159801] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:50,415 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:50,415 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:21:50,415 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405470984] [2022-02-21 04:21:50,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:50,416 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:50,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:50,416 INFO L85 PathProgramCache]: Analyzing trace with hash -714147278, now seen corresponding path program 1 times [2022-02-21 04:21:50,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:50,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423039867] [2022-02-21 04:21:50,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:50,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:50,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {53655#true} assume !false; {53655#true} is VALID [2022-02-21 04:21:50,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {53655#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; {53655#true} is VALID [2022-02-21 04:21:50,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {53655#true} assume !false; {53655#true} is VALID [2022-02-21 04:21:50,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {53655#true} assume !(0 == ~N_generate_st~0); {53655#true} is VALID [2022-02-21 04:21:50,443 INFO L290 TraceCheckUtils]: 4: Hoare triple {53655#true} assume !(0 == ~S1_addsub_st~0); {53655#true} is VALID [2022-02-21 04:21:50,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {53655#true} assume !(0 == ~S2_presdbl_st~0); {53655#true} is VALID [2022-02-21 04:21:50,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {53655#true} assume !(0 == ~S3_zero_st~0); {53655#true} is VALID [2022-02-21 04:21:50,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {53655#true} assume !(0 == ~D_print_st~0); {53655#true} is VALID [2022-02-21 04:21:50,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {53655#true} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; {53655#true} is VALID [2022-02-21 04:21:50,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {53655#true} assume !(1 == ~main_in1_req_up~0); {53655#true} is VALID [2022-02-21 04:21:50,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {53655#true} assume !(1 == ~main_in2_req_up~0); {53655#true} is VALID [2022-02-21 04:21:50,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {53655#true} assume !(1 == ~main_sum_req_up~0); {53655#true} is VALID [2022-02-21 04:21:50,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {53655#true} assume !(1 == ~main_diff_req_up~0); {53655#true} is VALID [2022-02-21 04:21:50,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {53655#true} assume !(1 == ~main_pres_req_up~0); {53655#true} is VALID [2022-02-21 04:21:50,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {53655#true} assume !(1 == ~main_dbl_req_up~0); {53655#true} is VALID [2022-02-21 04:21:50,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {53655#true} assume !(1 == ~main_zero_req_up~0); {53655#true} is VALID [2022-02-21 04:21:50,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {53655#true} assume !(1 == ~main_clk_req_up~0); {53655#true} is VALID [2022-02-21 04:21:50,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {53655#true} start_simulation_~kernel_st~0#1 := 3; {53655#true} is VALID [2022-02-21 04:21:50,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {53655#true} assume !(0 == ~main_in1_ev~0); {53655#true} is VALID [2022-02-21 04:21:50,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {53655#true} assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:50,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:50,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:50,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:50,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(0 == ~main_dbl_ev~0); {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:50,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:50,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:50,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(0 == ~main_clk_pos_edge~0); {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:50,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:50,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:50,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:50,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:50,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:50,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:50,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_in1_ev~0); {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:50,450 INFO L290 TraceCheckUtils]: 34: Hoare triple {53657#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_in2_ev~0); {53656#false} is VALID [2022-02-21 04:21:50,451 INFO L290 TraceCheckUtils]: 35: Hoare triple {53656#false} assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; {53656#false} is VALID [2022-02-21 04:21:50,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {53656#false} assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; {53656#false} is VALID [2022-02-21 04:21:50,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {53656#false} assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; {53656#false} is VALID [2022-02-21 04:21:50,451 INFO L290 TraceCheckUtils]: 38: Hoare triple {53656#false} assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; {53656#false} is VALID [2022-02-21 04:21:50,451 INFO L290 TraceCheckUtils]: 39: Hoare triple {53656#false} assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; {53656#false} is VALID [2022-02-21 04:21:50,451 INFO L290 TraceCheckUtils]: 40: Hoare triple {53656#false} assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; {53656#false} is VALID [2022-02-21 04:21:50,451 INFO L290 TraceCheckUtils]: 41: Hoare triple {53656#false} assume !(1 == ~main_clk_pos_edge~0); {53656#false} is VALID [2022-02-21 04:21:50,451 INFO L290 TraceCheckUtils]: 42: Hoare triple {53656#false} assume !(1 == ~main_clk_neg_edge~0); {53656#false} is VALID [2022-02-21 04:21:50,452 INFO L290 TraceCheckUtils]: 43: Hoare triple {53656#false} assume 0 == ~N_generate_st~0; {53656#false} is VALID [2022-02-21 04:21:50,452 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 04:21:50,452 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:50,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423039867] [2022-02-21 04:21:50,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423039867] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:50,453 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:50,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:50,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393045280] [2022-02-21 04:21:50,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:50,453 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:50,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:50,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:21:50,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:21:50,455 INFO L87 Difference]: Start difference. First operand 4415 states and 7462 transitions. cyclomatic complexity: 3063 Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 04:21:52,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:52,000 INFO L93 Difference]: Finished difference Result 5574 states and 9318 transitions. [2022-02-21 04:21:52,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:21:52,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 04:21:52,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:52,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5574 states and 9318 transitions. [2022-02-21 04:21:52,640 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 5240 [2022-02-21 04:21:53,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5574 states to 5574 states and 9318 transitions. [2022-02-21 04:21:53,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5574 [2022-02-21 04:21:53,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5574 [2022-02-21 04:21:53,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5574 states and 9318 transitions. [2022-02-21 04:21:53,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:53,275 INFO L681 BuchiCegarLoop]: Abstraction has 5574 states and 9318 transitions. [2022-02-21 04:21:53,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5574 states and 9318 transitions. [2022-02-21 04:21:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5574 to 5130. [2022-02-21 04:21:53,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:53,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5574 states and 9318 transitions. Second operand has 5130 states, 5130 states have (on average 1.6754385964912282) internal successors, (8595), 5129 states have internal predecessors, (8595), 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 04:21:53,332 INFO L74 IsIncluded]: Start isIncluded. First operand 5574 states and 9318 transitions. Second operand has 5130 states, 5130 states have (on average 1.6754385964912282) internal successors, (8595), 5129 states have internal predecessors, (8595), 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 04:21:53,335 INFO L87 Difference]: Start difference. First operand 5574 states and 9318 transitions. Second operand has 5130 states, 5130 states have (on average 1.6754385964912282) internal successors, (8595), 5129 states have internal predecessors, (8595), 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 04:21:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:53,960 INFO L93 Difference]: Finished difference Result 5574 states and 9318 transitions. [2022-02-21 04:21:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 5574 states and 9318 transitions. [2022-02-21 04:21:53,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:53,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:53,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 5130 states, 5130 states have (on average 1.6754385964912282) internal successors, (8595), 5129 states have internal predecessors, (8595), 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 5574 states and 9318 transitions. [2022-02-21 04:21:53,976 INFO L87 Difference]: Start difference. First operand has 5130 states, 5130 states have (on average 1.6754385964912282) internal successors, (8595), 5129 states have internal predecessors, (8595), 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 5574 states and 9318 transitions. [2022-02-21 04:21:54,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:54,615 INFO L93 Difference]: Finished difference Result 5574 states and 9318 transitions. [2022-02-21 04:21:54,615 INFO L276 IsEmpty]: Start isEmpty. Operand 5574 states and 9318 transitions. [2022-02-21 04:21:54,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:54,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:54,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:54,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5130 states, 5130 states have (on average 1.6754385964912282) internal successors, (8595), 5129 states have internal predecessors, (8595), 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 04:21:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5130 states to 5130 states and 8595 transitions. [2022-02-21 04:21:55,182 INFO L704 BuchiCegarLoop]: Abstraction has 5130 states and 8595 transitions. [2022-02-21 04:21:55,182 INFO L587 BuchiCegarLoop]: Abstraction has 5130 states and 8595 transitions. [2022-02-21 04:21:55,182 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 04:21:55,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5130 states and 8595 transitions. [2022-02-21 04:21:55,193 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 4812 [2022-02-21 04:21:55,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:55,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:55,194 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:55,194 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:55,194 INFO L791 eck$LassoCheckResult]: Stem: 59740#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 59709#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 59296#L256 assume !(1 == ~main_in1_req_up~0); 59252#L256-2 assume !(1 == ~main_in2_req_up~0); 59254#L267-1 assume !(1 == ~main_sum_req_up~0); 59283#L278-1 assume !(1 == ~main_diff_req_up~0); 59235#L289-1 assume !(1 == ~main_pres_req_up~0); 59236#L300-1 assume !(1 == ~main_dbl_req_up~0); 59343#L311-1 assume !(1 == ~main_zero_req_up~0); 59688#L322-1 assume !(1 == ~main_clk_req_up~0); 59475#L333-1 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 61966#L351-1 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 59272#L356-1 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 59273#L361-1 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 59458#L366-1 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 59453#L371-1 assume !(0 == ~main_in1_ev~0); 59323#L376-1 assume !(0 == ~main_in2_ev~0); 59324#L381-1 assume !(0 == ~main_sum_ev~0); 59478#L386-1 assume !(0 == ~main_diff_ev~0); 59479#L391-1 assume !(0 == ~main_pres_ev~0); 59608#L396-1 assume !(0 == ~main_dbl_ev~0); 59609#L401-1 assume !(0 == ~main_zero_ev~0); 61958#L406-1 assume !(0 == ~main_clk_ev~0); 61956#L411-1 assume !(0 == ~main_clk_pos_edge~0); 61954#L416-1 assume !(0 == ~main_clk_neg_edge~0); 61952#L421-1 assume !(1 == ~main_clk_pos_edge~0); 61944#L426-1 assume !(1 == ~main_clk_pos_edge~0); 61942#L431-1 assume !(1 == ~main_clk_pos_edge~0); 61941#L436-1 assume !(1 == ~main_clk_pos_edge~0); 61940#L441-1 assume !(1 == ~main_clk_pos_edge~0); 61160#L446-1 assume !(1 == ~main_in1_ev~0); 61157#L451-1 assume !(1 == ~main_in2_ev~0); 61154#L456-1 assume !(1 == ~main_sum_ev~0); 61151#L461-1 assume !(1 == ~main_diff_ev~0); 61148#L466-1 assume !(1 == ~main_pres_ev~0); 61145#L471-1 assume !(1 == ~main_dbl_ev~0); 61142#L476-1 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 61139#L481-1 assume !(1 == ~main_clk_ev~0); 61132#L486-1 assume !(1 == ~main_clk_pos_edge~0); 61133#L491-1 assume !(1 == ~main_clk_neg_edge~0); 61128#L742-1 [2022-02-21 04:21:55,194 INFO L793 eck$LassoCheckResult]: Loop: 61128#L742-1 assume !false; 61129#L503 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 61120#L229 assume !false; 61121#L147 assume !(0 == ~N_generate_st~0); 61091#L151 assume !(0 == ~S1_addsub_st~0); 61093#L154 assume !(0 == ~S2_presdbl_st~0); 61096#L157 assume !(0 == ~S3_zero_st~0); 61097#L160 assume !(0 == ~D_print_st~0); 61246#L245 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 61247#L509 assume !(1 == ~main_in1_req_up~0); 60747#L509-2 assume !(1 == ~main_in2_req_up~0); 60742#L520-1 assume !(1 == ~main_sum_req_up~0); 60733#L531-1 assume !(1 == ~main_diff_req_up~0); 60730#L542-1 assume !(1 == ~main_pres_req_up~0); 60729#L553-1 assume !(1 == ~main_dbl_req_up~0); 60636#L564-1 assume !(1 == ~main_zero_req_up~0); 60635#L575-1 assume !(1 == ~main_clk_req_up~0); 61981#L586-1 start_simulation_~kernel_st~0#1 := 3; 61980#L605 assume !(0 == ~main_in1_ev~0); 61979#L605-2 assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; 61978#L610-1 assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; 61977#L615-1 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 61976#L620-1 assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; 61975#L625-1 assume !(0 == ~main_dbl_ev~0); 61974#L630-1 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 61973#L635-1 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 61972#L640-1 assume !(0 == ~main_clk_pos_edge~0); 61971#L645-1 assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; 61970#L650-1 assume !(1 == ~main_clk_pos_edge~0); 61969#L655-1 assume !(1 == ~main_clk_pos_edge~0); 61968#L660-1 assume !(1 == ~main_clk_pos_edge~0); 61967#L665-1 assume !(1 == ~main_clk_pos_edge~0); 60658#L670-1 assume !(1 == ~main_clk_pos_edge~0); 60659#L675-1 assume !(1 == ~main_in1_ev~0); 60653#L680-1 assume !(1 == ~main_in2_ev~0); 60654#L685-1 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 61950#L690-1 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 61949#L695-1 assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; 61948#L700-1 assume !(1 == ~main_dbl_ev~0); 61947#L705-1 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 61946#L710-1 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 61945#L715-1 assume !(1 == ~main_clk_pos_edge~0); 60585#L720-1 assume !(1 == ~main_clk_neg_edge~0); 60586#L725-1 assume 0 == ~N_generate_st~0; 61128#L742-1 [2022-02-21 04:21:55,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:55,195 INFO L85 PathProgramCache]: Analyzing trace with hash 222837305, now seen corresponding path program 1 times [2022-02-21 04:21:55,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:55,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953881337] [2022-02-21 04:21:55,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:55,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:55,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {75516#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; {75516#true} is VALID [2022-02-21 04:21:55,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {75516#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(1 == ~main_in1_req_up~0); {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,218 INFO L290 TraceCheckUtils]: 3: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(1 == ~main_in2_req_up~0); {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,218 INFO L290 TraceCheckUtils]: 4: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(1 == ~main_sum_req_up~0); {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(1 == ~main_diff_req_up~0); {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(1 == ~main_pres_req_up~0); {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(1 == ~main_dbl_req_up~0); {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(1 == ~main_zero_req_up~0); {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(1 == ~main_clk_req_up~0); {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(0 == ~main_in1_ev~0); {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(0 == ~main_in2_ev~0); {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(0 == ~main_sum_ev~0); {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(0 == ~main_diff_ev~0); {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(0 == ~main_pres_ev~0); {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(0 == ~main_dbl_ev~0); {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(0 == ~main_zero_ev~0); {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(0 == ~main_clk_ev~0); {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(0 == ~main_clk_pos_edge~0); {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(0 == ~main_clk_neg_edge~0); {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} is VALID [2022-02-21 04:21:55,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {75518#(= ~main_zero_ev~0 ~main_clk_pos_edge~0)} assume !(1 == ~main_clk_pos_edge~0); {75519#(not (= ~main_zero_ev~0 1))} is VALID [2022-02-21 04:21:55,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {75519#(not (= ~main_zero_ev~0 1))} assume !(1 == ~main_clk_pos_edge~0); {75519#(not (= ~main_zero_ev~0 1))} is VALID [2022-02-21 04:21:55,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {75519#(not (= ~main_zero_ev~0 1))} assume !(1 == ~main_clk_pos_edge~0); {75519#(not (= ~main_zero_ev~0 1))} is VALID [2022-02-21 04:21:55,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {75519#(not (= ~main_zero_ev~0 1))} assume !(1 == ~main_clk_pos_edge~0); {75519#(not (= ~main_zero_ev~0 1))} is VALID [2022-02-21 04:21:55,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {75519#(not (= ~main_zero_ev~0 1))} assume !(1 == ~main_clk_pos_edge~0); {75519#(not (= ~main_zero_ev~0 1))} is VALID [2022-02-21 04:21:55,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {75519#(not (= ~main_zero_ev~0 1))} assume !(1 == ~main_in1_ev~0); {75519#(not (= ~main_zero_ev~0 1))} is VALID [2022-02-21 04:21:55,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {75519#(not (= ~main_zero_ev~0 1))} assume !(1 == ~main_in2_ev~0); {75519#(not (= ~main_zero_ev~0 1))} is VALID [2022-02-21 04:21:55,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {75519#(not (= ~main_zero_ev~0 1))} assume !(1 == ~main_sum_ev~0); {75519#(not (= ~main_zero_ev~0 1))} is VALID [2022-02-21 04:21:55,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {75519#(not (= ~main_zero_ev~0 1))} assume !(1 == ~main_diff_ev~0); {75519#(not (= ~main_zero_ev~0 1))} is VALID [2022-02-21 04:21:55,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {75519#(not (= ~main_zero_ev~0 1))} assume !(1 == ~main_pres_ev~0); {75519#(not (= ~main_zero_ev~0 1))} is VALID [2022-02-21 04:21:55,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {75519#(not (= ~main_zero_ev~0 1))} assume !(1 == ~main_dbl_ev~0); {75519#(not (= ~main_zero_ev~0 1))} is VALID [2022-02-21 04:21:55,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {75519#(not (= ~main_zero_ev~0 1))} assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; {75517#false} is VALID [2022-02-21 04:21:55,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {75517#false} assume !(1 == ~main_clk_ev~0); {75517#false} is VALID [2022-02-21 04:21:55,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {75517#false} assume !(1 == ~main_clk_pos_edge~0); {75517#false} is VALID [2022-02-21 04:21:55,228 INFO L290 TraceCheckUtils]: 39: Hoare triple {75517#false} assume !(1 == ~main_clk_neg_edge~0); {75517#false} is VALID [2022-02-21 04:21:55,228 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 04:21:55,228 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:55,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953881337] [2022-02-21 04:21:55,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953881337] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:55,228 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:55,228 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:21:55,228 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925328603] [2022-02-21 04:21:55,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:55,229 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:55,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:55,229 INFO L85 PathProgramCache]: Analyzing trace with hash -656888976, now seen corresponding path program 1 times [2022-02-21 04:21:55,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:55,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827340218] [2022-02-21 04:21:55,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:55,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:55,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {75520#true} assume !false; {75520#true} is VALID [2022-02-21 04:21:55,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {75520#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; {75520#true} is VALID [2022-02-21 04:21:55,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {75520#true} assume !false; {75520#true} is VALID [2022-02-21 04:21:55,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {75520#true} assume !(0 == ~N_generate_st~0); {75520#true} is VALID [2022-02-21 04:21:55,242 INFO L290 TraceCheckUtils]: 4: Hoare triple {75520#true} assume !(0 == ~S1_addsub_st~0); {75520#true} is VALID [2022-02-21 04:21:55,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {75520#true} assume !(0 == ~S2_presdbl_st~0); {75520#true} is VALID [2022-02-21 04:21:55,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {75520#true} assume !(0 == ~S3_zero_st~0); {75520#true} is VALID [2022-02-21 04:21:55,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {75520#true} assume !(0 == ~D_print_st~0); {75520#true} is VALID [2022-02-21 04:21:55,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {75520#true} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; {75520#true} is VALID [2022-02-21 04:21:55,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {75520#true} assume !(1 == ~main_in1_req_up~0); {75520#true} is VALID [2022-02-21 04:21:55,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {75520#true} assume !(1 == ~main_in2_req_up~0); {75520#true} is VALID [2022-02-21 04:21:55,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {75520#true} assume !(1 == ~main_sum_req_up~0); {75520#true} is VALID [2022-02-21 04:21:55,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {75520#true} assume !(1 == ~main_diff_req_up~0); {75520#true} is VALID [2022-02-21 04:21:55,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {75520#true} assume !(1 == ~main_pres_req_up~0); {75520#true} is VALID [2022-02-21 04:21:55,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {75520#true} assume !(1 == ~main_dbl_req_up~0); {75520#true} is VALID [2022-02-21 04:21:55,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {75520#true} assume !(1 == ~main_zero_req_up~0); {75520#true} is VALID [2022-02-21 04:21:55,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {75520#true} assume !(1 == ~main_clk_req_up~0); {75520#true} is VALID [2022-02-21 04:21:55,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {75520#true} start_simulation_~kernel_st~0#1 := 3; {75520#true} is VALID [2022-02-21 04:21:55,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {75520#true} assume !(0 == ~main_in1_ev~0); {75520#true} is VALID [2022-02-21 04:21:55,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {75520#true} assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:55,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:55,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:55,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:55,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(0 == ~main_dbl_ev~0); {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:55,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:55,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:55,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(0 == ~main_clk_pos_edge~0); {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:55,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:55,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:55,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:55,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:55,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:55,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:55,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_in1_ev~0); {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:21:55,248 INFO L290 TraceCheckUtils]: 34: Hoare triple {75522#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_in2_ev~0); {75521#false} is VALID [2022-02-21 04:21:55,248 INFO L290 TraceCheckUtils]: 35: Hoare triple {75521#false} assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; {75521#false} is VALID [2022-02-21 04:21:55,248 INFO L290 TraceCheckUtils]: 36: Hoare triple {75521#false} assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; {75521#false} is VALID [2022-02-21 04:21:55,248 INFO L290 TraceCheckUtils]: 37: Hoare triple {75521#false} assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; {75521#false} is VALID [2022-02-21 04:21:55,249 INFO L290 TraceCheckUtils]: 38: Hoare triple {75521#false} assume !(1 == ~main_dbl_ev~0); {75521#false} is VALID [2022-02-21 04:21:55,249 INFO L290 TraceCheckUtils]: 39: Hoare triple {75521#false} assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; {75521#false} is VALID [2022-02-21 04:21:55,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {75521#false} assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; {75521#false} is VALID [2022-02-21 04:21:55,249 INFO L290 TraceCheckUtils]: 41: Hoare triple {75521#false} assume !(1 == ~main_clk_pos_edge~0); {75521#false} is VALID [2022-02-21 04:21:55,249 INFO L290 TraceCheckUtils]: 42: Hoare triple {75521#false} assume !(1 == ~main_clk_neg_edge~0); {75521#false} is VALID [2022-02-21 04:21:55,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {75521#false} assume 0 == ~N_generate_st~0; {75521#false} is VALID [2022-02-21 04:21:55,249 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 04:21:55,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:55,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827340218] [2022-02-21 04:21:55,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827340218] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:55,253 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:55,253 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:55,253 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319658645] [2022-02-21 04:21:55,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:55,253 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:55,253 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:55,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:21:55,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:21:55,254 INFO L87 Difference]: Start difference. First operand 5130 states and 8595 transitions. cyclomatic complexity: 3481 Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 04:21:58,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:58,534 INFO L93 Difference]: Finished difference Result 9446 states and 15503 transitions. [2022-02-21 04:21:58,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:21:58,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 04:21:58,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:58,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9446 states and 15503 transitions. [2022-02-21 04:22:00,550 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 8840 [2022-02-21 04:22:02,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9446 states to 9446 states and 15503 transitions. [2022-02-21 04:22:02,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9446 [2022-02-21 04:22:02,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9446 [2022-02-21 04:22:02,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9446 states and 15503 transitions. [2022-02-21 04:22:02,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:22:02,438 INFO L681 BuchiCegarLoop]: Abstraction has 9446 states and 15503 transitions. [2022-02-21 04:22:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9446 states and 15503 transitions. [2022-02-21 04:22:02,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9446 to 6978. [2022-02-21 04:22:02,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:22:02,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9446 states and 15503 transitions. Second operand has 6978 states, 6978 states have (on average 1.65262252794497) internal successors, (11532), 6977 states have internal predecessors, (11532), 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 04:22:02,538 INFO L74 IsIncluded]: Start isIncluded. First operand 9446 states and 15503 transitions. Second operand has 6978 states, 6978 states have (on average 1.65262252794497) internal successors, (11532), 6977 states have internal predecessors, (11532), 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 04:22:02,548 INFO L87 Difference]: Start difference. First operand 9446 states and 15503 transitions. Second operand has 6978 states, 6978 states have (on average 1.65262252794497) internal successors, (11532), 6977 states have internal predecessors, (11532), 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 04:22:04,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:22:04,406 INFO L93 Difference]: Finished difference Result 9446 states and 15503 transitions. [2022-02-21 04:22:04,406 INFO L276 IsEmpty]: Start isEmpty. Operand 9446 states and 15503 transitions. [2022-02-21 04:22:04,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:22:04,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:22:04,421 INFO L74 IsIncluded]: Start isIncluded. First operand has 6978 states, 6978 states have (on average 1.65262252794497) internal successors, (11532), 6977 states have internal predecessors, (11532), 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 9446 states and 15503 transitions. [2022-02-21 04:22:04,427 INFO L87 Difference]: Start difference. First operand has 6978 states, 6978 states have (on average 1.65262252794497) internal successors, (11532), 6977 states have internal predecessors, (11532), 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 9446 states and 15503 transitions. [2022-02-21 04:22:06,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:22:06,295 INFO L93 Difference]: Finished difference Result 9446 states and 15503 transitions. [2022-02-21 04:22:06,295 INFO L276 IsEmpty]: Start isEmpty. Operand 9446 states and 15503 transitions. [2022-02-21 04:22:06,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:22:06,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:22:06,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:22:06,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:22:06,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6978 states, 6978 states have (on average 1.65262252794497) internal successors, (11532), 6977 states have internal predecessors, (11532), 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 04:22:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6978 states to 6978 states and 11532 transitions. [2022-02-21 04:22:07,322 INFO L704 BuchiCegarLoop]: Abstraction has 6978 states and 11532 transitions. [2022-02-21 04:22:07,322 INFO L587 BuchiCegarLoop]: Abstraction has 6978 states and 11532 transitions. [2022-02-21 04:22:07,322 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 04:22:07,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6978 states and 11532 transitions. [2022-02-21 04:22:07,337 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 6492 [2022-02-21 04:22:07,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:22:07,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:22:07,338 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:22:07,338 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:22:07,338 INFO L791 eck$LassoCheckResult]: Stem: 85496#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 85464#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 85033#L256 assume !(1 == ~main_in1_req_up~0); 84989#L256-2 assume !(1 == ~main_in2_req_up~0); 84991#L267-1 assume !(1 == ~main_sum_req_up~0); 85020#L278-1 assume !(1 == ~main_diff_req_up~0); 84972#L289-1 assume !(1 == ~main_pres_req_up~0); 84973#L300-1 assume !(1 == ~main_dbl_req_up~0); 85080#L311-1 assume !(1 == ~main_zero_req_up~0); 85440#L322-1 assume !(1 == ~main_clk_req_up~0); 85210#L333-1 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 85200#L351-1 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 85009#L356-1 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 85010#L361-1 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 85193#L366-1 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 85732#L371-1 assume !(0 == ~main_in1_ev~0); 85060#L376-1 assume !(0 == ~main_in2_ev~0); 85061#L381-1 assume !(0 == ~main_sum_ev~0); 85729#L386-1 assume !(0 == ~main_diff_ev~0); 85436#L391-1 assume !(0 == ~main_pres_ev~0); 85354#L396-1 assume !(0 == ~main_dbl_ev~0); 85134#L401-1 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 85135#L406-1 assume !(0 == ~main_clk_ev~0); 85759#L411-1 assume !(0 == ~main_clk_pos_edge~0); 85760#L416-1 assume !(0 == ~main_clk_neg_edge~0); 85755#L421-1 assume !(1 == ~main_clk_pos_edge~0); 85756#L426-1 assume !(1 == ~main_clk_pos_edge~0); 85751#L431-1 assume !(1 == ~main_clk_pos_edge~0); 85752#L436-1 assume !(1 == ~main_clk_pos_edge~0); 85747#L441-1 assume !(1 == ~main_clk_pos_edge~0); 85748#L446-1 assume !(1 == ~main_in1_ev~0); 85738#L451-1 assume !(1 == ~main_in2_ev~0); 85739#L456-1 assume !(1 == ~main_sum_ev~0); 85730#L461-1 assume !(1 == ~main_diff_ev~0); 85731#L466-1 assume !(1 == ~main_pres_ev~0); 85687#L471-1 assume !(1 == ~main_dbl_ev~0); 85688#L476-1 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 86881#L481-1 assume !(1 == ~main_clk_ev~0); 86875#L486-1 assume !(1 == ~main_clk_pos_edge~0); 86868#L491-1 assume !(1 == ~main_clk_neg_edge~0); 85330#L742-1 [2022-02-21 04:22:07,338 INFO L793 eck$LassoCheckResult]: Loop: 85330#L742-1 assume !false; 86856#L503 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 86851#L229 assume !false; 86849#L147 assume !(0 == ~N_generate_st~0); 86844#L151 assume !(0 == ~S1_addsub_st~0); 86842#L154 assume !(0 == ~S2_presdbl_st~0); 86840#L157 assume !(0 == ~S3_zero_st~0); 86837#L160 assume !(0 == ~D_print_st~0); 86834#L245 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 86831#L509 assume !(1 == ~main_in1_req_up~0); 86827#L509-2 assume !(1 == ~main_in2_req_up~0); 86822#L520-1 assume !(1 == ~main_sum_req_up~0); 86816#L531-1 assume !(1 == ~main_diff_req_up~0); 86811#L542-1 assume !(1 == ~main_pres_req_up~0); 86789#L553-1 assume !(1 == ~main_dbl_req_up~0); 86784#L564-1 assume !(1 == ~main_zero_req_up~0); 86779#L575-1 assume !(1 == ~main_clk_req_up~0); 86780#L586-1 start_simulation_~kernel_st~0#1 := 3; 86836#L605 assume !(0 == ~main_in1_ev~0); 86833#L605-2 assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; 86830#L610-1 assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; 86825#L615-1 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 86820#L620-1 assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; 86815#L625-1 assume !(0 == ~main_dbl_ev~0); 86808#L630-1 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 86807#L635-1 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 86806#L640-1 assume !(0 == ~main_clk_pos_edge~0); 86805#L645-1 assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; 86804#L650-1 assume !(1 == ~main_clk_pos_edge~0); 86803#L655-1 assume !(1 == ~main_clk_pos_edge~0); 86802#L660-1 assume !(1 == ~main_clk_pos_edge~0); 86801#L665-1 assume !(1 == ~main_clk_pos_edge~0); 86800#L670-1 assume !(1 == ~main_clk_pos_edge~0); 86799#L675-1 assume !(1 == ~main_in1_ev~0); 86798#L680-1 assume !(1 == ~main_in2_ev~0); 86797#L685-1 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 86796#L690-1 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 86795#L695-1 assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; 86794#L700-1 assume !(1 == ~main_dbl_ev~0); 86792#L705-1 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 86787#L710-1 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 86782#L715-1 assume !(1 == ~main_clk_pos_edge~0); 86778#L720-1 assume !(1 == ~main_clk_neg_edge~0); 86774#L725-1 assume 0 == ~N_generate_st~0; 85330#L742-1 [2022-02-21 04:22:07,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:22:07,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1911781047, now seen corresponding path program 1 times [2022-02-21 04:22:07,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:22:07,339 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567969599] [2022-02-21 04:22:07,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:22:07,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:22:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:22:07,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {110845#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; {110845#true} is VALID [2022-02-21 04:22:07,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {110845#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:22:07,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} assume !(1 == ~main_in1_req_up~0); {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:22:07,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} assume !(1 == ~main_in2_req_up~0); {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:22:07,364 INFO L290 TraceCheckUtils]: 4: Hoare triple {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} assume !(1 == ~main_sum_req_up~0); {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:22:07,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} assume !(1 == ~main_diff_req_up~0); {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:22:07,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} assume !(1 == ~main_pres_req_up~0); {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:22:07,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} assume !(1 == ~main_dbl_req_up~0); {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:22:07,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} assume !(1 == ~main_zero_req_up~0); {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:22:07,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} assume !(1 == ~main_clk_req_up~0); {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:22:07,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:22:07,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:22:07,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:22:07,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:22:07,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} is VALID [2022-02-21 04:22:07,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {110847#(= ~main_zero_ev~0 ~main_in1_ev~0)} assume !(0 == ~main_in1_ev~0); {110848#(not (= ~main_zero_ev~0 0))} is VALID [2022-02-21 04:22:07,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {110848#(not (= ~main_zero_ev~0 0))} assume !(0 == ~main_in2_ev~0); {110848#(not (= ~main_zero_ev~0 0))} is VALID [2022-02-21 04:22:07,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {110848#(not (= ~main_zero_ev~0 0))} assume !(0 == ~main_sum_ev~0); {110848#(not (= ~main_zero_ev~0 0))} is VALID [2022-02-21 04:22:07,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {110848#(not (= ~main_zero_ev~0 0))} assume !(0 == ~main_diff_ev~0); {110848#(not (= ~main_zero_ev~0 0))} is VALID [2022-02-21 04:22:07,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {110848#(not (= ~main_zero_ev~0 0))} assume !(0 == ~main_pres_ev~0); {110848#(not (= ~main_zero_ev~0 0))} is VALID [2022-02-21 04:22:07,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {110848#(not (= ~main_zero_ev~0 0))} assume !(0 == ~main_dbl_ev~0); {110848#(not (= ~main_zero_ev~0 0))} is VALID [2022-02-21 04:22:07,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {110848#(not (= ~main_zero_ev~0 0))} assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; {110846#false} is VALID [2022-02-21 04:22:07,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {110846#false} assume !(0 == ~main_clk_ev~0); {110846#false} is VALID [2022-02-21 04:22:07,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {110846#false} assume !(0 == ~main_clk_pos_edge~0); {110846#false} is VALID [2022-02-21 04:22:07,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {110846#false} assume !(0 == ~main_clk_neg_edge~0); {110846#false} is VALID [2022-02-21 04:22:07,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {110846#false} assume !(1 == ~main_clk_pos_edge~0); {110846#false} is VALID [2022-02-21 04:22:07,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {110846#false} assume !(1 == ~main_clk_pos_edge~0); {110846#false} is VALID [2022-02-21 04:22:07,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {110846#false} assume !(1 == ~main_clk_pos_edge~0); {110846#false} is VALID [2022-02-21 04:22:07,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {110846#false} assume !(1 == ~main_clk_pos_edge~0); {110846#false} is VALID [2022-02-21 04:22:07,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {110846#false} assume !(1 == ~main_clk_pos_edge~0); {110846#false} is VALID [2022-02-21 04:22:07,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {110846#false} assume !(1 == ~main_in1_ev~0); {110846#false} is VALID [2022-02-21 04:22:07,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {110846#false} assume !(1 == ~main_in2_ev~0); {110846#false} is VALID [2022-02-21 04:22:07,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {110846#false} assume !(1 == ~main_sum_ev~0); {110846#false} is VALID [2022-02-21 04:22:07,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {110846#false} assume !(1 == ~main_diff_ev~0); {110846#false} is VALID [2022-02-21 04:22:07,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {110846#false} assume !(1 == ~main_pres_ev~0); {110846#false} is VALID [2022-02-21 04:22:07,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {110846#false} assume !(1 == ~main_dbl_ev~0); {110846#false} is VALID [2022-02-21 04:22:07,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {110846#false} assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; {110846#false} is VALID [2022-02-21 04:22:07,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {110846#false} assume !(1 == ~main_clk_ev~0); {110846#false} is VALID [2022-02-21 04:22:07,371 INFO L290 TraceCheckUtils]: 38: Hoare triple {110846#false} assume !(1 == ~main_clk_pos_edge~0); {110846#false} is VALID [2022-02-21 04:22:07,371 INFO L290 TraceCheckUtils]: 39: Hoare triple {110846#false} assume !(1 == ~main_clk_neg_edge~0); {110846#false} is VALID [2022-02-21 04:22:07,372 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 04:22:07,372 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:22:07,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567969599] [2022-02-21 04:22:07,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567969599] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:22:07,372 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:22:07,372 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:22:07,373 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76678851] [2022-02-21 04:22:07,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:22:07,373 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:22:07,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:22:07,373 INFO L85 PathProgramCache]: Analyzing trace with hash -656888976, now seen corresponding path program 2 times [2022-02-21 04:22:07,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:22:07,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165548754] [2022-02-21 04:22:07,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:22:07,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:22:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:22:07,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {110849#true} assume !false; {110849#true} is VALID [2022-02-21 04:22:07,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {110849#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; {110849#true} is VALID [2022-02-21 04:22:07,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {110849#true} assume !false; {110849#true} is VALID [2022-02-21 04:22:07,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {110849#true} assume !(0 == ~N_generate_st~0); {110849#true} is VALID [2022-02-21 04:22:07,397 INFO L290 TraceCheckUtils]: 4: Hoare triple {110849#true} assume !(0 == ~S1_addsub_st~0); {110849#true} is VALID [2022-02-21 04:22:07,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {110849#true} assume !(0 == ~S2_presdbl_st~0); {110849#true} is VALID [2022-02-21 04:22:07,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {110849#true} assume !(0 == ~S3_zero_st~0); {110849#true} is VALID [2022-02-21 04:22:07,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {110849#true} assume !(0 == ~D_print_st~0); {110849#true} is VALID [2022-02-21 04:22:07,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {110849#true} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; {110849#true} is VALID [2022-02-21 04:22:07,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {110849#true} assume !(1 == ~main_in1_req_up~0); {110849#true} is VALID [2022-02-21 04:22:07,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {110849#true} assume !(1 == ~main_in2_req_up~0); {110849#true} is VALID [2022-02-21 04:22:07,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {110849#true} assume !(1 == ~main_sum_req_up~0); {110849#true} is VALID [2022-02-21 04:22:07,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {110849#true} assume !(1 == ~main_diff_req_up~0); {110849#true} is VALID [2022-02-21 04:22:07,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {110849#true} assume !(1 == ~main_pres_req_up~0); {110849#true} is VALID [2022-02-21 04:22:07,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {110849#true} assume !(1 == ~main_dbl_req_up~0); {110849#true} is VALID [2022-02-21 04:22:07,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {110849#true} assume !(1 == ~main_zero_req_up~0); {110849#true} is VALID [2022-02-21 04:22:07,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {110849#true} assume !(1 == ~main_clk_req_up~0); {110849#true} is VALID [2022-02-21 04:22:07,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {110849#true} start_simulation_~kernel_st~0#1 := 3; {110849#true} is VALID [2022-02-21 04:22:07,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {110849#true} assume !(0 == ~main_in1_ev~0); {110849#true} is VALID [2022-02-21 04:22:07,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {110849#true} assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:07,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:07,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:07,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:07,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(0 == ~main_dbl_ev~0); {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:07,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:07,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:07,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(0 == ~main_clk_pos_edge~0); {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:07,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:07,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:07,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:07,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:07,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:07,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:07,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_in1_ev~0); {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:07,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {110851#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_in2_ev~0); {110850#false} is VALID [2022-02-21 04:22:07,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {110850#false} assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; {110850#false} is VALID [2022-02-21 04:22:07,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {110850#false} assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; {110850#false} is VALID [2022-02-21 04:22:07,404 INFO L290 TraceCheckUtils]: 37: Hoare triple {110850#false} assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; {110850#false} is VALID [2022-02-21 04:22:07,404 INFO L290 TraceCheckUtils]: 38: Hoare triple {110850#false} assume !(1 == ~main_dbl_ev~0); {110850#false} is VALID [2022-02-21 04:22:07,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {110850#false} assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; {110850#false} is VALID [2022-02-21 04:22:07,405 INFO L290 TraceCheckUtils]: 40: Hoare triple {110850#false} assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; {110850#false} is VALID [2022-02-21 04:22:07,405 INFO L290 TraceCheckUtils]: 41: Hoare triple {110850#false} assume !(1 == ~main_clk_pos_edge~0); {110850#false} is VALID [2022-02-21 04:22:07,405 INFO L290 TraceCheckUtils]: 42: Hoare triple {110850#false} assume !(1 == ~main_clk_neg_edge~0); {110850#false} is VALID [2022-02-21 04:22:07,405 INFO L290 TraceCheckUtils]: 43: Hoare triple {110850#false} assume 0 == ~N_generate_st~0; {110850#false} is VALID [2022-02-21 04:22:07,405 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 04:22:07,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:22:07,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165548754] [2022-02-21 04:22:07,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165548754] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:22:07,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:22:07,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:22:07,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002464504] [2022-02-21 04:22:07,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:22:07,406 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:22:07,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:22:07,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:22:07,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:22:07,407 INFO L87 Difference]: Start difference. First operand 6978 states and 11532 transitions. cyclomatic complexity: 4570 Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 04:22:11,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:22:11,810 INFO L93 Difference]: Finished difference Result 12839 states and 21043 transitions. [2022-02-21 04:22:11,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:22:11,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 04:22:11,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:22:11,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12839 states and 21043 transitions. [2022-02-21 04:22:15,079 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 12108 [2022-02-21 04:22:18,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12839 states to 12839 states and 21043 transitions. [2022-02-21 04:22:18,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12839 [2022-02-21 04:22:18,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12839 [2022-02-21 04:22:18,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12839 states and 21043 transitions. [2022-02-21 04:22:18,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:22:18,558 INFO L681 BuchiCegarLoop]: Abstraction has 12839 states and 21043 transitions. [2022-02-21 04:22:18,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12839 states and 21043 transitions. [2022-02-21 04:22:18,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12839 to 12839. [2022-02-21 04:22:18,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:22:18,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12839 states and 21043 transitions. Second operand has 12839 states, 12839 states have (on average 1.6389905755899992) internal successors, (21043), 12838 states have internal predecessors, (21043), 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 04:22:18,754 INFO L74 IsIncluded]: Start isIncluded. First operand 12839 states and 21043 transitions. Second operand has 12839 states, 12839 states have (on average 1.6389905755899992) internal successors, (21043), 12838 states have internal predecessors, (21043), 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 04:22:18,769 INFO L87 Difference]: Start difference. First operand 12839 states and 21043 transitions. Second operand has 12839 states, 12839 states have (on average 1.6389905755899992) internal successors, (21043), 12838 states have internal predecessors, (21043), 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 04:22:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:22:22,278 INFO L93 Difference]: Finished difference Result 12839 states and 21043 transitions. [2022-02-21 04:22:22,278 INFO L276 IsEmpty]: Start isEmpty. Operand 12839 states and 21043 transitions. [2022-02-21 04:22:22,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:22:22,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:22:22,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 12839 states, 12839 states have (on average 1.6389905755899992) internal successors, (21043), 12838 states have internal predecessors, (21043), 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 12839 states and 21043 transitions. [2022-02-21 04:22:22,320 INFO L87 Difference]: Start difference. First operand has 12839 states, 12839 states have (on average 1.6389905755899992) internal successors, (21043), 12838 states have internal predecessors, (21043), 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 12839 states and 21043 transitions. [2022-02-21 04:22:25,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:22:25,894 INFO L93 Difference]: Finished difference Result 12839 states and 21043 transitions. [2022-02-21 04:22:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 12839 states and 21043 transitions. [2022-02-21 04:22:25,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:22:25,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:22:25,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:22:25,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:22:25,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12839 states, 12839 states have (on average 1.6389905755899992) internal successors, (21043), 12838 states have internal predecessors, (21043), 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 04:22:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12839 states to 12839 states and 21043 transitions. [2022-02-21 04:22:29,363 INFO L704 BuchiCegarLoop]: Abstraction has 12839 states and 21043 transitions. [2022-02-21 04:22:29,363 INFO L587 BuchiCegarLoop]: Abstraction has 12839 states and 21043 transitions. [2022-02-21 04:22:29,363 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 04:22:29,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12839 states and 21043 transitions. [2022-02-21 04:22:29,382 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 12108 [2022-02-21 04:22:29,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:22:29,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:22:29,382 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:22:29,382 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:22:29,383 INFO L791 eck$LassoCheckResult]: Stem: 124234#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 124204#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 123755#L256 assume !(1 == ~main_in1_req_up~0); 123711#L256-2 assume !(1 == ~main_in2_req_up~0); 123713#L267-1 assume !(1 == ~main_sum_req_up~0); 123742#L278-1 assume !(1 == ~main_diff_req_up~0); 123693#L289-1 assume !(1 == ~main_pres_req_up~0); 123694#L300-1 assume !(1 == ~main_dbl_req_up~0); 123802#L311-1 assume !(1 == ~main_zero_req_up~0); 124181#L322-1 assume !(1 == ~main_clk_req_up~0); 124183#L333-1 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 126252#L351-1 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 126248#L356-1 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 126244#L361-1 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 126240#L366-1 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 126238#L371-1 assume !(0 == ~main_in1_ev~0); 126236#L376-1 assume !(0 == ~main_in2_ev~0); 126234#L381-1 assume !(0 == ~main_sum_ev~0); 126232#L386-1 assume !(0 == ~main_diff_ev~0); 126230#L391-1 assume !(0 == ~main_pres_ev~0); 126228#L396-1 assume !(0 == ~main_dbl_ev~0); 126226#L401-1 assume !(0 == ~main_zero_ev~0); 126224#L406-1 assume !(0 == ~main_clk_ev~0); 126222#L411-1 assume !(0 == ~main_clk_pos_edge~0); 126220#L416-1 assume !(0 == ~main_clk_neg_edge~0); 126218#L421-1 assume !(1 == ~main_clk_pos_edge~0); 126216#L426-1 assume !(1 == ~main_clk_pos_edge~0); 126214#L431-1 assume !(1 == ~main_clk_pos_edge~0); 126212#L436-1 assume !(1 == ~main_clk_pos_edge~0); 126210#L441-1 assume !(1 == ~main_clk_pos_edge~0); 126208#L446-1 assume !(1 == ~main_in1_ev~0); 126206#L451-1 assume !(1 == ~main_in2_ev~0); 126204#L456-1 assume !(1 == ~main_sum_ev~0); 126202#L461-1 assume !(1 == ~main_diff_ev~0); 126200#L466-1 assume !(1 == ~main_pres_ev~0); 126198#L471-1 assume !(1 == ~main_dbl_ev~0); 126196#L476-1 assume !(1 == ~main_zero_ev~0); 126194#L481-1 assume !(1 == ~main_clk_ev~0); 126192#L486-1 assume !(1 == ~main_clk_pos_edge~0); 126182#L491-1 assume !(1 == ~main_clk_neg_edge~0); 126180#L742-1 [2022-02-21 04:22:29,383 INFO L793 eck$LassoCheckResult]: Loop: 126180#L742-1 assume !false; 126178#L503 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 126173#L229 assume !false; 126169#L147 assume !(0 == ~N_generate_st~0); 126165#L151 assume !(0 == ~S1_addsub_st~0); 126166#L154 assume !(0 == ~S2_presdbl_st~0); 126167#L157 assume !(0 == ~S3_zero_st~0); 126168#L160 assume !(0 == ~D_print_st~0); 126170#L245 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 126265#L509 assume !(1 == ~main_in1_req_up~0); 126263#L509-2 assume !(1 == ~main_in2_req_up~0); 126260#L520-1 assume !(1 == ~main_sum_req_up~0); 126256#L531-1 assume !(1 == ~main_diff_req_up~0); 126254#L542-1 assume !(1 == ~main_pres_req_up~0); 126250#L553-1 assume !(1 == ~main_dbl_req_up~0); 126246#L564-1 assume !(1 == ~main_zero_req_up~0); 126242#L575-1 assume !(1 == ~main_clk_req_up~0); 126239#L586-1 start_simulation_~kernel_st~0#1 := 3; 126237#L605 assume !(0 == ~main_in1_ev~0); 126235#L605-2 assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; 126233#L610-1 assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; 126231#L615-1 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 126229#L620-1 assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; 126227#L625-1 assume !(0 == ~main_dbl_ev~0); 126225#L630-1 assume !(0 == ~main_zero_ev~0); 126223#L635-1 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 126221#L640-1 assume !(0 == ~main_clk_pos_edge~0); 126219#L645-1 assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; 126217#L650-1 assume !(1 == ~main_clk_pos_edge~0); 126215#L655-1 assume !(1 == ~main_clk_pos_edge~0); 126213#L660-1 assume !(1 == ~main_clk_pos_edge~0); 126211#L665-1 assume !(1 == ~main_clk_pos_edge~0); 126209#L670-1 assume !(1 == ~main_clk_pos_edge~0); 126207#L675-1 assume !(1 == ~main_in1_ev~0); 126205#L680-1 assume !(1 == ~main_in2_ev~0); 126203#L685-1 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 126201#L690-1 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 126199#L695-1 assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; 126197#L700-1 assume !(1 == ~main_dbl_ev~0); 126195#L705-1 assume !(1 == ~main_zero_ev~0); 126193#L710-1 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 126191#L715-1 assume !(1 == ~main_clk_pos_edge~0); 126190#L720-1 assume !(1 == ~main_clk_neg_edge~0); 126185#L725-1 assume 0 == ~N_generate_st~0; 126180#L742-1 [2022-02-21 04:22:29,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:22:29,383 INFO L85 PathProgramCache]: Analyzing trace with hash 222896887, now seen corresponding path program 1 times [2022-02-21 04:22:29,383 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:22:29,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859532204] [2022-02-21 04:22:29,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:22:29,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:22:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:22:29,398 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:22:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:22:29,452 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:22:29,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:22:29,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1472690384, now seen corresponding path program 1 times [2022-02-21 04:22:29,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:22:29,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967858652] [2022-02-21 04:22:29,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:22:29,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:22:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:22:29,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {162215#true} assume !false; {162215#true} is VALID [2022-02-21 04:22:29,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {162215#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; {162215#true} is VALID [2022-02-21 04:22:29,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {162215#true} assume !false; {162215#true} is VALID [2022-02-21 04:22:29,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {162215#true} assume !(0 == ~N_generate_st~0); {162215#true} is VALID [2022-02-21 04:22:29,471 INFO L290 TraceCheckUtils]: 4: Hoare triple {162215#true} assume !(0 == ~S1_addsub_st~0); {162215#true} is VALID [2022-02-21 04:22:29,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {162215#true} assume !(0 == ~S2_presdbl_st~0); {162215#true} is VALID [2022-02-21 04:22:29,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {162215#true} assume !(0 == ~S3_zero_st~0); {162215#true} is VALID [2022-02-21 04:22:29,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {162215#true} assume !(0 == ~D_print_st~0); {162215#true} is VALID [2022-02-21 04:22:29,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {162215#true} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; {162215#true} is VALID [2022-02-21 04:22:29,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {162215#true} assume !(1 == ~main_in1_req_up~0); {162215#true} is VALID [2022-02-21 04:22:29,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {162215#true} assume !(1 == ~main_in2_req_up~0); {162215#true} is VALID [2022-02-21 04:22:29,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {162215#true} assume !(1 == ~main_sum_req_up~0); {162215#true} is VALID [2022-02-21 04:22:29,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {162215#true} assume !(1 == ~main_diff_req_up~0); {162215#true} is VALID [2022-02-21 04:22:29,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {162215#true} assume !(1 == ~main_pres_req_up~0); {162215#true} is VALID [2022-02-21 04:22:29,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {162215#true} assume !(1 == ~main_dbl_req_up~0); {162215#true} is VALID [2022-02-21 04:22:29,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {162215#true} assume !(1 == ~main_zero_req_up~0); {162215#true} is VALID [2022-02-21 04:22:29,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {162215#true} assume !(1 == ~main_clk_req_up~0); {162215#true} is VALID [2022-02-21 04:22:29,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {162215#true} start_simulation_~kernel_st~0#1 := 3; {162215#true} is VALID [2022-02-21 04:22:29,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {162215#true} assume !(0 == ~main_in1_ev~0); {162215#true} is VALID [2022-02-21 04:22:29,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {162215#true} assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:29,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:29,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:29,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:29,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(0 == ~main_dbl_ev~0); {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:29,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(0 == ~main_zero_ev~0); {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:29,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:29,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(0 == ~main_clk_pos_edge~0); {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:29,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:29,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:29,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:29,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:29,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:29,477 INFO L290 TraceCheckUtils]: 32: Hoare triple {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_clk_pos_edge~0); {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:29,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_in1_ev~0); {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} is VALID [2022-02-21 04:22:29,478 INFO L290 TraceCheckUtils]: 34: Hoare triple {162217#(= (+ (- 1) ~main_in2_ev~0) 0)} assume !(1 == ~main_in2_ev~0); {162216#false} is VALID [2022-02-21 04:22:29,478 INFO L290 TraceCheckUtils]: 35: Hoare triple {162216#false} assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; {162216#false} is VALID [2022-02-21 04:22:29,478 INFO L290 TraceCheckUtils]: 36: Hoare triple {162216#false} assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; {162216#false} is VALID [2022-02-21 04:22:29,478 INFO L290 TraceCheckUtils]: 37: Hoare triple {162216#false} assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; {162216#false} is VALID [2022-02-21 04:22:29,478 INFO L290 TraceCheckUtils]: 38: Hoare triple {162216#false} assume !(1 == ~main_dbl_ev~0); {162216#false} is VALID [2022-02-21 04:22:29,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {162216#false} assume !(1 == ~main_zero_ev~0); {162216#false} is VALID [2022-02-21 04:22:29,478 INFO L290 TraceCheckUtils]: 40: Hoare triple {162216#false} assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; {162216#false} is VALID [2022-02-21 04:22:29,479 INFO L290 TraceCheckUtils]: 41: Hoare triple {162216#false} assume !(1 == ~main_clk_pos_edge~0); {162216#false} is VALID [2022-02-21 04:22:29,479 INFO L290 TraceCheckUtils]: 42: Hoare triple {162216#false} assume !(1 == ~main_clk_neg_edge~0); {162216#false} is VALID [2022-02-21 04:22:29,479 INFO L290 TraceCheckUtils]: 43: Hoare triple {162216#false} assume 0 == ~N_generate_st~0; {162216#false} is VALID [2022-02-21 04:22:29,479 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 04:22:29,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:22:29,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967858652] [2022-02-21 04:22:29,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967858652] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:22:29,480 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:22:29,480 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:22:29,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133444453] [2022-02-21 04:22:29,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:22:29,481 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:22:29,481 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:22:29,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:22:29,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:22:29,482 INFO L87 Difference]: Start difference. First operand 12839 states and 21043 transitions. cyclomatic complexity: 8236 Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 04:22:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:22:37,180 INFO L93 Difference]: Finished difference Result 18429 states and 29722 transitions. [2022-02-21 04:22:37,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:22:37,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 04:22:37,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:22:37,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18429 states and 29722 transitions. [2022-02-21 04:22:43,891 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 17278 [2022-02-21 04:22:50,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18429 states to 18429 states and 29722 transitions. [2022-02-21 04:22:50,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18429 [2022-02-21 04:22:50,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18429 [2022-02-21 04:22:50,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18429 states and 29722 transitions. [2022-02-21 04:22:50,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:22:50,693 INFO L681 BuchiCegarLoop]: Abstraction has 18429 states and 29722 transitions. [2022-02-21 04:22:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18429 states and 29722 transitions. [2022-02-21 04:22:50,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18429 to 18429. [2022-02-21 04:22:50,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:22:50,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18429 states and 29722 transitions. Second operand has 18429 states, 18429 states have (on average 1.6127841988170817) internal successors, (29722), 18428 states have internal predecessors, (29722), 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 04:22:50,903 INFO L74 IsIncluded]: Start isIncluded. First operand 18429 states and 29722 transitions. Second operand has 18429 states, 18429 states have (on average 1.6127841988170817) internal successors, (29722), 18428 states have internal predecessors, (29722), 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 04:22:50,921 INFO L87 Difference]: Start difference. First operand 18429 states and 29722 transitions. Second operand has 18429 states, 18429 states have (on average 1.6127841988170817) internal successors, (29722), 18428 states have internal predecessors, (29722), 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)