./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label21.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_label21.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 14f7b86bfc883455824a54ae68bb832997924960967cf306b251b3f457d9ff4b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 15:34:21,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 15:34:21,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 15:34:21,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 15:34:21,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 15:34:21,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 15:34:21,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 15:34:21,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 15:34:21,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 15:34:21,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 15:34:21,946 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 15:34:21,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 15:34:21,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 15:34:21,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 15:34:21,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 15:34:21,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 15:34:21,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 15:34:21,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 15:34:21,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 15:34:21,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 15:34:21,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 15:34:21,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 15:34:21,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 15:34:21,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 15:34:21,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 15:34:21,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 15:34:21,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 15:34:21,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 15:34:21,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 15:34:21,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 15:34:21,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 15:34:21,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 15:34:21,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 15:34:21,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 15:34:21,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 15:34:21,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 15:34:21,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 15:34:21,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 15:34:21,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 15:34:21,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 15:34:21,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 15:34:21,981 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:34:22,000 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 15:34:22,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 15:34:22,003 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 15:34:22,003 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 15:34:22,004 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 15:34:22,004 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 15:34:22,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 15:34:22,004 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 15:34:22,004 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 15:34:22,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 15:34:22,005 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 15:34:22,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 15:34:22,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 15:34:22,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 15:34:22,006 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 15:34:22,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 15:34:22,006 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 15:34:22,006 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 15:34:22,006 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 15:34:22,006 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 15:34:22,007 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 15:34:22,007 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 15:34:22,007 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 15:34:22,007 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 15:34:22,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 15:34:22,007 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 15:34:22,007 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 15:34:22,008 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 15:34:22,008 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 15:34:22,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 15:34:22,009 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 15:34:22,009 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 15:34:22,009 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 15:34:22,009 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 -> 14f7b86bfc883455824a54ae68bb832997924960967cf306b251b3f457d9ff4b [2022-02-20 15:34:22,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 15:34:22,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 15:34:22,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 15:34:22,234 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 15:34:22,235 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 15:34:22,236 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label21.c [2022-02-20 15:34:22,288 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f02724a5c/d389e22788784e16b339c016ccab95af/FLAGdf58443a7 [2022-02-20 15:34:22,814 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 15:34:22,814 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label21.c [2022-02-20 15:34:22,837 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f02724a5c/d389e22788784e16b339c016ccab95af/FLAGdf58443a7 [2022-02-20 15:34:23,051 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f02724a5c/d389e22788784e16b339c016ccab95af [2022-02-20 15:34:23,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 15:34:23,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 15:34:23,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 15:34:23,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 15:34:23,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 15:34:23,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 03:34:23" (1/1) ... [2022-02-20 15:34:23,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d750b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:34:23, skipping insertion in model container [2022-02-20 15:34:23,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 03:34:23" (1/1) ... [2022-02-20 15:34:23,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 15:34:23,154 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 15:34:23,343 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_label21.c[3130,3143] [2022-02-20 15:34:23,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 15:34:23,980 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 15:34:24,007 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_label21.c[3130,3143] [2022-02-20 15:34:24,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 15:34:24,412 INFO L208 MainTranslator]: Completed translation [2022-02-20 15:34:24,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:34:24 WrapperNode [2022-02-20 15:34:24,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 15:34:24,415 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 15:34:24,415 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 15:34:24,415 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 15:34:24,419 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:34:24" (1/1) ... [2022-02-20 15:34:24,474 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:34:24" (1/1) ... [2022-02-20 15:34:25,060 INFO L137 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5583 [2022-02-20 15:34:25,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 15:34:25,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 15:34:25,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 15:34:25,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 15:34:25,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:34:24" (1/1) ... [2022-02-20 15:34:25,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:34:24" (1/1) ... [2022-02-20 15:34:25,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:34:24" (1/1) ... [2022-02-20 15:34:25,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:34:24" (1/1) ... [2022-02-20 15:34:25,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:34:24" (1/1) ... [2022-02-20 15:34:25,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:34:24" (1/1) ... [2022-02-20 15:34:25,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:34:24" (1/1) ... [2022-02-20 15:34:25,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 15:34:25,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 15:34:25,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 15:34:25,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 15:34:25,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:34:24" (1/1) ... [2022-02-20 15:34:25,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 15:34:25,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 15:34:25,576 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:34:25,594 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:34:25,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 15:34:25,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 15:34:25,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 15:34:25,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 15:34:25,672 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 15:34:25,673 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 15:34:34,152 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 15:34:34,165 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 15:34:34,166 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 15:34:34,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 03:34:34 BoogieIcfgContainer [2022-02-20 15:34:34,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 15:34:34,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 15:34:34,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 15:34:34,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 15:34:34,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 03:34:23" (1/3) ... [2022-02-20 15:34:34,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a560e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 03:34:34, skipping insertion in model container [2022-02-20 15:34:34,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:34:24" (2/3) ... [2022-02-20 15:34:34,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a560e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 03:34:34, skipping insertion in model container [2022-02-20 15:34:34,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 03:34:34" (3/3) ... [2022-02-20 15:34:34,174 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem13_label21.c [2022-02-20 15:34:34,177 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 15:34:34,177 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 15:34:34,208 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 15:34:34,212 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:34:34,212 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 15:34:34,248 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:34:34,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 15:34:34,252 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:34:34,252 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] [2022-02-20 15:34:34,253 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:34:34,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:34:34,256 INFO L85 PathProgramCache]: Analyzing trace with hash -279853278, now seen corresponding path program 1 times [2022-02-20 15:34:34,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:34:34,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775786850] [2022-02-20 15:34:34,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:34:34,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:34:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:34:34,425 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:34:34,425 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:34:34,426 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:34:34,426 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:34:34,427 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:34:34,428 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:34:34,428 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:34:34,428 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:34:34,429 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:34:34,429 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:34:34,443 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:34:34,444 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:34:34,444 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:34:34,445 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:34:34,445 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:34:34,445 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:34:34,446 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:34:34,446 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:34:34,447 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); {1102#false} is VALID [2022-02-20 15:34:34,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {1102#false} assume !false; {1102#false} is VALID [2022-02-20 15:34:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:34:34,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:34:34,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775786850] [2022-02-20 15:34:34,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775786850] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:34:34,450 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:34:34,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:34:34,451 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427141548] [2022-02-20 15:34:34,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:34:34,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 15:34:34,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:34:34,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:34:34,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:34:34,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:34:34,482 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:34:34,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:34:34,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:34:34,559 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 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:34:41,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:34:41,633 INFO L93 Difference]: Finished difference Result 3121 states and 5804 transitions. [2022-02-20 15:34:41,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:34:41,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 15:34:41,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:34:41,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:34:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5804 transitions. [2022-02-20 15:34:41,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:34:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5804 transitions. [2022-02-20 15:34:41,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 5804 transitions. [2022-02-20 15:34:45,855 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:34:46,032 INFO L225 Difference]: With dead ends: 3121 [2022-02-20 15:34:46,033 INFO L226 Difference]: Without dead ends: 1944 [2022-02-20 15:34:46,037 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:46,039 INFO L933 BasicCegarLoop]: 438 mSDtfsCounter, 969 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3124 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 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.2s IncrementalHoareTripleChecker+Time [2022-02-20 15:34:46,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [969 Valid, 575 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 3124 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-02-20 15:34:46,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2022-02-20 15:34:46,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1873. [2022-02-20 15:34:46,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:34:46,121 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:34:46,124 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:34:46,127 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:34:46,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:34:46,235 INFO L93 Difference]: Finished difference Result 1944 states and 3398 transitions. [2022-02-20 15:34:46,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 3398 transitions. [2022-02-20 15:34:46,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:34:46,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:34:46,248 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:34:46,250 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:34:46,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:34:46,372 INFO L93 Difference]: Finished difference Result 1944 states and 3398 transitions. [2022-02-20 15:34:46,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 3398 transitions. [2022-02-20 15:34:46,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:34:46,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:34:46,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:34:46,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:34:46,379 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:34:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 3256 transitions. [2022-02-20 15:34:46,490 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 3256 transitions. Word has length 20 [2022-02-20 15:34:46,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:34:46,490 INFO L470 AbstractCegarLoop]: Abstraction has 1873 states and 3256 transitions. [2022-02-20 15:34:46,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:34:46,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 3256 transitions. [2022-02-20 15:34:46,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-02-20 15:34:46,494 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:34:46,495 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2022-02-20 15:34:46,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 15:34:46,496 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:34:46,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:34:46,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1306602698, now seen corresponding path program 1 times [2022-02-20 15:34:46,499 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:34:46,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313745925] [2022-02-20 15:34:46,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:34:46,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:34:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:34:46,707 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:34:46,708 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:34:46,708 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:34:46,709 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:34:46,709 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:34:46,709 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:34:46,710 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:34:46,710 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:34:46,710 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:34:46,711 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:34:46,711 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:34:46,711 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:34:46,712 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:34:46,712 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:34:46,712 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:34:46,713 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:34:46,713 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:34:46,713 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:34:46,714 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:34:46,714 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:34:46,714 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:34:46,715 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:34:46,715 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:34:46,715 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:34:46,716 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:34:46,716 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:34:46,716 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:34:46,717 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:34:46,717 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:34:46,718 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:34:46,718 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:34:46,718 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:34:46,719 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:34:46,719 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:34:46,721 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:34:46,721 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:34:46,721 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:34:46,722 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:34:46,722 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:34:46,722 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:34:46,724 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:34:46,725 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:34:46,725 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:34:46,726 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:34:46,726 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:34:46,726 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:34:46,727 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:34:46,727 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:34:46,727 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:34:46,728 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:34:46,728 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:34:46,728 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:34:46,729 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:34:46,729 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:34:46,730 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:34:46,730 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:34:46,730 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:34:46,731 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:34:46,731 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:34:46,731 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:34:46,732 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:34:46,732 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:34:46,732 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:34:46,733 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:34:46,733 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:34:46,734 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:34:46,734 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:34:46,734 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:34:46,735 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:34:46,735 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:34:46,735 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:34:46,735 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:34:46,735 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:34:46,735 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:34:46,736 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:34:46,736 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:34:46,736 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:34:46,736 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:34:46,736 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:34:46,737 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:34:46,737 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:34:46,737 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:34:46,737 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:34:46,737 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:34:46,737 INFO L290 TraceCheckUtils]: 84: Hoare triple {10017#false} assume !false; {10017#false} is VALID [2022-02-20 15:34:46,738 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:34:46,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:34:46,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313745925] [2022-02-20 15:34:46,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313745925] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:34:46,739 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:34:46,739 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:34:46,739 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379286835] [2022-02-20 15:34:46,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:34:46,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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 85 [2022-02-20 15:34:46,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:34:46,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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:46,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:34:46,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:34:46,802 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:34:46,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:34:46,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:34:46,803 INFO L87 Difference]: Start difference. First operand 1873 states and 3256 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:34:53,043 INFO L93 Difference]: Finished difference Result 5351 states and 9369 transitions. [2022-02-20 15:34:53,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:34:53,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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 85 [2022-02-20 15:34:53,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:34:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5300 transitions. [2022-02-20 15:34:53,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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:53,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5300 transitions. [2022-02-20 15:34:53,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 5300 transitions. [2022-02-20 15:34:56,766 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:34:57,121 INFO L225 Difference]: With dead ends: 5351 [2022-02-20 15:34:57,122 INFO L226 Difference]: Without dead ends: 3480 [2022-02-20 15:34:57,124 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:57,125 INFO L933 BasicCegarLoop]: 926 mSDtfsCounter, 884 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-02-20 15:34:57,125 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.4s Time] [2022-02-20 15:34:57,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2022-02-20 15:34:57,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 3479. [2022-02-20 15:34:57,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:34:57,171 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:34:57,176 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:34:57,181 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:34:57,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:34:57,527 INFO L93 Difference]: Finished difference Result 3480 states and 5284 transitions. [2022-02-20 15:34:57,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 5284 transitions. [2022-02-20 15:34:57,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:34:57,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:34:57,547 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:34:57,553 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:34:57,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:34:57,918 INFO L93 Difference]: Finished difference Result 3480 states and 5284 transitions. [2022-02-20 15:34:57,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 5284 transitions. [2022-02-20 15:34:57,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:34:57,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:34:57,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:34:57,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:34:57,928 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:34:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3479 states to 3479 states and 5282 transitions. [2022-02-20 15:34:58,303 INFO L78 Accepts]: Start accepts. Automaton has 3479 states and 5282 transitions. Word has length 85 [2022-02-20 15:34:58,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:34:58,303 INFO L470 AbstractCegarLoop]: Abstraction has 3479 states and 5282 transitions. [2022-02-20 15:34:58,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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:58,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3479 states and 5282 transitions. [2022-02-20 15:34:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-20 15:34:58,305 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:34:58,305 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-02-20 15:34:58,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 15:34:58,306 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:34:58,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:34:58,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1302816827, now seen corresponding path program 1 times [2022-02-20 15:34:58,306 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:34:58,306 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840279868] [2022-02-20 15:34:58,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:34:58,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:34:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:34:58,445 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:34:58,447 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:34:58,448 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:34:58,448 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:34:58,448 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:34:58,449 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:34:58,449 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:34:58,449 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:34:58,450 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:34:58,450 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:34:58,451 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:34:58,451 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:34:58,451 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:34:58,453 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:34:58,453 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:34:58,453 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:34:58,454 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:34:58,454 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:34:58,454 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:34:58,455 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:34:58,455 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:34:58,455 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:34:58,456 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:34:58,456 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:34:58,456 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:34:58,457 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:34:58,457 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:34:58,457 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:34:58,458 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:34:58,458 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:34:58,458 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:34:58,459 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:34:58,459 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:34:58,459 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:34:58,460 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:34:58,460 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:34:58,460 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:34:58,461 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:34:58,461 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:34:58,461 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:34:58,462 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:34:58,462 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:34:58,462 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:34:58,463 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:34:58,463 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:34:58,463 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:34:58,464 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:34:58,464 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:34:58,464 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:34:58,464 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:34:58,465 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:34:58,465 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:34:58,465 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:34:58,466 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:34:58,466 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:34:58,466 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:34:58,467 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:34:58,467 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:34:58,467 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:34:58,467 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:34:58,468 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:34:58,468 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:34:58,468 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:34:58,469 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:34:58,469 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:34:58,469 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:34:58,470 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:34:58,471 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:34:58,471 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:34:58,471 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:34:58,471 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:34:58,471 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:34:58,472 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:34:58,472 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:34:58,472 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:34:58,472 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:34:58,472 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:34:58,472 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:34:58,472 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:34:58,473 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:34:58,473 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:34:58,473 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:34:58,473 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:34:58,473 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:34:58,473 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:34:58,473 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:34:58,474 INFO L290 TraceCheckUtils]: 86: Hoare triple {25862#false} assume !false; {25862#false} is VALID [2022-02-20 15:34:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:34:58,474 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:34:58,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840279868] [2022-02-20 15:34:58,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840279868] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:34:58,475 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:34:58,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:34:58,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461395460] [2022-02-20 15:34:58,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:34:58,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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 87 [2022-02-20 15:34:58,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:34:58,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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:58,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:34:58,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:34:58,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:34:58,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:34:58,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:34:58,529 INFO L87 Difference]: Start difference. First operand 3479 states and 5282 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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:35:06,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:35:06,902 INFO L93 Difference]: Finished difference Result 10142 states and 15438 transitions. [2022-02-20 15:35:06,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:35:06,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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 87 [2022-02-20 15:35:06,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:35:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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:35:06,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5311 transitions. [2022-02-20 15:35:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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:35:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5311 transitions. [2022-02-20 15:35:06,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 5311 transitions. [2022-02-20 15:35:10,690 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:35:12,044 INFO L225 Difference]: With dead ends: 10142 [2022-02-20 15:35:12,045 INFO L226 Difference]: Without dead ends: 6665 [2022-02-20 15:35:12,048 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:35:12,049 INFO L933 BasicCegarLoop]: 744 mSDtfsCounter, 976 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2553 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-02-20 15:35:12,049 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.5s Time] [2022-02-20 15:35:12,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6665 states. [2022-02-20 15:35:12,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6665 to 6657. [2022-02-20 15:35:12,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:35:12,143 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:35:12,150 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:35:12,156 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) [2022-02-20 15:35:13,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:35:13,452 INFO L93 Difference]: Finished difference Result 6665 states and 9153 transitions. [2022-02-20 15:35:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 9153 transitions. [2022-02-20 15:35:13,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:35:13,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:35:13,468 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 6665 states. [2022-02-20 15:35:13,475 INFO L87 Difference]: Start difference. First 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) Second operand 6665 states. [2022-02-20 15:35:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:35:14,820 INFO L93 Difference]: Finished difference Result 6665 states and 9153 transitions. [2022-02-20 15:35:14,820 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 9153 transitions. [2022-02-20 15:35:14,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:35:14,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:35:14,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:35:14,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:35:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. 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:35:16,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 9138 transitions. [2022-02-20 15:35:16,327 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 9138 transitions. Word has length 87 [2022-02-20 15:35:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:35:16,327 INFO L470 AbstractCegarLoop]: Abstraction has 6657 states and 9138 transitions. [2022-02-20 15:35:16,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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:35:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 9138 transitions. [2022-02-20 15:35:16,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-20 15:35:16,328 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:35:16,328 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 15:35:16,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 15:35:16,328 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:35:16,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:35:16,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2120781558, now seen corresponding path program 1 times [2022-02-20 15:35:16,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:35:16,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812222157] [2022-02-20 15:35:16,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:35:16,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:35:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:35:16,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {56095#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; {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {56097#(<= ~a19~0 9)} 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; {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {56097#(<= ~a19~0 9)} 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; {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,447 INFO L290 TraceCheckUtils]: 3: Hoare triple {56097#(<= ~a19~0 9)} 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; {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,447 INFO L290 TraceCheckUtils]: 4: Hoare triple {56097#(<= ~a19~0 9)} 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); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {56097#(<= ~a19~0 9)} 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); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {56097#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {56097#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {56097#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {56097#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,454 INFO L290 TraceCheckUtils]: 26: Hoare triple {56097#(<= ~a19~0 9)} 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); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {56097#(<= ~a19~0 9)} 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); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {56097#(<= ~a19~0 9)} 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); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,456 INFO L290 TraceCheckUtils]: 32: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,458 INFO L290 TraceCheckUtils]: 37: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,459 INFO L290 TraceCheckUtils]: 40: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,459 INFO L290 TraceCheckUtils]: 41: Hoare triple {56097#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,459 INFO L290 TraceCheckUtils]: 42: Hoare triple {56097#(<= ~a19~0 9)} 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); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,460 INFO L290 TraceCheckUtils]: 43: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,460 INFO L290 TraceCheckUtils]: 44: Hoare triple {56097#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,460 INFO L290 TraceCheckUtils]: 45: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,460 INFO L290 TraceCheckUtils]: 46: Hoare triple {56097#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,461 INFO L290 TraceCheckUtils]: 47: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,461 INFO L290 TraceCheckUtils]: 48: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,461 INFO L290 TraceCheckUtils]: 49: Hoare triple {56097#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,462 INFO L290 TraceCheckUtils]: 50: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,462 INFO L290 TraceCheckUtils]: 51: Hoare triple {56097#(<= ~a19~0 9)} 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); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,462 INFO L290 TraceCheckUtils]: 52: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,463 INFO L290 TraceCheckUtils]: 53: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,463 INFO L290 TraceCheckUtils]: 54: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,463 INFO L290 TraceCheckUtils]: 55: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,463 INFO L290 TraceCheckUtils]: 56: Hoare triple {56097#(<= ~a19~0 9)} 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); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,464 INFO L290 TraceCheckUtils]: 57: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,464 INFO L290 TraceCheckUtils]: 58: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,464 INFO L290 TraceCheckUtils]: 59: Hoare triple {56097#(<= ~a19~0 9)} 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); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,465 INFO L290 TraceCheckUtils]: 60: Hoare triple {56097#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,465 INFO L290 TraceCheckUtils]: 61: Hoare triple {56097#(<= ~a19~0 9)} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,465 INFO L290 TraceCheckUtils]: 62: Hoare triple {56097#(<= ~a19~0 9)} 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); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,465 INFO L290 TraceCheckUtils]: 63: Hoare triple {56097#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,466 INFO L290 TraceCheckUtils]: 64: Hoare triple {56097#(<= ~a19~0 9)} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,466 INFO L290 TraceCheckUtils]: 65: Hoare triple {56097#(<= ~a19~0 9)} 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); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,466 INFO L290 TraceCheckUtils]: 66: Hoare triple {56097#(<= ~a19~0 9)} 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); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,467 INFO L290 TraceCheckUtils]: 67: Hoare triple {56097#(<= ~a19~0 9)} 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); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,467 INFO L290 TraceCheckUtils]: 68: Hoare triple {56097#(<= ~a19~0 9)} assume !((1 == ~a26~0 && (1 == ~a13~0 && 2 == calculate_output_~input#1 && ((~a23~0 <= 95 && 13 == ~a19~0) || (12 == ~a19~0 && 264 < ~a23~0 && 476 >= ~a23~0) || (12 == ~a19~0 && 476 < ~a23~0))) && ~a12~0 <= 178) && 3 == ~a1~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,467 INFO L290 TraceCheckUtils]: 69: Hoare triple {56097#(<= ~a19~0 9)} assume !(((1 == ~a26~0 && (11 == ~a19~0 && 2 == ~a1~0 && 6 == calculate_output_~input#1) && 441 < ~a12~0) && 1 == ~a13~0) && 95 < ~a23~0 && 264 >= ~a23~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,468 INFO L290 TraceCheckUtils]: 70: Hoare triple {56097#(<= ~a19~0 9)} assume !(~a12~0 <= 178 && !(1 == ~a13~0) && 1 == ~a26~0 && (2 == calculate_output_~input#1 && ((13 == ~a19~0 && ~a23~0 <= 95) || ((264 < ~a23~0 && 476 >= ~a23~0) && 12 == ~a19~0) || (12 == ~a19~0 && 476 < ~a23~0))) && 3 == ~a1~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,468 INFO L290 TraceCheckUtils]: 71: Hoare triple {56097#(<= ~a19~0 9)} assume !((((2 == ~a1~0 && (((476 < ~a23~0 && 10 == ~a19~0) || (11 == ~a19~0 && ~a23~0 <= 95)) || ((95 < ~a23~0 && 264 >= ~a23~0) && 11 == ~a19~0)) && 3 == calculate_output_~input#1) && 395 < ~a12~0 && 441 >= ~a12~0) && 1 == ~a26~0) && !(1 == ~a13~0)); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,468 INFO L290 TraceCheckUtils]: 72: Hoare triple {56097#(<= ~a19~0 9)} assume !((178 < ~a12~0 && 395 >= ~a12~0) && 1 == ~a26~0 && (9 == ~a19~0 && (6 == calculate_output_~input#1 && 1 == ~a13~0) && 3 == ~a1~0) && 476 < ~a23~0); {56097#(<= ~a19~0 9)} is VALID [2022-02-20 15:35:16,469 INFO L290 TraceCheckUtils]: 73: Hoare triple {56097#(<= ~a19~0 9)} assume ((95 < ~a23~0 && 264 >= ~a23~0) && (!(1 == ~a13~0) && 11 == ~a19~0 && 1 == ~a26~0 && 4 == calculate_output_~input#1) && 178 < ~a12~0 && 395 >= ~a12~0) && 2 == ~a1~0;~a12~0 := (if 25 * ((if ~a12~0 < 0 && 0 != ~a12~0 % 22 then ~a12~0 % 22 - 22 else ~a12~0 % 22) - -397) < 0 && 0 != 25 * ((if ~a12~0 < 0 && 0 != ~a12~0 % 22 then ~a12~0 % 22 - 22 else ~a12~0 % 22) - -397) % 22 then 25 * ((if ~a12~0 < 0 && 0 != ~a12~0 % 22 then ~a12~0 % 22 - 22 else ~a12~0 % 22) - -397) % 22 - 22 else 25 * ((if ~a12~0 < 0 && 0 != ~a12~0 % 22 then ~a12~0 % 22 - 22 else ~a12~0 % 22) - -397) % 22) - -410;~a23~0 := (if 265 * (if (if 176 + ~a23~0 < 0 && 0 != (176 + ~a23~0) % 5 then 1 + (176 + ~a23~0) / 5 else (176 + ~a23~0) / 5) < 0 && 0 != (if 176 + ~a23~0 < 0 && 0 != (176 + ~a23~0) % 5 then 1 + (176 + ~a23~0) / 5 else (176 + ~a23~0) / 5) % 5 then 1 + (if 176 + ~a23~0 < 0 && 0 != (176 + ~a23~0) % 5 then 1 + (176 + ~a23~0) / 5 else (176 + ~a23~0) / 5) / 5 else (if 176 + ~a23~0 < 0 && 0 != (176 + ~a23~0) % 5 then 1 + (176 + ~a23~0) / 5 else (176 + ~a23~0) / 5) / 5) < 0 && 0 != 265 * (if (if 176 + ~a23~0 < 0 && 0 != (176 + ~a23~0) % 5 then 1 + (176 + ~a23~0) / 5 else (176 + ~a23~0) / 5) < 0 && 0 != (if 176 + ~a23~0 < 0 && 0 != (176 + ~a23~0) % 5 then 1 + (176 + ~a23~0) / 5 else (176 + ~a23~0) / 5) % 5 then 1 + (if 176 + ~a23~0 < 0 && 0 != (176 + ~a23~0) % 5 then 1 + (176 + ~a23~0) / 5 else (176 + ~a23~0) / 5) / 5 else (if 176 + ~a23~0 < 0 && 0 != (176 + ~a23~0) % 5 then 1 + (176 + ~a23~0) / 5 else (176 + ~a23~0) / 5) / 5) % 10 then 1 + 265 * (if (if 176 + ~a23~0 < 0 && 0 != (176 + ~a23~0) % 5 then 1 + (176 + ~a23~0) / 5 else (176 + ~a23~0) / 5) < 0 && 0 != (if 176 + ~a23~0 < 0 && 0 != (176 + ~a23~0) % 5 then 1 + (176 + ~a23~0) / 5 else (176 + ~a23~0) / 5) % 5 then 1 + (if 176 + ~a23~0 < 0 && 0 != (176 + ~a23~0) % 5 then 1 + (176 + ~a23~0) / 5 else (176 + ~a23~0) / 5) / 5 else (if 176 + ~a23~0 < 0 && 0 != (176 + ~a23~0) % 5 then 1 + (176 + ~a23~0) / 5 else (176 + ~a23~0) / 5) / 5) / 10 else 265 * (if (if 176 + ~a23~0 < 0 && 0 != (176 + ~a23~0) % 5 then 1 + (176 + ~a23~0) / 5 else (176 + ~a23~0) / 5) < 0 && 0 != (if 176 + ~a23~0 < 0 && 0 != (176 + ~a23~0) % 5 then 1 + (176 + ~a23~0) / 5 else (176 + ~a23~0) / 5) % 5 then 1 + (if 176 + ~a23~0 < 0 && 0 != (176 + ~a23~0) % 5 then 1 + (176 + ~a23~0) / 5 else (176 + ~a23~0) / 5) / 5 else (if 176 + ~a23~0 < 0 && 0 != (176 + ~a23~0) % 5 then 1 + (176 + ~a23~0) / 5 else (176 + ~a23~0) / 5) / 5) / 10);calculate_output_#res#1 := 26; {56096#false} is VALID [2022-02-20 15:35:16,469 INFO L290 TraceCheckUtils]: 74: Hoare triple {56096#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; {56096#false} is VALID [2022-02-20 15:35:16,470 INFO L290 TraceCheckUtils]: 75: Hoare triple {56096#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; {56096#false} is VALID [2022-02-20 15:35:16,470 INFO L290 TraceCheckUtils]: 76: Hoare triple {56096#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; {56096#false} is VALID [2022-02-20 15:35:16,470 INFO L290 TraceCheckUtils]: 77: Hoare triple {56096#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); {56096#false} is VALID [2022-02-20 15:35:16,470 INFO L290 TraceCheckUtils]: 78: Hoare triple {56096#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); {56096#false} is VALID [2022-02-20 15:35:16,470 INFO L290 TraceCheckUtils]: 79: Hoare triple {56096#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && !(1 == ~a13~0)); {56096#false} is VALID [2022-02-20 15:35:16,470 INFO L290 TraceCheckUtils]: 80: Hoare triple {56096#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 12 == ~a19~0) && 1 == ~a13~0); {56096#false} is VALID [2022-02-20 15:35:16,470 INFO L290 TraceCheckUtils]: 81: Hoare triple {56096#false} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {56096#false} is VALID [2022-02-20 15:35:16,470 INFO L290 TraceCheckUtils]: 82: Hoare triple {56096#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && !(1 == ~a13~0)); {56096#false} is VALID [2022-02-20 15:35:16,471 INFO L290 TraceCheckUtils]: 83: Hoare triple {56096#false} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 13 == ~a19~0) && 1 == ~a13~0); {56096#false} is VALID [2022-02-20 15:35:16,471 INFO L290 TraceCheckUtils]: 84: Hoare triple {56096#false} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && !(1 == ~a13~0)); {56096#false} is VALID [2022-02-20 15:35:16,471 INFO L290 TraceCheckUtils]: 85: Hoare triple {56096#false} assume !(((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {56096#false} is VALID [2022-02-20 15:35:16,471 INFO L290 TraceCheckUtils]: 86: Hoare triple {56096#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {56096#false} is VALID [2022-02-20 15:35:16,471 INFO L290 TraceCheckUtils]: 87: Hoare triple {56096#false} assume !(((((~a12~0 <= 178 && 95 < ~a23~0 && 264 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {56096#false} is VALID [2022-02-20 15:35:16,471 INFO L290 TraceCheckUtils]: 88: Hoare triple {56096#false} assume !(((((~a12~0 <= 178 && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0)); {56096#false} is VALID [2022-02-20 15:35:16,471 INFO L290 TraceCheckUtils]: 89: Hoare triple {56096#false} assume !((((((178 < ~a12~0 && 395 >= ~a12~0) && ~a23~0 <= 95) && 1 == ~a26~0) && 2 == ~a1~0) && 10 == ~a19~0) && 1 == ~a13~0); {56096#false} is VALID [2022-02-20 15:35:16,472 INFO L290 TraceCheckUtils]: 90: Hoare triple {56096#false} assume !(((((~a12~0 <= 178 && 476 < ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 11 == ~a19~0) && !(1 == ~a13~0)); {56096#false} is VALID [2022-02-20 15:35:16,472 INFO L290 TraceCheckUtils]: 91: Hoare triple {56096#false} assume ((((~a12~0 <= 178 && 264 < ~a23~0 && 476 >= ~a23~0) && 1 == ~a26~0) && 2 == ~a1~0) && 9 == ~a19~0) && !(1 == ~a13~0); {56096#false} is VALID [2022-02-20 15:35:16,472 INFO L290 TraceCheckUtils]: 92: Hoare triple {56096#false} assume !false; {56096#false} is VALID [2022-02-20 15:35:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:35:16,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:35:16,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812222157] [2022-02-20 15:35:16,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812222157] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:35:16,480 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:35:16,480 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:35:16,480 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102821685] [2022-02-20 15:35:16,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:35:16,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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 93 [2022-02-20 15:35:16,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:35:16,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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:35:16,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:35:16,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:35:16,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:35:16,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:35:16,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:35:16,540 INFO L87 Difference]: Start difference. First operand 6657 states and 9138 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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)