./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.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/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.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 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:23:57,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:23:57,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:23:57,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:23:57,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:23:57,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:23:57,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:23:57,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:23:57,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:23:57,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:23:57,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:23:57,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:23:57,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:23:57,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:23:57,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:23:57,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:23:57,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:23:57,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:23:57,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:23:57,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:23:57,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:23:57,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:23:57,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:23:57,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:23:57,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:23:57,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:23:57,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:23:57,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:23:57,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:23:57,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:23:57,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:23:57,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:23:57,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:23:57,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:23:57,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:23:57,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:23:57,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:23:57,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:23:57,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:23:57,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:23:57,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:23:57,939 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:23:57,963 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:23:57,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:23:57,964 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:23:57,964 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:23:57,964 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:23:57,965 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:23:57,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:23:57,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:23:57,965 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:23:57,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:23:57,966 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:23:57,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:23:57,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:23:57,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:23:57,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:23:57,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:23:57,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:23:57,967 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:23:57,967 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:23:57,967 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:23:57,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:23:57,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:23:57,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:23:57,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:23:57,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:23:57,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:23:57,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:23:57,969 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:23:57,969 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:23:57,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:23:57,970 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:23:57,970 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:23:57,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:23:57,970 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 -> 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 [2022-02-20 18:23:58,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:23:58,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:23:58,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:23:58,165 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:23:58,166 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:23:58,166 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2022-02-20 18:23:58,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6815d6bb/49ee61e4b8ec46d8ba2995a4c0683b9e/FLAG05940c137 [2022-02-20 18:23:58,656 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:23:58,656 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2022-02-20 18:23:58,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6815d6bb/49ee61e4b8ec46d8ba2995a4c0683b9e/FLAG05940c137 [2022-02-20 18:23:58,679 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6815d6bb/49ee61e4b8ec46d8ba2995a4c0683b9e [2022-02-20 18:23:58,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:23:58,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:23:58,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:23:58,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:23:58,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:23:58,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:23:58" (1/1) ... [2022-02-20 18:23:58,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e890509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:58, skipping insertion in model container [2022-02-20 18:23:58,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:23:58" (1/1) ... [2022-02-20 18:23:58,695 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:23:58,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:23:58,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c[11348,11361] [2022-02-20 18:23:58,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:23:58,911 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:23:58,963 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c[11348,11361] [2022-02-20 18:23:58,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:23:58,974 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:23:58,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:58 WrapperNode [2022-02-20 18:23:58,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:23:58,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:23:58,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:23:58,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:23:58,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:58" (1/1) ... [2022-02-20 18:23:58,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:58" (1/1) ... [2022-02-20 18:23:59,059 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 429 [2022-02-20 18:23:59,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:23:59,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:23:59,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:23:59,060 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:23:59,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:58" (1/1) ... [2022-02-20 18:23:59,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:58" (1/1) ... [2022-02-20 18:23:59,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:58" (1/1) ... [2022-02-20 18:23:59,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:58" (1/1) ... [2022-02-20 18:23:59,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:58" (1/1) ... [2022-02-20 18:23:59,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:58" (1/1) ... [2022-02-20 18:23:59,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:58" (1/1) ... [2022-02-20 18:23:59,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:23:59,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:23:59,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:23:59,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:23:59,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:58" (1/1) ... [2022-02-20 18:23:59,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:23:59,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:23:59,167 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 18:23:59,171 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 18:23:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:23:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:23:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:23:59,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:23:59,263 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:23:59,264 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:23:59,790 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:23:59,799 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:23:59,801 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:23:59,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:23:59 BoogieIcfgContainer [2022-02-20 18:23:59,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:23:59,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:23:59,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:23:59,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:23:59,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:23:58" (1/3) ... [2022-02-20 18:23:59,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5baf8fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:23:59, skipping insertion in model container [2022-02-20 18:23:59,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:23:58" (2/3) ... [2022-02-20 18:23:59,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5baf8fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:23:59, skipping insertion in model container [2022-02-20 18:23:59,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:23:59" (3/3) ... [2022-02-20 18:23:59,809 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2022-02-20 18:23:59,815 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:23:59,815 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:23:59,855 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:23:59,866 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 18:23:59,866 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:23:59,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 123 states have (on average 1.7479674796747968) internal successors, (215), 124 states have internal predecessors, (215), 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 18:23:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:23:59,882 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:23:59,882 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:23:59,883 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:23:59,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:23:59,886 INFO L85 PathProgramCache]: Analyzing trace with hash 632685314, now seen corresponding path program 1 times [2022-02-20 18:23:59,891 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:23:59,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719361052] [2022-02-20 18:23:59,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:23:59,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:23:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:00,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {128#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {128#true} is VALID [2022-02-20 18:24:00,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {128#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {128#true} is VALID [2022-02-20 18:24:00,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {128#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {128#true} is VALID [2022-02-20 18:24:00,077 INFO L290 TraceCheckUtils]: 3: Hoare triple {128#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {128#true} is VALID [2022-02-20 18:24:00,077 INFO L290 TraceCheckUtils]: 4: Hoare triple {128#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {128#true} is VALID [2022-02-20 18:24:00,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {128#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {128#true} is VALID [2022-02-20 18:24:00,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {128#true} is VALID [2022-02-20 18:24:00,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {128#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {128#true} is VALID [2022-02-20 18:24:00,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {128#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {128#true} is VALID [2022-02-20 18:24:00,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {128#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {128#true} is VALID [2022-02-20 18:24:00,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {128#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {128#true} is VALID [2022-02-20 18:24:00,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {128#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {128#true} is VALID [2022-02-20 18:24:00,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {128#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {128#true} is VALID [2022-02-20 18:24:00,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {128#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {128#true} is VALID [2022-02-20 18:24:00,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {128#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {128#true} is VALID [2022-02-20 18:24:00,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {128#true} init_#res#1 := init_~tmp___5~0#1; {128#true} is VALID [2022-02-20 18:24:00,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {128#true} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {128#true} is VALID [2022-02-20 18:24:00,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {128#true} assume 0 == main_~i2~0#1;assume false; {129#false} is VALID [2022-02-20 18:24:00,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {129#false} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {129#false} is VALID [2022-02-20 18:24:00,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {129#false} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {129#false} is VALID [2022-02-20 18:24:00,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {129#false} assume !(0 != ~mode1~0 % 256); {129#false} is VALID [2022-02-20 18:24:00,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {129#false} assume !(~r1~0 < 2); {129#false} is VALID [2022-02-20 18:24:00,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {129#false} ~mode1~0 := 1; {129#false} is VALID [2022-02-20 18:24:00,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {129#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {129#false} is VALID [2022-02-20 18:24:00,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {129#false} assume !(0 != ~mode2~0 % 256); {129#false} is VALID [2022-02-20 18:24:00,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {129#false} assume !(~r2~0 < 2); {129#false} is VALID [2022-02-20 18:24:00,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {129#false} ~mode2~0 := 1; {129#false} is VALID [2022-02-20 18:24:00,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {129#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {129#false} is VALID [2022-02-20 18:24:00,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {129#false} assume !(0 != ~mode3~0 % 256); {129#false} is VALID [2022-02-20 18:24:00,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {129#false} assume !(~r3~0 < 2); {129#false} is VALID [2022-02-20 18:24:00,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {129#false} ~mode3~0 := 1; {129#false} is VALID [2022-02-20 18:24:00,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {129#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {129#false} is VALID [2022-02-20 18:24:00,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {129#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {129#false} is VALID [2022-02-20 18:24:00,090 INFO L290 TraceCheckUtils]: 33: Hoare triple {129#false} check_#res#1 := check_~tmp~1#1; {129#false} is VALID [2022-02-20 18:24:00,091 INFO L290 TraceCheckUtils]: 34: Hoare triple {129#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {129#false} is VALID [2022-02-20 18:24:00,091 INFO L290 TraceCheckUtils]: 35: Hoare triple {129#false} assume 0 == assert_~arg#1 % 256; {129#false} is VALID [2022-02-20 18:24:00,091 INFO L290 TraceCheckUtils]: 36: Hoare triple {129#false} assume !false; {129#false} is VALID [2022-02-20 18:24:00,092 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 18:24:00,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:00,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719361052] [2022-02-20 18:24:00,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719361052] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:00,093 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:00,093 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:24:00,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114179397] [2022-02-20 18:24:00,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:00,100 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 37 [2022-02-20 18:24:00,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:00,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 18:24:00,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:00,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:24:00,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:00,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:24:00,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:24:00,175 INFO L87 Difference]: Start difference. First operand has 125 states, 123 states have (on average 1.7479674796747968) internal successors, (215), 124 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 18:24:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:00,334 INFO L93 Difference]: Finished difference Result 200 states and 340 transitions. [2022-02-20 18:24:00,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:24:00,336 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 37 [2022-02-20 18:24:00,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 18:24:00,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 340 transitions. [2022-02-20 18:24:00,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 18:24:00,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 340 transitions. [2022-02-20 18:24:00,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 340 transitions. [2022-02-20 18:24:00,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 340 edges. 340 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:00,622 INFO L225 Difference]: With dead ends: 200 [2022-02-20 18:24:00,622 INFO L226 Difference]: Without dead ends: 121 [2022-02-20 18:24:00,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:24:00,627 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:00,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-02-20 18:24:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-02-20 18:24:00,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:00,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 121 states, 120 states have (on average 1.7333333333333334) internal successors, (208), 120 states have internal predecessors, (208), 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 18:24:00,662 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 121 states, 120 states have (on average 1.7333333333333334) internal successors, (208), 120 states have internal predecessors, (208), 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 18:24:00,663 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 121 states, 120 states have (on average 1.7333333333333334) internal successors, (208), 120 states have internal predecessors, (208), 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 18:24:00,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:00,671 INFO L93 Difference]: Finished difference Result 121 states and 208 transitions. [2022-02-20 18:24:00,671 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 208 transitions. [2022-02-20 18:24:00,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:00,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:00,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 120 states have (on average 1.7333333333333334) internal successors, (208), 120 states have internal predecessors, (208), 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 121 states. [2022-02-20 18:24:00,674 INFO L87 Difference]: Start difference. First operand has 121 states, 120 states have (on average 1.7333333333333334) internal successors, (208), 120 states have internal predecessors, (208), 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 121 states. [2022-02-20 18:24:00,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:00,682 INFO L93 Difference]: Finished difference Result 121 states and 208 transitions. [2022-02-20 18:24:00,682 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 208 transitions. [2022-02-20 18:24:00,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:00,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:00,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:00,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.7333333333333334) internal successors, (208), 120 states have internal predecessors, (208), 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 18:24:00,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 208 transitions. [2022-02-20 18:24:00,697 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 208 transitions. Word has length 37 [2022-02-20 18:24:00,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:00,698 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 208 transitions. [2022-02-20 18:24:00,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 18:24:00,698 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 208 transitions. [2022-02-20 18:24:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:24:00,701 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:00,701 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:00,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:24:00,702 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:00,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:00,703 INFO L85 PathProgramCache]: Analyzing trace with hash -184963136, now seen corresponding path program 1 times [2022-02-20 18:24:00,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:00,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374921051] [2022-02-20 18:24:00,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:00,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:00,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {723#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {723#true} is VALID [2022-02-20 18:24:00,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {723#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {723#true} is VALID [2022-02-20 18:24:00,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {723#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {723#true} is VALID [2022-02-20 18:24:00,846 INFO L290 TraceCheckUtils]: 3: Hoare triple {723#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {723#true} is VALID [2022-02-20 18:24:00,846 INFO L290 TraceCheckUtils]: 4: Hoare triple {723#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {723#true} is VALID [2022-02-20 18:24:00,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {723#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {723#true} is VALID [2022-02-20 18:24:00,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {723#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {723#true} is VALID [2022-02-20 18:24:00,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {723#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {723#true} is VALID [2022-02-20 18:24:00,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {723#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {723#true} is VALID [2022-02-20 18:24:00,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {723#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {723#true} is VALID [2022-02-20 18:24:00,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {723#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {723#true} is VALID [2022-02-20 18:24:00,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {723#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {723#true} is VALID [2022-02-20 18:24:00,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {723#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {723#true} is VALID [2022-02-20 18:24:00,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {723#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {723#true} is VALID [2022-02-20 18:24:00,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {723#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {725#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-20 18:24:00,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {725#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {726#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:24:00,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {726#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {727#(= |ULTIMATE.start_main_~i2~0#1| 0)} is VALID [2022-02-20 18:24:00,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {727#(= |ULTIMATE.start_main_~i2~0#1| 0)} assume !(0 == main_~i2~0#1); {724#false} is VALID [2022-02-20 18:24:00,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {724#false} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {724#false} is VALID [2022-02-20 18:24:00,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {724#false} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {724#false} is VALID [2022-02-20 18:24:00,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {724#false} assume !(0 != ~mode1~0 % 256); {724#false} is VALID [2022-02-20 18:24:00,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {724#false} assume !(~r1~0 < 2); {724#false} is VALID [2022-02-20 18:24:00,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {724#false} ~mode1~0 := 1; {724#false} is VALID [2022-02-20 18:24:00,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {724#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {724#false} is VALID [2022-02-20 18:24:00,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {724#false} assume !(0 != ~mode2~0 % 256); {724#false} is VALID [2022-02-20 18:24:00,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {724#false} assume !(~r2~0 < 2); {724#false} is VALID [2022-02-20 18:24:00,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {724#false} ~mode2~0 := 1; {724#false} is VALID [2022-02-20 18:24:00,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {724#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {724#false} is VALID [2022-02-20 18:24:00,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {724#false} assume !(0 != ~mode3~0 % 256); {724#false} is VALID [2022-02-20 18:24:00,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {724#false} assume !(~r3~0 < 2); {724#false} is VALID [2022-02-20 18:24:00,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {724#false} ~mode3~0 := 1; {724#false} is VALID [2022-02-20 18:24:00,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {724#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {724#false} is VALID [2022-02-20 18:24:00,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {724#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {724#false} is VALID [2022-02-20 18:24:00,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {724#false} check_#res#1 := check_~tmp~1#1; {724#false} is VALID [2022-02-20 18:24:00,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {724#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {724#false} is VALID [2022-02-20 18:24:00,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {724#false} assume 0 == assert_~arg#1 % 256; {724#false} is VALID [2022-02-20 18:24:00,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {724#false} assume !false; {724#false} is VALID [2022-02-20 18:24:00,860 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 18:24:00,860 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:00,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374921051] [2022-02-20 18:24:00,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374921051] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:00,861 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:00,861 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:24:00,861 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932124155] [2022-02-20 18:24:00,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:00,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2022-02-20 18:24:00,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:00,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 18:24:00,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:00,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:24:00,893 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:00,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:24:00,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:24:00,895 INFO L87 Difference]: Start difference. First operand 121 states and 208 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 18:24:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:01,343 INFO L93 Difference]: Finished difference Result 265 states and 448 transitions. [2022-02-20 18:24:01,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:24:01,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2022-02-20 18:24:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 18:24:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 448 transitions. [2022-02-20 18:24:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 18:24:01,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 448 transitions. [2022-02-20 18:24:01,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 448 transitions. [2022-02-20 18:24:01,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:01,637 INFO L225 Difference]: With dead ends: 265 [2022-02-20 18:24:01,637 INFO L226 Difference]: Without dead ends: 191 [2022-02-20 18:24:01,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:24:01,639 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 120 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:01,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 790 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:01,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-02-20 18:24:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 121. [2022-02-20 18:24:01,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:01,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 121 states, 120 states have (on average 1.5583333333333333) internal successors, (187), 120 states have internal predecessors, (187), 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 18:24:01,645 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 121 states, 120 states have (on average 1.5583333333333333) internal successors, (187), 120 states have internal predecessors, (187), 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 18:24:01,645 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 121 states, 120 states have (on average 1.5583333333333333) internal successors, (187), 120 states have internal predecessors, (187), 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 18:24:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:01,650 INFO L93 Difference]: Finished difference Result 191 states and 305 transitions. [2022-02-20 18:24:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 305 transitions. [2022-02-20 18:24:01,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:01,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:01,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 120 states have (on average 1.5583333333333333) internal successors, (187), 120 states have internal predecessors, (187), 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 191 states. [2022-02-20 18:24:01,662 INFO L87 Difference]: Start difference. First operand has 121 states, 120 states have (on average 1.5583333333333333) internal successors, (187), 120 states have internal predecessors, (187), 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 191 states. [2022-02-20 18:24:01,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:01,668 INFO L93 Difference]: Finished difference Result 191 states and 305 transitions. [2022-02-20 18:24:01,668 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 305 transitions. [2022-02-20 18:24:01,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:01,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:01,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:01,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.5583333333333333) internal successors, (187), 120 states have internal predecessors, (187), 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 18:24:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 187 transitions. [2022-02-20 18:24:01,672 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 187 transitions. Word has length 37 [2022-02-20 18:24:01,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:01,673 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 187 transitions. [2022-02-20 18:24:01,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 18:24:01,674 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 187 transitions. [2022-02-20 18:24:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:24:01,676 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:01,678 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:01,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:24:01,679 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:01,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:01,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1843152740, now seen corresponding path program 1 times [2022-02-20 18:24:01,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:01,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011882487] [2022-02-20 18:24:01,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:01,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:01,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {1537#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {1537#true} is VALID [2022-02-20 18:24:01,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {1537#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {1537#true} is VALID [2022-02-20 18:24:01,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {1537#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1537#true} is VALID [2022-02-20 18:24:01,803 INFO L290 TraceCheckUtils]: 3: Hoare triple {1537#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1537#true} is VALID [2022-02-20 18:24:01,803 INFO L290 TraceCheckUtils]: 4: Hoare triple {1537#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1537#true} is VALID [2022-02-20 18:24:01,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {1537#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1537#true} is VALID [2022-02-20 18:24:01,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {1537#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {1537#true} is VALID [2022-02-20 18:24:01,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {1537#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1537#true} is VALID [2022-02-20 18:24:01,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {1537#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {1537#true} is VALID [2022-02-20 18:24:01,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {1537#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1537#true} is VALID [2022-02-20 18:24:01,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {1537#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {1537#true} is VALID [2022-02-20 18:24:01,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {1537#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1537#true} is VALID [2022-02-20 18:24:01,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {1537#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {1537#true} is VALID [2022-02-20 18:24:01,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {1537#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1537#true} is VALID [2022-02-20 18:24:01,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {1537#true} assume ~id1~0 != ~id2~0; {1537#true} is VALID [2022-02-20 18:24:01,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {1537#true} assume ~id1~0 != ~id3~0; {1537#true} is VALID [2022-02-20 18:24:01,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {1537#true} assume ~id2~0 != ~id3~0; {1537#true} is VALID [2022-02-20 18:24:01,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {1537#true} assume ~id1~0 >= 0; {1537#true} is VALID [2022-02-20 18:24:01,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {1537#true} assume ~id2~0 >= 0; {1537#true} is VALID [2022-02-20 18:24:01,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {1537#true} assume ~id3~0 >= 0; {1537#true} is VALID [2022-02-20 18:24:01,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {1537#true} assume 0 == ~r1~0; {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {1539#(<= ~r1~0 0)} assume 0 == ~r2~0; {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {1539#(<= ~r1~0 0)} assume 0 == ~r3~0; {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {1539#(<= ~r1~0 0)} assume ~max1~0 == ~id1~0; {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {1539#(<= ~r1~0 0)} assume ~max2~0 == ~id2~0; {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {1539#(<= ~r1~0 0)} assume ~max3~0 == ~id3~0; {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {1539#(<= ~r1~0 0)} assume 0 == ~st1~0; {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {1539#(<= ~r1~0 0)} assume 0 == ~st2~0; {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {1539#(<= ~r1~0 0)} assume 0 == ~st3~0; {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {1539#(<= ~r1~0 0)} assume 0 == ~nl1~0; {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,833 INFO L290 TraceCheckUtils]: 30: Hoare triple {1539#(<= ~r1~0 0)} assume 0 == ~nl2~0; {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {1539#(<= ~r1~0 0)} assume 0 == ~nl3~0; {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {1539#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {1539#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {1539#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {1539#(<= ~r1~0 0)} init_#res#1 := init_~tmp___5~0#1; {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {1539#(<= ~r1~0 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {1539#(<= ~r1~0 0)} assume !(0 == main_~i2~0#1); {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {1539#(<= ~r1~0 0)} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,840 INFO L290 TraceCheckUtils]: 39: Hoare triple {1539#(<= ~r1~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,841 INFO L290 TraceCheckUtils]: 40: Hoare triple {1539#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {1539#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:01,842 INFO L290 TraceCheckUtils]: 41: Hoare triple {1539#(<= ~r1~0 0)} assume !(~r1~0 < 2); {1538#false} is VALID [2022-02-20 18:24:01,842 INFO L290 TraceCheckUtils]: 42: Hoare triple {1538#false} ~mode1~0 := 1; {1538#false} is VALID [2022-02-20 18:24:01,844 INFO L290 TraceCheckUtils]: 43: Hoare triple {1538#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {1538#false} is VALID [2022-02-20 18:24:01,844 INFO L290 TraceCheckUtils]: 44: Hoare triple {1538#false} assume !(0 != ~mode2~0 % 256); {1538#false} is VALID [2022-02-20 18:24:01,855 INFO L290 TraceCheckUtils]: 45: Hoare triple {1538#false} assume !(~r2~0 < 2); {1538#false} is VALID [2022-02-20 18:24:01,855 INFO L290 TraceCheckUtils]: 46: Hoare triple {1538#false} ~mode2~0 := 1; {1538#false} is VALID [2022-02-20 18:24:01,855 INFO L290 TraceCheckUtils]: 47: Hoare triple {1538#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {1538#false} is VALID [2022-02-20 18:24:01,856 INFO L290 TraceCheckUtils]: 48: Hoare triple {1538#false} assume !(0 != ~mode3~0 % 256); {1538#false} is VALID [2022-02-20 18:24:01,856 INFO L290 TraceCheckUtils]: 49: Hoare triple {1538#false} assume !(~r3~0 < 2); {1538#false} is VALID [2022-02-20 18:24:01,856 INFO L290 TraceCheckUtils]: 50: Hoare triple {1538#false} ~mode3~0 := 1; {1538#false} is VALID [2022-02-20 18:24:01,856 INFO L290 TraceCheckUtils]: 51: Hoare triple {1538#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1538#false} is VALID [2022-02-20 18:24:01,856 INFO L290 TraceCheckUtils]: 52: Hoare triple {1538#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1538#false} is VALID [2022-02-20 18:24:01,856 INFO L290 TraceCheckUtils]: 53: Hoare triple {1538#false} check_#res#1 := check_~tmp~1#1; {1538#false} is VALID [2022-02-20 18:24:01,856 INFO L290 TraceCheckUtils]: 54: Hoare triple {1538#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1538#false} is VALID [2022-02-20 18:24:01,856 INFO L290 TraceCheckUtils]: 55: Hoare triple {1538#false} assume 0 == assert_~arg#1 % 256; {1538#false} is VALID [2022-02-20 18:24:01,856 INFO L290 TraceCheckUtils]: 56: Hoare triple {1538#false} assume !false; {1538#false} is VALID [2022-02-20 18:24:01,857 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 18:24:01,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:01,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011882487] [2022-02-20 18:24:01,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011882487] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:01,857 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:01,858 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:01,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117730155] [2022-02-20 18:24:01,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:01,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 57 [2022-02-20 18:24:01,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:01,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 18:24:01,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:01,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:01,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:01,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:01,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:01,917 INFO L87 Difference]: Start difference. First operand 121 states and 187 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 18:24:02,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:02,191 INFO L93 Difference]: Finished difference Result 252 states and 406 transitions. [2022-02-20 18:24:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:02,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 57 [2022-02-20 18:24:02,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 18:24:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2022-02-20 18:24:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 18:24:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2022-02-20 18:24:02,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 406 transitions. [2022-02-20 18:24:02,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:02,460 INFO L225 Difference]: With dead ends: 252 [2022-02-20 18:24:02,460 INFO L226 Difference]: Without dead ends: 182 [2022-02-20 18:24:02,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:24:02,461 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 93 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:02,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 415 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:02,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-02-20 18:24:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2022-02-20 18:24:02,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:02,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 180 states, 179 states have (on average 1.5754189944134078) internal successors, (282), 179 states have internal predecessors, (282), 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 18:24:02,491 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 180 states, 179 states have (on average 1.5754189944134078) internal successors, (282), 179 states have internal predecessors, (282), 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 18:24:02,491 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 180 states, 179 states have (on average 1.5754189944134078) internal successors, (282), 179 states have internal predecessors, (282), 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 18:24:02,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:02,495 INFO L93 Difference]: Finished difference Result 182 states and 283 transitions. [2022-02-20 18:24:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 283 transitions. [2022-02-20 18:24:02,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:02,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:02,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 179 states have (on average 1.5754189944134078) internal successors, (282), 179 states have internal predecessors, (282), 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 182 states. [2022-02-20 18:24:02,496 INFO L87 Difference]: Start difference. First operand has 180 states, 179 states have (on average 1.5754189944134078) internal successors, (282), 179 states have internal predecessors, (282), 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 182 states. [2022-02-20 18:24:02,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:02,500 INFO L93 Difference]: Finished difference Result 182 states and 283 transitions. [2022-02-20 18:24:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 283 transitions. [2022-02-20 18:24:02,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:02,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:02,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:02,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.5754189944134078) internal successors, (282), 179 states have internal predecessors, (282), 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 18:24:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 282 transitions. [2022-02-20 18:24:02,505 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 282 transitions. Word has length 57 [2022-02-20 18:24:02,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:02,506 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 282 transitions. [2022-02-20 18:24:02,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 18:24:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 282 transitions. [2022-02-20 18:24:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:24:02,507 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:02,507 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:02,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:24:02,507 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:02,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:02,508 INFO L85 PathProgramCache]: Analyzing trace with hash 700379209, now seen corresponding path program 1 times [2022-02-20 18:24:02,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:02,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099171088] [2022-02-20 18:24:02,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:02,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:02,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {2380#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {2380#true} is VALID [2022-02-20 18:24:02,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {2380#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {2380#true} is VALID [2022-02-20 18:24:02,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {2380#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2380#true} is VALID [2022-02-20 18:24:02,569 INFO L290 TraceCheckUtils]: 3: Hoare triple {2380#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2380#true} is VALID [2022-02-20 18:24:02,583 INFO L290 TraceCheckUtils]: 4: Hoare triple {2380#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2380#true} is VALID [2022-02-20 18:24:02,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {2380#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2380#true} is VALID [2022-02-20 18:24:02,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {2380#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2380#true} is VALID [2022-02-20 18:24:02,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {2380#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2380#true} is VALID [2022-02-20 18:24:02,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {2380#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2380#true} is VALID [2022-02-20 18:24:02,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {2380#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2380#true} is VALID [2022-02-20 18:24:02,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {2380#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2380#true} is VALID [2022-02-20 18:24:02,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {2380#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2380#true} is VALID [2022-02-20 18:24:02,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {2380#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2380#true} is VALID [2022-02-20 18:24:02,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {2380#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2380#true} is VALID [2022-02-20 18:24:02,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {2380#true} assume ~id1~0 != ~id2~0; {2380#true} is VALID [2022-02-20 18:24:02,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {2380#true} assume ~id1~0 != ~id3~0; {2380#true} is VALID [2022-02-20 18:24:02,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {2380#true} assume ~id2~0 != ~id3~0; {2380#true} is VALID [2022-02-20 18:24:02,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {2380#true} assume ~id1~0 >= 0; {2380#true} is VALID [2022-02-20 18:24:02,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {2380#true} assume ~id2~0 >= 0; {2380#true} is VALID [2022-02-20 18:24:02,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {2380#true} assume ~id3~0 >= 0; {2380#true} is VALID [2022-02-20 18:24:02,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {2380#true} assume 0 == ~r1~0; {2380#true} is VALID [2022-02-20 18:24:02,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {2380#true} assume 0 == ~r2~0; {2380#true} is VALID [2022-02-20 18:24:02,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {2380#true} assume 0 == ~r3~0; {2380#true} is VALID [2022-02-20 18:24:02,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {2380#true} assume ~max1~0 == ~id1~0; {2380#true} is VALID [2022-02-20 18:24:02,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {2380#true} assume ~max2~0 == ~id2~0; {2380#true} is VALID [2022-02-20 18:24:02,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {2380#true} assume ~max3~0 == ~id3~0; {2380#true} is VALID [2022-02-20 18:24:02,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {2380#true} assume 0 == ~st1~0; {2380#true} is VALID [2022-02-20 18:24:02,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {2380#true} assume 0 == ~st2~0; {2380#true} is VALID [2022-02-20 18:24:02,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {2380#true} assume 0 == ~st3~0; {2380#true} is VALID [2022-02-20 18:24:02,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {2380#true} assume 0 == ~nl1~0; {2380#true} is VALID [2022-02-20 18:24:02,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {2380#true} assume 0 == ~nl2~0; {2380#true} is VALID [2022-02-20 18:24:02,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {2380#true} assume 0 == ~nl3~0; {2380#true} is VALID [2022-02-20 18:24:02,589 INFO L290 TraceCheckUtils]: 32: Hoare triple {2380#true} assume 0 == ~mode1~0 % 256; {2382#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:02,589 INFO L290 TraceCheckUtils]: 33: Hoare triple {2382#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {2382#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:02,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {2382#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {2382#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:02,590 INFO L290 TraceCheckUtils]: 35: Hoare triple {2382#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {2382#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:02,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {2382#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {2382#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:02,591 INFO L290 TraceCheckUtils]: 37: Hoare triple {2382#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main_~i2~0#1); {2382#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:02,591 INFO L290 TraceCheckUtils]: 38: Hoare triple {2382#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2382#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:02,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {2382#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {2382#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:02,593 INFO L290 TraceCheckUtils]: 40: Hoare triple {2382#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {2381#false} is VALID [2022-02-20 18:24:02,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {2381#false} assume !(0 != ~ep21~0 % 256); {2381#false} is VALID [2022-02-20 18:24:02,593 INFO L290 TraceCheckUtils]: 42: Hoare triple {2381#false} assume !(0 != ~ep31~0 % 256); {2381#false} is VALID [2022-02-20 18:24:02,593 INFO L290 TraceCheckUtils]: 43: Hoare triple {2381#false} assume !(2 == ~r1~0); {2381#false} is VALID [2022-02-20 18:24:02,593 INFO L290 TraceCheckUtils]: 44: Hoare triple {2381#false} ~mode1~0 := 0; {2381#false} is VALID [2022-02-20 18:24:02,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {2381#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {2381#false} is VALID [2022-02-20 18:24:02,594 INFO L290 TraceCheckUtils]: 46: Hoare triple {2381#false} assume !(0 != ~mode2~0 % 256); {2381#false} is VALID [2022-02-20 18:24:02,594 INFO L290 TraceCheckUtils]: 47: Hoare triple {2381#false} assume !(~r2~0 < 2); {2381#false} is VALID [2022-02-20 18:24:02,594 INFO L290 TraceCheckUtils]: 48: Hoare triple {2381#false} ~mode2~0 := 1; {2381#false} is VALID [2022-02-20 18:24:02,594 INFO L290 TraceCheckUtils]: 49: Hoare triple {2381#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {2381#false} is VALID [2022-02-20 18:24:02,595 INFO L290 TraceCheckUtils]: 50: Hoare triple {2381#false} assume !(0 != ~mode3~0 % 256); {2381#false} is VALID [2022-02-20 18:24:02,595 INFO L290 TraceCheckUtils]: 51: Hoare triple {2381#false} assume !(~r3~0 < 2); {2381#false} is VALID [2022-02-20 18:24:02,595 INFO L290 TraceCheckUtils]: 52: Hoare triple {2381#false} ~mode3~0 := 1; {2381#false} is VALID [2022-02-20 18:24:02,595 INFO L290 TraceCheckUtils]: 53: Hoare triple {2381#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2381#false} is VALID [2022-02-20 18:24:02,595 INFO L290 TraceCheckUtils]: 54: Hoare triple {2381#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {2381#false} is VALID [2022-02-20 18:24:02,596 INFO L290 TraceCheckUtils]: 55: Hoare triple {2381#false} check_#res#1 := check_~tmp~1#1; {2381#false} is VALID [2022-02-20 18:24:02,596 INFO L290 TraceCheckUtils]: 56: Hoare triple {2381#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2381#false} is VALID [2022-02-20 18:24:02,596 INFO L290 TraceCheckUtils]: 57: Hoare triple {2381#false} assume 0 == assert_~arg#1 % 256; {2381#false} is VALID [2022-02-20 18:24:02,596 INFO L290 TraceCheckUtils]: 58: Hoare triple {2381#false} assume !false; {2381#false} is VALID [2022-02-20 18:24:02,597 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 18:24:02,597 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:02,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099171088] [2022-02-20 18:24:02,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099171088] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:02,597 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:02,598 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:02,598 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291612959] [2022-02-20 18:24:02,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:02,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2022-02-20 18:24:02,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:02,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 18:24:02,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:02,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:02,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:02,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:02,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:02,657 INFO L87 Difference]: Start difference. First operand 180 states and 282 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 18:24:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:02,876 INFO L93 Difference]: Finished difference Result 307 states and 495 transitions. [2022-02-20 18:24:02,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:02,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2022-02-20 18:24:02,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 18:24:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2022-02-20 18:24:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 18:24:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2022-02-20 18:24:02,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 397 transitions. [2022-02-20 18:24:03,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 397 edges. 397 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:03,129 INFO L225 Difference]: With dead ends: 307 [2022-02-20 18:24:03,130 INFO L226 Difference]: Without dead ends: 237 [2022-02-20 18:24:03,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:24:03,139 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 102 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:03,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 429 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:03,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-02-20 18:24:03,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2022-02-20 18:24:03,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:03,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 235 states, 234 states have (on average 1.5982905982905984) internal successors, (374), 234 states have internal predecessors, (374), 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 18:24:03,163 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 235 states, 234 states have (on average 1.5982905982905984) internal successors, (374), 234 states have internal predecessors, (374), 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 18:24:03,164 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 235 states, 234 states have (on average 1.5982905982905984) internal successors, (374), 234 states have internal predecessors, (374), 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 18:24:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:03,178 INFO L93 Difference]: Finished difference Result 237 states and 375 transitions. [2022-02-20 18:24:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 375 transitions. [2022-02-20 18:24:03,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:03,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:03,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 234 states have (on average 1.5982905982905984) internal successors, (374), 234 states have internal predecessors, (374), 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 237 states. [2022-02-20 18:24:03,179 INFO L87 Difference]: Start difference. First operand has 235 states, 234 states have (on average 1.5982905982905984) internal successors, (374), 234 states have internal predecessors, (374), 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 237 states. [2022-02-20 18:24:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:03,184 INFO L93 Difference]: Finished difference Result 237 states and 375 transitions. [2022-02-20 18:24:03,184 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 375 transitions. [2022-02-20 18:24:03,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:03,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:03,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:03,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.5982905982905984) internal successors, (374), 234 states have internal predecessors, (374), 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 18:24:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 374 transitions. [2022-02-20 18:24:03,189 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 374 transitions. Word has length 59 [2022-02-20 18:24:03,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:03,189 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 374 transitions. [2022-02-20 18:24:03,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 18:24:03,190 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 374 transitions. [2022-02-20 18:24:03,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:24:03,191 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:03,191 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:03,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:24:03,191 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:03,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:03,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1943315629, now seen corresponding path program 1 times [2022-02-20 18:24:03,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:03,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554538849] [2022-02-20 18:24:03,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:03,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:03,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {3461#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {3461#true} is VALID [2022-02-20 18:24:03,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {3461#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {3461#true} is VALID [2022-02-20 18:24:03,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {3461#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3461#true} is VALID [2022-02-20 18:24:03,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {3461#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3461#true} is VALID [2022-02-20 18:24:03,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {3461#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3461#true} is VALID [2022-02-20 18:24:03,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {3461#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3461#true} is VALID [2022-02-20 18:24:03,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {3461#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {3461#true} is VALID [2022-02-20 18:24:03,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {3461#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3461#true} is VALID [2022-02-20 18:24:03,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {3461#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {3461#true} is VALID [2022-02-20 18:24:03,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {3461#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3461#true} is VALID [2022-02-20 18:24:03,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {3461#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {3461#true} is VALID [2022-02-20 18:24:03,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {3461#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3461#true} is VALID [2022-02-20 18:24:03,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {3461#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {3461#true} is VALID [2022-02-20 18:24:03,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {3461#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3461#true} is VALID [2022-02-20 18:24:03,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {3461#true} assume ~id1~0 != ~id2~0; {3461#true} is VALID [2022-02-20 18:24:03,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {3461#true} assume ~id1~0 != ~id3~0; {3461#true} is VALID [2022-02-20 18:24:03,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {3461#true} assume ~id2~0 != ~id3~0; {3461#true} is VALID [2022-02-20 18:24:03,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {3461#true} assume ~id1~0 >= 0; {3461#true} is VALID [2022-02-20 18:24:03,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {3461#true} assume ~id2~0 >= 0; {3461#true} is VALID [2022-02-20 18:24:03,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {3461#true} assume ~id3~0 >= 0; {3461#true} is VALID [2022-02-20 18:24:03,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {3461#true} assume 0 == ~r1~0; {3461#true} is VALID [2022-02-20 18:24:03,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {3461#true} assume 0 == ~r2~0; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {3463#(<= ~r2~0 0)} assume 0 == ~r3~0; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {3463#(<= ~r2~0 0)} assume ~max1~0 == ~id1~0; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {3463#(<= ~r2~0 0)} assume ~max2~0 == ~id2~0; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {3463#(<= ~r2~0 0)} assume ~max3~0 == ~id3~0; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {3463#(<= ~r2~0 0)} assume 0 == ~st1~0; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {3463#(<= ~r2~0 0)} assume 0 == ~st2~0; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {3463#(<= ~r2~0 0)} assume 0 == ~st3~0; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,285 INFO L290 TraceCheckUtils]: 29: Hoare triple {3463#(<= ~r2~0 0)} assume 0 == ~nl1~0; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {3463#(<= ~r2~0 0)} assume 0 == ~nl2~0; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {3463#(<= ~r2~0 0)} assume 0 == ~nl3~0; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,286 INFO L290 TraceCheckUtils]: 32: Hoare triple {3463#(<= ~r2~0 0)} assume 0 == ~mode1~0 % 256; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {3463#(<= ~r2~0 0)} assume 0 == ~mode2~0 % 256; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {3463#(<= ~r2~0 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {3463#(<= ~r2~0 0)} init_#res#1 := init_~tmp___5~0#1; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,287 INFO L290 TraceCheckUtils]: 36: Hoare triple {3463#(<= ~r2~0 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {3463#(<= ~r2~0 0)} assume !(0 == main_~i2~0#1); {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,288 INFO L290 TraceCheckUtils]: 38: Hoare triple {3463#(<= ~r2~0 0)} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,288 INFO L290 TraceCheckUtils]: 39: Hoare triple {3463#(<= ~r2~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,289 INFO L290 TraceCheckUtils]: 40: Hoare triple {3463#(<= ~r2~0 0)} assume !(0 != ~mode1~0 % 256); {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,289 INFO L290 TraceCheckUtils]: 41: Hoare triple {3463#(<= ~r2~0 0)} assume ~r1~0 < 2; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,289 INFO L290 TraceCheckUtils]: 42: Hoare triple {3463#(<= ~r2~0 0)} assume !(0 != ~ep12~0 % 256); {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,290 INFO L290 TraceCheckUtils]: 43: Hoare triple {3463#(<= ~r2~0 0)} assume !(0 != ~ep13~0 % 256); {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,290 INFO L290 TraceCheckUtils]: 44: Hoare triple {3463#(<= ~r2~0 0)} ~mode1~0 := 1; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,290 INFO L290 TraceCheckUtils]: 45: Hoare triple {3463#(<= ~r2~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,291 INFO L290 TraceCheckUtils]: 46: Hoare triple {3463#(<= ~r2~0 0)} assume !(0 != ~mode2~0 % 256); {3463#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:03,291 INFO L290 TraceCheckUtils]: 47: Hoare triple {3463#(<= ~r2~0 0)} assume !(~r2~0 < 2); {3462#false} is VALID [2022-02-20 18:24:03,291 INFO L290 TraceCheckUtils]: 48: Hoare triple {3462#false} ~mode2~0 := 1; {3462#false} is VALID [2022-02-20 18:24:03,291 INFO L290 TraceCheckUtils]: 49: Hoare triple {3462#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {3462#false} is VALID [2022-02-20 18:24:03,291 INFO L290 TraceCheckUtils]: 50: Hoare triple {3462#false} assume !(0 != ~mode3~0 % 256); {3462#false} is VALID [2022-02-20 18:24:03,292 INFO L290 TraceCheckUtils]: 51: Hoare triple {3462#false} assume !(~r3~0 < 2); {3462#false} is VALID [2022-02-20 18:24:03,296 INFO L290 TraceCheckUtils]: 52: Hoare triple {3462#false} ~mode3~0 := 1; {3462#false} is VALID [2022-02-20 18:24:03,297 INFO L290 TraceCheckUtils]: 53: Hoare triple {3462#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3462#false} is VALID [2022-02-20 18:24:03,297 INFO L290 TraceCheckUtils]: 54: Hoare triple {3462#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {3462#false} is VALID [2022-02-20 18:24:03,297 INFO L290 TraceCheckUtils]: 55: Hoare triple {3462#false} check_#res#1 := check_~tmp~1#1; {3462#false} is VALID [2022-02-20 18:24:03,298 INFO L290 TraceCheckUtils]: 56: Hoare triple {3462#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3462#false} is VALID [2022-02-20 18:24:03,299 INFO L290 TraceCheckUtils]: 57: Hoare triple {3462#false} assume 0 == assert_~arg#1 % 256; {3462#false} is VALID [2022-02-20 18:24:03,299 INFO L290 TraceCheckUtils]: 58: Hoare triple {3462#false} assume !false; {3462#false} is VALID [2022-02-20 18:24:03,299 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 18:24:03,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:03,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554538849] [2022-02-20 18:24:03,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554538849] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:03,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:03,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:03,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058227142] [2022-02-20 18:24:03,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:03,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2022-02-20 18:24:03,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:03,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 18:24:03,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:03,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:03,331 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:03,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:03,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:03,332 INFO L87 Difference]: Start difference. First operand 235 states and 374 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 18:24:03,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:03,539 INFO L93 Difference]: Finished difference Result 578 states and 941 transitions. [2022-02-20 18:24:03,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:03,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2022-02-20 18:24:03,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 18:24:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2022-02-20 18:24:03,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 18:24:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2022-02-20 18:24:03,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 410 transitions. [2022-02-20 18:24:03,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 410 edges. 410 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:03,777 INFO L225 Difference]: With dead ends: 578 [2022-02-20 18:24:03,777 INFO L226 Difference]: Without dead ends: 396 [2022-02-20 18:24:03,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:24:03,782 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 95 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:03,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 422 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:03,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-02-20 18:24:03,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 394. [2022-02-20 18:24:03,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:03,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 394 states, 393 states have (on average 1.61323155216285) internal successors, (634), 393 states have internal predecessors, (634), 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 18:24:03,819 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 394 states, 393 states have (on average 1.61323155216285) internal successors, (634), 393 states have internal predecessors, (634), 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 18:24:03,820 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 394 states, 393 states have (on average 1.61323155216285) internal successors, (634), 393 states have internal predecessors, (634), 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 18:24:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:03,827 INFO L93 Difference]: Finished difference Result 396 states and 635 transitions. [2022-02-20 18:24:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 635 transitions. [2022-02-20 18:24:03,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:03,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:03,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 394 states, 393 states have (on average 1.61323155216285) internal successors, (634), 393 states have internal predecessors, (634), 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 396 states. [2022-02-20 18:24:03,829 INFO L87 Difference]: Start difference. First operand has 394 states, 393 states have (on average 1.61323155216285) internal successors, (634), 393 states have internal predecessors, (634), 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 396 states. [2022-02-20 18:24:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:03,836 INFO L93 Difference]: Finished difference Result 396 states and 635 transitions. [2022-02-20 18:24:03,836 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 635 transitions. [2022-02-20 18:24:03,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:03,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:03,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:03,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 1.61323155216285) internal successors, (634), 393 states have internal predecessors, (634), 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 18:24:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 634 transitions. [2022-02-20 18:24:03,844 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 634 transitions. Word has length 59 [2022-02-20 18:24:03,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:03,844 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 634 transitions. [2022-02-20 18:24:03,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 18:24:03,845 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 634 transitions. [2022-02-20 18:24:03,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:24:03,846 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:03,846 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:03,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:24:03,846 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:03,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:03,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1342077512, now seen corresponding path program 1 times [2022-02-20 18:24:03,847 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:03,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499775138] [2022-02-20 18:24:03,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:03,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:03,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {5354#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {5354#true} is VALID [2022-02-20 18:24:03,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {5354#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {5354#true} is VALID [2022-02-20 18:24:03,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {5354#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {5354#true} is VALID [2022-02-20 18:24:03,905 INFO L290 TraceCheckUtils]: 3: Hoare triple {5354#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {5354#true} is VALID [2022-02-20 18:24:03,905 INFO L290 TraceCheckUtils]: 4: Hoare triple {5354#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {5354#true} is VALID [2022-02-20 18:24:03,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {5354#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {5354#true} is VALID [2022-02-20 18:24:03,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {5354#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {5354#true} is VALID [2022-02-20 18:24:03,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {5354#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {5354#true} is VALID [2022-02-20 18:24:03,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {5354#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {5354#true} is VALID [2022-02-20 18:24:03,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {5354#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {5354#true} is VALID [2022-02-20 18:24:03,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {5354#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {5354#true} is VALID [2022-02-20 18:24:03,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {5354#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {5354#true} is VALID [2022-02-20 18:24:03,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {5354#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {5354#true} is VALID [2022-02-20 18:24:03,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {5354#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {5354#true} is VALID [2022-02-20 18:24:03,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {5354#true} assume ~id1~0 != ~id2~0; {5354#true} is VALID [2022-02-20 18:24:03,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {5354#true} assume ~id1~0 != ~id3~0; {5354#true} is VALID [2022-02-20 18:24:03,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {5354#true} assume ~id2~0 != ~id3~0; {5354#true} is VALID [2022-02-20 18:24:03,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {5354#true} assume ~id1~0 >= 0; {5354#true} is VALID [2022-02-20 18:24:03,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {5354#true} assume ~id2~0 >= 0; {5354#true} is VALID [2022-02-20 18:24:03,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {5354#true} assume ~id3~0 >= 0; {5354#true} is VALID [2022-02-20 18:24:03,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {5354#true} assume 0 == ~r1~0; {5354#true} is VALID [2022-02-20 18:24:03,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {5354#true} assume 0 == ~r2~0; {5354#true} is VALID [2022-02-20 18:24:03,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {5354#true} assume 0 == ~r3~0; {5354#true} is VALID [2022-02-20 18:24:03,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {5354#true} assume ~max1~0 == ~id1~0; {5354#true} is VALID [2022-02-20 18:24:03,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {5354#true} assume ~max2~0 == ~id2~0; {5354#true} is VALID [2022-02-20 18:24:03,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {5354#true} assume ~max3~0 == ~id3~0; {5354#true} is VALID [2022-02-20 18:24:03,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {5354#true} assume 0 == ~st1~0; {5354#true} is VALID [2022-02-20 18:24:03,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {5354#true} assume 0 == ~st2~0; {5354#true} is VALID [2022-02-20 18:24:03,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {5354#true} assume 0 == ~st3~0; {5354#true} is VALID [2022-02-20 18:24:03,908 INFO L290 TraceCheckUtils]: 29: Hoare triple {5354#true} assume 0 == ~nl1~0; {5354#true} is VALID [2022-02-20 18:24:03,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {5354#true} assume 0 == ~nl2~0; {5354#true} is VALID [2022-02-20 18:24:03,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {5354#true} assume 0 == ~nl3~0; {5354#true} is VALID [2022-02-20 18:24:03,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {5354#true} assume 0 == ~mode1~0 % 256; {5354#true} is VALID [2022-02-20 18:24:03,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {5354#true} assume 0 == ~mode2~0 % 256; {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:03,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:03,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:03,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:03,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == main_~i2~0#1); {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:03,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:03,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:03,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:03,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 < 2; {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:03,913 INFO L290 TraceCheckUtils]: 42: Hoare triple {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep12~0 % 256); {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:03,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep13~0 % 256); {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:03,914 INFO L290 TraceCheckUtils]: 44: Hoare triple {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:03,914 INFO L290 TraceCheckUtils]: 45: Hoare triple {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:03,915 INFO L290 TraceCheckUtils]: 46: Hoare triple {5356#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {5355#false} is VALID [2022-02-20 18:24:03,915 INFO L290 TraceCheckUtils]: 47: Hoare triple {5355#false} assume !(0 != ~ep12~0 % 256); {5355#false} is VALID [2022-02-20 18:24:03,915 INFO L290 TraceCheckUtils]: 48: Hoare triple {5355#false} assume !(0 != ~ep32~0 % 256); {5355#false} is VALID [2022-02-20 18:24:03,915 INFO L290 TraceCheckUtils]: 49: Hoare triple {5355#false} assume !(2 == ~r2~0); {5355#false} is VALID [2022-02-20 18:24:03,915 INFO L290 TraceCheckUtils]: 50: Hoare triple {5355#false} ~mode2~0 := 0; {5355#false} is VALID [2022-02-20 18:24:03,915 INFO L290 TraceCheckUtils]: 51: Hoare triple {5355#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {5355#false} is VALID [2022-02-20 18:24:03,916 INFO L290 TraceCheckUtils]: 52: Hoare triple {5355#false} assume !(0 != ~mode3~0 % 256); {5355#false} is VALID [2022-02-20 18:24:03,916 INFO L290 TraceCheckUtils]: 53: Hoare triple {5355#false} assume !(~r3~0 < 2); {5355#false} is VALID [2022-02-20 18:24:03,916 INFO L290 TraceCheckUtils]: 54: Hoare triple {5355#false} ~mode3~0 := 1; {5355#false} is VALID [2022-02-20 18:24:03,916 INFO L290 TraceCheckUtils]: 55: Hoare triple {5355#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5355#false} is VALID [2022-02-20 18:24:03,916 INFO L290 TraceCheckUtils]: 56: Hoare triple {5355#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {5355#false} is VALID [2022-02-20 18:24:03,916 INFO L290 TraceCheckUtils]: 57: Hoare triple {5355#false} check_#res#1 := check_~tmp~1#1; {5355#false} is VALID [2022-02-20 18:24:03,916 INFO L290 TraceCheckUtils]: 58: Hoare triple {5355#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5355#false} is VALID [2022-02-20 18:24:03,917 INFO L290 TraceCheckUtils]: 59: Hoare triple {5355#false} assume 0 == assert_~arg#1 % 256; {5355#false} is VALID [2022-02-20 18:24:03,917 INFO L290 TraceCheckUtils]: 60: Hoare triple {5355#false} assume !false; {5355#false} is VALID [2022-02-20 18:24:03,917 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 18:24:03,917 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:03,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499775138] [2022-02-20 18:24:03,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499775138] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:03,918 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:03,918 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:03,918 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149557418] [2022-02-20 18:24:03,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:03,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2022-02-20 18:24:03,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:03,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 18:24:03,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:03,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:03,953 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:03,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:03,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:03,954 INFO L87 Difference]: Start difference. First operand 394 states and 634 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 18:24:04,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:04,199 INFO L93 Difference]: Finished difference Result 723 states and 1177 transitions. [2022-02-20 18:24:04,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:04,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2022-02-20 18:24:04,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:04,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 18:24:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2022-02-20 18:24:04,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 18:24:04,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2022-02-20 18:24:04,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 397 transitions. [2022-02-20 18:24:04,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 397 edges. 397 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:04,473 INFO L225 Difference]: With dead ends: 723 [2022-02-20 18:24:04,474 INFO L226 Difference]: Without dead ends: 541 [2022-02-20 18:24:04,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:24:04,474 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 96 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:04,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 415 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:04,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-02-20 18:24:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 539. [2022-02-20 18:24:04,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:04,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 541 states. Second operand has 539 states, 538 states have (on average 1.6152416356877324) internal successors, (869), 538 states have internal predecessors, (869), 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 18:24:04,511 INFO L74 IsIncluded]: Start isIncluded. First operand 541 states. Second operand has 539 states, 538 states have (on average 1.6152416356877324) internal successors, (869), 538 states have internal predecessors, (869), 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 18:24:04,512 INFO L87 Difference]: Start difference. First operand 541 states. Second operand has 539 states, 538 states have (on average 1.6152416356877324) internal successors, (869), 538 states have internal predecessors, (869), 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 18:24:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:04,527 INFO L93 Difference]: Finished difference Result 541 states and 870 transitions. [2022-02-20 18:24:04,527 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 870 transitions. [2022-02-20 18:24:04,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:04,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:04,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 539 states, 538 states have (on average 1.6152416356877324) internal successors, (869), 538 states have internal predecessors, (869), 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 541 states. [2022-02-20 18:24:04,530 INFO L87 Difference]: Start difference. First operand has 539 states, 538 states have (on average 1.6152416356877324) internal successors, (869), 538 states have internal predecessors, (869), 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 541 states. [2022-02-20 18:24:04,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:04,541 INFO L93 Difference]: Finished difference Result 541 states and 870 transitions. [2022-02-20 18:24:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 870 transitions. [2022-02-20 18:24:04,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:04,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:04,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:04,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.6152416356877324) internal successors, (869), 538 states have internal predecessors, (869), 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 18:24:04,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 869 transitions. [2022-02-20 18:24:04,553 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 869 transitions. Word has length 61 [2022-02-20 18:24:04,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:04,554 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 869 transitions. [2022-02-20 18:24:04,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 18:24:04,554 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 869 transitions. [2022-02-20 18:24:04,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:24:04,554 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:04,554 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:04,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:24:04,555 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:04,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:04,555 INFO L85 PathProgramCache]: Analyzing trace with hash -308214334, now seen corresponding path program 1 times [2022-02-20 18:24:04,555 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:04,555 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300417999] [2022-02-20 18:24:04,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:04,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:04,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {7877#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {7877#true} is VALID [2022-02-20 18:24:04,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {7877#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {7877#true} is VALID [2022-02-20 18:24:04,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {7877#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {7877#true} is VALID [2022-02-20 18:24:04,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {7877#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {7877#true} is VALID [2022-02-20 18:24:04,600 INFO L290 TraceCheckUtils]: 4: Hoare triple {7877#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {7877#true} is VALID [2022-02-20 18:24:04,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {7877#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {7877#true} is VALID [2022-02-20 18:24:04,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {7877#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {7877#true} is VALID [2022-02-20 18:24:04,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {7877#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {7877#true} is VALID [2022-02-20 18:24:04,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {7877#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {7877#true} is VALID [2022-02-20 18:24:04,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {7877#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {7877#true} is VALID [2022-02-20 18:24:04,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {7877#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {7877#true} is VALID [2022-02-20 18:24:04,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {7877#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {7877#true} is VALID [2022-02-20 18:24:04,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {7877#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {7877#true} is VALID [2022-02-20 18:24:04,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {7877#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {7877#true} is VALID [2022-02-20 18:24:04,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {7877#true} assume ~id1~0 != ~id2~0; {7877#true} is VALID [2022-02-20 18:24:04,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {7877#true} assume ~id1~0 != ~id3~0; {7877#true} is VALID [2022-02-20 18:24:04,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {7877#true} assume ~id2~0 != ~id3~0; {7877#true} is VALID [2022-02-20 18:24:04,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {7877#true} assume ~id1~0 >= 0; {7877#true} is VALID [2022-02-20 18:24:04,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {7877#true} assume ~id2~0 >= 0; {7877#true} is VALID [2022-02-20 18:24:04,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {7877#true} assume ~id3~0 >= 0; {7877#true} is VALID [2022-02-20 18:24:04,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {7877#true} assume 0 == ~r1~0; {7877#true} is VALID [2022-02-20 18:24:04,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {7877#true} assume 0 == ~r2~0; {7877#true} is VALID [2022-02-20 18:24:04,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {7877#true} assume 0 == ~r3~0; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {7879#(<= ~r3~0 0)} assume ~max1~0 == ~id1~0; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {7879#(<= ~r3~0 0)} assume ~max2~0 == ~id2~0; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {7879#(<= ~r3~0 0)} assume ~max3~0 == ~id3~0; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {7879#(<= ~r3~0 0)} assume 0 == ~st1~0; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {7879#(<= ~r3~0 0)} assume 0 == ~st2~0; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {7879#(<= ~r3~0 0)} assume 0 == ~st3~0; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {7879#(<= ~r3~0 0)} assume 0 == ~nl1~0; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {7879#(<= ~r3~0 0)} assume 0 == ~nl2~0; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {7879#(<= ~r3~0 0)} assume 0 == ~nl3~0; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,606 INFO L290 TraceCheckUtils]: 32: Hoare triple {7879#(<= ~r3~0 0)} assume 0 == ~mode1~0 % 256; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,606 INFO L290 TraceCheckUtils]: 33: Hoare triple {7879#(<= ~r3~0 0)} assume 0 == ~mode2~0 % 256; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,607 INFO L290 TraceCheckUtils]: 34: Hoare triple {7879#(<= ~r3~0 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,607 INFO L290 TraceCheckUtils]: 35: Hoare triple {7879#(<= ~r3~0 0)} init_#res#1 := init_~tmp___5~0#1; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,607 INFO L290 TraceCheckUtils]: 36: Hoare triple {7879#(<= ~r3~0 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {7879#(<= ~r3~0 0)} assume !(0 == main_~i2~0#1); {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,608 INFO L290 TraceCheckUtils]: 38: Hoare triple {7879#(<= ~r3~0 0)} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {7879#(<= ~r3~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,609 INFO L290 TraceCheckUtils]: 40: Hoare triple {7879#(<= ~r3~0 0)} assume !(0 != ~mode1~0 % 256); {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,609 INFO L290 TraceCheckUtils]: 41: Hoare triple {7879#(<= ~r3~0 0)} assume ~r1~0 < 2; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,610 INFO L290 TraceCheckUtils]: 42: Hoare triple {7879#(<= ~r3~0 0)} assume !(0 != ~ep12~0 % 256); {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,610 INFO L290 TraceCheckUtils]: 43: Hoare triple {7879#(<= ~r3~0 0)} assume !(0 != ~ep13~0 % 256); {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,610 INFO L290 TraceCheckUtils]: 44: Hoare triple {7879#(<= ~r3~0 0)} ~mode1~0 := 1; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,611 INFO L290 TraceCheckUtils]: 45: Hoare triple {7879#(<= ~r3~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,611 INFO L290 TraceCheckUtils]: 46: Hoare triple {7879#(<= ~r3~0 0)} assume !(0 != ~mode2~0 % 256); {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,611 INFO L290 TraceCheckUtils]: 47: Hoare triple {7879#(<= ~r3~0 0)} assume ~r2~0 < 2; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,612 INFO L290 TraceCheckUtils]: 48: Hoare triple {7879#(<= ~r3~0 0)} assume !(0 != ~ep21~0 % 256); {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,612 INFO L290 TraceCheckUtils]: 49: Hoare triple {7879#(<= ~r3~0 0)} assume !(0 != ~ep23~0 % 256); {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,612 INFO L290 TraceCheckUtils]: 50: Hoare triple {7879#(<= ~r3~0 0)} ~mode2~0 := 1; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,613 INFO L290 TraceCheckUtils]: 51: Hoare triple {7879#(<= ~r3~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,613 INFO L290 TraceCheckUtils]: 52: Hoare triple {7879#(<= ~r3~0 0)} assume !(0 != ~mode3~0 % 256); {7879#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:04,614 INFO L290 TraceCheckUtils]: 53: Hoare triple {7879#(<= ~r3~0 0)} assume !(~r3~0 < 2); {7878#false} is VALID [2022-02-20 18:24:04,614 INFO L290 TraceCheckUtils]: 54: Hoare triple {7878#false} ~mode3~0 := 1; {7878#false} is VALID [2022-02-20 18:24:04,614 INFO L290 TraceCheckUtils]: 55: Hoare triple {7878#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {7878#false} is VALID [2022-02-20 18:24:04,614 INFO L290 TraceCheckUtils]: 56: Hoare triple {7878#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {7878#false} is VALID [2022-02-20 18:24:04,614 INFO L290 TraceCheckUtils]: 57: Hoare triple {7878#false} check_#res#1 := check_~tmp~1#1; {7878#false} is VALID [2022-02-20 18:24:04,614 INFO L290 TraceCheckUtils]: 58: Hoare triple {7878#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {7878#false} is VALID [2022-02-20 18:24:04,615 INFO L290 TraceCheckUtils]: 59: Hoare triple {7878#false} assume 0 == assert_~arg#1 % 256; {7878#false} is VALID [2022-02-20 18:24:04,615 INFO L290 TraceCheckUtils]: 60: Hoare triple {7878#false} assume !false; {7878#false} is VALID [2022-02-20 18:24:04,615 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 18:24:04,615 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:04,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300417999] [2022-02-20 18:24:04,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300417999] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:04,616 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:04,616 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:04,616 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456952987] [2022-02-20 18:24:04,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:04,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2022-02-20 18:24:04,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:04,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 18:24:04,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:04,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:04,649 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:04,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:04,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:04,650 INFO L87 Difference]: Start difference. First operand 539 states and 869 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 18:24:04,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:04,961 INFO L93 Difference]: Finished difference Result 1428 states and 2320 transitions. [2022-02-20 18:24:04,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:04,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2022-02-20 18:24:04,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:04,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 18:24:04,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2022-02-20 18:24:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 18:24:04,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2022-02-20 18:24:04,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 410 transitions. [2022-02-20 18:24:05,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 410 edges. 410 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:05,221 INFO L225 Difference]: With dead ends: 1428 [2022-02-20 18:24:05,221 INFO L226 Difference]: Without dead ends: 952 [2022-02-20 18:24:05,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:24:05,222 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 89 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:05,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 358 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:05,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2022-02-20 18:24:05,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 950. [2022-02-20 18:24:05,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:05,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 952 states. Second operand has 950 states, 949 states have (on average 1.608008429926238) internal successors, (1526), 949 states have internal predecessors, (1526), 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 18:24:05,310 INFO L74 IsIncluded]: Start isIncluded. First operand 952 states. Second operand has 950 states, 949 states have (on average 1.608008429926238) internal successors, (1526), 949 states have internal predecessors, (1526), 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 18:24:05,311 INFO L87 Difference]: Start difference. First operand 952 states. Second operand has 950 states, 949 states have (on average 1.608008429926238) internal successors, (1526), 949 states have internal predecessors, (1526), 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 18:24:05,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:05,339 INFO L93 Difference]: Finished difference Result 952 states and 1527 transitions. [2022-02-20 18:24:05,339 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1527 transitions. [2022-02-20 18:24:05,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:05,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:05,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 950 states, 949 states have (on average 1.608008429926238) internal successors, (1526), 949 states have internal predecessors, (1526), 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 952 states. [2022-02-20 18:24:05,343 INFO L87 Difference]: Start difference. First operand has 950 states, 949 states have (on average 1.608008429926238) internal successors, (1526), 949 states have internal predecessors, (1526), 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 952 states. [2022-02-20 18:24:05,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:05,370 INFO L93 Difference]: Finished difference Result 952 states and 1527 transitions. [2022-02-20 18:24:05,378 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1527 transitions. [2022-02-20 18:24:05,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:05,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:05,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:05,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 1.608008429926238) internal successors, (1526), 949 states have internal predecessors, (1526), 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 18:24:05,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1526 transitions. [2022-02-20 18:24:05,414 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1526 transitions. Word has length 61 [2022-02-20 18:24:05,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:05,414 INFO L470 AbstractCegarLoop]: Abstraction has 950 states and 1526 transitions. [2022-02-20 18:24:05,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 18:24:05,414 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1526 transitions. [2022-02-20 18:24:05,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:24:05,415 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:05,415 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:05,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:24:05,415 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:05,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:05,416 INFO L85 PathProgramCache]: Analyzing trace with hash 349619889, now seen corresponding path program 1 times [2022-02-20 18:24:05,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:05,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171747252] [2022-02-20 18:24:05,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:05,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:05,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {12530#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {12530#true} is VALID [2022-02-20 18:24:05,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {12530#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {12530#true} is VALID [2022-02-20 18:24:05,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {12530#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {12530#true} is VALID [2022-02-20 18:24:05,466 INFO L290 TraceCheckUtils]: 3: Hoare triple {12530#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {12530#true} is VALID [2022-02-20 18:24:05,466 INFO L290 TraceCheckUtils]: 4: Hoare triple {12530#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {12530#true} is VALID [2022-02-20 18:24:05,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {12530#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {12530#true} is VALID [2022-02-20 18:24:05,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {12530#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {12530#true} is VALID [2022-02-20 18:24:05,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {12530#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {12530#true} is VALID [2022-02-20 18:24:05,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {12530#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {12530#true} is VALID [2022-02-20 18:24:05,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {12530#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {12530#true} is VALID [2022-02-20 18:24:05,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {12530#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {12530#true} is VALID [2022-02-20 18:24:05,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {12530#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {12530#true} is VALID [2022-02-20 18:24:05,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {12530#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {12530#true} is VALID [2022-02-20 18:24:05,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {12530#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {12530#true} is VALID [2022-02-20 18:24:05,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {12530#true} assume ~id1~0 != ~id2~0; {12530#true} is VALID [2022-02-20 18:24:05,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {12530#true} assume ~id1~0 != ~id3~0; {12530#true} is VALID [2022-02-20 18:24:05,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {12530#true} assume ~id2~0 != ~id3~0; {12530#true} is VALID [2022-02-20 18:24:05,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {12530#true} assume ~id1~0 >= 0; {12530#true} is VALID [2022-02-20 18:24:05,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {12530#true} assume ~id2~0 >= 0; {12530#true} is VALID [2022-02-20 18:24:05,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {12530#true} assume ~id3~0 >= 0; {12530#true} is VALID [2022-02-20 18:24:05,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {12530#true} assume 0 == ~r1~0; {12530#true} is VALID [2022-02-20 18:24:05,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {12530#true} assume 0 == ~r2~0; {12530#true} is VALID [2022-02-20 18:24:05,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {12530#true} assume 0 == ~r3~0; {12530#true} is VALID [2022-02-20 18:24:05,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {12530#true} assume ~max1~0 == ~id1~0; {12530#true} is VALID [2022-02-20 18:24:05,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {12530#true} assume ~max2~0 == ~id2~0; {12530#true} is VALID [2022-02-20 18:24:05,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {12530#true} assume ~max3~0 == ~id3~0; {12530#true} is VALID [2022-02-20 18:24:05,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {12530#true} assume 0 == ~st1~0; {12532#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:05,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {12532#(<= ~st1~0 0)} assume 0 == ~st2~0; {12533#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {12533#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,470 INFO L290 TraceCheckUtils]: 29: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,471 INFO L290 TraceCheckUtils]: 32: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,473 INFO L290 TraceCheckUtils]: 36: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,473 INFO L290 TraceCheckUtils]: 37: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~i2~0#1); {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,475 INFO L290 TraceCheckUtils]: 38: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,476 INFO L290 TraceCheckUtils]: 39: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,476 INFO L290 TraceCheckUtils]: 40: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,476 INFO L290 TraceCheckUtils]: 41: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 2; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,476 INFO L290 TraceCheckUtils]: 42: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,477 INFO L290 TraceCheckUtils]: 43: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,477 INFO L290 TraceCheckUtils]: 44: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,477 INFO L290 TraceCheckUtils]: 45: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,478 INFO L290 TraceCheckUtils]: 46: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,478 INFO L290 TraceCheckUtils]: 47: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 < 2; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,478 INFO L290 TraceCheckUtils]: 48: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,479 INFO L290 TraceCheckUtils]: 49: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,479 INFO L290 TraceCheckUtils]: 50: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,479 INFO L290 TraceCheckUtils]: 51: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,479 INFO L290 TraceCheckUtils]: 52: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,480 INFO L290 TraceCheckUtils]: 53: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 < 2; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,480 INFO L290 TraceCheckUtils]: 54: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,480 INFO L290 TraceCheckUtils]: 55: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,481 INFO L290 TraceCheckUtils]: 56: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,481 INFO L290 TraceCheckUtils]: 57: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:05,481 INFO L290 TraceCheckUtils]: 58: Hoare triple {12534#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {12531#false} is VALID [2022-02-20 18:24:05,481 INFO L290 TraceCheckUtils]: 59: Hoare triple {12531#false} check_#res#1 := check_~tmp~1#1; {12531#false} is VALID [2022-02-20 18:24:05,482 INFO L290 TraceCheckUtils]: 60: Hoare triple {12531#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {12531#false} is VALID [2022-02-20 18:24:05,482 INFO L290 TraceCheckUtils]: 61: Hoare triple {12531#false} assume 0 == assert_~arg#1 % 256; {12531#false} is VALID [2022-02-20 18:24:05,482 INFO L290 TraceCheckUtils]: 62: Hoare triple {12531#false} assume !false; {12531#false} is VALID [2022-02-20 18:24:05,482 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 18:24:05,482 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:05,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171747252] [2022-02-20 18:24:05,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171747252] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:05,483 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:05,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:24:05,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114235746] [2022-02-20 18:24:05,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:05,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 63 [2022-02-20 18:24:05,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:05,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 18:24:05,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:05,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:24:05,517 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:05,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:24:05,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:24:05,518 INFO L87 Difference]: Start difference. First operand 950 states and 1526 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 18:24:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:07,378 INFO L93 Difference]: Finished difference Result 4661 states and 7632 transitions. [2022-02-20 18:24:07,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:24:07,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 63 [2022-02-20 18:24:07,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 18:24:07,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 895 transitions. [2022-02-20 18:24:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 18:24:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 895 transitions. [2022-02-20 18:24:07,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 895 transitions. [2022-02-20 18:24:07,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 895 edges. 895 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:08,502 INFO L225 Difference]: With dead ends: 4661 [2022-02-20 18:24:08,502 INFO L226 Difference]: Without dead ends: 3774 [2022-02-20 18:24:08,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:24:08,504 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 865 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:08,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [865 Valid, 906 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:24:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3774 states. [2022-02-20 18:24:08,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3774 to 1770. [2022-02-20 18:24:08,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:08,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3774 states. Second operand has 1770 states, 1769 states have (on average 1.607687959299039) internal successors, (2844), 1769 states have internal predecessors, (2844), 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 18:24:08,962 INFO L74 IsIncluded]: Start isIncluded. First operand 3774 states. Second operand has 1770 states, 1769 states have (on average 1.607687959299039) internal successors, (2844), 1769 states have internal predecessors, (2844), 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 18:24:08,964 INFO L87 Difference]: Start difference. First operand 3774 states. Second operand has 1770 states, 1769 states have (on average 1.607687959299039) internal successors, (2844), 1769 states have internal predecessors, (2844), 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 18:24:09,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:09,405 INFO L93 Difference]: Finished difference Result 3774 states and 6117 transitions. [2022-02-20 18:24:09,405 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 6117 transitions. [2022-02-20 18:24:09,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:09,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:09,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 1770 states, 1769 states have (on average 1.607687959299039) internal successors, (2844), 1769 states have internal predecessors, (2844), 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 3774 states. [2022-02-20 18:24:09,415 INFO L87 Difference]: Start difference. First operand has 1770 states, 1769 states have (on average 1.607687959299039) internal successors, (2844), 1769 states have internal predecessors, (2844), 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 3774 states. [2022-02-20 18:24:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:09,899 INFO L93 Difference]: Finished difference Result 3774 states and 6117 transitions. [2022-02-20 18:24:09,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 6117 transitions. [2022-02-20 18:24:09,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:09,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:09,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:09,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1769 states have (on average 1.607687959299039) internal successors, (2844), 1769 states have internal predecessors, (2844), 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 18:24:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2844 transitions. [2022-02-20 18:24:10,030 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2844 transitions. Word has length 63 [2022-02-20 18:24:10,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:10,031 INFO L470 AbstractCegarLoop]: Abstraction has 1770 states and 2844 transitions. [2022-02-20 18:24:10,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 18:24:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2844 transitions. [2022-02-20 18:24:10,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:24:10,032 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:10,032 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:10,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:24:10,032 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:10,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:10,033 INFO L85 PathProgramCache]: Analyzing trace with hash 325449286, now seen corresponding path program 1 times [2022-02-20 18:24:10,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:10,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177926861] [2022-02-20 18:24:10,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:10,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:10,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {27517#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {27517#true} is VALID [2022-02-20 18:24:10,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {27517#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {27517#true} is VALID [2022-02-20 18:24:10,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {27517#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {27517#true} is VALID [2022-02-20 18:24:10,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {27517#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {27517#true} is VALID [2022-02-20 18:24:10,082 INFO L290 TraceCheckUtils]: 4: Hoare triple {27517#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {27517#true} is VALID [2022-02-20 18:24:10,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {27517#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {27517#true} is VALID [2022-02-20 18:24:10,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {27517#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {27517#true} is VALID [2022-02-20 18:24:10,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {27517#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {27517#true} is VALID [2022-02-20 18:24:10,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {27517#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {27517#true} is VALID [2022-02-20 18:24:10,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {27517#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {27517#true} is VALID [2022-02-20 18:24:10,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {27517#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {27517#true} is VALID [2022-02-20 18:24:10,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {27517#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {27517#true} is VALID [2022-02-20 18:24:10,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {27517#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {27517#true} is VALID [2022-02-20 18:24:10,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {27517#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {27517#true} is VALID [2022-02-20 18:24:10,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {27517#true} assume ~id1~0 != ~id2~0; {27517#true} is VALID [2022-02-20 18:24:10,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {27517#true} assume ~id1~0 != ~id3~0; {27517#true} is VALID [2022-02-20 18:24:10,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {27517#true} assume ~id2~0 != ~id3~0; {27517#true} is VALID [2022-02-20 18:24:10,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {27517#true} assume ~id1~0 >= 0; {27517#true} is VALID [2022-02-20 18:24:10,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {27517#true} assume ~id2~0 >= 0; {27517#true} is VALID [2022-02-20 18:24:10,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {27517#true} assume ~id3~0 >= 0; {27517#true} is VALID [2022-02-20 18:24:10,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {27517#true} assume 0 == ~r1~0; {27517#true} is VALID [2022-02-20 18:24:10,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {27517#true} assume 0 == ~r2~0; {27517#true} is VALID [2022-02-20 18:24:10,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {27517#true} assume 0 == ~r3~0; {27517#true} is VALID [2022-02-20 18:24:10,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {27517#true} assume ~max1~0 == ~id1~0; {27517#true} is VALID [2022-02-20 18:24:10,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {27517#true} assume ~max2~0 == ~id2~0; {27517#true} is VALID [2022-02-20 18:24:10,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {27517#true} assume ~max3~0 == ~id3~0; {27517#true} is VALID [2022-02-20 18:24:10,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {27517#true} assume 0 == ~st1~0; {27519#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:10,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {27519#(<= ~st1~0 0)} assume 0 == ~st2~0; {27519#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:10,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {27519#(<= ~st1~0 0)} assume 0 == ~st3~0; {27519#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:10,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {27519#(<= ~st1~0 0)} assume 0 == ~nl1~0; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,087 INFO L290 TraceCheckUtils]: 35: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == main_~i2~0#1); {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,088 INFO L290 TraceCheckUtils]: 38: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,088 INFO L290 TraceCheckUtils]: 39: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,089 INFO L290 TraceCheckUtils]: 40: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,089 INFO L290 TraceCheckUtils]: 41: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 < 2; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,089 INFO L290 TraceCheckUtils]: 42: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,090 INFO L290 TraceCheckUtils]: 43: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,090 INFO L290 TraceCheckUtils]: 44: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,091 INFO L290 TraceCheckUtils]: 46: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,091 INFO L290 TraceCheckUtils]: 47: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 < 2; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,092 INFO L290 TraceCheckUtils]: 48: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,092 INFO L290 TraceCheckUtils]: 49: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,092 INFO L290 TraceCheckUtils]: 50: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,093 INFO L290 TraceCheckUtils]: 51: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,093 INFO L290 TraceCheckUtils]: 52: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,093 INFO L290 TraceCheckUtils]: 53: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 < 2; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,094 INFO L290 TraceCheckUtils]: 54: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,094 INFO L290 TraceCheckUtils]: 55: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,094 INFO L290 TraceCheckUtils]: 56: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,095 INFO L290 TraceCheckUtils]: 57: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,095 INFO L290 TraceCheckUtils]: 58: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {27520#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:10,096 INFO L290 TraceCheckUtils]: 59: Hoare triple {27520#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);check_~tmp~1#1 := 0; {27518#false} is VALID [2022-02-20 18:24:10,096 INFO L290 TraceCheckUtils]: 60: Hoare triple {27518#false} check_#res#1 := check_~tmp~1#1; {27518#false} is VALID [2022-02-20 18:24:10,096 INFO L290 TraceCheckUtils]: 61: Hoare triple {27518#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {27518#false} is VALID [2022-02-20 18:24:10,096 INFO L290 TraceCheckUtils]: 62: Hoare triple {27518#false} assume 0 == assert_~arg#1 % 256; {27518#false} is VALID [2022-02-20 18:24:10,096 INFO L290 TraceCheckUtils]: 63: Hoare triple {27518#false} assume !false; {27518#false} is VALID [2022-02-20 18:24:10,097 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 18:24:10,097 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:10,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177926861] [2022-02-20 18:24:10,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177926861] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:10,097 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:10,098 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:24:10,098 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125330570] [2022-02-20 18:24:10,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:10,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2022-02-20 18:24:10,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:10,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 18:24:10,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:10,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:24:10,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:10,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:24:10,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:24:10,141 INFO L87 Difference]: Start difference. First operand 1770 states and 2844 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 18:24:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:12,687 INFO L93 Difference]: Finished difference Result 5679 states and 9231 transitions. [2022-02-20 18:24:12,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:24:12,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2022-02-20 18:24:12,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 18:24:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2022-02-20 18:24:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 18:24:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2022-02-20 18:24:12,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 541 transitions. [2022-02-20 18:24:13,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 541 edges. 541 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:13,548 INFO L225 Difference]: With dead ends: 5679 [2022-02-20 18:24:13,549 INFO L226 Difference]: Without dead ends: 3972 [2022-02-20 18:24:13,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:24:13,552 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 338 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:13,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 603 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:13,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2022-02-20 18:24:14,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 2858. [2022-02-20 18:24:14,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:14,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3972 states. Second operand has 2858 states, 2857 states have (on average 1.6107805390269514) internal successors, (4602), 2857 states have internal predecessors, (4602), 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 18:24:14,494 INFO L74 IsIncluded]: Start isIncluded. First operand 3972 states. Second operand has 2858 states, 2857 states have (on average 1.6107805390269514) internal successors, (4602), 2857 states have internal predecessors, (4602), 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 18:24:14,496 INFO L87 Difference]: Start difference. First operand 3972 states. Second operand has 2858 states, 2857 states have (on average 1.6107805390269514) internal successors, (4602), 2857 states have internal predecessors, (4602), 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 18:24:14,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:14,897 INFO L93 Difference]: Finished difference Result 3972 states and 6439 transitions. [2022-02-20 18:24:14,897 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 6439 transitions. [2022-02-20 18:24:14,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:14,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:14,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 2858 states, 2857 states have (on average 1.6107805390269514) internal successors, (4602), 2857 states have internal predecessors, (4602), 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 3972 states. [2022-02-20 18:24:14,925 INFO L87 Difference]: Start difference. First operand has 2858 states, 2857 states have (on average 1.6107805390269514) internal successors, (4602), 2857 states have internal predecessors, (4602), 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 3972 states. [2022-02-20 18:24:15,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:15,349 INFO L93 Difference]: Finished difference Result 3972 states and 6439 transitions. [2022-02-20 18:24:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 6439 transitions. [2022-02-20 18:24:15,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:15,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:15,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:15,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2858 states, 2857 states have (on average 1.6107805390269514) internal successors, (4602), 2857 states have internal predecessors, (4602), 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 18:24:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 4602 transitions. [2022-02-20 18:24:15,612 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 4602 transitions. Word has length 64 [2022-02-20 18:24:15,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:15,612 INFO L470 AbstractCegarLoop]: Abstraction has 2858 states and 4602 transitions. [2022-02-20 18:24:15,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 18:24:15,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 4602 transitions. [2022-02-20 18:24:15,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:24:15,613 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:15,613 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:15,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:24:15,614 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:15,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:15,614 INFO L85 PathProgramCache]: Analyzing trace with hash 905685231, now seen corresponding path program 1 times [2022-02-20 18:24:15,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:15,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515741818] [2022-02-20 18:24:15,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:15,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:15,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {45336#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {45336#true} is VALID [2022-02-20 18:24:15,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {45336#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {45336#true} is VALID [2022-02-20 18:24:15,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {45336#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {45336#true} is VALID [2022-02-20 18:24:15,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {45336#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {45336#true} is VALID [2022-02-20 18:24:15,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {45336#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {45336#true} is VALID [2022-02-20 18:24:15,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {45336#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {45336#true} is VALID [2022-02-20 18:24:15,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {45336#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {45336#true} is VALID [2022-02-20 18:24:15,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {45336#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {45336#true} is VALID [2022-02-20 18:24:15,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {45336#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {45336#true} is VALID [2022-02-20 18:24:15,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {45336#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {45336#true} is VALID [2022-02-20 18:24:15,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {45336#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {45336#true} is VALID [2022-02-20 18:24:15,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {45336#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {45336#true} is VALID [2022-02-20 18:24:15,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {45336#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {45336#true} is VALID [2022-02-20 18:24:15,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {45336#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {45336#true} is VALID [2022-02-20 18:24:15,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {45336#true} assume ~id1~0 != ~id2~0; {45336#true} is VALID [2022-02-20 18:24:15,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {45336#true} assume ~id1~0 != ~id3~0; {45336#true} is VALID [2022-02-20 18:24:15,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {45336#true} assume ~id2~0 != ~id3~0; {45336#true} is VALID [2022-02-20 18:24:15,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {45336#true} assume ~id1~0 >= 0; {45336#true} is VALID [2022-02-20 18:24:15,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {45336#true} assume ~id2~0 >= 0; {45336#true} is VALID [2022-02-20 18:24:15,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {45336#true} assume ~id3~0 >= 0; {45336#true} is VALID [2022-02-20 18:24:15,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {45336#true} assume 0 == ~r1~0; {45336#true} is VALID [2022-02-20 18:24:15,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {45336#true} assume 0 == ~r2~0; {45336#true} is VALID [2022-02-20 18:24:15,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {45336#true} assume 0 == ~r3~0; {45336#true} is VALID [2022-02-20 18:24:15,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {45336#true} assume ~max1~0 == ~id1~0; {45336#true} is VALID [2022-02-20 18:24:15,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {45336#true} assume ~max2~0 == ~id2~0; {45336#true} is VALID [2022-02-20 18:24:15,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {45336#true} assume ~max3~0 == ~id3~0; {45336#true} is VALID [2022-02-20 18:24:15,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {45336#true} assume 0 == ~st1~0; {45336#true} is VALID [2022-02-20 18:24:15,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {45336#true} assume 0 == ~st2~0; {45336#true} is VALID [2022-02-20 18:24:15,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {45336#true} assume 0 == ~st3~0; {45336#true} is VALID [2022-02-20 18:24:15,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {45336#true} assume 0 == ~nl1~0; {45336#true} is VALID [2022-02-20 18:24:15,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {45336#true} assume 0 == ~nl2~0; {45336#true} is VALID [2022-02-20 18:24:15,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {45336#true} assume 0 == ~nl3~0; {45336#true} is VALID [2022-02-20 18:24:15,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {45336#true} assume 0 == ~mode1~0 % 256; {45336#true} is VALID [2022-02-20 18:24:15,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {45336#true} assume 0 == ~mode2~0 % 256; {45336#true} is VALID [2022-02-20 18:24:15,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {45336#true} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:15,679 INFO L290 TraceCheckUtils]: 35: Hoare triple {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:15,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:15,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == main_~i2~0#1); {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:15,680 INFO L290 TraceCheckUtils]: 38: Hoare triple {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:15,680 INFO L290 TraceCheckUtils]: 39: Hoare triple {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:15,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:15,681 INFO L290 TraceCheckUtils]: 41: Hoare triple {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 < 2; {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:15,681 INFO L290 TraceCheckUtils]: 42: Hoare triple {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep12~0 % 256); {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:15,682 INFO L290 TraceCheckUtils]: 43: Hoare triple {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep13~0 % 256); {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:15,682 INFO L290 TraceCheckUtils]: 44: Hoare triple {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:15,682 INFO L290 TraceCheckUtils]: 45: Hoare triple {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:15,683 INFO L290 TraceCheckUtils]: 46: Hoare triple {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:15,683 INFO L290 TraceCheckUtils]: 47: Hoare triple {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 < 2; {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:15,683 INFO L290 TraceCheckUtils]: 48: Hoare triple {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep21~0 % 256); {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:15,684 INFO L290 TraceCheckUtils]: 49: Hoare triple {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep23~0 % 256); {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:15,684 INFO L290 TraceCheckUtils]: 50: Hoare triple {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:15,684 INFO L290 TraceCheckUtils]: 51: Hoare triple {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:15,685 INFO L290 TraceCheckUtils]: 52: Hoare triple {45338#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {45337#false} is VALID [2022-02-20 18:24:15,685 INFO L290 TraceCheckUtils]: 53: Hoare triple {45337#false} assume !(0 != ~ep13~0 % 256); {45337#false} is VALID [2022-02-20 18:24:15,685 INFO L290 TraceCheckUtils]: 54: Hoare triple {45337#false} assume !(0 != ~ep23~0 % 256); {45337#false} is VALID [2022-02-20 18:24:15,685 INFO L290 TraceCheckUtils]: 55: Hoare triple {45337#false} assume 2 == ~r3~0; {45337#false} is VALID [2022-02-20 18:24:15,686 INFO L290 TraceCheckUtils]: 56: Hoare triple {45337#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {45337#false} is VALID [2022-02-20 18:24:15,686 INFO L290 TraceCheckUtils]: 57: Hoare triple {45337#false} ~mode3~0 := 0; {45337#false} is VALID [2022-02-20 18:24:15,686 INFO L290 TraceCheckUtils]: 58: Hoare triple {45337#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {45337#false} is VALID [2022-02-20 18:24:15,686 INFO L290 TraceCheckUtils]: 59: Hoare triple {45337#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {45337#false} is VALID [2022-02-20 18:24:15,686 INFO L290 TraceCheckUtils]: 60: Hoare triple {45337#false} check_#res#1 := check_~tmp~1#1; {45337#false} is VALID [2022-02-20 18:24:15,686 INFO L290 TraceCheckUtils]: 61: Hoare triple {45337#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {45337#false} is VALID [2022-02-20 18:24:15,686 INFO L290 TraceCheckUtils]: 62: Hoare triple {45337#false} assume 0 == assert_~arg#1 % 256; {45337#false} is VALID [2022-02-20 18:24:15,686 INFO L290 TraceCheckUtils]: 63: Hoare triple {45337#false} assume !false; {45337#false} is VALID [2022-02-20 18:24:15,687 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 18:24:15,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:15,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515741818] [2022-02-20 18:24:15,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515741818] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:15,687 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:15,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:15,688 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561545893] [2022-02-20 18:24:15,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:15,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2022-02-20 18:24:15,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:15,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 18:24:15,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:15,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:15,733 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:15,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:15,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:15,734 INFO L87 Difference]: Start difference. First operand 2858 states and 4602 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 18:24:18,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:18,077 INFO L93 Difference]: Finished difference Result 5558 states and 8983 transitions. [2022-02-20 18:24:18,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:18,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2022-02-20 18:24:18,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 18:24:18,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2022-02-20 18:24:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 18:24:18,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2022-02-20 18:24:18,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 397 transitions. [2022-02-20 18:24:18,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 397 edges. 397 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:18,870 INFO L225 Difference]: With dead ends: 5558 [2022-02-20 18:24:18,871 INFO L226 Difference]: Without dead ends: 3988 [2022-02-20 18:24:18,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:24:18,873 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 90 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:18,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 407 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:18,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3988 states. [2022-02-20 18:24:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3988 to 3986. [2022-02-20 18:24:19,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:19,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3988 states. Second operand has 3986 states, 3985 states have (on average 1.6005018820577164) internal successors, (6378), 3985 states have internal predecessors, (6378), 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 18:24:19,985 INFO L74 IsIncluded]: Start isIncluded. First operand 3988 states. Second operand has 3986 states, 3985 states have (on average 1.6005018820577164) internal successors, (6378), 3985 states have internal predecessors, (6378), 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 18:24:19,988 INFO L87 Difference]: Start difference. First operand 3988 states. Second operand has 3986 states, 3985 states have (on average 1.6005018820577164) internal successors, (6378), 3985 states have internal predecessors, (6378), 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 18:24:20,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:20,503 INFO L93 Difference]: Finished difference Result 3988 states and 6379 transitions. [2022-02-20 18:24:20,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3988 states and 6379 transitions. [2022-02-20 18:24:20,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:20,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:20,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 3986 states, 3985 states have (on average 1.6005018820577164) internal successors, (6378), 3985 states have internal predecessors, (6378), 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 3988 states. [2022-02-20 18:24:20,514 INFO L87 Difference]: Start difference. First operand has 3986 states, 3985 states have (on average 1.6005018820577164) internal successors, (6378), 3985 states have internal predecessors, (6378), 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 3988 states. [2022-02-20 18:24:20,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:20,924 INFO L93 Difference]: Finished difference Result 3988 states and 6379 transitions. [2022-02-20 18:24:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 3988 states and 6379 transitions. [2022-02-20 18:24:20,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:20,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:20,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:20,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3986 states, 3985 states have (on average 1.6005018820577164) internal successors, (6378), 3985 states have internal predecessors, (6378), 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 18:24:21,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3986 states to 3986 states and 6378 transitions. [2022-02-20 18:24:21,437 INFO L78 Accepts]: Start accepts. Automaton has 3986 states and 6378 transitions. Word has length 64 [2022-02-20 18:24:21,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:21,438 INFO L470 AbstractCegarLoop]: Abstraction has 3986 states and 6378 transitions. [2022-02-20 18:24:21,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 18:24:21,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3986 states and 6378 transitions. [2022-02-20 18:24:21,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:24:21,438 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:21,438 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:21,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:24:21,439 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:21,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:21,439 INFO L85 PathProgramCache]: Analyzing trace with hash -254835064, now seen corresponding path program 1 times [2022-02-20 18:24:21,439 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:21,439 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522713255] [2022-02-20 18:24:21,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:21,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:21,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {64444#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {64444#true} is VALID [2022-02-20 18:24:21,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {64444#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {64444#true} is VALID [2022-02-20 18:24:21,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {64444#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {64444#true} is VALID [2022-02-20 18:24:21,476 INFO L290 TraceCheckUtils]: 3: Hoare triple {64444#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {64444#true} is VALID [2022-02-20 18:24:21,476 INFO L290 TraceCheckUtils]: 4: Hoare triple {64444#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {64444#true} is VALID [2022-02-20 18:24:21,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {64444#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {64444#true} is VALID [2022-02-20 18:24:21,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {64444#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {64444#true} is VALID [2022-02-20 18:24:21,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {64444#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {64444#true} is VALID [2022-02-20 18:24:21,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {64444#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {64444#true} is VALID [2022-02-20 18:24:21,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {64444#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {64444#true} is VALID [2022-02-20 18:24:21,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {64444#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {64444#true} is VALID [2022-02-20 18:24:21,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {64444#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {64444#true} is VALID [2022-02-20 18:24:21,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {64444#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {64444#true} is VALID [2022-02-20 18:24:21,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {64444#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {64444#true} is VALID [2022-02-20 18:24:21,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {64444#true} assume ~id1~0 != ~id2~0; {64444#true} is VALID [2022-02-20 18:24:21,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {64444#true} assume ~id1~0 != ~id3~0; {64444#true} is VALID [2022-02-20 18:24:21,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {64444#true} assume ~id2~0 != ~id3~0; {64444#true} is VALID [2022-02-20 18:24:21,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {64444#true} assume ~id1~0 >= 0; {64444#true} is VALID [2022-02-20 18:24:21,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {64444#true} assume ~id2~0 >= 0; {64444#true} is VALID [2022-02-20 18:24:21,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {64444#true} assume ~id3~0 >= 0; {64444#true} is VALID [2022-02-20 18:24:21,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {64444#true} assume 0 == ~r1~0; {64444#true} is VALID [2022-02-20 18:24:21,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {64444#true} assume 0 == ~r2~0; {64444#true} is VALID [2022-02-20 18:24:21,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {64444#true} assume 0 == ~r3~0; {64444#true} is VALID [2022-02-20 18:24:21,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {64444#true} assume ~max1~0 == ~id1~0; {64444#true} is VALID [2022-02-20 18:24:21,479 INFO L290 TraceCheckUtils]: 24: Hoare triple {64444#true} assume ~max2~0 == ~id2~0; {64444#true} is VALID [2022-02-20 18:24:21,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {64444#true} assume ~max3~0 == ~id3~0; {64444#true} is VALID [2022-02-20 18:24:21,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {64444#true} assume 0 == ~st1~0; {64444#true} is VALID [2022-02-20 18:24:21,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {64444#true} assume 0 == ~st2~0; {64446#(<= ~st2~0 0)} is VALID [2022-02-20 18:24:21,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {64446#(<= ~st2~0 0)} assume 0 == ~st3~0; {64446#(<= ~st2~0 0)} is VALID [2022-02-20 18:24:21,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {64446#(<= ~st2~0 0)} assume 0 == ~nl1~0; {64446#(<= ~st2~0 0)} is VALID [2022-02-20 18:24:21,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {64446#(<= ~st2~0 0)} assume 0 == ~nl2~0; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,481 INFO L290 TraceCheckUtils]: 31: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,481 INFO L290 TraceCheckUtils]: 32: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == main_~i2~0#1); {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,483 INFO L290 TraceCheckUtils]: 38: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,483 INFO L290 TraceCheckUtils]: 39: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode1~0 % 256); {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,484 INFO L290 TraceCheckUtils]: 41: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 < 2; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,484 INFO L290 TraceCheckUtils]: 42: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep12~0 % 256); {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,485 INFO L290 TraceCheckUtils]: 43: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep13~0 % 256); {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,485 INFO L290 TraceCheckUtils]: 44: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,485 INFO L290 TraceCheckUtils]: 45: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,485 INFO L290 TraceCheckUtils]: 46: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode2~0 % 256); {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,486 INFO L290 TraceCheckUtils]: 47: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 < 2; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,486 INFO L290 TraceCheckUtils]: 48: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep21~0 % 256); {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,486 INFO L290 TraceCheckUtils]: 49: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep23~0 % 256); {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,487 INFO L290 TraceCheckUtils]: 50: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,487 INFO L290 TraceCheckUtils]: 51: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,487 INFO L290 TraceCheckUtils]: 52: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode3~0 % 256); {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 < 2; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,488 INFO L290 TraceCheckUtils]: 54: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep31~0 % 256); {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,488 INFO L290 TraceCheckUtils]: 55: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep32~0 % 256); {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,489 INFO L290 TraceCheckUtils]: 56: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,489 INFO L290 TraceCheckUtils]: 57: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,489 INFO L290 TraceCheckUtils]: 58: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,490 INFO L290 TraceCheckUtils]: 59: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {64447#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:21,490 INFO L290 TraceCheckUtils]: 60: Hoare triple {64447#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);check_~tmp~1#1 := 0; {64445#false} is VALID [2022-02-20 18:24:21,490 INFO L290 TraceCheckUtils]: 61: Hoare triple {64445#false} check_#res#1 := check_~tmp~1#1; {64445#false} is VALID [2022-02-20 18:24:21,490 INFO L290 TraceCheckUtils]: 62: Hoare triple {64445#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {64445#false} is VALID [2022-02-20 18:24:21,490 INFO L290 TraceCheckUtils]: 63: Hoare triple {64445#false} assume 0 == assert_~arg#1 % 256; {64445#false} is VALID [2022-02-20 18:24:21,490 INFO L290 TraceCheckUtils]: 64: Hoare triple {64445#false} assume !false; {64445#false} is VALID [2022-02-20 18:24:21,491 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 18:24:21,491 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:21,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522713255] [2022-02-20 18:24:21,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522713255] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:21,491 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:21,491 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:24:21,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456472531] [2022-02-20 18:24:21,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:21,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2022-02-20 18:24:21,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:21,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 18:24:21,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:21,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:24:21,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:21,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:24:21,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:24:21,532 INFO L87 Difference]: Start difference. First operand 3986 states and 6378 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 18:24:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:29,690 INFO L93 Difference]: Finished difference Result 12749 states and 20489 transitions. [2022-02-20 18:24:29,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:24:29,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2022-02-20 18:24:29,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 18:24:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2022-02-20 18:24:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 18:24:29,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2022-02-20 18:24:29,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 541 transitions. [2022-02-20 18:24:30,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 541 edges. 541 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:32,406 INFO L225 Difference]: With dead ends: 12749 [2022-02-20 18:24:32,406 INFO L226 Difference]: Without dead ends: 8836 [2022-02-20 18:24:32,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:24:32,410 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 336 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:32,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 562 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:32,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8836 states. [2022-02-20 18:24:34,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8836 to 6382. [2022-02-20 18:24:34,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:34,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8836 states. Second operand has 6382 states, 6381 states have (on average 1.5919134931828867) internal successors, (10158), 6381 states have internal predecessors, (10158), 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 18:24:34,753 INFO L74 IsIncluded]: Start isIncluded. First operand 8836 states. Second operand has 6382 states, 6381 states have (on average 1.5919134931828867) internal successors, (10158), 6381 states have internal predecessors, (10158), 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 18:24:34,764 INFO L87 Difference]: Start difference. First operand 8836 states. Second operand has 6382 states, 6381 states have (on average 1.5919134931828867) internal successors, (10158), 6381 states have internal predecessors, (10158), 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 18:24:36,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:36,894 INFO L93 Difference]: Finished difference Result 8836 states and 14129 transitions. [2022-02-20 18:24:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 8836 states and 14129 transitions. [2022-02-20 18:24:36,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:36,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:36,911 INFO L74 IsIncluded]: Start isIncluded. First operand has 6382 states, 6381 states have (on average 1.5919134931828867) internal successors, (10158), 6381 states have internal predecessors, (10158), 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 8836 states. [2022-02-20 18:24:36,916 INFO L87 Difference]: Start difference. First operand has 6382 states, 6381 states have (on average 1.5919134931828867) internal successors, (10158), 6381 states have internal predecessors, (10158), 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 8836 states. [2022-02-20 18:24:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:39,105 INFO L93 Difference]: Finished difference Result 8836 states and 14129 transitions. [2022-02-20 18:24:39,105 INFO L276 IsEmpty]: Start isEmpty. Operand 8836 states and 14129 transitions. [2022-02-20 18:24:39,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:39,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:39,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:39,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6382 states, 6381 states have (on average 1.5919134931828867) internal successors, (10158), 6381 states have internal predecessors, (10158), 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 18:24:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6382 states to 6382 states and 10158 transitions. [2022-02-20 18:24:40,504 INFO L78 Accepts]: Start accepts. Automaton has 6382 states and 10158 transitions. Word has length 65 [2022-02-20 18:24:40,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:40,504 INFO L470 AbstractCegarLoop]: Abstraction has 6382 states and 10158 transitions. [2022-02-20 18:24:40,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 18:24:40,504 INFO L276 IsEmpty]: Start isEmpty. Operand 6382 states and 10158 transitions. [2022-02-20 18:24:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:24:40,505 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:40,505 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:40,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:24:40,505 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:40,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:40,506 INFO L85 PathProgramCache]: Analyzing trace with hash -894776387, now seen corresponding path program 1 times [2022-02-20 18:24:40,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:40,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554166294] [2022-02-20 18:24:40,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:40,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:40,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {104540#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {104540#true} is VALID [2022-02-20 18:24:40,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {104540#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {104540#true} is VALID [2022-02-20 18:24:40,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {104540#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {104540#true} is VALID [2022-02-20 18:24:40,542 INFO L290 TraceCheckUtils]: 3: Hoare triple {104540#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {104540#true} is VALID [2022-02-20 18:24:40,542 INFO L290 TraceCheckUtils]: 4: Hoare triple {104540#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {104540#true} is VALID [2022-02-20 18:24:40,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {104540#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {104540#true} is VALID [2022-02-20 18:24:40,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {104540#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {104540#true} is VALID [2022-02-20 18:24:40,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {104540#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {104540#true} is VALID [2022-02-20 18:24:40,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {104540#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {104540#true} is VALID [2022-02-20 18:24:40,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {104540#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {104540#true} is VALID [2022-02-20 18:24:40,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {104540#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {104540#true} is VALID [2022-02-20 18:24:40,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {104540#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {104540#true} is VALID [2022-02-20 18:24:40,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {104540#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {104540#true} is VALID [2022-02-20 18:24:40,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {104540#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {104540#true} is VALID [2022-02-20 18:24:40,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {104540#true} assume ~id1~0 != ~id2~0; {104540#true} is VALID [2022-02-20 18:24:40,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {104540#true} assume ~id1~0 != ~id3~0; {104540#true} is VALID [2022-02-20 18:24:40,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {104540#true} assume ~id2~0 != ~id3~0; {104540#true} is VALID [2022-02-20 18:24:40,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {104540#true} assume ~id1~0 >= 0; {104540#true} is VALID [2022-02-20 18:24:40,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {104540#true} assume ~id2~0 >= 0; {104540#true} is VALID [2022-02-20 18:24:40,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {104540#true} assume ~id3~0 >= 0; {104540#true} is VALID [2022-02-20 18:24:40,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {104540#true} assume 0 == ~r1~0; {104540#true} is VALID [2022-02-20 18:24:40,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {104540#true} assume 0 == ~r2~0; {104540#true} is VALID [2022-02-20 18:24:40,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {104540#true} assume 0 == ~r3~0; {104540#true} is VALID [2022-02-20 18:24:40,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {104540#true} assume ~max1~0 == ~id1~0; {104540#true} is VALID [2022-02-20 18:24:40,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {104540#true} assume ~max2~0 == ~id2~0; {104540#true} is VALID [2022-02-20 18:24:40,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {104540#true} assume ~max3~0 == ~id3~0; {104540#true} is VALID [2022-02-20 18:24:40,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {104540#true} assume 0 == ~st1~0; {104540#true} is VALID [2022-02-20 18:24:40,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {104540#true} assume 0 == ~st2~0; {104540#true} is VALID [2022-02-20 18:24:40,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {104540#true} assume 0 == ~st3~0; {104542#(<= ~st3~0 0)} is VALID [2022-02-20 18:24:40,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {104542#(<= ~st3~0 0)} assume 0 == ~nl1~0; {104542#(<= ~st3~0 0)} is VALID [2022-02-20 18:24:40,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {104542#(<= ~st3~0 0)} assume 0 == ~nl2~0; {104542#(<= ~st3~0 0)} is VALID [2022-02-20 18:24:40,546 INFO L290 TraceCheckUtils]: 31: Hoare triple {104542#(<= ~st3~0 0)} assume 0 == ~nl3~0; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,549 INFO L290 TraceCheckUtils]: 37: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == main_~i2~0#1); {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,549 INFO L290 TraceCheckUtils]: 38: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,549 INFO L290 TraceCheckUtils]: 39: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,550 INFO L290 TraceCheckUtils]: 40: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode1~0 % 256); {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,550 INFO L290 TraceCheckUtils]: 41: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 < 2; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,550 INFO L290 TraceCheckUtils]: 42: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep12~0 % 256); {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,551 INFO L290 TraceCheckUtils]: 43: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep13~0 % 256); {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,551 INFO L290 TraceCheckUtils]: 45: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,552 INFO L290 TraceCheckUtils]: 46: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode2~0 % 256); {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,552 INFO L290 TraceCheckUtils]: 47: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 < 2; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,552 INFO L290 TraceCheckUtils]: 48: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep21~0 % 256); {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,553 INFO L290 TraceCheckUtils]: 49: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep23~0 % 256); {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,553 INFO L290 TraceCheckUtils]: 50: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,553 INFO L290 TraceCheckUtils]: 51: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,554 INFO L290 TraceCheckUtils]: 52: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode3~0 % 256); {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,554 INFO L290 TraceCheckUtils]: 53: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 < 2; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,554 INFO L290 TraceCheckUtils]: 54: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep31~0 % 256); {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,555 INFO L290 TraceCheckUtils]: 55: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep32~0 % 256); {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,555 INFO L290 TraceCheckUtils]: 56: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,555 INFO L290 TraceCheckUtils]: 57: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,556 INFO L290 TraceCheckUtils]: 58: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,556 INFO L290 TraceCheckUtils]: 59: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,556 INFO L290 TraceCheckUtils]: 60: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {104543#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:40,557 INFO L290 TraceCheckUtils]: 61: Hoare triple {104543#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);check_~tmp~1#1 := 0; {104541#false} is VALID [2022-02-20 18:24:40,557 INFO L290 TraceCheckUtils]: 62: Hoare triple {104541#false} check_#res#1 := check_~tmp~1#1; {104541#false} is VALID [2022-02-20 18:24:40,557 INFO L290 TraceCheckUtils]: 63: Hoare triple {104541#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {104541#false} is VALID [2022-02-20 18:24:40,557 INFO L290 TraceCheckUtils]: 64: Hoare triple {104541#false} assume 0 == assert_~arg#1 % 256; {104541#false} is VALID [2022-02-20 18:24:40,557 INFO L290 TraceCheckUtils]: 65: Hoare triple {104541#false} assume !false; {104541#false} is VALID [2022-02-20 18:24:40,557 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 18:24:40,557 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:40,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554166294] [2022-02-20 18:24:40,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554166294] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:40,558 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:40,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:24:40,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338294302] [2022-02-20 18:24:40,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:40,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2022-02-20 18:24:40,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:40,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 18:24:40,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:40,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:24:40,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:40,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:24:40,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:24:40,599 INFO L87 Difference]: Start difference. First operand 6382 states and 10158 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 18:24:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:58,003 INFO L93 Difference]: Finished difference Result 20041 states and 32013 transitions. [2022-02-20 18:24:58,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:24:58,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2022-02-20 18:24:58,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 18:24:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2022-02-20 18:24:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 18:24:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2022-02-20 18:24:58,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 541 transitions. [2022-02-20 18:24:58,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 541 edges. 541 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:04,288 INFO L225 Difference]: With dead ends: 20041 [2022-02-20 18:25:04,288 INFO L226 Difference]: Without dead ends: 13732 [2022-02-20 18:25:04,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:25:04,303 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 334 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:25:04,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 612 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:25:04,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13732 states. [2022-02-20 18:25:09,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13732 to 10014. [2022-02-20 18:25:09,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:25:09,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13732 states. Second operand has 10014 states, 10013 states have (on average 1.582942175172276) internal successors, (15850), 10013 states have internal predecessors, (15850), 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 18:25:09,486 INFO L74 IsIncluded]: Start isIncluded. First operand 13732 states. Second operand has 10014 states, 10013 states have (on average 1.582942175172276) internal successors, (15850), 10013 states have internal predecessors, (15850), 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 18:25:09,495 INFO L87 Difference]: Start difference. First operand 13732 states. Second operand has 10014 states, 10013 states have (on average 1.582942175172276) internal successors, (15850), 10013 states have internal predecessors, (15850), 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)