./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label06.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label06.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df2b5c022524eef310b1de6141625f90d464b51feae63f6fbead126ad9876e79 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 15:33:14,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 15:33:14,844 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 15:33:14,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 15:33:14,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 15:33:14,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 15:33:14,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 15:33:14,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 15:33:14,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 15:33:14,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 15:33:14,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 15:33:14,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 15:33:14,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 15:33:14,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 15:33:14,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 15:33:14,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 15:33:14,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 15:33:14,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 15:33:14,914 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 15:33:14,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 15:33:14,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 15:33:14,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 15:33:14,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 15:33:14,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 15:33:14,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 15:33:14,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 15:33:14,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 15:33:14,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 15:33:14,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 15:33:14,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 15:33:14,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 15:33:14,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 15:33:14,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 15:33:14,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 15:33:14,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 15:33:14,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 15:33:14,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 15:33:14,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 15:33:14,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 15:33:14,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 15:33:14,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 15:33:14,941 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 15:33:14,970 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 15:33:14,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 15:33:14,971 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 15:33:14,971 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 15:33:14,972 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 15:33:14,972 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 15:33:14,973 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 15:33:14,973 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 15:33:14,973 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 15:33:14,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 15:33:14,974 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 15:33:14,974 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 15:33:14,974 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 15:33:14,974 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 15:33:14,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 15:33:14,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 15:33:14,975 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 15:33:14,975 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 15:33:14,975 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 15:33:14,976 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 15:33:14,976 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 15:33:14,976 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 15:33:14,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 15:33:14,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 15:33:14,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 15:33:14,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 15:33:14,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 15:33:14,977 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 15:33:14,978 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 15:33:14,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 15:33:14,979 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 15:33:14,979 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 15:33:14,979 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 15:33:14,979 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(G ! call(reach_error())) ) 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 -> df2b5c022524eef310b1de6141625f90d464b51feae63f6fbead126ad9876e79 [2022-02-20 15:33:15,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 15:33:15,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 15:33:15,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 15:33:15,253 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 15:33:15,254 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 15:33:15,255 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label06.c [2022-02-20 15:33:15,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccdaeb2b/63ec3f8aea5e4908830324716d0f3997/FLAG48b6dc518 [2022-02-20 15:33:16,000 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 15:33:16,000 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label06.c [2022-02-20 15:33:16,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccdaeb2b/63ec3f8aea5e4908830324716d0f3997/FLAG48b6dc518 [2022-02-20 15:33:16,365 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccdaeb2b/63ec3f8aea5e4908830324716d0f3997 [2022-02-20 15:33:16,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 15:33:16,369 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 15:33:16,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 15:33:16,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 15:33:16,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 15:33:16,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 03:33:16" (1/1) ... [2022-02-20 15:33:16,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f6b8440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:16, skipping insertion in model container [2022-02-20 15:33:16,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 03:33:16" (1/1) ... [2022-02-20 15:33:16,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 15:33:16,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 15:33:16,700 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/eca-rers2012/Problem13_label06.c[3786,3799] [2022-02-20 15:33:17,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 15:33:17,588 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 15:33:17,615 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/eca-rers2012/Problem13_label06.c[3786,3799] [2022-02-20 15:33:18,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 15:33:18,116 INFO L208 MainTranslator]: Completed translation [2022-02-20 15:33:18,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:18 WrapperNode [2022-02-20 15:33:18,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 15:33:18,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 15:33:18,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 15:33:18,118 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 15:33:18,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:18" (1/1) ... [2022-02-20 15:33:18,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:18" (1/1) ... [2022-02-20 15:33:18,830 INFO L137 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5583 [2022-02-20 15:33:18,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 15:33:18,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 15:33:18,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 15:33:18,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 15:33:18,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:18" (1/1) ... [2022-02-20 15:33:18,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:18" (1/1) ... [2022-02-20 15:33:18,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:18" (1/1) ... [2022-02-20 15:33:18,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:18" (1/1) ... [2022-02-20 15:33:19,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:18" (1/1) ... [2022-02-20 15:33:19,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:18" (1/1) ... [2022-02-20 15:33:19,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:18" (1/1) ... [2022-02-20 15:33:19,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 15:33:19,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 15:33:19,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 15:33:19,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 15:33:19,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:18" (1/1) ... [2022-02-20 15:33:19,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 15:33:19,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 15:33:19,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 15:33:19,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 15:33:19,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 15:33:19,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 15:33:19,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 15:33:19,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 15:33:19,725 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 15:33:19,727 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 15:33:29,935 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 15:33:29,954 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 15:33:29,954 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 15:33:29,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 03:33:29 BoogieIcfgContainer [2022-02-20 15:33:29,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 15:33:29,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 15:33:29,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 15:33:29,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 15:33:29,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 03:33:16" (1/3) ... [2022-02-20 15:33:29,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e142b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 03:33:29, skipping insertion in model container [2022-02-20 15:33:29,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:33:18" (2/3) ... [2022-02-20 15:33:29,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e142b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 03:33:29, skipping insertion in model container [2022-02-20 15:33:29,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 03:33:29" (3/3) ... [2022-02-20 15:33:29,964 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem13_label06.c [2022-02-20 15:33:29,968 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 15:33:29,968 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 15:33:30,012 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 15:33:30,017 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 15:33:30,018 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 15:33:30,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 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-20 15:33:30,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 15:33:30,069 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:33:30,070 INFO L514 BasicCegarLoop]: trace 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] [2022-02-20 15:33:30,070 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:33:30,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:33:30,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1225036359, now seen corresponding path program 1 times [2022-02-20 15:33:30,082 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:33:30,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543091088] [2022-02-20 15:33:30,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:33:30,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:33:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:33:30,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {1101#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(20, 2);call #Ultimate.allocInit(12, 3);~inputB~0 := 2;~inputE~0 := 5;~inputC~0 := 3;~inputD~0 := 4;~inputF~0 := 6;~a26~0 := 1;~a13~0 := 0;~a19~0 := 9;~a23~0 := 158;~a12~0 := 286;~a1~0 := 2; {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {1103#(<= ~a23~0 158)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {1103#(<= ~a23~0 158)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~input~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,351 INFO L290 TraceCheckUtils]: 3: Hoare triple {1103#(<= ~a23~0 158)} assume !((((2 != main_~input~0#1 && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret9#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,351 INFO L290 TraceCheckUtils]: 4: Hoare triple {1103#(<= ~a23~0 158)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {1103#(<= ~a23~0 158)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {1103#(<= ~a23~0 158)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {1103#(<= ~a23~0 158)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {1103#(<= ~a23~0 158)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {1103#(<= ~a23~0 158)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {1103#(<= ~a23~0 158)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {1103#(<= ~a23~0 158)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {1103#(<= ~a23~0 158)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {1103#(<= ~a23~0 158)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {1103#(<= ~a23~0 158)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {1103#(<= ~a23~0 158)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {1103#(<= ~a23~0 158)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {1103#(<= ~a23~0 158)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {1103#(<= ~a23~0 158)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {1103#(<= ~a23~0 158)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {1103#(<= ~a23~0 158)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {1103#(<= ~a23~0 158)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {1103#(<= ~a23~0 158)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {1103#(<= ~a23~0 158)} is VALID [2022-02-20 15:33:30,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {1103#(<= ~a23~0 158)} assume ((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0; {1102#false} is VALID [2022-02-20 15:33:30,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {1102#false} assume !false; {1102#false} is VALID [2022-02-20 15:33:30,369 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-20 15:33:30,369 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:33:30,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543091088] [2022-02-20 15:33:30,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543091088] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:33:30,371 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:33:30,372 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:33:30,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75726390] [2022-02-20 15:33:30,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:33:30,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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) Word has length 25 [2022-02-20 15:33:30,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:33:30,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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-20 15:33:30,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:33:30,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:33:30,419 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:33:30,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:33:30,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:33:30,450 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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-20 15:33:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:33:38,397 INFO L93 Difference]: Finished difference Result 3121 states and 5804 transitions. [2022-02-20 15:33:38,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:33:38,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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) Word has length 25 [2022-02-20 15:33:38,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:33:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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-20 15:33:38,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5804 transitions. [2022-02-20 15:33:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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-20 15:33:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5804 transitions. [2022-02-20 15:33:38,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 5804 transitions. [2022-02-20 15:33:43,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5804 edges. 5804 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:33:43,507 INFO L225 Difference]: With dead ends: 3121 [2022-02-20 15:33:43,507 INFO L226 Difference]: Without dead ends: 1944 [2022-02-20 15:33:43,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:33:43,515 INFO L933 BasicCegarLoop]: 438 mSDtfsCounter, 964 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3124 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 3124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-02-20 15:33:43,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [964 Valid, 575 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 3124 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-02-20 15:33:43,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2022-02-20 15:33:43,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1873. [2022-02-20 15:33:43,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:33:43,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1944 states. Second operand has 1873 states, 1872 states have (on average 1.7393162393162394) internal successors, (3256), 1872 states have internal predecessors, (3256), 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-20 15:33:43,617 INFO L74 IsIncluded]: Start isIncluded. First operand 1944 states. Second operand has 1873 states, 1872 states have (on average 1.7393162393162394) internal successors, (3256), 1872 states have internal predecessors, (3256), 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-20 15:33:43,620 INFO L87 Difference]: Start difference. First operand 1944 states. Second operand has 1873 states, 1872 states have (on average 1.7393162393162394) internal successors, (3256), 1872 states have internal predecessors, (3256), 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-20 15:33:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:33:43,784 INFO L93 Difference]: Finished difference Result 1944 states and 3398 transitions. [2022-02-20 15:33:43,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 3398 transitions. [2022-02-20 15:33:43,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:33:43,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:33:43,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 1873 states, 1872 states have (on average 1.7393162393162394) internal successors, (3256), 1872 states have internal predecessors, (3256), 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 1944 states. [2022-02-20 15:33:43,802 INFO L87 Difference]: Start difference. First operand has 1873 states, 1872 states have (on average 1.7393162393162394) internal successors, (3256), 1872 states have internal predecessors, (3256), 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 1944 states. [2022-02-20 15:33:43,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:33:43,978 INFO L93 Difference]: Finished difference Result 1944 states and 3398 transitions. [2022-02-20 15:33:43,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 3398 transitions. [2022-02-20 15:33:43,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:33:43,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:33:43,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:33:43,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:33:43,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1872 states have (on average 1.7393162393162394) internal successors, (3256), 1872 states have internal predecessors, (3256), 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-20 15:33:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 3256 transitions. [2022-02-20 15:33:44,160 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 3256 transitions. Word has length 25 [2022-02-20 15:33:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:33:44,160 INFO L470 AbstractCegarLoop]: Abstraction has 1873 states and 3256 transitions. [2022-02-20 15:33:44,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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-20 15:33:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 3256 transitions. [2022-02-20 15:33:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-02-20 15:33:44,164 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:33:44,165 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 15:33:44,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 15:33:44,171 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:33:44,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:33:44,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1708850290, now seen corresponding path program 1 times [2022-02-20 15:33:44,174 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:33:44,174 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971200796] [2022-02-20 15:33:44,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:33:44,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:33:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:33:44,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {10016#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(20, 2);call #Ultimate.allocInit(12, 3);~inputB~0 := 2;~inputE~0 := 5;~inputC~0 := 3;~inputD~0 := 4;~inputF~0 := 6;~a26~0 := 1;~a13~0 := 0;~a19~0 := 9;~a23~0 := 158;~a12~0 := 286;~a1~0 := 2; {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {10018#(= 2 ~a1~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {10018#(= 2 ~a1~0)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~input~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,381 INFO L290 TraceCheckUtils]: 3: Hoare triple {10018#(= 2 ~a1~0)} assume !((((2 != main_~input~0#1 && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret9#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,381 INFO L290 TraceCheckUtils]: 4: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,397 INFO L290 TraceCheckUtils]: 27: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,398 INFO L290 TraceCheckUtils]: 30: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,399 INFO L290 TraceCheckUtils]: 32: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,399 INFO L290 TraceCheckUtils]: 33: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,401 INFO L290 TraceCheckUtils]: 36: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,401 INFO L290 TraceCheckUtils]: 37: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,402 INFO L290 TraceCheckUtils]: 39: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,402 INFO L290 TraceCheckUtils]: 40: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,403 INFO L290 TraceCheckUtils]: 41: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,403 INFO L290 TraceCheckUtils]: 42: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,404 INFO L290 TraceCheckUtils]: 43: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,404 INFO L290 TraceCheckUtils]: 44: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,405 INFO L290 TraceCheckUtils]: 45: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,405 INFO L290 TraceCheckUtils]: 46: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,406 INFO L290 TraceCheckUtils]: 48: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,406 INFO L290 TraceCheckUtils]: 49: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,407 INFO L290 TraceCheckUtils]: 50: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,407 INFO L290 TraceCheckUtils]: 51: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,408 INFO L290 TraceCheckUtils]: 52: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,408 INFO L290 TraceCheckUtils]: 53: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,408 INFO L290 TraceCheckUtils]: 54: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,409 INFO L290 TraceCheckUtils]: 55: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,409 INFO L290 TraceCheckUtils]: 56: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,410 INFO L290 TraceCheckUtils]: 57: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,410 INFO L290 TraceCheckUtils]: 58: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,411 INFO L290 TraceCheckUtils]: 59: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,411 INFO L290 TraceCheckUtils]: 60: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,411 INFO L290 TraceCheckUtils]: 61: Hoare triple {10018#(= 2 ~a1~0)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,412 INFO L290 TraceCheckUtils]: 62: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,412 INFO L290 TraceCheckUtils]: 63: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,413 INFO L290 TraceCheckUtils]: 64: Hoare triple {10018#(= 2 ~a1~0)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10018#(= 2 ~a1~0)} is VALID [2022-02-20 15:33:44,414 INFO L290 TraceCheckUtils]: 65: Hoare triple {10018#(= 2 ~a1~0)} assume 1 == ~a26~0 && (((5 == calculate_output_~input#1 && ((((264 < ~a23~0 && 476 >= ~a23~0) && 10 == ~a19~0) || (476 < ~a23~0 && 10 == ~a19~0)) || (~a23~0 <= 95 && 11 == ~a19~0))) && 178 < ~a12~0 && 395 >= ~a12~0) && 3 == ~a1~0) && 1 == ~a13~0;~a12~0 := -588001 + (if ~a12~0 < 0 && 0 != ~a12~0 % -5 then ~a12~0 / -5 - 1 else ~a12~0 / -5);~a23~0 := (if -3722 + ((if 9 * ~a23~0 < 0 && 0 != 9 * ~a23~0 % 10 then 1 + 9 * ~a23~0 / 10 else 9 * ~a23~0 / 10) - 41318) < 0 && 0 != (-3722 + ((if 9 * ~a23~0 < 0 && 0 != 9 * ~a23~0 % 10 then 1 + 9 * ~a23~0 / 10 else 9 * ~a23~0 / 10) - 41318)) % 84 then (-3722 + ((if 9 * ~a23~0 < 0 && 0 != 9 * ~a23~0 % 10 then 1 + 9 * ~a23~0 / 10 else 9 * ~a23~0 / 10) - 41318)) % 84 - 84 else (-3722 + ((if 9 * ~a23~0 < 0 && 0 != 9 * ~a23~0 % 10 then 1 + 9 * ~a23~0 / 10 else 9 * ~a23~0 / 10) - 41318)) % 84) - -180;~a1~0 := 2;~a19~0 := 11;~a13~0 := 0;calculate_output_#res#1 := -1; {10017#false} is VALID [2022-02-20 15:33:44,414 INFO L290 TraceCheckUtils]: 66: Hoare triple {10017#false} main_#t~ret13#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647;main_~output~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1; {10017#false} is VALID [2022-02-20 15:33:44,415 INFO L290 TraceCheckUtils]: 67: Hoare triple {10017#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~input~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {10017#false} is VALID [2022-02-20 15:33:44,415 INFO L290 TraceCheckUtils]: 68: Hoare triple {10017#false} assume !((((2 != main_~input~0#1 && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret9#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {10017#false} is VALID [2022-02-20 15:33:44,415 INFO L290 TraceCheckUtils]: 69: Hoare triple {10017#false} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {10017#false} is VALID [2022-02-20 15:33:44,415 INFO L290 TraceCheckUtils]: 70: Hoare triple {10017#false} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10017#false} is VALID [2022-02-20 15:33:44,416 INFO L290 TraceCheckUtils]: 71: Hoare triple {10017#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {10017#false} is VALID [2022-02-20 15:33:44,416 INFO L290 TraceCheckUtils]: 72: Hoare triple {10017#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {10017#false} is VALID [2022-02-20 15:33:44,416 INFO L290 TraceCheckUtils]: 73: Hoare triple {10017#false} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {10017#false} is VALID [2022-02-20 15:33:44,416 INFO L290 TraceCheckUtils]: 74: Hoare triple {10017#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {10017#false} is VALID [2022-02-20 15:33:44,417 INFO L290 TraceCheckUtils]: 75: Hoare triple {10017#false} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {10017#false} is VALID [2022-02-20 15:33:44,417 INFO L290 TraceCheckUtils]: 76: Hoare triple {10017#false} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {10017#false} is VALID [2022-02-20 15:33:44,417 INFO L290 TraceCheckUtils]: 77: Hoare triple {10017#false} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {10017#false} is VALID [2022-02-20 15:33:44,417 INFO L290 TraceCheckUtils]: 78: Hoare triple {10017#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {10017#false} is VALID [2022-02-20 15:33:44,423 INFO L290 TraceCheckUtils]: 79: Hoare triple {10017#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10017#false} is VALID [2022-02-20 15:33:44,423 INFO L290 TraceCheckUtils]: 80: Hoare triple {10017#false} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {10017#false} is VALID [2022-02-20 15:33:44,423 INFO L290 TraceCheckUtils]: 81: Hoare triple {10017#false} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {10017#false} is VALID [2022-02-20 15:33:44,424 INFO L290 TraceCheckUtils]: 82: Hoare triple {10017#false} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {10017#false} is VALID [2022-02-20 15:33:44,425 INFO L290 TraceCheckUtils]: 83: Hoare triple {10017#false} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {10017#false} is VALID [2022-02-20 15:33:44,425 INFO L290 TraceCheckUtils]: 84: Hoare triple {10017#false} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {10017#false} is VALID [2022-02-20 15:33:44,426 INFO L290 TraceCheckUtils]: 85: Hoare triple {10017#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {10017#false} is VALID [2022-02-20 15:33:44,427 INFO L290 TraceCheckUtils]: 86: Hoare triple {10017#false} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {10017#false} is VALID [2022-02-20 15:33:44,427 INFO L290 TraceCheckUtils]: 87: Hoare triple {10017#false} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {10017#false} is VALID [2022-02-20 15:33:44,435 INFO L290 TraceCheckUtils]: 88: Hoare triple {10017#false} assume ((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0; {10017#false} is VALID [2022-02-20 15:33:44,435 INFO L290 TraceCheckUtils]: 89: Hoare triple {10017#false} assume !false; {10017#false} is VALID [2022-02-20 15:33:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:33:44,439 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:33:44,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971200796] [2022-02-20 15:33:44,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971200796] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:33:44,440 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:33:44,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:33:44,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585382402] [2022-02-20 15:33:44,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:33:44,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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) Word has length 90 [2022-02-20 15:33:44,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:33:44,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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-20 15:33:44,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:33:44,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:33:44,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:33:44,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:33:44,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:33:44,520 INFO L87 Difference]: Start difference. First operand 1873 states and 3256 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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-20 15:33:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:33:51,408 INFO L93 Difference]: Finished difference Result 5351 states and 9369 transitions. [2022-02-20 15:33:51,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:33:51,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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) Word has length 90 [2022-02-20 15:33:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:33:51,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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-20 15:33:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5300 transitions. [2022-02-20 15:33:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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-20 15:33:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5300 transitions. [2022-02-20 15:33:51,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 5300 transitions. [2022-02-20 15:33:55,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5300 edges. 5300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:33:55,929 INFO L225 Difference]: With dead ends: 5351 [2022-02-20 15:33:55,929 INFO L226 Difference]: Without dead ends: 3480 [2022-02-20 15:33:55,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:33:55,932 INFO L933 BasicCegarLoop]: 926 mSDtfsCounter, 884 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 3216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-20 15:33:55,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [884 Valid, 1079 Invalid, 3216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-02-20 15:33:55,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2022-02-20 15:33:55,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 3479. [2022-02-20 15:33:55,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:33:55,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3480 states. Second operand has 3479 states, 3478 states have (on average 1.518688901667625) internal successors, (5282), 3478 states have internal predecessors, (5282), 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-20 15:33:56,001 INFO L74 IsIncluded]: Start isIncluded. First operand 3480 states. Second operand has 3479 states, 3478 states have (on average 1.518688901667625) internal successors, (5282), 3478 states have internal predecessors, (5282), 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-20 15:33:56,007 INFO L87 Difference]: Start difference. First operand 3480 states. Second operand has 3479 states, 3478 states have (on average 1.518688901667625) internal successors, (5282), 3478 states have internal predecessors, (5282), 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-20 15:33:56,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:33:56,547 INFO L93 Difference]: Finished difference Result 3480 states and 5284 transitions. [2022-02-20 15:33:56,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 5284 transitions. [2022-02-20 15:33:56,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:33:56,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:33:56,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 3479 states, 3478 states have (on average 1.518688901667625) internal successors, (5282), 3478 states have internal predecessors, (5282), 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 3480 states. [2022-02-20 15:33:56,565 INFO L87 Difference]: Start difference. First operand has 3479 states, 3478 states have (on average 1.518688901667625) internal successors, (5282), 3478 states have internal predecessors, (5282), 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 3480 states. [2022-02-20 15:33:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:33:56,942 INFO L93 Difference]: Finished difference Result 3480 states and 5284 transitions. [2022-02-20 15:33:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 5284 transitions. [2022-02-20 15:33:56,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:33:56,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:33:56,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:33:56,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:33:56,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3479 states, 3478 states have (on average 1.518688901667625) internal successors, (5282), 3478 states have internal predecessors, (5282), 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-20 15:33:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3479 states to 3479 states and 5282 transitions. [2022-02-20 15:33:57,463 INFO L78 Accepts]: Start accepts. Automaton has 3479 states and 5282 transitions. Word has length 90 [2022-02-20 15:33:57,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:33:57,466 INFO L470 AbstractCegarLoop]: Abstraction has 3479 states and 5282 transitions. [2022-02-20 15:33:57,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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-20 15:33:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3479 states and 5282 transitions. [2022-02-20 15:33:57,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 15:33:57,468 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:33:57,469 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 15:33:57,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 15:33:57,470 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:33:57,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:33:57,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1846075927, now seen corresponding path program 1 times [2022-02-20 15:33:57,471 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:33:57,471 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546307230] [2022-02-20 15:33:57,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:33:57,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:33:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:33:57,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {25861#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(20, 2);call #Ultimate.allocInit(12, 3);~inputB~0 := 2;~inputE~0 := 5;~inputC~0 := 3;~inputD~0 := 4;~inputF~0 := 6;~a26~0 := 1;~a13~0 := 0;~a19~0 := 9;~a23~0 := 158;~a12~0 := 286;~a1~0 := 2; {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {25863#(<= ~a12~0 286)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {25863#(<= ~a12~0 286)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~input~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {25863#(<= ~a12~0 286)} assume !((((2 != main_~input~0#1 && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret9#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,614 INFO L290 TraceCheckUtils]: 4: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,624 INFO L290 TraceCheckUtils]: 29: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,625 INFO L290 TraceCheckUtils]: 32: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,625 INFO L290 TraceCheckUtils]: 33: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,627 INFO L290 TraceCheckUtils]: 36: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,627 INFO L290 TraceCheckUtils]: 37: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,627 INFO L290 TraceCheckUtils]: 38: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,628 INFO L290 TraceCheckUtils]: 39: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,628 INFO L290 TraceCheckUtils]: 40: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,628 INFO L290 TraceCheckUtils]: 41: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,629 INFO L290 TraceCheckUtils]: 43: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,630 INFO L290 TraceCheckUtils]: 44: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,630 INFO L290 TraceCheckUtils]: 45: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,630 INFO L290 TraceCheckUtils]: 46: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,631 INFO L290 TraceCheckUtils]: 47: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,631 INFO L290 TraceCheckUtils]: 48: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,632 INFO L290 TraceCheckUtils]: 49: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,632 INFO L290 TraceCheckUtils]: 50: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,632 INFO L290 TraceCheckUtils]: 51: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,633 INFO L290 TraceCheckUtils]: 52: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,633 INFO L290 TraceCheckUtils]: 53: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,634 INFO L290 TraceCheckUtils]: 54: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,634 INFO L290 TraceCheckUtils]: 55: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,634 INFO L290 TraceCheckUtils]: 56: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,635 INFO L290 TraceCheckUtils]: 57: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,635 INFO L290 TraceCheckUtils]: 58: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,635 INFO L290 TraceCheckUtils]: 59: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,636 INFO L290 TraceCheckUtils]: 60: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,636 INFO L290 TraceCheckUtils]: 61: Hoare triple {25863#(<= ~a12~0 286)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,637 INFO L290 TraceCheckUtils]: 62: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,637 INFO L290 TraceCheckUtils]: 63: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,637 INFO L290 TraceCheckUtils]: 64: Hoare triple {25863#(<= ~a12~0 286)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,638 INFO L290 TraceCheckUtils]: 65: Hoare triple {25863#(<= ~a12~0 286)} assume !(1 == ~a26~0 && (((5 == calculate_output_~input#1 && ((((264 < ~a23~0 && 476 >= ~a23~0) && 10 == ~a19~0) || (476 < ~a23~0 && 10 == ~a19~0)) || (~a23~0 <= 95 && 11 == ~a19~0))) && 178 < ~a12~0 && 395 >= ~a12~0) && 3 == ~a1~0) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,638 INFO L290 TraceCheckUtils]: 66: Hoare triple {25863#(<= ~a12~0 286)} assume !(13 == ~a19~0 && (395 < ~a12~0 && 441 >= ~a12~0) && 3 == ~a1~0 && 1 == ~a26~0 && (4 == calculate_output_~input#1 && (~a23~0 <= 95 || (95 < ~a23~0 && 264 >= ~a23~0))) && 1 == ~a13~0); {25863#(<= ~a12~0 286)} is VALID [2022-02-20 15:33:57,640 INFO L290 TraceCheckUtils]: 67: Hoare triple {25863#(<= ~a12~0 286)} assume ((2 == ~a1~0 && (2 == calculate_output_~input#1 && ((12 == ~a19~0 && ~a23~0 <= 95) || (11 == ~a19~0 && 264 < ~a23~0 && 476 >= ~a23~0) || (476 < ~a23~0 && 11 == ~a19~0))) && !(1 == ~a13~0)) && 441 < ~a12~0) && 1 == ~a26~0;~a12~0 := -600385 + ~a12~0 - 26 - 18;~a23~0 := (if (if 9 * (~a23~0 - 0) < 0 && 0 != 9 * (~a23~0 - 0) % 10 then 1 + 9 * (~a23~0 - 0) / 10 else 9 * (~a23~0 - 0) / 10) < 0 && 0 != (if 9 * (~a23~0 - 0) < 0 && 0 != 9 * (~a23~0 - 0) % 10 then 1 + 9 * (~a23~0 - 0) / 10 else 9 * (~a23~0 - 0) / 10) % 84 then (if 9 * (~a23~0 - 0) < 0 && 0 != 9 * (~a23~0 - 0) % 10 then 1 + 9 * (~a23~0 - 0) / 10 else 9 * (~a23~0 - 0) / 10) % 84 - 84 else (if 9 * (~a23~0 - 0) < 0 && 0 != 9 * (~a23~0 - 0) % 10 then 1 + 9 * (~a23~0 - 0) / 10 else 9 * (~a23~0 - 0) / 10) % 84) - -180;~a1~0 := 3;~a19~0 := 11;calculate_output_#res#1 := 24; {25862#false} is VALID [2022-02-20 15:33:57,640 INFO L290 TraceCheckUtils]: 68: Hoare triple {25862#false} main_#t~ret13#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647;main_~output~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1; {25862#false} is VALID [2022-02-20 15:33:57,640 INFO L290 TraceCheckUtils]: 69: Hoare triple {25862#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~input~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {25862#false} is VALID [2022-02-20 15:33:57,640 INFO L290 TraceCheckUtils]: 70: Hoare triple {25862#false} assume !((((2 != main_~input~0#1 && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret9#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {25862#false} is VALID [2022-02-20 15:33:57,640 INFO L290 TraceCheckUtils]: 71: Hoare triple {25862#false} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {25862#false} is VALID [2022-02-20 15:33:57,641 INFO L290 TraceCheckUtils]: 72: Hoare triple {25862#false} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {25862#false} is VALID [2022-02-20 15:33:57,641 INFO L290 TraceCheckUtils]: 73: Hoare triple {25862#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {25862#false} is VALID [2022-02-20 15:33:57,641 INFO L290 TraceCheckUtils]: 74: Hoare triple {25862#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {25862#false} is VALID [2022-02-20 15:33:57,641 INFO L290 TraceCheckUtils]: 75: Hoare triple {25862#false} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {25862#false} is VALID [2022-02-20 15:33:57,641 INFO L290 TraceCheckUtils]: 76: Hoare triple {25862#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {25862#false} is VALID [2022-02-20 15:33:57,642 INFO L290 TraceCheckUtils]: 77: Hoare triple {25862#false} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {25862#false} is VALID [2022-02-20 15:33:57,642 INFO L290 TraceCheckUtils]: 78: Hoare triple {25862#false} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {25862#false} is VALID [2022-02-20 15:33:57,642 INFO L290 TraceCheckUtils]: 79: Hoare triple {25862#false} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {25862#false} is VALID [2022-02-20 15:33:57,642 INFO L290 TraceCheckUtils]: 80: Hoare triple {25862#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {25862#false} is VALID [2022-02-20 15:33:57,642 INFO L290 TraceCheckUtils]: 81: Hoare triple {25862#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {25862#false} is VALID [2022-02-20 15:33:57,643 INFO L290 TraceCheckUtils]: 82: Hoare triple {25862#false} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {25862#false} is VALID [2022-02-20 15:33:57,643 INFO L290 TraceCheckUtils]: 83: Hoare triple {25862#false} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {25862#false} is VALID [2022-02-20 15:33:57,643 INFO L290 TraceCheckUtils]: 84: Hoare triple {25862#false} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {25862#false} is VALID [2022-02-20 15:33:57,643 INFO L290 TraceCheckUtils]: 85: Hoare triple {25862#false} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {25862#false} is VALID [2022-02-20 15:33:57,643 INFO L290 TraceCheckUtils]: 86: Hoare triple {25862#false} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {25862#false} is VALID [2022-02-20 15:33:57,643 INFO L290 TraceCheckUtils]: 87: Hoare triple {25862#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {25862#false} is VALID [2022-02-20 15:33:57,644 INFO L290 TraceCheckUtils]: 88: Hoare triple {25862#false} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {25862#false} is VALID [2022-02-20 15:33:57,644 INFO L290 TraceCheckUtils]: 89: Hoare triple {25862#false} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {25862#false} is VALID [2022-02-20 15:33:57,644 INFO L290 TraceCheckUtils]: 90: Hoare triple {25862#false} assume ((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0; {25862#false} is VALID [2022-02-20 15:33:57,644 INFO L290 TraceCheckUtils]: 91: Hoare triple {25862#false} assume !false; {25862#false} is VALID [2022-02-20 15:33:57,645 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:33:57,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:33:57,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546307230] [2022-02-20 15:33:57,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546307230] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:33:57,646 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:33:57,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:33:57,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584294164] [2022-02-20 15:33:57,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:33:57,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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) Word has length 92 [2022-02-20 15:33:57,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:33:57,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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-20 15:33:57,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:33:57,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:33:57,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:33:57,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:33:57,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:33:57,725 INFO L87 Difference]: Start difference. First operand 3479 states and 5282 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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-20 15:34:06,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:34:06,449 INFO L93 Difference]: Finished difference Result 10142 states and 15438 transitions. [2022-02-20 15:34:06,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:34:06,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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) Word has length 92 [2022-02-20 15:34:06,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:34:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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-20 15:34:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5311 transitions. [2022-02-20 15:34:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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-20 15:34:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5311 transitions. [2022-02-20 15:34:06,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 5311 transitions. [2022-02-20 15:34:10,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5311 edges. 5311 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:34:12,038 INFO L225 Difference]: With dead ends: 10142 [2022-02-20 15:34:12,038 INFO L226 Difference]: Without dead ends: 6665 [2022-02-20 15:34:12,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:34:12,044 INFO L933 BasicCegarLoop]: 744 mSDtfsCounter, 976 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2553 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 3325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 2553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-02-20 15:34:12,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [976 Valid, 877 Invalid, 3325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 2553 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-02-20 15:34:12,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6665 states. [2022-02-20 15:34:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6665 to 6657. [2022-02-20 15:34:12,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:34:12,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6665 states. Second operand has 6657 states, 6656 states have (on average 1.3728966346153846) internal successors, (9138), 6656 states have internal predecessors, (9138), 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-20 15:34:12,232 INFO L74 IsIncluded]: Start isIncluded. First operand 6665 states. Second operand has 6657 states, 6656 states have (on average 1.3728966346153846) internal successors, (9138), 6656 states have internal predecessors, (9138), 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-20 15:34:12,239 INFO L87 Difference]: Start difference. First operand 6665 states. Second operand has 6657 states, 6656 states have (on average 1.3728966346153846) internal successors, (9138), 6656 states have internal predecessors, (9138), 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)