./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.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.4.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 904bd1313458c4f9af8d5bf1208ba922a2079eb77883d7ecd1ca28ceda09c9f6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:24:27,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:24:27,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:24:27,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:24:27,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:24:27,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:24:27,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:24:27,264 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:24:27,266 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:24:27,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:24:27,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:24:27,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:24:27,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:24:27,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:24:27,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:24:27,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:24:27,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:24:27,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:24:27,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:24:27,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:24:27,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:24:27,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:24:27,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:24:27,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:24:27,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:24:27,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:24:27,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:24:27,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:24:27,290 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:24:27,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:24:27,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:24:27,292 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:24:27,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:24:27,293 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:24:27,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:24:27,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:24:27,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:24:27,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:24:27,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:24:27,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:24:27,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:24:27,297 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:24:27,320 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:24:27,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:24:27,321 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:24:27,321 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:24:27,321 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:24:27,321 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:24:27,322 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:24:27,322 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:24:27,322 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:24:27,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:24:27,323 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:24:27,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:24:27,323 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:24:27,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:24:27,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:24:27,324 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:24:27,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:24:27,324 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:24:27,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:24:27,324 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:24:27,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:24:27,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:24:27,325 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:24:27,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:24:27,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:24:27,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:24:27,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:24:27,325 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:24:27,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:24:27,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:24:27,326 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:24:27,326 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:24:27,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:24:27,326 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 -> 904bd1313458c4f9af8d5bf1208ba922a2079eb77883d7ecd1ca28ceda09c9f6 [2022-02-20 18:24:27,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:24:27,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:24:27,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:24:27,600 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:24:27,600 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:24:27,601 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2022-02-20 18:24:27,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f4a2fcb6/b226f4d44ca444e3aaeb40052c13ce29/FLAG2c38127a4 [2022-02-20 18:24:27,968 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:24:27,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2022-02-20 18:24:27,976 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f4a2fcb6/b226f4d44ca444e3aaeb40052c13ce29/FLAG2c38127a4 [2022-02-20 18:24:28,397 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f4a2fcb6/b226f4d44ca444e3aaeb40052c13ce29 [2022-02-20 18:24:28,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:24:28,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:24:28,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:24:28,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:24:28,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:24:28,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:24:28" (1/1) ... [2022-02-20 18:24:28,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eba86e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:28, skipping insertion in model container [2022-02-20 18:24:28,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:24:28" (1/1) ... [2022-02-20 18:24:28,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:24:28,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:24:28,714 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.4.ufo.BOUNDED-6.pals.c[12764,12777] [2022-02-20 18:24:28,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:24:28,731 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:24:28,845 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.4.ufo.BOUNDED-6.pals.c[12764,12777] [2022-02-20 18:24:28,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:24:28,875 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:24:28,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:28 WrapperNode [2022-02-20 18:24:28,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:24:28,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:24:28,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:24:28,877 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:24:28,885 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:24:28" (1/1) ... [2022-02-20 18:24:28,904 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:24:28" (1/1) ... [2022-02-20 18:24:28,970 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 441 [2022-02-20 18:24:28,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:24:28,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:24:28,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:24:28,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:24:28,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:28" (1/1) ... [2022-02-20 18:24:28,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:28" (1/1) ... [2022-02-20 18:24:29,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:28" (1/1) ... [2022-02-20 18:24:29,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:28" (1/1) ... [2022-02-20 18:24:29,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:28" (1/1) ... [2022-02-20 18:24:29,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:28" (1/1) ... [2022-02-20 18:24:29,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:28" (1/1) ... [2022-02-20 18:24:29,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:24:29,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:24:29,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:24:29,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:24:29,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:28" (1/1) ... [2022-02-20 18:24:29,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:24:29,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:24:29,122 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:24:29,127 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:24:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:24:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:24:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:24:29,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:24:29,256 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:24:29,257 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:24:29,715 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:24:29,722 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:24:29,723 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:24:29,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:24:29 BoogieIcfgContainer [2022-02-20 18:24:29,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:24:29,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:24:29,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:24:29,729 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:24:29,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:24:28" (1/3) ... [2022-02-20 18:24:29,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354e83db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:24:29, skipping insertion in model container [2022-02-20 18:24:29,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:28" (2/3) ... [2022-02-20 18:24:29,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354e83db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:24:29, skipping insertion in model container [2022-02-20 18:24:29,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:24:29" (3/3) ... [2022-02-20 18:24:29,731 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2022-02-20 18:24:29,735 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:24:29,735 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:24:29,769 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:24:29,774 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:24:29,774 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:24:29,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.7596899224806202) internal successors, (227), 130 states have internal predecessors, (227), 0 states have call successors, (0), 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,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:24:29,796 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:29,796 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:29,797 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:29,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:29,801 INFO L85 PathProgramCache]: Analyzing trace with hash -306716250, now seen corresponding path program 1 times [2022-02-20 18:24:29,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:29,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192820376] [2022-02-20 18:24:29,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:29,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:30,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {134#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; {134#true} is VALID [2022-02-20 18:24:30,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#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; {134#true} is VALID [2022-02-20 18:24:30,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {134#true} is VALID [2022-02-20 18:24:30,038 INFO L290 TraceCheckUtils]: 3: Hoare triple {134#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {134#true} is VALID [2022-02-20 18:24:30,038 INFO L290 TraceCheckUtils]: 4: Hoare triple {134#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {134#true} is VALID [2022-02-20 18:24:30,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {134#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {134#true} is VALID [2022-02-20 18:24:30,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {134#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {134#true} is VALID [2022-02-20 18:24:30,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {134#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {134#true} is VALID [2022-02-20 18:24:30,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {134#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {134#true} is VALID [2022-02-20 18:24:30,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {134#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {134#true} is VALID [2022-02-20 18:24:30,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {134#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {134#true} is VALID [2022-02-20 18:24:30,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {134#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {134#true} is VALID [2022-02-20 18:24:30,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {134#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {134#true} is VALID [2022-02-20 18:24:30,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {134#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {134#true} is VALID [2022-02-20 18:24:30,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {134#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {134#true} is VALID [2022-02-20 18:24:30,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {134#true} init_#res#1 := init_~tmp___5~0#1; {134#true} is VALID [2022-02-20 18:24:30,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {134#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; {134#true} is VALID [2022-02-20 18:24:30,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {134#true} assume 0 == main_~i2~0#1;assume false; {135#false} is VALID [2022-02-20 18:24:30,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {135#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; {135#false} is VALID [2022-02-20 18:24:30,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {135#false} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {135#false} is VALID [2022-02-20 18:24:30,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {135#false} assume !(0 != ~mode1~0 % 256); {135#false} is VALID [2022-02-20 18:24:30,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {135#false} assume !(~r1~0 < 1); {135#false} is VALID [2022-02-20 18:24:30,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {135#false} ~mode1~0 := 1; {135#false} is VALID [2022-02-20 18:24:30,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {135#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {135#false} is VALID [2022-02-20 18:24:30,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {135#false} assume !(0 != ~mode2~0 % 256); {135#false} is VALID [2022-02-20 18:24:30,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {135#false} assume !(~r2~0 < 2); {135#false} is VALID [2022-02-20 18:24:30,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {135#false} ~mode2~0 := 1; {135#false} is VALID [2022-02-20 18:24:30,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {135#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {135#false} is VALID [2022-02-20 18:24:30,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {135#false} assume !(0 != ~mode3~0 % 256); {135#false} is VALID [2022-02-20 18:24:30,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {135#false} assume !(~r3~0 < 2); {135#false} is VALID [2022-02-20 18:24:30,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {135#false} ~mode3~0 := 1; {135#false} is VALID [2022-02-20 18:24:30,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {135#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; {135#false} is VALID [2022-02-20 18:24:30,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {135#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {135#false} is VALID [2022-02-20 18:24:30,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {135#false} check_#res#1 := check_~tmp~1#1; {135#false} is VALID [2022-02-20 18:24:30,049 INFO L290 TraceCheckUtils]: 34: Hoare triple {135#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; {135#false} is VALID [2022-02-20 18:24:30,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {135#false} assume 0 == assert_~arg#1 % 256; {135#false} is VALID [2022-02-20 18:24:30,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {135#false} assume !false; {135#false} is VALID [2022-02-20 18:24:30,051 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:30,051 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:30,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192820376] [2022-02-20 18:24:30,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192820376] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:30,052 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:30,052 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:24:30,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954327265] [2022-02-20 18:24:30,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:30,060 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:30,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:30,063 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:30,109 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:30,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:24:30,110 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:30,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:24:30,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:24:30,129 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.7596899224806202) internal successors, (227), 130 states have internal predecessors, (227), 0 states have call successors, (0), 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:30,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:30,255 INFO L93 Difference]: Finished difference Result 206 states and 352 transitions. [2022-02-20 18:24:30,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:24:30,256 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:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:30,257 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:30,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 352 transitions. [2022-02-20 18:24:30,264 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:30,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 352 transitions. [2022-02-20 18:24:30,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 352 transitions. [2022-02-20 18:24:30,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:30,507 INFO L225 Difference]: With dead ends: 206 [2022-02-20 18:24:30,507 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 18:24:30,509 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:30,518 INFO L933 BasicCegarLoop]: 224 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, 224 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:30,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 224 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:30,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 18:24:30,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-02-20 18:24:30,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:30,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 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:30,541 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 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:30,541 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 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:30,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:30,546 INFO L93 Difference]: Finished difference Result 127 states and 220 transitions. [2022-02-20 18:24:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 220 transitions. [2022-02-20 18:24:30,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:30,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:30,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 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 127 states. [2022-02-20 18:24:30,556 INFO L87 Difference]: Start difference. First operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 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 127 states. [2022-02-20 18:24:30,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:30,560 INFO L93 Difference]: Finished difference Result 127 states and 220 transitions. [2022-02-20 18:24:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 220 transitions. [2022-02-20 18:24:30,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:30,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:30,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:30,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 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:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 220 transitions. [2022-02-20 18:24:30,566 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 220 transitions. Word has length 37 [2022-02-20 18:24:30,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:30,566 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 220 transitions. [2022-02-20 18:24:30,567 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:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 220 transitions. [2022-02-20 18:24:30,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:24:30,568 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:30,568 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:30,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:24:30,568 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:30,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:30,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1124364700, now seen corresponding path program 1 times [2022-02-20 18:24:30,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:30,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498768040] [2022-02-20 18:24:30,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:30,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:30,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {753#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; {753#true} is VALID [2022-02-20 18:24:30,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {753#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; {753#true} is VALID [2022-02-20 18:24:30,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {753#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {753#true} is VALID [2022-02-20 18:24:30,645 INFO L290 TraceCheckUtils]: 3: Hoare triple {753#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {753#true} is VALID [2022-02-20 18:24:30,645 INFO L290 TraceCheckUtils]: 4: Hoare triple {753#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {753#true} is VALID [2022-02-20 18:24:30,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {753#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {753#true} is VALID [2022-02-20 18:24:30,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {753#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {753#true} is VALID [2022-02-20 18:24:30,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {753#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {753#true} is VALID [2022-02-20 18:24:30,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {753#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {753#true} is VALID [2022-02-20 18:24:30,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {753#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {753#true} is VALID [2022-02-20 18:24:30,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {753#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {753#true} is VALID [2022-02-20 18:24:30,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {753#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {753#true} is VALID [2022-02-20 18:24:30,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {753#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {753#true} is VALID [2022-02-20 18:24:30,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {753#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {753#true} is VALID [2022-02-20 18:24:30,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {753#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {755#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-20 18:24:30,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {755#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {756#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:24:30,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {756#(= |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; {757#(= |ULTIMATE.start_main_~i2~0#1| 0)} is VALID [2022-02-20 18:24:30,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {757#(= |ULTIMATE.start_main_~i2~0#1| 0)} assume !(0 == main_~i2~0#1); {754#false} is VALID [2022-02-20 18:24:30,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {754#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; {754#false} is VALID [2022-02-20 18:24:30,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {754#false} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {754#false} is VALID [2022-02-20 18:24:30,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {754#false} assume !(0 != ~mode1~0 % 256); {754#false} is VALID [2022-02-20 18:24:30,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {754#false} assume !(~r1~0 < 1); {754#false} is VALID [2022-02-20 18:24:30,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {754#false} ~mode1~0 := 1; {754#false} is VALID [2022-02-20 18:24:30,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {754#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {754#false} is VALID [2022-02-20 18:24:30,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {754#false} assume !(0 != ~mode2~0 % 256); {754#false} is VALID [2022-02-20 18:24:30,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {754#false} assume !(~r2~0 < 2); {754#false} is VALID [2022-02-20 18:24:30,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {754#false} ~mode2~0 := 1; {754#false} is VALID [2022-02-20 18:24:30,652 INFO L290 TraceCheckUtils]: 27: Hoare triple {754#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {754#false} is VALID [2022-02-20 18:24:30,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {754#false} assume !(0 != ~mode3~0 % 256); {754#false} is VALID [2022-02-20 18:24:30,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {754#false} assume !(~r3~0 < 2); {754#false} is VALID [2022-02-20 18:24:30,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {754#false} ~mode3~0 := 1; {754#false} is VALID [2022-02-20 18:24:30,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {754#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; {754#false} is VALID [2022-02-20 18:24:30,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {754#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {754#false} is VALID [2022-02-20 18:24:30,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {754#false} check_#res#1 := check_~tmp~1#1; {754#false} is VALID [2022-02-20 18:24:30,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {754#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; {754#false} is VALID [2022-02-20 18:24:30,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {754#false} assume 0 == assert_~arg#1 % 256; {754#false} is VALID [2022-02-20 18:24:30,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {754#false} assume !false; {754#false} is VALID [2022-02-20 18:24:30,654 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:30,654 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:30,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498768040] [2022-02-20 18:24:30,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498768040] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:30,654 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:30,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:24:30,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29914954] [2022-02-20 18:24:30,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:30,656 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:30,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:30,656 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:30,677 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:30,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:24:30,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:30,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:24:30,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:24:30,678 INFO L87 Difference]: Start difference. First operand 127 states and 220 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:31,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:31,104 INFO L93 Difference]: Finished difference Result 271 states and 460 transitions. [2022-02-20 18:24:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:24:31,105 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:31,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:31,105 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:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 460 transitions. [2022-02-20 18:24:31,125 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:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 460 transitions. [2022-02-20 18:24:31,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 460 transitions. [2022-02-20 18:24:31,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:31,400 INFO L225 Difference]: With dead ends: 271 [2022-02-20 18:24:31,400 INFO L226 Difference]: Without dead ends: 197 [2022-02-20 18:24:31,401 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:31,401 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 120 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:31,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 832 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:31,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-02-20 18:24:31,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 127. [2022-02-20 18:24:31,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:31,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 127 states, 126 states have (on average 1.5317460317460319) internal successors, (193), 126 states have internal predecessors, (193), 0 states have call successors, (0), 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:31,408 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 127 states, 126 states have (on average 1.5317460317460319) internal successors, (193), 126 states have internal predecessors, (193), 0 states have call successors, (0), 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:31,408 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 127 states, 126 states have (on average 1.5317460317460319) internal successors, (193), 126 states have internal predecessors, (193), 0 states have call successors, (0), 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:31,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:31,414 INFO L93 Difference]: Finished difference Result 197 states and 311 transitions. [2022-02-20 18:24:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 311 transitions. [2022-02-20 18:24:31,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:31,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:31,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 126 states have (on average 1.5317460317460319) internal successors, (193), 126 states have internal predecessors, (193), 0 states have call successors, (0), 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 197 states. [2022-02-20 18:24:31,415 INFO L87 Difference]: Start difference. First operand has 127 states, 126 states have (on average 1.5317460317460319) internal successors, (193), 126 states have internal predecessors, (193), 0 states have call successors, (0), 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 197 states. [2022-02-20 18:24:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:31,420 INFO L93 Difference]: Finished difference Result 197 states and 311 transitions. [2022-02-20 18:24:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 311 transitions. [2022-02-20 18:24:31,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:31,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:31,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:31,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:31,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5317460317460319) internal successors, (193), 126 states have internal predecessors, (193), 0 states have call successors, (0), 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:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 193 transitions. [2022-02-20 18:24:31,425 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 193 transitions. Word has length 37 [2022-02-20 18:24:31,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:31,425 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 193 transitions. [2022-02-20 18:24:31,425 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:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions. [2022-02-20 18:24:31,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:24:31,426 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:31,426 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:31,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:24:31,427 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:31,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:31,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1313145683, now seen corresponding path program 1 times [2022-02-20 18:24:31,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:31,428 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860537600] [2022-02-20 18:24:31,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:31,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:31,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {1591#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; {1591#true} is VALID [2022-02-20 18:24:31,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {1591#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; {1591#true} is VALID [2022-02-20 18:24:31,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {1591#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1591#true} is VALID [2022-02-20 18:24:31,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {1591#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1591#true} is VALID [2022-02-20 18:24:31,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {1591#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1591#true} is VALID [2022-02-20 18:24:31,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {1591#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1591#true} is VALID [2022-02-20 18:24:31,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {1591#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {1591#true} is VALID [2022-02-20 18:24:31,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {1591#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1591#true} is VALID [2022-02-20 18:24:31,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {1591#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {1591#true} is VALID [2022-02-20 18:24:31,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {1591#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1591#true} is VALID [2022-02-20 18:24:31,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {1591#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {1591#true} is VALID [2022-02-20 18:24:31,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {1591#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1591#true} is VALID [2022-02-20 18:24:31,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {1591#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {1591#true} is VALID [2022-02-20 18:24:31,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {1591#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1591#true} is VALID [2022-02-20 18:24:31,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {1591#true} assume ~id1~0 != ~id2~0; {1591#true} is VALID [2022-02-20 18:24:31,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {1591#true} assume ~id1~0 != ~id3~0; {1591#true} is VALID [2022-02-20 18:24:31,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {1591#true} assume ~id2~0 != ~id3~0; {1591#true} is VALID [2022-02-20 18:24:31,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {1591#true} assume ~id1~0 >= 0; {1591#true} is VALID [2022-02-20 18:24:31,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {1591#true} assume ~id2~0 >= 0; {1591#true} is VALID [2022-02-20 18:24:31,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {1591#true} assume ~id3~0 >= 0; {1591#true} is VALID [2022-02-20 18:24:31,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {1591#true} assume 0 == ~r1~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~r2~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~r3~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {1593#(<= ~r1~0 0)} assume 0 != init_~r122~0#1 % 256; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {1593#(<= ~r1~0 0)} assume 0 != init_~r132~0#1 % 256; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {1593#(<= ~r1~0 0)} assume 0 != init_~r212~0#1 % 256; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {1593#(<= ~r1~0 0)} assume 0 != init_~r232~0#1 % 256; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {1593#(<= ~r1~0 0)} assume 0 != init_~r312~0#1 % 256; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {1593#(<= ~r1~0 0)} assume 0 != init_~r322~0#1 % 256; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {1593#(<= ~r1~0 0)} assume ~max1~0 == ~id1~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {1593#(<= ~r1~0 0)} assume ~max2~0 == ~id2~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {1593#(<= ~r1~0 0)} assume ~max3~0 == ~id3~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~st1~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~st2~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,562 INFO L290 TraceCheckUtils]: 34: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~st3~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~nl1~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~nl2~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,564 INFO L290 TraceCheckUtils]: 37: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~nl3~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,564 INFO L290 TraceCheckUtils]: 38: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,565 INFO L290 TraceCheckUtils]: 40: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {1593#(<= ~r1~0 0)} init_#res#1 := init_~tmp___5~0#1; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {1593#(<= ~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; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,566 INFO L290 TraceCheckUtils]: 43: Hoare triple {1593#(<= ~r1~0 0)} assume !(0 == main_~i2~0#1); {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {1593#(<= ~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; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,579 INFO L290 TraceCheckUtils]: 45: Hoare triple {1593#(<= ~r1~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,580 INFO L290 TraceCheckUtils]: 46: Hoare triple {1593#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:31,580 INFO L290 TraceCheckUtils]: 47: Hoare triple {1593#(<= ~r1~0 0)} assume !(~r1~0 < 1); {1592#false} is VALID [2022-02-20 18:24:31,580 INFO L290 TraceCheckUtils]: 48: Hoare triple {1592#false} ~mode1~0 := 1; {1592#false} is VALID [2022-02-20 18:24:31,581 INFO L290 TraceCheckUtils]: 49: Hoare triple {1592#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {1592#false} is VALID [2022-02-20 18:24:31,581 INFO L290 TraceCheckUtils]: 50: Hoare triple {1592#false} assume !(0 != ~mode2~0 % 256); {1592#false} is VALID [2022-02-20 18:24:31,581 INFO L290 TraceCheckUtils]: 51: Hoare triple {1592#false} assume !(~r2~0 < 2); {1592#false} is VALID [2022-02-20 18:24:31,581 INFO L290 TraceCheckUtils]: 52: Hoare triple {1592#false} ~mode2~0 := 1; {1592#false} is VALID [2022-02-20 18:24:31,581 INFO L290 TraceCheckUtils]: 53: Hoare triple {1592#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {1592#false} is VALID [2022-02-20 18:24:31,581 INFO L290 TraceCheckUtils]: 54: Hoare triple {1592#false} assume !(0 != ~mode3~0 % 256); {1592#false} is VALID [2022-02-20 18:24:31,582 INFO L290 TraceCheckUtils]: 55: Hoare triple {1592#false} assume !(~r3~0 < 2); {1592#false} is VALID [2022-02-20 18:24:31,582 INFO L290 TraceCheckUtils]: 56: Hoare triple {1592#false} ~mode3~0 := 1; {1592#false} is VALID [2022-02-20 18:24:31,582 INFO L290 TraceCheckUtils]: 57: Hoare triple {1592#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; {1592#false} is VALID [2022-02-20 18:24:31,582 INFO L290 TraceCheckUtils]: 58: Hoare triple {1592#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1592#false} is VALID [2022-02-20 18:24:31,582 INFO L290 TraceCheckUtils]: 59: Hoare triple {1592#false} check_#res#1 := check_~tmp~1#1; {1592#false} is VALID [2022-02-20 18:24:31,582 INFO L290 TraceCheckUtils]: 60: Hoare triple {1592#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; {1592#false} is VALID [2022-02-20 18:24:31,583 INFO L290 TraceCheckUtils]: 61: Hoare triple {1592#false} assume 0 == assert_~arg#1 % 256; {1592#false} is VALID [2022-02-20 18:24:31,583 INFO L290 TraceCheckUtils]: 62: Hoare triple {1592#false} assume !false; {1592#false} is VALID [2022-02-20 18:24:31,583 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:31,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:31,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860537600] [2022-02-20 18:24:31,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860537600] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:31,584 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:31,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:31,584 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400651509] [2022-02-20 18:24:31,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:31,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:31,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:31,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:31,640 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:31,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:31,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:31,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:31,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:31,641 INFO L87 Difference]: Start difference. First operand 127 states and 193 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:31,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:31,932 INFO L93 Difference]: Finished difference Result 252 states and 402 transitions. [2022-02-20 18:24:31,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:31,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:31,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:31,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2022-02-20 18:24:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2022-02-20 18:24:31,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 402 transitions. [2022-02-20 18:24:32,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:32,237 INFO L225 Difference]: With dead ends: 252 [2022-02-20 18:24:32,237 INFO L226 Difference]: Without dead ends: 182 [2022-02-20 18:24:32,237 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:32,238 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 93 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:32,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 411 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-02-20 18:24:32,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2022-02-20 18:24:32,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:32,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 180 states, 179 states have (on average 1.553072625698324) internal successors, (278), 179 states have internal predecessors, (278), 0 states have call successors, (0), 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:32,250 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 180 states, 179 states have (on average 1.553072625698324) internal successors, (278), 179 states have internal predecessors, (278), 0 states have call successors, (0), 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:32,250 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 180 states, 179 states have (on average 1.553072625698324) internal successors, (278), 179 states have internal predecessors, (278), 0 states have call successors, (0), 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:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:32,253 INFO L93 Difference]: Finished difference Result 182 states and 279 transitions. [2022-02-20 18:24:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 279 transitions. [2022-02-20 18:24:32,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:32,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:32,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 179 states have (on average 1.553072625698324) internal successors, (278), 179 states have internal predecessors, (278), 0 states have call successors, (0), 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:32,255 INFO L87 Difference]: Start difference. First operand has 180 states, 179 states have (on average 1.553072625698324) internal successors, (278), 179 states have internal predecessors, (278), 0 states have call successors, (0), 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:32,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:32,258 INFO L93 Difference]: Finished difference Result 182 states and 279 transitions. [2022-02-20 18:24:32,258 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 279 transitions. [2022-02-20 18:24:32,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:32,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:32,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:32,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.553072625698324) internal successors, (278), 179 states have internal predecessors, (278), 0 states have call successors, (0), 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:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 278 transitions. [2022-02-20 18:24:32,263 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 278 transitions. Word has length 63 [2022-02-20 18:24:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:32,263 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 278 transitions. [2022-02-20 18:24:32,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:32,264 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 278 transitions. [2022-02-20 18:24:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:24:32,264 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:32,264 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:32,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:24:32,265 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:32,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:32,265 INFO L85 PathProgramCache]: Analyzing trace with hash -255493166, now seen corresponding path program 1 times [2022-02-20 18:24:32,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:32,266 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510344763] [2022-02-20 18:24:32,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:32,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:32,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {2434#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; {2434#true} is VALID [2022-02-20 18:24:32,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {2434#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; {2434#true} is VALID [2022-02-20 18:24:32,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {2434#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2434#true} is VALID [2022-02-20 18:24:32,332 INFO L290 TraceCheckUtils]: 3: Hoare triple {2434#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2434#true} is VALID [2022-02-20 18:24:32,332 INFO L290 TraceCheckUtils]: 4: Hoare triple {2434#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2434#true} is VALID [2022-02-20 18:24:32,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {2434#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2434#true} is VALID [2022-02-20 18:24:32,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {2434#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2434#true} is VALID [2022-02-20 18:24:32,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {2434#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2434#true} is VALID [2022-02-20 18:24:32,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {2434#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2434#true} is VALID [2022-02-20 18:24:32,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {2434#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2434#true} is VALID [2022-02-20 18:24:32,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {2434#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2434#true} is VALID [2022-02-20 18:24:32,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {2434#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2434#true} is VALID [2022-02-20 18:24:32,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {2434#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2434#true} is VALID [2022-02-20 18:24:32,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {2434#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2434#true} is VALID [2022-02-20 18:24:32,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {2434#true} assume ~id1~0 != ~id2~0; {2434#true} is VALID [2022-02-20 18:24:32,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {2434#true} assume ~id1~0 != ~id3~0; {2434#true} is VALID [2022-02-20 18:24:32,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {2434#true} assume ~id2~0 != ~id3~0; {2434#true} is VALID [2022-02-20 18:24:32,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {2434#true} assume ~id1~0 >= 0; {2434#true} is VALID [2022-02-20 18:24:32,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {2434#true} assume ~id2~0 >= 0; {2434#true} is VALID [2022-02-20 18:24:32,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {2434#true} assume ~id3~0 >= 0; {2434#true} is VALID [2022-02-20 18:24:32,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {2434#true} assume 0 == ~r1~0; {2434#true} is VALID [2022-02-20 18:24:32,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {2434#true} assume 0 == ~r2~0; {2434#true} is VALID [2022-02-20 18:24:32,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {2434#true} assume 0 == ~r3~0; {2434#true} is VALID [2022-02-20 18:24:32,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {2434#true} assume 0 != init_~r122~0#1 % 256; {2434#true} is VALID [2022-02-20 18:24:32,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {2434#true} assume 0 != init_~r132~0#1 % 256; {2434#true} is VALID [2022-02-20 18:24:32,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {2434#true} assume 0 != init_~r212~0#1 % 256; {2434#true} is VALID [2022-02-20 18:24:32,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {2434#true} assume 0 != init_~r232~0#1 % 256; {2434#true} is VALID [2022-02-20 18:24:32,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {2434#true} assume 0 != init_~r312~0#1 % 256; {2434#true} is VALID [2022-02-20 18:24:32,335 INFO L290 TraceCheckUtils]: 28: Hoare triple {2434#true} assume 0 != init_~r322~0#1 % 256; {2434#true} is VALID [2022-02-20 18:24:32,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {2434#true} assume ~max1~0 == ~id1~0; {2434#true} is VALID [2022-02-20 18:24:32,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {2434#true} assume ~max2~0 == ~id2~0; {2434#true} is VALID [2022-02-20 18:24:32,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {2434#true} assume ~max3~0 == ~id3~0; {2434#true} is VALID [2022-02-20 18:24:32,336 INFO L290 TraceCheckUtils]: 32: Hoare triple {2434#true} assume 0 == ~st1~0; {2434#true} is VALID [2022-02-20 18:24:32,336 INFO L290 TraceCheckUtils]: 33: Hoare triple {2434#true} assume 0 == ~st2~0; {2434#true} is VALID [2022-02-20 18:24:32,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {2434#true} assume 0 == ~st3~0; {2434#true} is VALID [2022-02-20 18:24:32,336 INFO L290 TraceCheckUtils]: 35: Hoare triple {2434#true} assume 0 == ~nl1~0; {2434#true} is VALID [2022-02-20 18:24:32,336 INFO L290 TraceCheckUtils]: 36: Hoare triple {2434#true} assume 0 == ~nl2~0; {2434#true} is VALID [2022-02-20 18:24:32,336 INFO L290 TraceCheckUtils]: 37: Hoare triple {2434#true} assume 0 == ~nl3~0; {2434#true} is VALID [2022-02-20 18:24:32,337 INFO L290 TraceCheckUtils]: 38: Hoare triple {2434#true} assume 0 == ~mode1~0 % 256; {2436#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:32,337 INFO L290 TraceCheckUtils]: 39: Hoare triple {2436#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {2436#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:32,338 INFO L290 TraceCheckUtils]: 40: Hoare triple {2436#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {2436#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:32,338 INFO L290 TraceCheckUtils]: 41: Hoare triple {2436#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {2436#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:32,339 INFO L290 TraceCheckUtils]: 42: Hoare triple {2436#(= (+ (* (- 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; {2436#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:32,339 INFO L290 TraceCheckUtils]: 43: Hoare triple {2436#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main_~i2~0#1); {2436#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:32,340 INFO L290 TraceCheckUtils]: 44: Hoare triple {2436#(= (+ (* (- 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; {2436#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:32,340 INFO L290 TraceCheckUtils]: 45: Hoare triple {2436#(= (+ (* (- 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; {2436#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:32,341 INFO L290 TraceCheckUtils]: 46: Hoare triple {2436#(= (+ (* (- 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); {2435#false} is VALID [2022-02-20 18:24:32,341 INFO L290 TraceCheckUtils]: 47: Hoare triple {2435#false} assume !(0 != ~ep21~0 % 256); {2435#false} is VALID [2022-02-20 18:24:32,341 INFO L290 TraceCheckUtils]: 48: Hoare triple {2435#false} assume !(0 != ~ep31~0 % 256); {2435#false} is VALID [2022-02-20 18:24:32,341 INFO L290 TraceCheckUtils]: 49: Hoare triple {2435#false} assume !(2 == ~r1~0); {2435#false} is VALID [2022-02-20 18:24:32,341 INFO L290 TraceCheckUtils]: 50: Hoare triple {2435#false} ~mode1~0 := 0; {2435#false} is VALID [2022-02-20 18:24:32,341 INFO L290 TraceCheckUtils]: 51: Hoare triple {2435#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {2435#false} is VALID [2022-02-20 18:24:32,342 INFO L290 TraceCheckUtils]: 52: Hoare triple {2435#false} assume !(0 != ~mode2~0 % 256); {2435#false} is VALID [2022-02-20 18:24:32,342 INFO L290 TraceCheckUtils]: 53: Hoare triple {2435#false} assume !(~r2~0 < 2); {2435#false} is VALID [2022-02-20 18:24:32,342 INFO L290 TraceCheckUtils]: 54: Hoare triple {2435#false} ~mode2~0 := 1; {2435#false} is VALID [2022-02-20 18:24:32,342 INFO L290 TraceCheckUtils]: 55: Hoare triple {2435#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {2435#false} is VALID [2022-02-20 18:24:32,342 INFO L290 TraceCheckUtils]: 56: Hoare triple {2435#false} assume !(0 != ~mode3~0 % 256); {2435#false} is VALID [2022-02-20 18:24:32,342 INFO L290 TraceCheckUtils]: 57: Hoare triple {2435#false} assume !(~r3~0 < 2); {2435#false} is VALID [2022-02-20 18:24:32,342 INFO L290 TraceCheckUtils]: 58: Hoare triple {2435#false} ~mode3~0 := 1; {2435#false} is VALID [2022-02-20 18:24:32,343 INFO L290 TraceCheckUtils]: 59: Hoare triple {2435#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; {2435#false} is VALID [2022-02-20 18:24:32,343 INFO L290 TraceCheckUtils]: 60: Hoare triple {2435#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {2435#false} is VALID [2022-02-20 18:24:32,343 INFO L290 TraceCheckUtils]: 61: Hoare triple {2435#false} check_#res#1 := check_~tmp~1#1; {2435#false} is VALID [2022-02-20 18:24:32,343 INFO L290 TraceCheckUtils]: 62: Hoare triple {2435#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; {2435#false} is VALID [2022-02-20 18:24:32,343 INFO L290 TraceCheckUtils]: 63: Hoare triple {2435#false} assume 0 == assert_~arg#1 % 256; {2435#false} is VALID [2022-02-20 18:24:32,343 INFO L290 TraceCheckUtils]: 64: Hoare triple {2435#false} assume !false; {2435#false} is VALID [2022-02-20 18:24:32,344 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:32,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:32,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510344763] [2022-02-20 18:24:32,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510344763] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:32,344 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:32,344 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:32,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895348401] [2022-02-20 18:24:32,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:32,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:32,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:32,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:32,384 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:32,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:32,384 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:32,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:32,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:32,385 INFO L87 Difference]: Start difference. First operand 180 states and 278 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:32,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:32,602 INFO L93 Difference]: Finished difference Result 360 states and 576 transitions. [2022-02-20 18:24:32,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:32,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:32,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-02-20 18:24:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:32,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-02-20 18:24:32,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 403 transitions. [2022-02-20 18:24:32,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 403 edges. 403 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:32,860 INFO L225 Difference]: With dead ends: 360 [2022-02-20 18:24:32,860 INFO L226 Difference]: Without dead ends: 237 [2022-02-20 18:24:32,861 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:32,862 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 102 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 441 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:32,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 441 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:32,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-02-20 18:24:32,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2022-02-20 18:24:32,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:32,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 235 states, 234 states have (on average 1.5811965811965811) internal successors, (370), 234 states have internal predecessors, (370), 0 states have call successors, (0), 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:32,874 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 235 states, 234 states have (on average 1.5811965811965811) internal successors, (370), 234 states have internal predecessors, (370), 0 states have call successors, (0), 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:32,875 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 235 states, 234 states have (on average 1.5811965811965811) internal successors, (370), 234 states have internal predecessors, (370), 0 states have call successors, (0), 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:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:32,880 INFO L93 Difference]: Finished difference Result 237 states and 371 transitions. [2022-02-20 18:24:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 371 transitions. [2022-02-20 18:24:32,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:32,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:32,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 234 states have (on average 1.5811965811965811) internal successors, (370), 234 states have internal predecessors, (370), 0 states have call successors, (0), 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:32,881 INFO L87 Difference]: Start difference. First operand has 235 states, 234 states have (on average 1.5811965811965811) internal successors, (370), 234 states have internal predecessors, (370), 0 states have call successors, (0), 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:32,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:32,886 INFO L93 Difference]: Finished difference Result 237 states and 371 transitions. [2022-02-20 18:24:32,886 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 371 transitions. [2022-02-20 18:24:32,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:32,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:32,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:32,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:32,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.5811965811965811) internal successors, (370), 234 states have internal predecessors, (370), 0 states have call successors, (0), 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:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 370 transitions. [2022-02-20 18:24:32,892 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 370 transitions. Word has length 65 [2022-02-20 18:24:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:32,893 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 370 transitions. [2022-02-20 18:24:32,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 370 transitions. [2022-02-20 18:24:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:24:32,894 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:32,894 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:32,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:24:32,894 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:32,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:32,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1395779292, now seen corresponding path program 1 times [2022-02-20 18:24:32,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:32,895 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704240930] [2022-02-20 18:24:32,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:32,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:32,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {3576#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; {3576#true} is VALID [2022-02-20 18:24:32,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {3576#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; {3576#true} is VALID [2022-02-20 18:24:32,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {3576#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3576#true} is VALID [2022-02-20 18:24:32,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {3576#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3576#true} is VALID [2022-02-20 18:24:32,944 INFO L290 TraceCheckUtils]: 4: Hoare triple {3576#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3576#true} is VALID [2022-02-20 18:24:32,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {3576#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3576#true} is VALID [2022-02-20 18:24:32,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {3576#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {3576#true} is VALID [2022-02-20 18:24:32,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {3576#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3576#true} is VALID [2022-02-20 18:24:32,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {3576#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {3576#true} is VALID [2022-02-20 18:24:32,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {3576#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3576#true} is VALID [2022-02-20 18:24:32,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {3576#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {3576#true} is VALID [2022-02-20 18:24:32,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {3576#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3576#true} is VALID [2022-02-20 18:24:32,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {3576#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {3576#true} is VALID [2022-02-20 18:24:32,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {3576#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3576#true} is VALID [2022-02-20 18:24:32,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {3576#true} assume ~id1~0 != ~id2~0; {3576#true} is VALID [2022-02-20 18:24:32,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {3576#true} assume ~id1~0 != ~id3~0; {3576#true} is VALID [2022-02-20 18:24:32,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {3576#true} assume ~id2~0 != ~id3~0; {3576#true} is VALID [2022-02-20 18:24:32,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {3576#true} assume ~id1~0 >= 0; {3576#true} is VALID [2022-02-20 18:24:32,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {3576#true} assume ~id2~0 >= 0; {3576#true} is VALID [2022-02-20 18:24:32,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {3576#true} assume ~id3~0 >= 0; {3576#true} is VALID [2022-02-20 18:24:32,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {3576#true} assume 0 == ~r1~0; {3576#true} is VALID [2022-02-20 18:24:32,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {3576#true} assume 0 == ~r2~0; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {3578#(<= ~r2~0 0)} assume 0 == ~r3~0; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {3578#(<= ~r2~0 0)} assume 0 != init_~r122~0#1 % 256; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {3578#(<= ~r2~0 0)} assume 0 != init_~r132~0#1 % 256; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {3578#(<= ~r2~0 0)} assume 0 != init_~r212~0#1 % 256; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {3578#(<= ~r2~0 0)} assume 0 != init_~r232~0#1 % 256; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {3578#(<= ~r2~0 0)} assume 0 != init_~r312~0#1 % 256; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {3578#(<= ~r2~0 0)} assume 0 != init_~r322~0#1 % 256; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {3578#(<= ~r2~0 0)} assume ~max1~0 == ~id1~0; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {3578#(<= ~r2~0 0)} assume ~max2~0 == ~id2~0; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {3578#(<= ~r2~0 0)} assume ~max3~0 == ~id3~0; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {3578#(<= ~r2~0 0)} assume 0 == ~st1~0; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {3578#(<= ~r2~0 0)} assume 0 == ~st2~0; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {3578#(<= ~r2~0 0)} assume 0 == ~st3~0; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {3578#(<= ~r2~0 0)} assume 0 == ~nl1~0; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {3578#(<= ~r2~0 0)} assume 0 == ~nl2~0; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {3578#(<= ~r2~0 0)} assume 0 == ~nl3~0; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {3578#(<= ~r2~0 0)} assume 0 == ~mode1~0 % 256; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,952 INFO L290 TraceCheckUtils]: 39: Hoare triple {3578#(<= ~r2~0 0)} assume 0 == ~mode2~0 % 256; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,952 INFO L290 TraceCheckUtils]: 40: Hoare triple {3578#(<= ~r2~0 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,953 INFO L290 TraceCheckUtils]: 41: Hoare triple {3578#(<= ~r2~0 0)} init_#res#1 := init_~tmp___5~0#1; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,953 INFO L290 TraceCheckUtils]: 42: Hoare triple {3578#(<= ~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; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,953 INFO L290 TraceCheckUtils]: 43: Hoare triple {3578#(<= ~r2~0 0)} assume !(0 == main_~i2~0#1); {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,953 INFO L290 TraceCheckUtils]: 44: Hoare triple {3578#(<= ~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; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,954 INFO L290 TraceCheckUtils]: 45: Hoare triple {3578#(<= ~r2~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,954 INFO L290 TraceCheckUtils]: 46: Hoare triple {3578#(<= ~r2~0 0)} assume !(0 != ~mode1~0 % 256); {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,954 INFO L290 TraceCheckUtils]: 47: Hoare triple {3578#(<= ~r2~0 0)} assume ~r1~0 < 1; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {3578#(<= ~r2~0 0)} assume !(0 != ~ep12~0 % 256); {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,976 INFO L290 TraceCheckUtils]: 49: Hoare triple {3578#(<= ~r2~0 0)} assume !(0 != ~ep13~0 % 256); {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,977 INFO L290 TraceCheckUtils]: 50: Hoare triple {3578#(<= ~r2~0 0)} ~mode1~0 := 1; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,979 INFO L290 TraceCheckUtils]: 51: Hoare triple {3578#(<= ~r2~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,980 INFO L290 TraceCheckUtils]: 52: Hoare triple {3578#(<= ~r2~0 0)} assume !(0 != ~mode2~0 % 256); {3578#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:32,982 INFO L290 TraceCheckUtils]: 53: Hoare triple {3578#(<= ~r2~0 0)} assume !(~r2~0 < 2); {3577#false} is VALID [2022-02-20 18:24:32,982 INFO L290 TraceCheckUtils]: 54: Hoare triple {3577#false} ~mode2~0 := 1; {3577#false} is VALID [2022-02-20 18:24:32,983 INFO L290 TraceCheckUtils]: 55: Hoare triple {3577#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {3577#false} is VALID [2022-02-20 18:24:32,983 INFO L290 TraceCheckUtils]: 56: Hoare triple {3577#false} assume !(0 != ~mode3~0 % 256); {3577#false} is VALID [2022-02-20 18:24:32,983 INFO L290 TraceCheckUtils]: 57: Hoare triple {3577#false} assume !(~r3~0 < 2); {3577#false} is VALID [2022-02-20 18:24:32,983 INFO L290 TraceCheckUtils]: 58: Hoare triple {3577#false} ~mode3~0 := 1; {3577#false} is VALID [2022-02-20 18:24:32,983 INFO L290 TraceCheckUtils]: 59: Hoare triple {3577#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; {3577#false} is VALID [2022-02-20 18:24:32,983 INFO L290 TraceCheckUtils]: 60: Hoare triple {3577#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {3577#false} is VALID [2022-02-20 18:24:32,983 INFO L290 TraceCheckUtils]: 61: Hoare triple {3577#false} check_#res#1 := check_~tmp~1#1; {3577#false} is VALID [2022-02-20 18:24:32,983 INFO L290 TraceCheckUtils]: 62: Hoare triple {3577#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; {3577#false} is VALID [2022-02-20 18:24:32,984 INFO L290 TraceCheckUtils]: 63: Hoare triple {3577#false} assume 0 == assert_~arg#1 % 256; {3577#false} is VALID [2022-02-20 18:24:32,984 INFO L290 TraceCheckUtils]: 64: Hoare triple {3577#false} assume !false; {3577#false} is VALID [2022-02-20 18:24:32,986 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:32,986 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:32,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704240930] [2022-02-20 18:24:32,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704240930] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:32,986 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:32,986 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:32,986 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849799103] [2022-02-20 18:24:32,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:32,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:32,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:32,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:33,027 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:33,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:33,027 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:33,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:33,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:33,028 INFO L87 Difference]: Start difference. First operand 235 states and 370 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:33,348 INFO L93 Difference]: Finished difference Result 566 states and 917 transitions. [2022-02-20 18:24:33,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:33,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:33,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:33,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-02-20 18:24:33,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-02-20 18:24:33,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 416 transitions. [2022-02-20 18:24:33,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 416 edges. 416 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:33,589 INFO L225 Difference]: With dead ends: 566 [2022-02-20 18:24:33,589 INFO L226 Difference]: Without dead ends: 390 [2022-02-20 18:24:33,590 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:33,590 INFO L933 BasicCegarLoop]: 266 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, 428 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:33,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 428 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:33,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-02-20 18:24:33,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 388. [2022-02-20 18:24:33,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:33,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 390 states. Second operand has 388 states, 387 states have (on average 1.6020671834625324) internal successors, (620), 387 states have internal predecessors, (620), 0 states have call successors, (0), 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:33,628 INFO L74 IsIncluded]: Start isIncluded. First operand 390 states. Second operand has 388 states, 387 states have (on average 1.6020671834625324) internal successors, (620), 387 states have internal predecessors, (620), 0 states have call successors, (0), 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:33,628 INFO L87 Difference]: Start difference. First operand 390 states. Second operand has 388 states, 387 states have (on average 1.6020671834625324) internal successors, (620), 387 states have internal predecessors, (620), 0 states have call successors, (0), 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:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:33,637 INFO L93 Difference]: Finished difference Result 390 states and 621 transitions. [2022-02-20 18:24:33,637 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 621 transitions. [2022-02-20 18:24:33,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:33,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:33,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 388 states, 387 states have (on average 1.6020671834625324) internal successors, (620), 387 states have internal predecessors, (620), 0 states have call successors, (0), 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 390 states. [2022-02-20 18:24:33,640 INFO L87 Difference]: Start difference. First operand has 388 states, 387 states have (on average 1.6020671834625324) internal successors, (620), 387 states have internal predecessors, (620), 0 states have call successors, (0), 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 390 states. [2022-02-20 18:24:33,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:33,648 INFO L93 Difference]: Finished difference Result 390 states and 621 transitions. [2022-02-20 18:24:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 621 transitions. [2022-02-20 18:24:33,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:33,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:33,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:33,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 1.6020671834625324) internal successors, (620), 387 states have internal predecessors, (620), 0 states have call successors, (0), 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:33,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 620 transitions. [2022-02-20 18:24:33,657 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 620 transitions. Word has length 65 [2022-02-20 18:24:33,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:33,658 INFO L470 AbstractCegarLoop]: Abstraction has 388 states and 620 transitions. [2022-02-20 18:24:33,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 620 transitions. [2022-02-20 18:24:33,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:24:33,659 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:33,659 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, 1] [2022-02-20 18:24:33,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:24:33,659 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:33,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:33,660 INFO L85 PathProgramCache]: Analyzing trace with hash -812427391, now seen corresponding path program 1 times [2022-02-20 18:24:33,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:33,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471827989] [2022-02-20 18:24:33,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:33,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:33,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {5439#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; {5439#true} is VALID [2022-02-20 18:24:33,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {5439#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; {5439#true} is VALID [2022-02-20 18:24:33,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {5439#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {5439#true} is VALID [2022-02-20 18:24:33,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {5439#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {5439#true} is VALID [2022-02-20 18:24:33,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {5439#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {5439#true} is VALID [2022-02-20 18:24:33,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {5439#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {5439#true} is VALID [2022-02-20 18:24:33,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {5439#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {5439#true} is VALID [2022-02-20 18:24:33,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {5439#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {5439#true} is VALID [2022-02-20 18:24:33,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {5439#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {5439#true} is VALID [2022-02-20 18:24:33,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {5439#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {5439#true} is VALID [2022-02-20 18:24:33,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {5439#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {5439#true} is VALID [2022-02-20 18:24:33,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {5439#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {5439#true} is VALID [2022-02-20 18:24:33,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {5439#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {5439#true} is VALID [2022-02-20 18:24:33,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {5439#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {5439#true} is VALID [2022-02-20 18:24:33,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {5439#true} assume ~id1~0 != ~id2~0; {5439#true} is VALID [2022-02-20 18:24:33,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {5439#true} assume ~id1~0 != ~id3~0; {5439#true} is VALID [2022-02-20 18:24:33,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {5439#true} assume ~id2~0 != ~id3~0; {5439#true} is VALID [2022-02-20 18:24:33,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {5439#true} assume ~id1~0 >= 0; {5439#true} is VALID [2022-02-20 18:24:33,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {5439#true} assume ~id2~0 >= 0; {5439#true} is VALID [2022-02-20 18:24:33,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {5439#true} assume ~id3~0 >= 0; {5439#true} is VALID [2022-02-20 18:24:33,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {5439#true} assume 0 == ~r1~0; {5439#true} is VALID [2022-02-20 18:24:33,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {5439#true} assume 0 == ~r2~0; {5439#true} is VALID [2022-02-20 18:24:33,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {5439#true} assume 0 == ~r3~0; {5439#true} is VALID [2022-02-20 18:24:33,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {5439#true} assume 0 != init_~r122~0#1 % 256; {5439#true} is VALID [2022-02-20 18:24:33,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {5439#true} assume 0 != init_~r132~0#1 % 256; {5439#true} is VALID [2022-02-20 18:24:33,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {5439#true} assume 0 != init_~r212~0#1 % 256; {5439#true} is VALID [2022-02-20 18:24:33,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {5439#true} assume 0 != init_~r232~0#1 % 256; {5439#true} is VALID [2022-02-20 18:24:33,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {5439#true} assume 0 != init_~r312~0#1 % 256; {5439#true} is VALID [2022-02-20 18:24:33,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {5439#true} assume 0 != init_~r322~0#1 % 256; {5439#true} is VALID [2022-02-20 18:24:33,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {5439#true} assume ~max1~0 == ~id1~0; {5439#true} is VALID [2022-02-20 18:24:33,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {5439#true} assume ~max2~0 == ~id2~0; {5439#true} is VALID [2022-02-20 18:24:33,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {5439#true} assume ~max3~0 == ~id3~0; {5439#true} is VALID [2022-02-20 18:24:33,708 INFO L290 TraceCheckUtils]: 32: Hoare triple {5439#true} assume 0 == ~st1~0; {5439#true} is VALID [2022-02-20 18:24:33,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {5439#true} assume 0 == ~st2~0; {5439#true} is VALID [2022-02-20 18:24:33,708 INFO L290 TraceCheckUtils]: 34: Hoare triple {5439#true} assume 0 == ~st3~0; {5439#true} is VALID [2022-02-20 18:24:33,709 INFO L290 TraceCheckUtils]: 35: Hoare triple {5439#true} assume 0 == ~nl1~0; {5439#true} is VALID [2022-02-20 18:24:33,709 INFO L290 TraceCheckUtils]: 36: Hoare triple {5439#true} assume 0 == ~nl2~0; {5439#true} is VALID [2022-02-20 18:24:33,709 INFO L290 TraceCheckUtils]: 37: Hoare triple {5439#true} assume 0 == ~nl3~0; {5439#true} is VALID [2022-02-20 18:24:33,709 INFO L290 TraceCheckUtils]: 38: Hoare triple {5439#true} assume 0 == ~mode1~0 % 256; {5439#true} is VALID [2022-02-20 18:24:33,709 INFO L290 TraceCheckUtils]: 39: Hoare triple {5439#true} assume 0 == ~mode2~0 % 256; {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:33,710 INFO L290 TraceCheckUtils]: 40: Hoare triple {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:33,710 INFO L290 TraceCheckUtils]: 41: Hoare triple {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:33,710 INFO L290 TraceCheckUtils]: 42: Hoare triple {5441#(= (+ (* (- 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; {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:33,711 INFO L290 TraceCheckUtils]: 43: Hoare triple {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == main_~i2~0#1); {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:33,711 INFO L290 TraceCheckUtils]: 44: Hoare triple {5441#(= (+ (* (- 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; {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:33,712 INFO L290 TraceCheckUtils]: 45: Hoare triple {5441#(= (+ (* (- 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; {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:33,712 INFO L290 TraceCheckUtils]: 46: Hoare triple {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:33,712 INFO L290 TraceCheckUtils]: 47: Hoare triple {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 < 1; {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:33,713 INFO L290 TraceCheckUtils]: 48: Hoare triple {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep12~0 % 256); {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:33,713 INFO L290 TraceCheckUtils]: 49: Hoare triple {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep13~0 % 256); {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:33,713 INFO L290 TraceCheckUtils]: 50: Hoare triple {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:33,714 INFO L290 TraceCheckUtils]: 51: Hoare triple {5441#(= (+ (* (- 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; {5441#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:33,714 INFO L290 TraceCheckUtils]: 52: Hoare triple {5441#(= (+ (* (- 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); {5440#false} is VALID [2022-02-20 18:24:33,714 INFO L290 TraceCheckUtils]: 53: Hoare triple {5440#false} assume !(0 != ~ep12~0 % 256); {5440#false} is VALID [2022-02-20 18:24:33,714 INFO L290 TraceCheckUtils]: 54: Hoare triple {5440#false} assume !(0 != ~ep32~0 % 256); {5440#false} is VALID [2022-02-20 18:24:33,715 INFO L290 TraceCheckUtils]: 55: Hoare triple {5440#false} assume !(2 == ~r2~0); {5440#false} is VALID [2022-02-20 18:24:33,715 INFO L290 TraceCheckUtils]: 56: Hoare triple {5440#false} ~mode2~0 := 0; {5440#false} is VALID [2022-02-20 18:24:33,715 INFO L290 TraceCheckUtils]: 57: Hoare triple {5440#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {5440#false} is VALID [2022-02-20 18:24:33,715 INFO L290 TraceCheckUtils]: 58: Hoare triple {5440#false} assume !(0 != ~mode3~0 % 256); {5440#false} is VALID [2022-02-20 18:24:33,715 INFO L290 TraceCheckUtils]: 59: Hoare triple {5440#false} assume !(~r3~0 < 2); {5440#false} is VALID [2022-02-20 18:24:33,715 INFO L290 TraceCheckUtils]: 60: Hoare triple {5440#false} ~mode3~0 := 1; {5440#false} is VALID [2022-02-20 18:24:33,715 INFO L290 TraceCheckUtils]: 61: Hoare triple {5440#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; {5440#false} is VALID [2022-02-20 18:24:33,715 INFO L290 TraceCheckUtils]: 62: Hoare triple {5440#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {5440#false} is VALID [2022-02-20 18:24:33,716 INFO L290 TraceCheckUtils]: 63: Hoare triple {5440#false} check_#res#1 := check_~tmp~1#1; {5440#false} is VALID [2022-02-20 18:24:33,716 INFO L290 TraceCheckUtils]: 64: Hoare triple {5440#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; {5440#false} is VALID [2022-02-20 18:24:33,716 INFO L290 TraceCheckUtils]: 65: Hoare triple {5440#false} assume 0 == assert_~arg#1 % 256; {5440#false} is VALID [2022-02-20 18:24:33,716 INFO L290 TraceCheckUtils]: 66: Hoare triple {5440#false} assume !false; {5440#false} is VALID [2022-02-20 18:24:33,716 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:33,716 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:33,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471827989] [2022-02-20 18:24:33,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471827989] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:33,717 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:33,717 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:33,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359710074] [2022-02-20 18:24:33,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:33,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:24:33,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:33,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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:33,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:33,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:33,753 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:33,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:33,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:33,754 INFO L87 Difference]: Start difference. First operand 388 states and 620 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:34,029 INFO L93 Difference]: Finished difference Result 705 states and 1143 transitions. [2022-02-20 18:24:34,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:34,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:24:34,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:34,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-02-20 18:24:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-02-20 18:24:34,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 403 transitions. [2022-02-20 18:24:34,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 403 edges. 403 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:34,277 INFO L225 Difference]: With dead ends: 705 [2022-02-20 18:24:34,277 INFO L226 Difference]: Without dead ends: 529 [2022-02-20 18:24:34,277 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:34,278 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 96 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 427 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:34,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 427 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:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-02-20 18:24:34,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 527. [2022-02-20 18:24:34,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:34,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 529 states. Second operand has 527 states, 526 states have (on average 1.6064638783269962) internal successors, (845), 526 states have internal predecessors, (845), 0 states have call successors, (0), 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,312 INFO L74 IsIncluded]: Start isIncluded. First operand 529 states. Second operand has 527 states, 526 states have (on average 1.6064638783269962) internal successors, (845), 526 states have internal predecessors, (845), 0 states have call successors, (0), 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,313 INFO L87 Difference]: Start difference. First operand 529 states. Second operand has 527 states, 526 states have (on average 1.6064638783269962) internal successors, (845), 526 states have internal predecessors, (845), 0 states have call successors, (0), 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,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:34,324 INFO L93 Difference]: Finished difference Result 529 states and 846 transitions. [2022-02-20 18:24:34,324 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 846 transitions. [2022-02-20 18:24:34,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:34,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:34,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 527 states, 526 states have (on average 1.6064638783269962) internal successors, (845), 526 states have internal predecessors, (845), 0 states have call successors, (0), 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 529 states. [2022-02-20 18:24:34,326 INFO L87 Difference]: Start difference. First operand has 527 states, 526 states have (on average 1.6064638783269962) internal successors, (845), 526 states have internal predecessors, (845), 0 states have call successors, (0), 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 529 states. [2022-02-20 18:24:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:34,338 INFO L93 Difference]: Finished difference Result 529 states and 846 transitions. [2022-02-20 18:24:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 846 transitions. [2022-02-20 18:24:34,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:34,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:34,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:34,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.6064638783269962) internal successors, (845), 526 states have internal predecessors, (845), 0 states have call successors, (0), 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,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 845 transitions. [2022-02-20 18:24:34,351 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 845 transitions. Word has length 67 [2022-02-20 18:24:34,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:34,352 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 845 transitions. [2022-02-20 18:24:34,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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,352 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 845 transitions. [2022-02-20 18:24:34,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:24:34,353 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:34,353 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, 1] [2022-02-20 18:24:34,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:24:34,353 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:34,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:34,353 INFO L85 PathProgramCache]: Analyzing trace with hash 221435787, now seen corresponding path program 1 times [2022-02-20 18:24:34,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:34,354 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629874141] [2022-02-20 18:24:34,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:34,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:34,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {7908#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; {7908#true} is VALID [2022-02-20 18:24:34,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {7908#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; {7908#true} is VALID [2022-02-20 18:24:34,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {7908#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {7908#true} is VALID [2022-02-20 18:24:34,402 INFO L290 TraceCheckUtils]: 3: Hoare triple {7908#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {7908#true} is VALID [2022-02-20 18:24:34,402 INFO L290 TraceCheckUtils]: 4: Hoare triple {7908#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {7908#true} is VALID [2022-02-20 18:24:34,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {7908#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {7908#true} is VALID [2022-02-20 18:24:34,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {7908#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {7908#true} is VALID [2022-02-20 18:24:34,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {7908#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {7908#true} is VALID [2022-02-20 18:24:34,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {7908#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {7908#true} is VALID [2022-02-20 18:24:34,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {7908#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {7908#true} is VALID [2022-02-20 18:24:34,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {7908#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {7908#true} is VALID [2022-02-20 18:24:34,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {7908#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {7908#true} is VALID [2022-02-20 18:24:34,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {7908#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {7908#true} is VALID [2022-02-20 18:24:34,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {7908#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {7908#true} is VALID [2022-02-20 18:24:34,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {7908#true} assume ~id1~0 != ~id2~0; {7908#true} is VALID [2022-02-20 18:24:34,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {7908#true} assume ~id1~0 != ~id3~0; {7908#true} is VALID [2022-02-20 18:24:34,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {7908#true} assume ~id2~0 != ~id3~0; {7908#true} is VALID [2022-02-20 18:24:34,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {7908#true} assume ~id1~0 >= 0; {7908#true} is VALID [2022-02-20 18:24:34,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {7908#true} assume ~id2~0 >= 0; {7908#true} is VALID [2022-02-20 18:24:34,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {7908#true} assume ~id3~0 >= 0; {7908#true} is VALID [2022-02-20 18:24:34,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {7908#true} assume 0 == ~r1~0; {7908#true} is VALID [2022-02-20 18:24:34,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {7908#true} assume 0 == ~r2~0; {7908#true} is VALID [2022-02-20 18:24:34,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {7908#true} assume 0 == ~r3~0; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {7910#(<= ~r3~0 0)} assume 0 != init_~r122~0#1 % 256; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {7910#(<= ~r3~0 0)} assume 0 != init_~r132~0#1 % 256; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {7910#(<= ~r3~0 0)} assume 0 != init_~r212~0#1 % 256; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {7910#(<= ~r3~0 0)} assume 0 != init_~r232~0#1 % 256; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {7910#(<= ~r3~0 0)} assume 0 != init_~r312~0#1 % 256; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {7910#(<= ~r3~0 0)} assume 0 != init_~r322~0#1 % 256; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {7910#(<= ~r3~0 0)} assume ~max1~0 == ~id1~0; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,407 INFO L290 TraceCheckUtils]: 30: Hoare triple {7910#(<= ~r3~0 0)} assume ~max2~0 == ~id2~0; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {7910#(<= ~r3~0 0)} assume ~max3~0 == ~id3~0; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {7910#(<= ~r3~0 0)} assume 0 == ~st1~0; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {7910#(<= ~r3~0 0)} assume 0 == ~st2~0; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,408 INFO L290 TraceCheckUtils]: 34: Hoare triple {7910#(<= ~r3~0 0)} assume 0 == ~st3~0; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,409 INFO L290 TraceCheckUtils]: 35: Hoare triple {7910#(<= ~r3~0 0)} assume 0 == ~nl1~0; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,409 INFO L290 TraceCheckUtils]: 36: Hoare triple {7910#(<= ~r3~0 0)} assume 0 == ~nl2~0; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,409 INFO L290 TraceCheckUtils]: 37: Hoare triple {7910#(<= ~r3~0 0)} assume 0 == ~nl3~0; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {7910#(<= ~r3~0 0)} assume 0 == ~mode1~0 % 256; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {7910#(<= ~r3~0 0)} assume 0 == ~mode2~0 % 256; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {7910#(<= ~r3~0 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,412 INFO L290 TraceCheckUtils]: 41: Hoare triple {7910#(<= ~r3~0 0)} init_#res#1 := init_~tmp___5~0#1; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,413 INFO L290 TraceCheckUtils]: 42: Hoare triple {7910#(<= ~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; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,418 INFO L290 TraceCheckUtils]: 43: Hoare triple {7910#(<= ~r3~0 0)} assume !(0 == main_~i2~0#1); {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,418 INFO L290 TraceCheckUtils]: 44: Hoare triple {7910#(<= ~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; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,418 INFO L290 TraceCheckUtils]: 45: Hoare triple {7910#(<= ~r3~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {7910#(<= ~r3~0 0)} assume !(0 != ~mode1~0 % 256); {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,419 INFO L290 TraceCheckUtils]: 47: Hoare triple {7910#(<= ~r3~0 0)} assume ~r1~0 < 1; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {7910#(<= ~r3~0 0)} assume !(0 != ~ep12~0 % 256); {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,420 INFO L290 TraceCheckUtils]: 49: Hoare triple {7910#(<= ~r3~0 0)} assume !(0 != ~ep13~0 % 256); {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,420 INFO L290 TraceCheckUtils]: 50: Hoare triple {7910#(<= ~r3~0 0)} ~mode1~0 := 1; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,420 INFO L290 TraceCheckUtils]: 51: Hoare triple {7910#(<= ~r3~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,420 INFO L290 TraceCheckUtils]: 52: Hoare triple {7910#(<= ~r3~0 0)} assume !(0 != ~mode2~0 % 256); {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {7910#(<= ~r3~0 0)} assume ~r2~0 < 2; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,421 INFO L290 TraceCheckUtils]: 54: Hoare triple {7910#(<= ~r3~0 0)} assume !(0 != ~ep21~0 % 256); {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,421 INFO L290 TraceCheckUtils]: 55: Hoare triple {7910#(<= ~r3~0 0)} assume !(0 != ~ep23~0 % 256); {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,422 INFO L290 TraceCheckUtils]: 56: Hoare triple {7910#(<= ~r3~0 0)} ~mode2~0 := 1; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,422 INFO L290 TraceCheckUtils]: 57: Hoare triple {7910#(<= ~r3~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,422 INFO L290 TraceCheckUtils]: 58: Hoare triple {7910#(<= ~r3~0 0)} assume !(0 != ~mode3~0 % 256); {7910#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:34,422 INFO L290 TraceCheckUtils]: 59: Hoare triple {7910#(<= ~r3~0 0)} assume !(~r3~0 < 2); {7909#false} is VALID [2022-02-20 18:24:34,423 INFO L290 TraceCheckUtils]: 60: Hoare triple {7909#false} ~mode3~0 := 1; {7909#false} is VALID [2022-02-20 18:24:34,423 INFO L290 TraceCheckUtils]: 61: Hoare triple {7909#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; {7909#false} is VALID [2022-02-20 18:24:34,423 INFO L290 TraceCheckUtils]: 62: Hoare triple {7909#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {7909#false} is VALID [2022-02-20 18:24:34,423 INFO L290 TraceCheckUtils]: 63: Hoare triple {7909#false} check_#res#1 := check_~tmp~1#1; {7909#false} is VALID [2022-02-20 18:24:34,423 INFO L290 TraceCheckUtils]: 64: Hoare triple {7909#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; {7909#false} is VALID [2022-02-20 18:24:34,423 INFO L290 TraceCheckUtils]: 65: Hoare triple {7909#false} assume 0 == assert_~arg#1 % 256; {7909#false} is VALID [2022-02-20 18:24:34,423 INFO L290 TraceCheckUtils]: 66: Hoare triple {7909#false} assume !false; {7909#false} is VALID [2022-02-20 18:24:34,423 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:34,424 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:34,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629874141] [2022-02-20 18:24:34,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629874141] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:34,424 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:34,424 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:34,424 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495651164] [2022-02-20 18:24:34,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:34,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:24:34,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:34,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:34,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:34,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:34,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:34,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:34,461 INFO L87 Difference]: Start difference. First operand 527 states and 845 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:34,820 INFO L93 Difference]: Finished difference Result 1380 states and 2236 transitions. [2022-02-20 18:24:34,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:34,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:24:34,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-02-20 18:24:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-02-20 18:24:34,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 416 transitions. [2022-02-20 18:24:35,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 416 edges. 416 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:35,123 INFO L225 Difference]: With dead ends: 1380 [2022-02-20 18:24:35,124 INFO L226 Difference]: Without dead ends: 922 [2022-02-20 18:24:35,124 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:35,125 INFO L933 BasicCegarLoop]: 252 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, 415 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:35,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 415 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:35,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2022-02-20 18:24:35,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 920. [2022-02-20 18:24:35,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:35,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 922 states. Second operand has 920 states, 919 states have (on average 1.601741022850925) internal successors, (1472), 919 states have internal predecessors, (1472), 0 states have call successors, (0), 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:35,218 INFO L74 IsIncluded]: Start isIncluded. First operand 922 states. Second operand has 920 states, 919 states have (on average 1.601741022850925) internal successors, (1472), 919 states have internal predecessors, (1472), 0 states have call successors, (0), 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:35,219 INFO L87 Difference]: Start difference. First operand 922 states. Second operand has 920 states, 919 states have (on average 1.601741022850925) internal successors, (1472), 919 states have internal predecessors, (1472), 0 states have call successors, (0), 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:35,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:35,250 INFO L93 Difference]: Finished difference Result 922 states and 1473 transitions. [2022-02-20 18:24:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1473 transitions. [2022-02-20 18:24:35,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:35,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:35,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 920 states, 919 states have (on average 1.601741022850925) internal successors, (1472), 919 states have internal predecessors, (1472), 0 states have call successors, (0), 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 922 states. [2022-02-20 18:24:35,254 INFO L87 Difference]: Start difference. First operand has 920 states, 919 states have (on average 1.601741022850925) internal successors, (1472), 919 states have internal predecessors, (1472), 0 states have call successors, (0), 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 922 states. [2022-02-20 18:24:35,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:35,282 INFO L93 Difference]: Finished difference Result 922 states and 1473 transitions. [2022-02-20 18:24:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1473 transitions. [2022-02-20 18:24:35,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:35,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:35,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:35,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:35,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 919 states have (on average 1.601741022850925) internal successors, (1472), 919 states have internal predecessors, (1472), 0 states have call successors, (0), 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:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1472 transitions. [2022-02-20 18:24:35,316 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1472 transitions. Word has length 67 [2022-02-20 18:24:35,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:35,317 INFO L470 AbstractCegarLoop]: Abstraction has 920 states and 1472 transitions. [2022-02-20 18:24:35,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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:35,317 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1472 transitions. [2022-02-20 18:24:35,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:24:35,318 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:35,318 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, 1, 1, 1] [2022-02-20 18:24:35,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:24:35,318 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:35,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:35,319 INFO L85 PathProgramCache]: Analyzing trace with hash 664156592, now seen corresponding path program 1 times [2022-02-20 18:24:35,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:35,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555841019] [2022-02-20 18:24:35,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:35,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:35,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {12423#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; {12423#true} is VALID [2022-02-20 18:24:35,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {12423#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; {12423#true} is VALID [2022-02-20 18:24:35,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {12423#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {12423#true} is VALID [2022-02-20 18:24:35,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {12423#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {12423#true} is VALID [2022-02-20 18:24:35,360 INFO L290 TraceCheckUtils]: 4: Hoare triple {12423#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {12423#true} is VALID [2022-02-20 18:24:35,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {12423#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {12423#true} is VALID [2022-02-20 18:24:35,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {12423#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {12423#true} is VALID [2022-02-20 18:24:35,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {12423#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {12423#true} is VALID [2022-02-20 18:24:35,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {12423#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {12423#true} is VALID [2022-02-20 18:24:35,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {12423#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {12423#true} is VALID [2022-02-20 18:24:35,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {12423#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {12423#true} is VALID [2022-02-20 18:24:35,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {12423#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {12423#true} is VALID [2022-02-20 18:24:35,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {12423#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {12423#true} is VALID [2022-02-20 18:24:35,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {12423#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {12423#true} is VALID [2022-02-20 18:24:35,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {12423#true} assume ~id1~0 != ~id2~0; {12423#true} is VALID [2022-02-20 18:24:35,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {12423#true} assume ~id1~0 != ~id3~0; {12423#true} is VALID [2022-02-20 18:24:35,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {12423#true} assume ~id2~0 != ~id3~0; {12423#true} is VALID [2022-02-20 18:24:35,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {12423#true} assume ~id1~0 >= 0; {12423#true} is VALID [2022-02-20 18:24:35,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {12423#true} assume ~id2~0 >= 0; {12423#true} is VALID [2022-02-20 18:24:35,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {12423#true} assume ~id3~0 >= 0; {12423#true} is VALID [2022-02-20 18:24:35,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {12423#true} assume 0 == ~r1~0; {12423#true} is VALID [2022-02-20 18:24:35,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {12423#true} assume 0 == ~r2~0; {12423#true} is VALID [2022-02-20 18:24:35,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {12423#true} assume 0 == ~r3~0; {12423#true} is VALID [2022-02-20 18:24:35,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {12423#true} assume 0 != init_~r122~0#1 % 256; {12423#true} is VALID [2022-02-20 18:24:35,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {12423#true} assume 0 != init_~r132~0#1 % 256; {12423#true} is VALID [2022-02-20 18:24:35,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {12423#true} assume 0 != init_~r212~0#1 % 256; {12423#true} is VALID [2022-02-20 18:24:35,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {12423#true} assume 0 != init_~r232~0#1 % 256; {12423#true} is VALID [2022-02-20 18:24:35,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {12423#true} assume 0 != init_~r312~0#1 % 256; {12423#true} is VALID [2022-02-20 18:24:35,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {12423#true} assume 0 != init_~r322~0#1 % 256; {12423#true} is VALID [2022-02-20 18:24:35,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {12423#true} assume ~max1~0 == ~id1~0; {12423#true} is VALID [2022-02-20 18:24:35,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {12423#true} assume ~max2~0 == ~id2~0; {12423#true} is VALID [2022-02-20 18:24:35,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {12423#true} assume ~max3~0 == ~id3~0; {12423#true} is VALID [2022-02-20 18:24:35,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {12423#true} assume 0 == ~st1~0; {12423#true} is VALID [2022-02-20 18:24:35,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {12423#true} assume 0 == ~st2~0; {12423#true} is VALID [2022-02-20 18:24:35,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {12423#true} assume 0 == ~st3~0; {12423#true} is VALID [2022-02-20 18:24:35,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {12423#true} assume 0 == ~nl1~0; {12423#true} is VALID [2022-02-20 18:24:35,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {12423#true} assume 0 == ~nl2~0; {12423#true} is VALID [2022-02-20 18:24:35,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {12423#true} assume 0 == ~nl3~0; {12423#true} is VALID [2022-02-20 18:24:35,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {12423#true} assume 0 == ~mode1~0 % 256; {12423#true} is VALID [2022-02-20 18:24:35,365 INFO L290 TraceCheckUtils]: 39: Hoare triple {12423#true} assume 0 == ~mode2~0 % 256; {12423#true} is VALID [2022-02-20 18:24:35,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {12423#true} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:35,368 INFO L290 TraceCheckUtils]: 41: Hoare triple {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:35,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {12425#(= (+ (* (- 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; {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:35,369 INFO L290 TraceCheckUtils]: 43: Hoare triple {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == main_~i2~0#1); {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:35,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {12425#(= (+ (* (- 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; {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:35,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {12425#(= (+ (* (- 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; {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:35,371 INFO L290 TraceCheckUtils]: 46: Hoare triple {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:35,371 INFO L290 TraceCheckUtils]: 47: Hoare triple {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 < 1; {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:35,372 INFO L290 TraceCheckUtils]: 48: Hoare triple {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep12~0 % 256); {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:35,372 INFO L290 TraceCheckUtils]: 49: Hoare triple {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep13~0 % 256); {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:35,373 INFO L290 TraceCheckUtils]: 50: Hoare triple {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:35,373 INFO L290 TraceCheckUtils]: 51: Hoare triple {12425#(= (+ (* (- 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; {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:35,374 INFO L290 TraceCheckUtils]: 52: Hoare triple {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:35,374 INFO L290 TraceCheckUtils]: 53: Hoare triple {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 < 2; {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:35,374 INFO L290 TraceCheckUtils]: 54: Hoare triple {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep21~0 % 256); {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:35,375 INFO L290 TraceCheckUtils]: 55: Hoare triple {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep23~0 % 256); {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:35,375 INFO L290 TraceCheckUtils]: 56: Hoare triple {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:35,376 INFO L290 TraceCheckUtils]: 57: Hoare triple {12425#(= (+ (* (- 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; {12425#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:35,376 INFO L290 TraceCheckUtils]: 58: Hoare triple {12425#(= (+ (* (- 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); {12424#false} is VALID [2022-02-20 18:24:35,376 INFO L290 TraceCheckUtils]: 59: Hoare triple {12424#false} assume !(0 != ~ep13~0 % 256); {12424#false} is VALID [2022-02-20 18:24:35,376 INFO L290 TraceCheckUtils]: 60: Hoare triple {12424#false} assume !(0 != ~ep23~0 % 256); {12424#false} is VALID [2022-02-20 18:24:35,376 INFO L290 TraceCheckUtils]: 61: Hoare triple {12424#false} assume !(2 == ~r3~0); {12424#false} is VALID [2022-02-20 18:24:35,377 INFO L290 TraceCheckUtils]: 62: Hoare triple {12424#false} ~mode3~0 := 0; {12424#false} is VALID [2022-02-20 18:24:35,377 INFO L290 TraceCheckUtils]: 63: Hoare triple {12424#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; {12424#false} is VALID [2022-02-20 18:24:35,377 INFO L290 TraceCheckUtils]: 64: Hoare triple {12424#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {12424#false} is VALID [2022-02-20 18:24:35,377 INFO L290 TraceCheckUtils]: 65: Hoare triple {12424#false} check_#res#1 := check_~tmp~1#1; {12424#false} is VALID [2022-02-20 18:24:35,377 INFO L290 TraceCheckUtils]: 66: Hoare triple {12424#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; {12424#false} is VALID [2022-02-20 18:24:35,377 INFO L290 TraceCheckUtils]: 67: Hoare triple {12424#false} assume 0 == assert_~arg#1 % 256; {12424#false} is VALID [2022-02-20 18:24:35,377 INFO L290 TraceCheckUtils]: 68: Hoare triple {12424#false} assume !false; {12424#false} is VALID [2022-02-20 18:24:35,378 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:35,378 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:35,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555841019] [2022-02-20 18:24:35,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555841019] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:35,378 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:35,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:35,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53573847] [2022-02-20 18:24:35,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:35,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-02-20 18:24:35,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:35,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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:35,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:35,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:35,420 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:35,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:35,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:35,421 INFO L87 Difference]: Start difference. First operand 920 states and 1472 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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:35,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:35,872 INFO L93 Difference]: Finished difference Result 1711 states and 2761 transitions. [2022-02-20 18:24:35,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:35,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-02-20 18:24:35,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-02-20 18:24:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-02-20 18:24:35,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 403 transitions. [2022-02-20 18:24:36,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 403 edges. 403 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:36,179 INFO L225 Difference]: With dead ends: 1711 [2022-02-20 18:24:36,180 INFO L226 Difference]: Without dead ends: 1253 [2022-02-20 18:24:36,181 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:36,181 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 90 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 413 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:36,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 413 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:36,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2022-02-20 18:24:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1251. [2022-02-20 18:24:36,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:36,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1253 states. Second operand has 1251 states, 1250 states have (on average 1.5968) internal successors, (1996), 1250 states have internal predecessors, (1996), 0 states have call successors, (0), 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,337 INFO L74 IsIncluded]: Start isIncluded. First operand 1253 states. Second operand has 1251 states, 1250 states have (on average 1.5968) internal successors, (1996), 1250 states have internal predecessors, (1996), 0 states have call successors, (0), 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,341 INFO L87 Difference]: Start difference. First operand 1253 states. Second operand has 1251 states, 1250 states have (on average 1.5968) internal successors, (1996), 1250 states have internal predecessors, (1996), 0 states have call successors, (0), 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,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:36,408 INFO L93 Difference]: Finished difference Result 1253 states and 1997 transitions. [2022-02-20 18:24:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1997 transitions. [2022-02-20 18:24:36,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:36,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:36,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 1251 states, 1250 states have (on average 1.5968) internal successors, (1996), 1250 states have internal predecessors, (1996), 0 states have call successors, (0), 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 1253 states. [2022-02-20 18:24:36,413 INFO L87 Difference]: Start difference. First operand has 1251 states, 1250 states have (on average 1.5968) internal successors, (1996), 1250 states have internal predecessors, (1996), 0 states have call successors, (0), 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 1253 states. [2022-02-20 18:24:36,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:36,462 INFO L93 Difference]: Finished difference Result 1253 states and 1997 transitions. [2022-02-20 18:24:36,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1997 transitions. [2022-02-20 18:24:36,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:36,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:36,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:36,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 1250 states have (on average 1.5968) internal successors, (1996), 1250 states have internal predecessors, (1996), 0 states have call successors, (0), 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,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1996 transitions. [2022-02-20 18:24:36,523 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1996 transitions. Word has length 69 [2022-02-20 18:24:36,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:36,523 INFO L470 AbstractCegarLoop]: Abstraction has 1251 states and 1996 transitions. [2022-02-20 18:24:36,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1996 transitions. [2022-02-20 18:24:36,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:24:36,526 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:36,526 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, 1, 1, 1] [2022-02-20 18:24:36,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:24:36,526 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:36,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:36,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1757720902, now seen corresponding path program 1 times [2022-02-20 18:24:36,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:36,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784082224] [2022-02-20 18:24:36,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:36,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:36,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {18408#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; {18408#true} is VALID [2022-02-20 18:24:36,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {18408#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; {18408#true} is VALID [2022-02-20 18:24:36,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {18408#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {18408#true} is VALID [2022-02-20 18:24:36,617 INFO L290 TraceCheckUtils]: 3: Hoare triple {18408#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {18408#true} is VALID [2022-02-20 18:24:36,617 INFO L290 TraceCheckUtils]: 4: Hoare triple {18408#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {18408#true} is VALID [2022-02-20 18:24:36,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {18408#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {18408#true} is VALID [2022-02-20 18:24:36,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {18408#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {18408#true} is VALID [2022-02-20 18:24:36,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {18408#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {18408#true} is VALID [2022-02-20 18:24:36,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {18408#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {18408#true} is VALID [2022-02-20 18:24:36,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {18408#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {18408#true} is VALID [2022-02-20 18:24:36,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {18408#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {18408#true} is VALID [2022-02-20 18:24:36,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {18408#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {18408#true} is VALID [2022-02-20 18:24:36,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {18408#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {18408#true} is VALID [2022-02-20 18:24:36,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {18408#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {18408#true} is VALID [2022-02-20 18:24:36,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {18408#true} assume ~id1~0 != ~id2~0; {18408#true} is VALID [2022-02-20 18:24:36,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {18408#true} assume ~id1~0 != ~id3~0; {18408#true} is VALID [2022-02-20 18:24:36,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {18408#true} assume ~id2~0 != ~id3~0; {18408#true} is VALID [2022-02-20 18:24:36,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {18408#true} assume ~id1~0 >= 0; {18408#true} is VALID [2022-02-20 18:24:36,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {18408#true} assume ~id2~0 >= 0; {18408#true} is VALID [2022-02-20 18:24:36,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {18408#true} assume ~id3~0 >= 0; {18408#true} is VALID [2022-02-20 18:24:36,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {18408#true} assume 0 == ~r1~0; {18408#true} is VALID [2022-02-20 18:24:36,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {18408#true} assume 0 == ~r2~0; {18408#true} is VALID [2022-02-20 18:24:36,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {18408#true} assume 0 == ~r3~0; {18408#true} is VALID [2022-02-20 18:24:36,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {18408#true} assume 0 != init_~r122~0#1 % 256; {18408#true} is VALID [2022-02-20 18:24:36,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {18408#true} assume 0 != init_~r132~0#1 % 256; {18408#true} is VALID [2022-02-20 18:24:36,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {18408#true} assume 0 != init_~r212~0#1 % 256; {18408#true} is VALID [2022-02-20 18:24:36,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {18408#true} assume 0 != init_~r232~0#1 % 256; {18408#true} is VALID [2022-02-20 18:24:36,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {18408#true} assume 0 != init_~r312~0#1 % 256; {18408#true} is VALID [2022-02-20 18:24:36,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {18408#true} assume 0 != init_~r322~0#1 % 256; {18408#true} is VALID [2022-02-20 18:24:36,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {18408#true} assume ~max1~0 == ~id1~0; {18408#true} is VALID [2022-02-20 18:24:36,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {18408#true} assume ~max2~0 == ~id2~0; {18408#true} is VALID [2022-02-20 18:24:36,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {18408#true} assume ~max3~0 == ~id3~0; {18408#true} is VALID [2022-02-20 18:24:36,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {18408#true} assume 0 == ~st1~0; {18410#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:36,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {18410#(<= ~st1~0 0)} assume 0 == ~st2~0; {18411#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,622 INFO L290 TraceCheckUtils]: 34: Hoare triple {18411#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,622 INFO L290 TraceCheckUtils]: 35: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,623 INFO L290 TraceCheckUtils]: 37: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,625 INFO L290 TraceCheckUtils]: 38: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,625 INFO L290 TraceCheckUtils]: 39: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,625 INFO L290 TraceCheckUtils]: 40: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,626 INFO L290 TraceCheckUtils]: 41: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,626 INFO L290 TraceCheckUtils]: 42: Hoare triple {18412#(<= (+ ~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; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,626 INFO L290 TraceCheckUtils]: 43: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~i2~0#1); {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,627 INFO L290 TraceCheckUtils]: 44: Hoare triple {18412#(<= (+ ~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; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,627 INFO L290 TraceCheckUtils]: 45: Hoare triple {18412#(<= (+ ~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; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,627 INFO L290 TraceCheckUtils]: 46: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,627 INFO L290 TraceCheckUtils]: 47: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 1; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,628 INFO L290 TraceCheckUtils]: 48: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,628 INFO L290 TraceCheckUtils]: 49: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,628 INFO L290 TraceCheckUtils]: 50: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,628 INFO L290 TraceCheckUtils]: 51: Hoare triple {18412#(<= (+ ~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; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,629 INFO L290 TraceCheckUtils]: 52: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,629 INFO L290 TraceCheckUtils]: 53: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 < 2; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,629 INFO L290 TraceCheckUtils]: 54: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,629 INFO L290 TraceCheckUtils]: 55: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,630 INFO L290 TraceCheckUtils]: 56: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,630 INFO L290 TraceCheckUtils]: 57: Hoare triple {18412#(<= (+ ~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; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,630 INFO L290 TraceCheckUtils]: 58: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,631 INFO L290 TraceCheckUtils]: 59: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 < 2; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,631 INFO L290 TraceCheckUtils]: 60: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,631 INFO L290 TraceCheckUtils]: 61: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,631 INFO L290 TraceCheckUtils]: 62: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,632 INFO L290 TraceCheckUtils]: 63: Hoare triple {18412#(<= (+ ~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; {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:36,632 INFO L290 TraceCheckUtils]: 64: Hoare triple {18412#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {18409#false} is VALID [2022-02-20 18:24:36,632 INFO L290 TraceCheckUtils]: 65: Hoare triple {18409#false} check_#res#1 := check_~tmp~1#1; {18409#false} is VALID [2022-02-20 18:24:36,632 INFO L290 TraceCheckUtils]: 66: Hoare triple {18409#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; {18409#false} is VALID [2022-02-20 18:24:36,632 INFO L290 TraceCheckUtils]: 67: Hoare triple {18409#false} assume 0 == assert_~arg#1 % 256; {18409#false} is VALID [2022-02-20 18:24:36,633 INFO L290 TraceCheckUtils]: 68: Hoare triple {18409#false} assume !false; {18409#false} is VALID [2022-02-20 18:24:36,633 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:36,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:36,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784082224] [2022-02-20 18:24:36,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784082224] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:36,633 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:36,634 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:24:36,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322321395] [2022-02-20 18:24:36,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:36,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-02-20 18:24:36,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:36,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:36,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:24:36,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:36,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:24:36,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:24:36,677 INFO L87 Difference]: Start difference. First operand 1251 states and 1996 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:40,347 INFO L93 Difference]: Finished difference Result 7020 states and 11356 transitions. [2022-02-20 18:24:40,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:24:40,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-02-20 18:24:40,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 901 transitions. [2022-02-20 18:24:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 901 transitions. [2022-02-20 18:24:40,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 901 transitions. [2022-02-20 18:24:40,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 901 edges. 901 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:42,223 INFO L225 Difference]: With dead ends: 7020 [2022-02-20 18:24:42,224 INFO L226 Difference]: Without dead ends: 5848 [2022-02-20 18:24:42,227 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:42,234 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 774 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:42,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [774 Valid, 1196 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:24:42,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5848 states. [2022-02-20 18:24:43,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5848 to 2385. [2022-02-20 18:24:43,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:43,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5848 states. Second operand has 2385 states, 2384 states have (on average 1.592281879194631) internal successors, (3796), 2384 states have internal predecessors, (3796), 0 states have call successors, (0), 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:43,468 INFO L74 IsIncluded]: Start isIncluded. First operand 5848 states. Second operand has 2385 states, 2384 states have (on average 1.592281879194631) internal successors, (3796), 2384 states have internal predecessors, (3796), 0 states have call successors, (0), 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:43,470 INFO L87 Difference]: Start difference. First operand 5848 states. Second operand has 2385 states, 2384 states have (on average 1.592281879194631) internal successors, (3796), 2384 states have internal predecessors, (3796), 0 states have call successors, (0), 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:44,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:44,403 INFO L93 Difference]: Finished difference Result 5848 states and 9345 transitions. [2022-02-20 18:24:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 5848 states and 9345 transitions. [2022-02-20 18:24:44,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:44,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:44,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 2385 states, 2384 states have (on average 1.592281879194631) internal successors, (3796), 2384 states have internal predecessors, (3796), 0 states have call successors, (0), 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 5848 states. [2022-02-20 18:24:44,439 INFO L87 Difference]: Start difference. First operand has 2385 states, 2384 states have (on average 1.592281879194631) internal successors, (3796), 2384 states have internal predecessors, (3796), 0 states have call successors, (0), 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 5848 states. [2022-02-20 18:24:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:45,384 INFO L93 Difference]: Finished difference Result 5848 states and 9345 transitions. [2022-02-20 18:24:45,384 INFO L276 IsEmpty]: Start isEmpty. Operand 5848 states and 9345 transitions. [2022-02-20 18:24:45,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:45,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:45,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:45,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 2384 states have (on average 1.592281879194631) internal successors, (3796), 2384 states have internal predecessors, (3796), 0 states have call successors, (0), 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:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 3796 transitions. [2022-02-20 18:24:45,593 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 3796 transitions. Word has length 69 [2022-02-20 18:24:45,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:45,594 INFO L470 AbstractCegarLoop]: Abstraction has 2385 states and 3796 transitions. [2022-02-20 18:24:45,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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:45,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 3796 transitions. [2022-02-20 18:24:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:24:45,594 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:45,595 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, 1, 1, 1, 1] [2022-02-20 18:24:45,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:24:45,595 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:45,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:45,595 INFO L85 PathProgramCache]: Analyzing trace with hash -577605759, now seen corresponding path program 1 times [2022-02-20 18:24:45,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:45,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794230766] [2022-02-20 18:24:45,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:45,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:45,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {41169#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; {41169#true} is VALID [2022-02-20 18:24:45,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {41169#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; {41169#true} is VALID [2022-02-20 18:24:45,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {41169#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {41169#true} is VALID [2022-02-20 18:24:45,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {41169#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {41169#true} is VALID [2022-02-20 18:24:45,637 INFO L290 TraceCheckUtils]: 4: Hoare triple {41169#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {41169#true} is VALID [2022-02-20 18:24:45,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {41169#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {41169#true} is VALID [2022-02-20 18:24:45,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {41169#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {41169#true} is VALID [2022-02-20 18:24:45,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {41169#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {41169#true} is VALID [2022-02-20 18:24:45,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {41169#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {41169#true} is VALID [2022-02-20 18:24:45,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {41169#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {41169#true} is VALID [2022-02-20 18:24:45,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {41169#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {41169#true} is VALID [2022-02-20 18:24:45,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {41169#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {41169#true} is VALID [2022-02-20 18:24:45,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {41169#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {41169#true} is VALID [2022-02-20 18:24:45,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {41169#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {41169#true} is VALID [2022-02-20 18:24:45,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {41169#true} assume ~id1~0 != ~id2~0; {41169#true} is VALID [2022-02-20 18:24:45,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {41169#true} assume ~id1~0 != ~id3~0; {41169#true} is VALID [2022-02-20 18:24:45,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {41169#true} assume ~id2~0 != ~id3~0; {41169#true} is VALID [2022-02-20 18:24:45,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {41169#true} assume ~id1~0 >= 0; {41169#true} is VALID [2022-02-20 18:24:45,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {41169#true} assume ~id2~0 >= 0; {41169#true} is VALID [2022-02-20 18:24:45,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {41169#true} assume ~id3~0 >= 0; {41169#true} is VALID [2022-02-20 18:24:45,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {41169#true} assume 0 == ~r1~0; {41169#true} is VALID [2022-02-20 18:24:45,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {41169#true} assume 0 == ~r2~0; {41169#true} is VALID [2022-02-20 18:24:45,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {41169#true} assume 0 == ~r3~0; {41169#true} is VALID [2022-02-20 18:24:45,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {41169#true} assume 0 != init_~r122~0#1 % 256; {41169#true} is VALID [2022-02-20 18:24:45,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {41169#true} assume 0 != init_~r132~0#1 % 256; {41169#true} is VALID [2022-02-20 18:24:45,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {41169#true} assume 0 != init_~r212~0#1 % 256; {41169#true} is VALID [2022-02-20 18:24:45,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {41169#true} assume 0 != init_~r232~0#1 % 256; {41169#true} is VALID [2022-02-20 18:24:45,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {41169#true} assume 0 != init_~r312~0#1 % 256; {41169#true} is VALID [2022-02-20 18:24:45,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {41169#true} assume 0 != init_~r322~0#1 % 256; {41169#true} is VALID [2022-02-20 18:24:45,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {41169#true} assume ~max1~0 == ~id1~0; {41169#true} is VALID [2022-02-20 18:24:45,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {41169#true} assume ~max2~0 == ~id2~0; {41169#true} is VALID [2022-02-20 18:24:45,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {41169#true} assume ~max3~0 == ~id3~0; {41169#true} is VALID [2022-02-20 18:24:45,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {41169#true} assume 0 == ~st1~0; {41171#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:45,640 INFO L290 TraceCheckUtils]: 33: Hoare triple {41171#(<= ~st1~0 0)} assume 0 == ~st2~0; {41171#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:45,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {41171#(<= ~st1~0 0)} assume 0 == ~st3~0; {41171#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:45,641 INFO L290 TraceCheckUtils]: 35: Hoare triple {41171#(<= ~st1~0 0)} assume 0 == ~nl1~0; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,641 INFO L290 TraceCheckUtils]: 36: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,641 INFO L290 TraceCheckUtils]: 37: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,642 INFO L290 TraceCheckUtils]: 39: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,642 INFO L290 TraceCheckUtils]: 40: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,642 INFO L290 TraceCheckUtils]: 41: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,642 INFO L290 TraceCheckUtils]: 42: Hoare triple {41172#(<= (+ ~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; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == main_~i2~0#1); {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,643 INFO L290 TraceCheckUtils]: 44: Hoare triple {41172#(<= (+ ~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; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,643 INFO L290 TraceCheckUtils]: 45: Hoare triple {41172#(<= (+ ~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; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,644 INFO L290 TraceCheckUtils]: 46: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,644 INFO L290 TraceCheckUtils]: 47: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 < 1; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,644 INFO L290 TraceCheckUtils]: 48: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,644 INFO L290 TraceCheckUtils]: 49: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,645 INFO L290 TraceCheckUtils]: 50: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,645 INFO L290 TraceCheckUtils]: 51: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,645 INFO L290 TraceCheckUtils]: 52: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,645 INFO L290 TraceCheckUtils]: 53: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 < 2; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,646 INFO L290 TraceCheckUtils]: 54: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,646 INFO L290 TraceCheckUtils]: 55: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,646 INFO L290 TraceCheckUtils]: 56: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,646 INFO L290 TraceCheckUtils]: 57: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,647 INFO L290 TraceCheckUtils]: 58: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,647 INFO L290 TraceCheckUtils]: 59: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 < 2; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,647 INFO L290 TraceCheckUtils]: 60: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,647 INFO L290 TraceCheckUtils]: 61: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,648 INFO L290 TraceCheckUtils]: 62: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,648 INFO L290 TraceCheckUtils]: 63: Hoare triple {41172#(<= (+ ~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; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,648 INFO L290 TraceCheckUtils]: 64: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {41172#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:45,649 INFO L290 TraceCheckUtils]: 65: Hoare triple {41172#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);check_~tmp~1#1 := 0; {41170#false} is VALID [2022-02-20 18:24:45,649 INFO L290 TraceCheckUtils]: 66: Hoare triple {41170#false} check_#res#1 := check_~tmp~1#1; {41170#false} is VALID [2022-02-20 18:24:45,649 INFO L290 TraceCheckUtils]: 67: Hoare triple {41170#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; {41170#false} is VALID [2022-02-20 18:24:45,649 INFO L290 TraceCheckUtils]: 68: Hoare triple {41170#false} assume 0 == assert_~arg#1 % 256; {41170#false} is VALID [2022-02-20 18:24:45,649 INFO L290 TraceCheckUtils]: 69: Hoare triple {41170#false} assume !false; {41170#false} is VALID [2022-02-20 18:24:45,649 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:45,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:45,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794230766] [2022-02-20 18:24:45,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794230766] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:45,650 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:45,650 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:24:45,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270717192] [2022-02-20 18:24:45,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:45,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:24:45,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:45,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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:45,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:45,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:24:45,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:45,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:24:45,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:24:45,693 INFO L87 Difference]: Start difference. First operand 2385 states and 3796 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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:50,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:50,721 INFO L93 Difference]: Finished difference Result 9047 states and 14463 transitions. [2022-02-20 18:24:50,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:24:50,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:24:50,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-02-20 18:24:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-02-20 18:24:50,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 547 transitions. [2022-02-20 18:24:51,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 547 edges. 547 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:52,693 INFO L225 Difference]: With dead ends: 9047 [2022-02-20 18:24:52,693 INFO L226 Difference]: Without dead ends: 6741 [2022-02-20 18:24:52,704 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:52,705 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 338 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 626 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:52,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 626 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:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6741 states. [2022-02-20 18:24:54,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6741 to 4544. [2022-02-20 18:24:54,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:54,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6741 states. Second operand has 4544 states, 4543 states have (on average 1.5844155844155845) internal successors, (7198), 4543 states have internal predecessors, (7198), 0 states have call successors, (0), 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:54,043 INFO L74 IsIncluded]: Start isIncluded. First operand 6741 states. Second operand has 4544 states, 4543 states have (on average 1.5844155844155845) internal successors, (7198), 4543 states have internal predecessors, (7198), 0 states have call successors, (0), 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:54,048 INFO L87 Difference]: Start difference. First operand 6741 states. Second operand has 4544 states, 4543 states have (on average 1.5844155844155845) internal successors, (7198), 4543 states have internal predecessors, (7198), 0 states have call successors, (0), 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:55,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:55,364 INFO L93 Difference]: Finished difference Result 6741 states and 10721 transitions. [2022-02-20 18:24:55,364 INFO L276 IsEmpty]: Start isEmpty. Operand 6741 states and 10721 transitions. [2022-02-20 18:24:55,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:55,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:55,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 4544 states, 4543 states have (on average 1.5844155844155845) internal successors, (7198), 4543 states have internal predecessors, (7198), 0 states have call successors, (0), 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 6741 states. [2022-02-20 18:24:55,380 INFO L87 Difference]: Start difference. First operand has 4544 states, 4543 states have (on average 1.5844155844155845) internal successors, (7198), 4543 states have internal predecessors, (7198), 0 states have call successors, (0), 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 6741 states. [2022-02-20 18:24:56,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:56,669 INFO L93 Difference]: Finished difference Result 6741 states and 10721 transitions. [2022-02-20 18:24:56,669 INFO L276 IsEmpty]: Start isEmpty. Operand 6741 states and 10721 transitions. [2022-02-20 18:24:56,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:56,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:56,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:56,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:56,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4544 states, 4543 states have (on average 1.5844155844155845) internal successors, (7198), 4543 states have internal predecessors, (7198), 0 states have call successors, (0), 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:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 7198 transitions. [2022-02-20 18:24:57,408 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 7198 transitions. Word has length 70 [2022-02-20 18:24:57,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:57,408 INFO L470 AbstractCegarLoop]: Abstraction has 4544 states and 7198 transitions. [2022-02-20 18:24:57,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 7198 transitions. [2022-02-20 18:24:57,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 18:24:57,409 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:57,409 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, 1, 1, 1, 1, 1] [2022-02-20 18:24:57,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:24:57,410 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:57,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:57,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1815229649, now seen corresponding path program 1 times [2022-02-20 18:24:57,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:57,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66303080] [2022-02-20 18:24:57,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:57,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:57,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {70626#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; {70626#true} is VALID [2022-02-20 18:24:57,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {70626#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; {70626#true} is VALID [2022-02-20 18:24:57,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {70626#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {70626#true} is VALID [2022-02-20 18:24:57,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {70626#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {70626#true} is VALID [2022-02-20 18:24:57,454 INFO L290 TraceCheckUtils]: 4: Hoare triple {70626#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {70626#true} is VALID [2022-02-20 18:24:57,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {70626#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {70626#true} is VALID [2022-02-20 18:24:57,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {70626#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {70626#true} is VALID [2022-02-20 18:24:57,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {70626#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {70626#true} is VALID [2022-02-20 18:24:57,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {70626#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {70626#true} is VALID [2022-02-20 18:24:57,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {70626#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {70626#true} is VALID [2022-02-20 18:24:57,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {70626#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {70626#true} is VALID [2022-02-20 18:24:57,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {70626#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {70626#true} is VALID [2022-02-20 18:24:57,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {70626#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {70626#true} is VALID [2022-02-20 18:24:57,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {70626#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {70626#true} is VALID [2022-02-20 18:24:57,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {70626#true} assume ~id1~0 != ~id2~0; {70626#true} is VALID [2022-02-20 18:24:57,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {70626#true} assume ~id1~0 != ~id3~0; {70626#true} is VALID [2022-02-20 18:24:57,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {70626#true} assume ~id2~0 != ~id3~0; {70626#true} is VALID [2022-02-20 18:24:57,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {70626#true} assume ~id1~0 >= 0; {70626#true} is VALID [2022-02-20 18:24:57,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {70626#true} assume ~id2~0 >= 0; {70626#true} is VALID [2022-02-20 18:24:57,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {70626#true} assume ~id3~0 >= 0; {70626#true} is VALID [2022-02-20 18:24:57,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {70626#true} assume 0 == ~r1~0; {70626#true} is VALID [2022-02-20 18:24:57,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {70626#true} assume 0 == ~r2~0; {70626#true} is VALID [2022-02-20 18:24:57,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {70626#true} assume 0 == ~r3~0; {70626#true} is VALID [2022-02-20 18:24:57,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {70626#true} assume 0 != init_~r122~0#1 % 256; {70626#true} is VALID [2022-02-20 18:24:57,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {70626#true} assume 0 != init_~r132~0#1 % 256; {70626#true} is VALID [2022-02-20 18:24:57,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {70626#true} assume 0 != init_~r212~0#1 % 256; {70626#true} is VALID [2022-02-20 18:24:57,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {70626#true} assume 0 != init_~r232~0#1 % 256; {70626#true} is VALID [2022-02-20 18:24:57,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {70626#true} assume 0 != init_~r312~0#1 % 256; {70626#true} is VALID [2022-02-20 18:24:57,457 INFO L290 TraceCheckUtils]: 28: Hoare triple {70626#true} assume 0 != init_~r322~0#1 % 256; {70626#true} is VALID [2022-02-20 18:24:57,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {70626#true} assume ~max1~0 == ~id1~0; {70626#true} is VALID [2022-02-20 18:24:57,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {70626#true} assume ~max2~0 == ~id2~0; {70626#true} is VALID [2022-02-20 18:24:57,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {70626#true} assume ~max3~0 == ~id3~0; {70626#true} is VALID [2022-02-20 18:24:57,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {70626#true} assume 0 == ~st1~0; {70626#true} is VALID [2022-02-20 18:24:57,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {70626#true} assume 0 == ~st2~0; {70628#(<= ~st2~0 0)} is VALID [2022-02-20 18:24:57,458 INFO L290 TraceCheckUtils]: 34: Hoare triple {70628#(<= ~st2~0 0)} assume 0 == ~st3~0; {70628#(<= ~st2~0 0)} is VALID [2022-02-20 18:24:57,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {70628#(<= ~st2~0 0)} assume 0 == ~nl1~0; {70628#(<= ~st2~0 0)} is VALID [2022-02-20 18:24:57,458 INFO L290 TraceCheckUtils]: 36: Hoare triple {70628#(<= ~st2~0 0)} assume 0 == ~nl2~0; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,459 INFO L290 TraceCheckUtils]: 39: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,460 INFO L290 TraceCheckUtils]: 42: Hoare triple {70629#(<= (+ ~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; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,460 INFO L290 TraceCheckUtils]: 43: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == main_~i2~0#1); {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {70629#(<= (+ ~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; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,461 INFO L290 TraceCheckUtils]: 45: Hoare triple {70629#(<= (+ ~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; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,461 INFO L290 TraceCheckUtils]: 46: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode1~0 % 256); {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,462 INFO L290 TraceCheckUtils]: 47: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 < 1; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,462 INFO L290 TraceCheckUtils]: 48: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep12~0 % 256); {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,462 INFO L290 TraceCheckUtils]: 49: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep13~0 % 256); {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,463 INFO L290 TraceCheckUtils]: 50: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,463 INFO L290 TraceCheckUtils]: 51: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,463 INFO L290 TraceCheckUtils]: 52: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode2~0 % 256); {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,463 INFO L290 TraceCheckUtils]: 53: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 < 2; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,464 INFO L290 TraceCheckUtils]: 54: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep21~0 % 256); {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,464 INFO L290 TraceCheckUtils]: 55: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep23~0 % 256); {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,464 INFO L290 TraceCheckUtils]: 56: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,465 INFO L290 TraceCheckUtils]: 57: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,465 INFO L290 TraceCheckUtils]: 58: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode3~0 % 256); {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,465 INFO L290 TraceCheckUtils]: 59: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 < 2; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,465 INFO L290 TraceCheckUtils]: 60: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep31~0 % 256); {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,466 INFO L290 TraceCheckUtils]: 61: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep32~0 % 256); {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,466 INFO L290 TraceCheckUtils]: 62: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,466 INFO L290 TraceCheckUtils]: 63: Hoare triple {70629#(<= (+ ~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; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,467 INFO L290 TraceCheckUtils]: 64: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,467 INFO L290 TraceCheckUtils]: 65: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {70629#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:57,467 INFO L290 TraceCheckUtils]: 66: Hoare triple {70629#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);check_~tmp~1#1 := 0; {70627#false} is VALID [2022-02-20 18:24:57,468 INFO L290 TraceCheckUtils]: 67: Hoare triple {70627#false} check_#res#1 := check_~tmp~1#1; {70627#false} is VALID [2022-02-20 18:24:57,468 INFO L290 TraceCheckUtils]: 68: Hoare triple {70627#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; {70627#false} is VALID [2022-02-20 18:24:57,468 INFO L290 TraceCheckUtils]: 69: Hoare triple {70627#false} assume 0 == assert_~arg#1 % 256; {70627#false} is VALID [2022-02-20 18:24:57,468 INFO L290 TraceCheckUtils]: 70: Hoare triple {70627#false} assume !false; {70627#false} is VALID [2022-02-20 18:24:57,468 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:57,468 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:57,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66303080] [2022-02-20 18:24:57,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66303080] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:57,469 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:57,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:24:57,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329954478] [2022-02-20 18:24:57,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:57,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-02-20 18:24:57,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:57,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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:57,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:57,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:24:57,513 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:57,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:24:57,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:24:57,514 INFO L87 Difference]: Start difference. First operand 4544 states and 7198 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:08,496 INFO L93 Difference]: Finished difference Result 14607 states and 23239 transitions. [2022-02-20 18:25:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:25:08,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-02-20 18:25:08,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:25:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-02-20 18:25:08,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-02-20 18:25:08,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 547 transitions. [2022-02-20 18:25:08,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 547 edges. 547 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:12,263 INFO L225 Difference]: With dead ends: 14607 [2022-02-20 18:25:12,264 INFO L226 Difference]: Without dead ends: 10142 [2022-02-20 18:25:12,268 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:12,268 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 336 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 623 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:12,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 623 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:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10142 states. [2022-02-20 18:25:15,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10142 to 7308. [2022-02-20 18:25:15,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:25:15,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10142 states. Second operand has 7308 states, 7307 states have (on average 1.574654440947037) internal successors, (11506), 7307 states have internal predecessors, (11506), 0 states have call successors, (0), 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:15,523 INFO L74 IsIncluded]: Start isIncluded. First operand 10142 states. Second operand has 7308 states, 7307 states have (on average 1.574654440947037) internal successors, (11506), 7307 states have internal predecessors, (11506), 0 states have call successors, (0), 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:15,530 INFO L87 Difference]: Start difference. First operand 10142 states. Second operand has 7308 states, 7307 states have (on average 1.574654440947037) internal successors, (11506), 7307 states have internal predecessors, (11506), 0 states have call successors, (0), 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:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:18,428 INFO L93 Difference]: Finished difference Result 10142 states and 16047 transitions. [2022-02-20 18:25:18,428 INFO L276 IsEmpty]: Start isEmpty. Operand 10142 states and 16047 transitions. [2022-02-20 18:25:18,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:18,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:18,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 7308 states, 7307 states have (on average 1.574654440947037) internal successors, (11506), 7307 states have internal predecessors, (11506), 0 states have call successors, (0), 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 10142 states. [2022-02-20 18:25:18,453 INFO L87 Difference]: Start difference. First operand has 7308 states, 7307 states have (on average 1.574654440947037) internal successors, (11506), 7307 states have internal predecessors, (11506), 0 states have call successors, (0), 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 10142 states. [2022-02-20 18:25:21,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:21,432 INFO L93 Difference]: Finished difference Result 10142 states and 16047 transitions. [2022-02-20 18:25:21,432 INFO L276 IsEmpty]: Start isEmpty. Operand 10142 states and 16047 transitions. [2022-02-20 18:25:21,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:21,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:21,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:25:21,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:25:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7308 states, 7307 states have (on average 1.574654440947037) internal successors, (11506), 7307 states have internal predecessors, (11506), 0 states have call successors, (0), 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:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7308 states to 7308 states and 11506 transitions. [2022-02-20 18:25:23,401 INFO L78 Accepts]: Start accepts. Automaton has 7308 states and 11506 transitions. Word has length 71 [2022-02-20 18:25:23,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:25:23,401 INFO L470 AbstractCegarLoop]: Abstraction has 7308 states and 11506 transitions. [2022-02-20 18:25:23,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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:23,402 INFO L276 IsEmpty]: Start isEmpty. Operand 7308 states and 11506 transitions. [2022-02-20 18:25:23,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:25:23,402 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:25:23,402 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, 1, 1, 1, 1, 1, 1] [2022-02-20 18:25:23,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:25:23,403 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:25:23,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:25:23,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1147279688, now seen corresponding path program 1 times [2022-02-20 18:25:23,403 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:25:23,403 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623055246] [2022-02-20 18:25:23,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:25:23,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:25:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:25:23,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {116703#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; {116703#true} is VALID [2022-02-20 18:25:23,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {116703#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; {116703#true} is VALID [2022-02-20 18:25:23,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {116703#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {116703#true} is VALID [2022-02-20 18:25:23,507 INFO L290 TraceCheckUtils]: 3: Hoare triple {116703#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {116703#true} is VALID [2022-02-20 18:25:23,507 INFO L290 TraceCheckUtils]: 4: Hoare triple {116703#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {116703#true} is VALID [2022-02-20 18:25:23,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {116703#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {116703#true} is VALID [2022-02-20 18:25:23,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {116703#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {116703#true} is VALID [2022-02-20 18:25:23,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {116703#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {116703#true} is VALID [2022-02-20 18:25:23,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {116703#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {116703#true} is VALID [2022-02-20 18:25:23,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {116703#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {116703#true} is VALID [2022-02-20 18:25:23,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {116703#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {116703#true} is VALID [2022-02-20 18:25:23,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {116703#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {116703#true} is VALID [2022-02-20 18:25:23,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {116703#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {116703#true} is VALID [2022-02-20 18:25:23,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {116703#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {116703#true} is VALID [2022-02-20 18:25:23,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {116703#true} assume ~id1~0 != ~id2~0; {116703#true} is VALID [2022-02-20 18:25:23,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {116703#true} assume ~id1~0 != ~id3~0; {116703#true} is VALID [2022-02-20 18:25:23,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {116703#true} assume ~id2~0 != ~id3~0; {116703#true} is VALID [2022-02-20 18:25:23,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {116703#true} assume ~id1~0 >= 0; {116703#true} is VALID [2022-02-20 18:25:23,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {116703#true} assume ~id2~0 >= 0; {116703#true} is VALID [2022-02-20 18:25:23,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {116703#true} assume ~id3~0 >= 0; {116703#true} is VALID [2022-02-20 18:25:23,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {116703#true} assume 0 == ~r1~0; {116703#true} is VALID [2022-02-20 18:25:23,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {116703#true} assume 0 == ~r2~0; {116703#true} is VALID [2022-02-20 18:25:23,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {116703#true} assume 0 == ~r3~0; {116703#true} is VALID [2022-02-20 18:25:23,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {116703#true} assume 0 != init_~r122~0#1 % 256; {116703#true} is VALID [2022-02-20 18:25:23,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {116703#true} assume 0 != init_~r132~0#1 % 256; {116703#true} is VALID [2022-02-20 18:25:23,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {116703#true} assume 0 != init_~r212~0#1 % 256; {116703#true} is VALID [2022-02-20 18:25:23,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {116703#true} assume 0 != init_~r232~0#1 % 256; {116703#true} is VALID [2022-02-20 18:25:23,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {116703#true} assume 0 != init_~r312~0#1 % 256; {116703#true} is VALID [2022-02-20 18:25:23,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {116703#true} assume 0 != init_~r322~0#1 % 256; {116703#true} is VALID [2022-02-20 18:25:23,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {116703#true} assume ~max1~0 == ~id1~0; {116703#true} is VALID [2022-02-20 18:25:23,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {116703#true} assume ~max2~0 == ~id2~0; {116703#true} is VALID [2022-02-20 18:25:23,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {116703#true} assume ~max3~0 == ~id3~0; {116703#true} is VALID [2022-02-20 18:25:23,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {116703#true} assume 0 == ~st1~0; {116703#true} is VALID [2022-02-20 18:25:23,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {116703#true} assume 0 == ~st2~0; {116703#true} is VALID [2022-02-20 18:25:23,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {116703#true} assume 0 == ~st3~0; {116705#(<= ~st3~0 0)} is VALID [2022-02-20 18:25:23,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {116705#(<= ~st3~0 0)} assume 0 == ~nl1~0; {116705#(<= ~st3~0 0)} is VALID [2022-02-20 18:25:23,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {116705#(<= ~st3~0 0)} assume 0 == ~nl2~0; {116705#(<= ~st3~0 0)} is VALID [2022-02-20 18:25:23,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {116705#(<= ~st3~0 0)} assume 0 == ~nl3~0; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,512 INFO L290 TraceCheckUtils]: 40: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,513 INFO L290 TraceCheckUtils]: 41: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {116706#(<= (+ ~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; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,513 INFO L290 TraceCheckUtils]: 43: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == main_~i2~0#1); {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {116706#(<= (+ ~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; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,514 INFO L290 TraceCheckUtils]: 45: Hoare triple {116706#(<= (+ ~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; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,514 INFO L290 TraceCheckUtils]: 46: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode1~0 % 256); {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,515 INFO L290 TraceCheckUtils]: 47: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 < 1; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,515 INFO L290 TraceCheckUtils]: 48: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep12~0 % 256); {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,515 INFO L290 TraceCheckUtils]: 49: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep13~0 % 256); {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,516 INFO L290 TraceCheckUtils]: 50: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,516 INFO L290 TraceCheckUtils]: 51: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,516 INFO L290 TraceCheckUtils]: 52: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode2~0 % 256); {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,517 INFO L290 TraceCheckUtils]: 53: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 < 2; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,517 INFO L290 TraceCheckUtils]: 54: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep21~0 % 256); {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,517 INFO L290 TraceCheckUtils]: 55: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep23~0 % 256); {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,518 INFO L290 TraceCheckUtils]: 56: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,518 INFO L290 TraceCheckUtils]: 57: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,518 INFO L290 TraceCheckUtils]: 58: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode3~0 % 256); {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,519 INFO L290 TraceCheckUtils]: 59: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 < 2; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,519 INFO L290 TraceCheckUtils]: 60: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep31~0 % 256); {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,519 INFO L290 TraceCheckUtils]: 61: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep32~0 % 256); {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,520 INFO L290 TraceCheckUtils]: 62: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,520 INFO L290 TraceCheckUtils]: 63: Hoare triple {116706#(<= (+ ~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; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,520 INFO L290 TraceCheckUtils]: 64: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,521 INFO L290 TraceCheckUtils]: 65: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,521 INFO L290 TraceCheckUtils]: 66: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {116706#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:23,522 INFO L290 TraceCheckUtils]: 67: Hoare triple {116706#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);check_~tmp~1#1 := 0; {116704#false} is VALID [2022-02-20 18:25:23,522 INFO L290 TraceCheckUtils]: 68: Hoare triple {116704#false} check_#res#1 := check_~tmp~1#1; {116704#false} is VALID [2022-02-20 18:25:23,522 INFO L290 TraceCheckUtils]: 69: Hoare triple {116704#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; {116704#false} is VALID [2022-02-20 18:25:23,522 INFO L290 TraceCheckUtils]: 70: Hoare triple {116704#false} assume 0 == assert_~arg#1 % 256; {116704#false} is VALID [2022-02-20 18:25:23,522 INFO L290 TraceCheckUtils]: 71: Hoare triple {116704#false} assume !false; {116704#false} is VALID [2022-02-20 18:25:23,522 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:25:23,522 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:25:23,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623055246] [2022-02-20 18:25:23,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623055246] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:25:23,523 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:25:23,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:25:23,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120834861] [2022-02-20 18:25:23,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:25:23,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:25:23,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:25:23,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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:23,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:23,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:25:23,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:25:23,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:25:23,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:25:23,571 INFO L87 Difference]: Start difference. First operand 7308 states and 11506 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)