./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_overflow.ufo.UNBOUNDED.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_overflow.ufo.UNBOUNDED.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 c9bc953af286e9cfd29d104859de67d32500c9606def6c78f8ad113aab301f45 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:24:46,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:24:46,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:24:46,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:24:46,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:24:46,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:24:46,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:24:46,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:24:46,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:24:46,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:24:46,113 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:24:46,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:24:46,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:24:46,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:24:46,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:24:46,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:24:46,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:24:46,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:24:46,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:24:46,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:24:46,131 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:24:46,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:24:46,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:24:46,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:24:46,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:24:46,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:24:46,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:24:46,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:24:46,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:24:46,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:24:46,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:24:46,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:24:46,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:24:46,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:24:46,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:24:46,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:24:46,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:24:46,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:24:46,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:24:46,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:24:46,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:24:46,152 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:46,184 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:24:46,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:24:46,185 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:24:46,185 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:24:46,186 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:24:46,186 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:24:46,187 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:24:46,187 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:24:46,187 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:24:46,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:24:46,188 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:24:46,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:24:46,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:24:46,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:24:46,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:24:46,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:24:46,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:24:46,189 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:24:46,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:24:46,190 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:24:46,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:24:46,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:24:46,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:24:46,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:24:46,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:24:46,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:24:46,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:24:46,191 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:24:46,192 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:24:46,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:24:46,192 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:24:46,192 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:24:46,193 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:24:46,193 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 -> c9bc953af286e9cfd29d104859de67d32500c9606def6c78f8ad113aab301f45 [2022-02-20 18:24:46,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:24:46,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:24:46,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:24:46,446 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:24:46,447 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:24:46,448 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2022-02-20 18:24:46,508 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cbc53aa4/8efedf089c4847a88da3c53e40276988/FLAG2cca332cb [2022-02-20 18:24:46,946 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:24:46,947 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2022-02-20 18:24:46,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cbc53aa4/8efedf089c4847a88da3c53e40276988/FLAG2cca332cb [2022-02-20 18:24:46,971 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cbc53aa4/8efedf089c4847a88da3c53e40276988 [2022-02-20 18:24:46,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:24:46,974 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:24:46,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:24:46,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:24:46,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:24:46,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:24:46" (1/1) ... [2022-02-20 18:24:46,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37392094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:46, skipping insertion in model container [2022-02-20 18:24:46,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:24:46" (1/1) ... [2022-02-20 18:24:46,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:24:47,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:24:47,276 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_overflow.ufo.UNBOUNDED.pals.c[12924,12937] [2022-02-20 18:24:47,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:24:47,285 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:24:47,357 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_overflow.ufo.UNBOUNDED.pals.c[12924,12937] [2022-02-20 18:24:47,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:24:47,381 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:24:47,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:47 WrapperNode [2022-02-20 18:24:47,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:24:47,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:24:47,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:24:47,384 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:24:47,390 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:47" (1/1) ... [2022-02-20 18:24:47,412 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:47" (1/1) ... [2022-02-20 18:24:47,467 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 437 [2022-02-20 18:24:47,467 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:24:47,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:24:47,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:24:47,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:24:47,475 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:47" (1/1) ... [2022-02-20 18:24:47,475 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:47" (1/1) ... [2022-02-20 18:24:47,481 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:47" (1/1) ... [2022-02-20 18:24:47,482 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:47" (1/1) ... [2022-02-20 18:24:47,492 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:47" (1/1) ... [2022-02-20 18:24:47,520 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:47" (1/1) ... [2022-02-20 18:24:47,522 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:47" (1/1) ... [2022-02-20 18:24:47,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:24:47,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:24:47,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:24:47,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:24:47,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:47" (1/1) ... [2022-02-20 18:24:47,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:24:47,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:24:47,560 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:47,586 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:47,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:24:47,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:24:47,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:24:47,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:24:47,720 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:24:47,721 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:24:48,326 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:24:48,332 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:24:48,340 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:24:48,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:24:48 BoogieIcfgContainer [2022-02-20 18:24:48,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:24:48,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:24:48,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:24:48,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:24:48,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:24:46" (1/3) ... [2022-02-20 18:24:48,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c52ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:24:48, skipping insertion in model container [2022-02-20 18:24:48,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:47" (2/3) ... [2022-02-20 18:24:48,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c52ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:24:48, skipping insertion in model container [2022-02-20 18:24:48,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:24:48" (3/3) ... [2022-02-20 18:24:48,364 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2022-02-20 18:24:48,368 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:24:48,368 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:24:48,416 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:24:48,422 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:48,423 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:24:48,464 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:48,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:24:48,471 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:48,472 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:48,473 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:48,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:48,477 INFO L85 PathProgramCache]: Analyzing trace with hash -306716250, now seen corresponding path program 1 times [2022-02-20 18:24:48,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:48,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338756845] [2022-02-20 18:24:48,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:48,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:48,775 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(46, 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:48,776 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_~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;~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;~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;~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:48,777 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:48,777 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:48,777 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:48,778 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:48,778 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:48,778 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:48,779 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:48,783 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:48,783 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:48,783 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:48,784 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:48,784 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:48,784 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:48,784 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:48,785 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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {134#true} is VALID [2022-02-20 18:24:48,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {134#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {135#false} is VALID [2022-02-20 18:24:48,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {135#false} assume { :end_inline_assume_abort_if_not } true;~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:48,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {135#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {135#false} is VALID [2022-02-20 18:24:48,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {135#false} assume !(0 != ~mode1~0 % 256); {135#false} is VALID [2022-02-20 18:24:48,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {135#false} assume !(~r1~0 % 256 < 2); {135#false} is VALID [2022-02-20 18:24:48,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {135#false} ~mode1~0 := 1; {135#false} is VALID [2022-02-20 18:24:48,789 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:48,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {135#false} assume !(0 != ~mode2~0 % 256); {135#false} is VALID [2022-02-20 18:24:48,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {135#false} assume !(~r2~0 % 256 < 2); {135#false} is VALID [2022-02-20 18:24:48,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {135#false} ~mode2~0 := 1; {135#false} is VALID [2022-02-20 18:24:48,790 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:48,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {135#false} assume !(0 != ~mode3~0 % 256); {135#false} is VALID [2022-02-20 18:24:48,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {135#false} assume !(~r3~0 % 256 < 2); {135#false} is VALID [2022-02-20 18:24:48,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {135#false} ~mode3~0 := 1; {135#false} is VALID [2022-02-20 18:24:48,792 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:48,792 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:48,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {135#false} check_#res#1 := check_~tmp~1#1; {135#false} is VALID [2022-02-20 18:24:48,793 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:48,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {135#false} assume 0 == assert_~arg#1 % 256; {135#false} is VALID [2022-02-20 18:24:48,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {135#false} assume !false; {135#false} is VALID [2022-02-20 18:24:48,795 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:48,795 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:48,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338756845] [2022-02-20 18:24:48,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338756845] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:48,797 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:48,797 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:24:48,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92910949] [2022-02-20 18:24:48,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:48,808 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:48,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:48,814 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:48,860 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:48,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:24:48,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:48,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:24:48,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:24:48,894 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:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:49,085 INFO L93 Difference]: Finished difference Result 202 states and 349 transitions. [2022-02-20 18:24:49,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:24:49,086 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:49,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:49,087 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:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 349 transitions. [2022-02-20 18:24:49,094 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:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 349 transitions. [2022-02-20 18:24:49,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 349 transitions. [2022-02-20 18:24:49,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 349 edges. 349 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:49,449 INFO L225 Difference]: With dead ends: 202 [2022-02-20 18:24:49,449 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 18:24:49,452 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:49,454 INFO L933 BasicCegarLoop]: 220 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, 220 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:49,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 220 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:49,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 18:24:49,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-02-20 18:24:49,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:49,493 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:49,497 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:49,497 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:49,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:49,510 INFO L93 Difference]: Finished difference Result 127 states and 220 transitions. [2022-02-20 18:24:49,510 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 220 transitions. [2022-02-20 18:24:49,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:49,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:49,516 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:49,516 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:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:49,525 INFO L93 Difference]: Finished difference Result 127 states and 220 transitions. [2022-02-20 18:24:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 220 transitions. [2022-02-20 18:24:49,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:49,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:49,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:49,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:49,534 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:49,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 220 transitions. [2022-02-20 18:24:49,540 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 220 transitions. Word has length 37 [2022-02-20 18:24:49,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:49,540 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 220 transitions. [2022-02-20 18:24:49,540 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:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 220 transitions. [2022-02-20 18:24:49,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:24:49,543 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:49,543 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:49,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:24:49,544 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:49,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:49,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1124364700, now seen corresponding path program 1 times [2022-02-20 18:24:49,547 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:49,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740877182] [2022-02-20 18:24:49,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:49,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:49,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {748#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(46, 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; {748#true} is VALID [2022-02-20 18:24:49,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {748#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_~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;~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;~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;~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; {748#true} is VALID [2022-02-20 18:24:49,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {748#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {748#true} is VALID [2022-02-20 18:24:49,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {748#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {748#true} is VALID [2022-02-20 18:24:49,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {748#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {748#true} is VALID [2022-02-20 18:24:49,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {748#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {748#true} is VALID [2022-02-20 18:24:49,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {748#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {748#true} is VALID [2022-02-20 18:24:49,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {748#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {748#true} is VALID [2022-02-20 18:24:49,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {748#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {748#true} is VALID [2022-02-20 18:24:49,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {748#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {748#true} is VALID [2022-02-20 18:24:49,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {748#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {748#true} is VALID [2022-02-20 18:24:49,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {748#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {748#true} is VALID [2022-02-20 18:24:49,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {748#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {748#true} is VALID [2022-02-20 18:24:49,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {748#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {748#true} is VALID [2022-02-20 18:24:49,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {748#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {750#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-20 18:24:49,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {750#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {751#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:24:49,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {751#(= |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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {752#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:24:49,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {752#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {749#false} is VALID [2022-02-20 18:24:49,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {749#false} assume { :end_inline_assume_abort_if_not } true;~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; {749#false} is VALID [2022-02-20 18:24:49,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {749#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {749#false} is VALID [2022-02-20 18:24:49,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {749#false} assume !(0 != ~mode1~0 % 256); {749#false} is VALID [2022-02-20 18:24:49,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {749#false} assume !(~r1~0 % 256 < 2); {749#false} is VALID [2022-02-20 18:24:49,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {749#false} ~mode1~0 := 1; {749#false} is VALID [2022-02-20 18:24:49,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {749#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {749#false} is VALID [2022-02-20 18:24:49,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {749#false} assume !(0 != ~mode2~0 % 256); {749#false} is VALID [2022-02-20 18:24:49,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {749#false} assume !(~r2~0 % 256 < 2); {749#false} is VALID [2022-02-20 18:24:49,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {749#false} ~mode2~0 := 1; {749#false} is VALID [2022-02-20 18:24:49,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {749#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {749#false} is VALID [2022-02-20 18:24:49,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {749#false} assume !(0 != ~mode3~0 % 256); {749#false} is VALID [2022-02-20 18:24:49,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {749#false} assume !(~r3~0 % 256 < 2); {749#false} is VALID [2022-02-20 18:24:49,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {749#false} ~mode3~0 := 1; {749#false} is VALID [2022-02-20 18:24:49,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {749#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; {749#false} is VALID [2022-02-20 18:24:49,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {749#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {749#false} is VALID [2022-02-20 18:24:49,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {749#false} check_#res#1 := check_~tmp~1#1; {749#false} is VALID [2022-02-20 18:24:49,686 INFO L290 TraceCheckUtils]: 34: Hoare triple {749#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; {749#false} is VALID [2022-02-20 18:24:49,686 INFO L290 TraceCheckUtils]: 35: Hoare triple {749#false} assume 0 == assert_~arg#1 % 256; {749#false} is VALID [2022-02-20 18:24:49,687 INFO L290 TraceCheckUtils]: 36: Hoare triple {749#false} assume !false; {749#false} is VALID [2022-02-20 18:24:49,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:49,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:49,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740877182] [2022-02-20 18:24:49,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740877182] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:49,689 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:49,695 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:24:49,695 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834529183] [2022-02-20 18:24:49,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:49,698 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:49,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:49,699 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:49,724 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:49,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:24:49,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:49,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:24:49,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:24:49,727 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:50,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:50,176 INFO L93 Difference]: Finished difference Result 201 states and 342 transitions. [2022-02-20 18:24:50,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:24:50,176 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:50,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:50,177 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:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2022-02-20 18:24:50,181 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:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2022-02-20 18:24:50,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 342 transitions. [2022-02-20 18:24:50,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 342 edges. 342 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:50,443 INFO L225 Difference]: With dead ends: 201 [2022-02-20 18:24:50,443 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 18:24:50,444 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:50,445 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 3 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:50,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 842 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:50,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 18:24:50,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-02-20 18:24:50,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:50,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 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:50,452 INFO L74 IsIncluded]: Start isIncluded. First operand 127 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:50,453 INFO L87 Difference]: Start difference. First operand 127 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:50,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:50,457 INFO L93 Difference]: Finished difference Result 127 states and 193 transitions. [2022-02-20 18:24:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions. [2022-02-20 18:24:50,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:50,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:50,458 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 127 states. [2022-02-20 18:24:50,458 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 127 states. [2022-02-20 18:24:50,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:50,462 INFO L93 Difference]: Finished difference Result 127 states and 193 transitions. [2022-02-20 18:24:50,462 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions. [2022-02-20 18:24:50,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:50,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:50,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:50,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:50,463 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:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 193 transitions. [2022-02-20 18:24:50,467 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 193 transitions. Word has length 37 [2022-02-20 18:24:50,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:50,468 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 193 transitions. [2022-02-20 18:24:50,468 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:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions. [2022-02-20 18:24:50,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:24:50,469 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:50,470 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:50,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:24:50,470 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:50,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:50,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1313145683, now seen corresponding path program 1 times [2022-02-20 18:24:50,471 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:50,471 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267460585] [2022-02-20 18:24:50,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:50,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:50,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {1368#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(46, 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; {1368#true} is VALID [2022-02-20 18:24:50,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {1368#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_~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;~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;~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;~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; {1368#true} is VALID [2022-02-20 18:24:50,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {1368#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1368#true} is VALID [2022-02-20 18:24:50,606 INFO L290 TraceCheckUtils]: 3: Hoare triple {1368#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1368#true} is VALID [2022-02-20 18:24:50,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {1368#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1368#true} is VALID [2022-02-20 18:24:50,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {1368#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1368#true} is VALID [2022-02-20 18:24:50,607 INFO L290 TraceCheckUtils]: 6: Hoare triple {1368#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {1368#true} is VALID [2022-02-20 18:24:50,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {1368#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1368#true} is VALID [2022-02-20 18:24:50,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {1368#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {1368#true} is VALID [2022-02-20 18:24:50,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {1368#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1368#true} is VALID [2022-02-20 18:24:50,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {1368#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {1368#true} is VALID [2022-02-20 18:24:50,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {1368#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1368#true} is VALID [2022-02-20 18:24:50,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {1368#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {1368#true} is VALID [2022-02-20 18:24:50,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {1368#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1368#true} is VALID [2022-02-20 18:24:50,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {1368#true} assume ~id1~0 != ~id2~0; {1368#true} is VALID [2022-02-20 18:24:50,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {1368#true} assume ~id1~0 != ~id3~0; {1368#true} is VALID [2022-02-20 18:24:50,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {1368#true} assume ~id2~0 != ~id3~0; {1368#true} is VALID [2022-02-20 18:24:50,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {1368#true} assume ~id1~0 >= 0; {1368#true} is VALID [2022-02-20 18:24:50,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {1368#true} assume ~id2~0 >= 0; {1368#true} is VALID [2022-02-20 18:24:50,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {1368#true} assume ~id3~0 >= 0; {1368#true} is VALID [2022-02-20 18:24:50,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {1368#true} assume 0 == ~r1~0 % 256; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r2~0 % 256; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r3~0 % 256; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r122~0#1 % 256; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r132~0#1 % 256; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r212~0#1 % 256; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r232~0#1 % 256; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r312~0#1 % 256; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r322~0#1 % 256; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max1~0 == ~id1~0; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max2~0 == ~id2~0; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max3~0 == ~id3~0; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl1~0; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl2~0; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl3~0; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,621 INFO L290 TraceCheckUtils]: 39: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,621 INFO L290 TraceCheckUtils]: 40: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,622 INFO L290 TraceCheckUtils]: 41: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp___5~0#1; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,622 INFO L290 TraceCheckUtils]: 42: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,623 INFO L290 TraceCheckUtils]: 43: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,623 INFO L290 TraceCheckUtils]: 44: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~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; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,623 INFO L290 TraceCheckUtils]: 45: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,624 INFO L290 TraceCheckUtils]: 46: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:50,624 INFO L290 TraceCheckUtils]: 47: Hoare triple {1370#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 2); {1369#false} is VALID [2022-02-20 18:24:50,625 INFO L290 TraceCheckUtils]: 48: Hoare triple {1369#false} ~mode1~0 := 1; {1369#false} is VALID [2022-02-20 18:24:50,625 INFO L290 TraceCheckUtils]: 49: Hoare triple {1369#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {1369#false} is VALID [2022-02-20 18:24:50,625 INFO L290 TraceCheckUtils]: 50: Hoare triple {1369#false} assume !(0 != ~mode2~0 % 256); {1369#false} is VALID [2022-02-20 18:24:50,625 INFO L290 TraceCheckUtils]: 51: Hoare triple {1369#false} assume !(~r2~0 % 256 < 2); {1369#false} is VALID [2022-02-20 18:24:50,625 INFO L290 TraceCheckUtils]: 52: Hoare triple {1369#false} ~mode2~0 := 1; {1369#false} is VALID [2022-02-20 18:24:50,626 INFO L290 TraceCheckUtils]: 53: Hoare triple {1369#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {1369#false} is VALID [2022-02-20 18:24:50,626 INFO L290 TraceCheckUtils]: 54: Hoare triple {1369#false} assume !(0 != ~mode3~0 % 256); {1369#false} is VALID [2022-02-20 18:24:50,626 INFO L290 TraceCheckUtils]: 55: Hoare triple {1369#false} assume !(~r3~0 % 256 < 2); {1369#false} is VALID [2022-02-20 18:24:50,626 INFO L290 TraceCheckUtils]: 56: Hoare triple {1369#false} ~mode3~0 := 1; {1369#false} is VALID [2022-02-20 18:24:50,626 INFO L290 TraceCheckUtils]: 57: Hoare triple {1369#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; {1369#false} is VALID [2022-02-20 18:24:50,627 INFO L290 TraceCheckUtils]: 58: Hoare triple {1369#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1369#false} is VALID [2022-02-20 18:24:50,627 INFO L290 TraceCheckUtils]: 59: Hoare triple {1369#false} check_#res#1 := check_~tmp~1#1; {1369#false} is VALID [2022-02-20 18:24:50,627 INFO L290 TraceCheckUtils]: 60: Hoare triple {1369#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; {1369#false} is VALID [2022-02-20 18:24:50,627 INFO L290 TraceCheckUtils]: 61: Hoare triple {1369#false} assume 0 == assert_~arg#1 % 256; {1369#false} is VALID [2022-02-20 18:24:50,627 INFO L290 TraceCheckUtils]: 62: Hoare triple {1369#false} assume !false; {1369#false} is VALID [2022-02-20 18:24:50,628 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:50,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:50,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267460585] [2022-02-20 18:24:50,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267460585] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:50,629 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:50,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:50,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069990312] [2022-02-20 18:24:50,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:50,630 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:50,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:50,630 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:50,681 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:50,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:50,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:50,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:50,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:50,683 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:50,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:50,959 INFO L93 Difference]: Finished difference Result 258 states and 412 transitions. [2022-02-20 18:24:50,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:50,959 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:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:50,960 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:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2022-02-20 18:24:50,964 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:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2022-02-20 18:24:50,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 412 transitions. [2022-02-20 18:24:51,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 412 edges. 412 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:51,277 INFO L225 Difference]: With dead ends: 258 [2022-02-20 18:24:51,277 INFO L226 Difference]: Without dead ends: 188 [2022-02-20 18:24:51,278 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:51,279 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 93 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:51,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 421 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:51,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-02-20 18:24:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2022-02-20 18:24:51,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:51,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 186 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have 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:51,316 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 186 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have 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:51,317 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 186 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have 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:51,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:51,322 INFO L93 Difference]: Finished difference Result 188 states and 289 transitions. [2022-02-20 18:24:51,322 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 289 transitions. [2022-02-20 18:24:51,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:51,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:51,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 0 states have call successors, (0), 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 188 states. [2022-02-20 18:24:51,324 INFO L87 Difference]: Start difference. First operand has 186 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 0 states have call successors, (0), 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 188 states. [2022-02-20 18:24:51,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:51,329 INFO L93 Difference]: Finished difference Result 188 states and 289 transitions. [2022-02-20 18:24:51,329 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 289 transitions. [2022-02-20 18:24:51,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:51,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:51,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:51,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have 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:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 288 transitions. [2022-02-20 18:24:51,337 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 288 transitions. Word has length 63 [2022-02-20 18:24:51,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:51,338 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 288 transitions. [2022-02-20 18:24:51,338 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:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 288 transitions. [2022-02-20 18:24:51,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:24:51,339 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:51,339 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:51,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:24:51,339 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:51,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:51,340 INFO L85 PathProgramCache]: Analyzing trace with hash -255493166, now seen corresponding path program 1 times [2022-02-20 18:24:51,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:51,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720575322] [2022-02-20 18:24:51,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:51,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:51,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {2235#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(46, 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; {2235#true} is VALID [2022-02-20 18:24:51,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {2235#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_~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;~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;~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;~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; {2235#true} is VALID [2022-02-20 18:24:51,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {2235#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2235#true} is VALID [2022-02-20 18:24:51,440 INFO L290 TraceCheckUtils]: 3: Hoare triple {2235#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2235#true} is VALID [2022-02-20 18:24:51,441 INFO L290 TraceCheckUtils]: 4: Hoare triple {2235#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2235#true} is VALID [2022-02-20 18:24:51,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {2235#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2235#true} is VALID [2022-02-20 18:24:51,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {2235#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2235#true} is VALID [2022-02-20 18:24:51,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {2235#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2235#true} is VALID [2022-02-20 18:24:51,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {2235#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2235#true} is VALID [2022-02-20 18:24:51,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {2235#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2235#true} is VALID [2022-02-20 18:24:51,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {2235#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2235#true} is VALID [2022-02-20 18:24:51,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {2235#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2235#true} is VALID [2022-02-20 18:24:51,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {2235#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2235#true} is VALID [2022-02-20 18:24:51,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {2235#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2235#true} is VALID [2022-02-20 18:24:51,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {2235#true} assume ~id1~0 != ~id2~0; {2235#true} is VALID [2022-02-20 18:24:51,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {2235#true} assume ~id1~0 != ~id3~0; {2235#true} is VALID [2022-02-20 18:24:51,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {2235#true} assume ~id2~0 != ~id3~0; {2235#true} is VALID [2022-02-20 18:24:51,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {2235#true} assume ~id1~0 >= 0; {2235#true} is VALID [2022-02-20 18:24:51,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {2235#true} assume ~id2~0 >= 0; {2235#true} is VALID [2022-02-20 18:24:51,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {2235#true} assume ~id3~0 >= 0; {2235#true} is VALID [2022-02-20 18:24:51,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {2235#true} assume 0 == ~r1~0 % 256; {2235#true} is VALID [2022-02-20 18:24:51,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {2235#true} assume 0 == ~r2~0 % 256; {2235#true} is VALID [2022-02-20 18:24:51,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {2235#true} assume 0 == ~r3~0 % 256; {2235#true} is VALID [2022-02-20 18:24:51,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {2235#true} assume 0 != init_~r122~0#1 % 256; {2235#true} is VALID [2022-02-20 18:24:51,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {2235#true} assume 0 != init_~r132~0#1 % 256; {2235#true} is VALID [2022-02-20 18:24:51,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {2235#true} assume 0 != init_~r212~0#1 % 256; {2235#true} is VALID [2022-02-20 18:24:51,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {2235#true} assume 0 != init_~r232~0#1 % 256; {2235#true} is VALID [2022-02-20 18:24:51,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {2235#true} assume 0 != init_~r312~0#1 % 256; {2235#true} is VALID [2022-02-20 18:24:51,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {2235#true} assume 0 != init_~r322~0#1 % 256; {2235#true} is VALID [2022-02-20 18:24:51,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {2235#true} assume ~max1~0 == ~id1~0; {2235#true} is VALID [2022-02-20 18:24:51,448 INFO L290 TraceCheckUtils]: 30: Hoare triple {2235#true} assume ~max2~0 == ~id2~0; {2235#true} is VALID [2022-02-20 18:24:51,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {2235#true} assume ~max3~0 == ~id3~0; {2235#true} is VALID [2022-02-20 18:24:51,449 INFO L290 TraceCheckUtils]: 32: Hoare triple {2235#true} assume 0 == ~st1~0; {2235#true} is VALID [2022-02-20 18:24:51,449 INFO L290 TraceCheckUtils]: 33: Hoare triple {2235#true} assume 0 == ~st2~0; {2235#true} is VALID [2022-02-20 18:24:51,449 INFO L290 TraceCheckUtils]: 34: Hoare triple {2235#true} assume 0 == ~st3~0; {2235#true} is VALID [2022-02-20 18:24:51,449 INFO L290 TraceCheckUtils]: 35: Hoare triple {2235#true} assume 0 == ~nl1~0; {2235#true} is VALID [2022-02-20 18:24:51,450 INFO L290 TraceCheckUtils]: 36: Hoare triple {2235#true} assume 0 == ~nl2~0; {2235#true} is VALID [2022-02-20 18:24:51,450 INFO L290 TraceCheckUtils]: 37: Hoare triple {2235#true} assume 0 == ~nl3~0; {2235#true} is VALID [2022-02-20 18:24:51,450 INFO L290 TraceCheckUtils]: 38: Hoare triple {2235#true} assume 0 == ~mode1~0 % 256; {2237#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:51,452 INFO L290 TraceCheckUtils]: 39: Hoare triple {2237#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {2237#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:51,452 INFO L290 TraceCheckUtils]: 40: Hoare triple {2237#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {2237#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:51,453 INFO L290 TraceCheckUtils]: 41: Hoare triple {2237#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {2237#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:51,453 INFO L290 TraceCheckUtils]: 42: Hoare triple {2237#(= (+ (* (- 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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2237#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:51,454 INFO L290 TraceCheckUtils]: 43: Hoare triple {2237#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {2237#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:51,455 INFO L290 TraceCheckUtils]: 44: Hoare triple {2237#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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; {2237#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:51,455 INFO L290 TraceCheckUtils]: 45: Hoare triple {2237#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {2237#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:51,456 INFO L290 TraceCheckUtils]: 46: Hoare triple {2237#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256; {2236#false} is VALID [2022-02-20 18:24:51,456 INFO L290 TraceCheckUtils]: 47: Hoare triple {2236#false} assume !(0 != ~ep21~0 % 256); {2236#false} is VALID [2022-02-20 18:24:51,456 INFO L290 TraceCheckUtils]: 48: Hoare triple {2236#false} assume !(0 != ~ep31~0 % 256); {2236#false} is VALID [2022-02-20 18:24:51,456 INFO L290 TraceCheckUtils]: 49: Hoare triple {2236#false} assume !(2 == ~r1~0 % 256); {2236#false} is VALID [2022-02-20 18:24:51,456 INFO L290 TraceCheckUtils]: 50: Hoare triple {2236#false} ~mode1~0 := 0; {2236#false} is VALID [2022-02-20 18:24:51,457 INFO L290 TraceCheckUtils]: 51: Hoare triple {2236#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {2236#false} is VALID [2022-02-20 18:24:51,457 INFO L290 TraceCheckUtils]: 52: Hoare triple {2236#false} assume !(0 != ~mode2~0 % 256); {2236#false} is VALID [2022-02-20 18:24:51,457 INFO L290 TraceCheckUtils]: 53: Hoare triple {2236#false} assume !(~r2~0 % 256 < 2); {2236#false} is VALID [2022-02-20 18:24:51,458 INFO L290 TraceCheckUtils]: 54: Hoare triple {2236#false} ~mode2~0 := 1; {2236#false} is VALID [2022-02-20 18:24:51,458 INFO L290 TraceCheckUtils]: 55: Hoare triple {2236#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {2236#false} is VALID [2022-02-20 18:24:51,458 INFO L290 TraceCheckUtils]: 56: Hoare triple {2236#false} assume !(0 != ~mode3~0 % 256); {2236#false} is VALID [2022-02-20 18:24:51,458 INFO L290 TraceCheckUtils]: 57: Hoare triple {2236#false} assume !(~r3~0 % 256 < 2); {2236#false} is VALID [2022-02-20 18:24:51,458 INFO L290 TraceCheckUtils]: 58: Hoare triple {2236#false} ~mode3~0 := 1; {2236#false} is VALID [2022-02-20 18:24:51,459 INFO L290 TraceCheckUtils]: 59: Hoare triple {2236#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; {2236#false} is VALID [2022-02-20 18:24:51,459 INFO L290 TraceCheckUtils]: 60: Hoare triple {2236#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {2236#false} is VALID [2022-02-20 18:24:51,459 INFO L290 TraceCheckUtils]: 61: Hoare triple {2236#false} check_#res#1 := check_~tmp~1#1; {2236#false} is VALID [2022-02-20 18:24:51,459 INFO L290 TraceCheckUtils]: 62: Hoare triple {2236#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; {2236#false} is VALID [2022-02-20 18:24:51,459 INFO L290 TraceCheckUtils]: 63: Hoare triple {2236#false} assume 0 == assert_~arg#1 % 256; {2236#false} is VALID [2022-02-20 18:24:51,460 INFO L290 TraceCheckUtils]: 64: Hoare triple {2236#false} assume !false; {2236#false} is VALID [2022-02-20 18:24:51,462 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:51,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:51,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720575322] [2022-02-20 18:24:51,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720575322] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:51,463 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:51,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:51,464 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996639121] [2022-02-20 18:24:51,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:51,464 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:51,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:51,465 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:51,507 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:51,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:51,507 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:51,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:51,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:51,509 INFO L87 Difference]: Start difference. First operand 186 states and 288 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:51,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:51,781 INFO L93 Difference]: Finished difference Result 313 states and 501 transitions. [2022-02-20 18:24:51,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:51,781 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:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:51,782 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:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-02-20 18:24:51,786 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:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-02-20 18:24:51,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 403 transitions. [2022-02-20 18:24:52,108 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:52,112 INFO L225 Difference]: With dead ends: 313 [2022-02-20 18:24:52,112 INFO L226 Difference]: Without dead ends: 243 [2022-02-20 18:24:52,113 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:52,114 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:52,115 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:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-02-20 18:24:52,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2022-02-20 18:24:52,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:52,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand has 241 states, 240 states have (on average 1.5833333333333333) internal successors, (380), 240 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have 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:52,132 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand has 241 states, 240 states have (on average 1.5833333333333333) internal successors, (380), 240 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have 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:52,133 INFO L87 Difference]: Start difference. First operand 243 states. Second operand has 241 states, 240 states have (on average 1.5833333333333333) internal successors, (380), 240 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have 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:52,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:52,140 INFO L93 Difference]: Finished difference Result 243 states and 381 transitions. [2022-02-20 18:24:52,141 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 381 transitions. [2022-02-20 18:24:52,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:52,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:52,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 241 states, 240 states have (on average 1.5833333333333333) internal successors, (380), 240 states have internal predecessors, (380), 0 states have call successors, (0), 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 243 states. [2022-02-20 18:24:52,143 INFO L87 Difference]: Start difference. First operand has 241 states, 240 states have (on average 1.5833333333333333) internal successors, (380), 240 states have internal predecessors, (380), 0 states have call successors, (0), 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 243 states. [2022-02-20 18:24:52,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:52,151 INFO L93 Difference]: Finished difference Result 243 states and 381 transitions. [2022-02-20 18:24:52,151 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 381 transitions. [2022-02-20 18:24:52,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:52,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:52,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:52,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.5833333333333333) internal successors, (380), 240 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have 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:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 380 transitions. [2022-02-20 18:24:52,171 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 380 transitions. Word has length 65 [2022-02-20 18:24:52,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:52,172 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 380 transitions. [2022-02-20 18:24:52,172 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:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 380 transitions. [2022-02-20 18:24:52,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:24:52,174 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:52,174 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:52,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:24:52,175 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:52,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:52,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1395779292, now seen corresponding path program 1 times [2022-02-20 18:24:52,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:52,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123243819] [2022-02-20 18:24:52,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:52,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:52,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {3340#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(46, 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; {3340#true} is VALID [2022-02-20 18:24:52,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {3340#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_~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;~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;~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;~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; {3340#true} is VALID [2022-02-20 18:24:52,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {3340#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3340#true} is VALID [2022-02-20 18:24:52,274 INFO L290 TraceCheckUtils]: 3: Hoare triple {3340#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3340#true} is VALID [2022-02-20 18:24:52,274 INFO L290 TraceCheckUtils]: 4: Hoare triple {3340#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3340#true} is VALID [2022-02-20 18:24:52,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {3340#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3340#true} is VALID [2022-02-20 18:24:52,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {3340#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {3340#true} is VALID [2022-02-20 18:24:52,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {3340#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3340#true} is VALID [2022-02-20 18:24:52,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {3340#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {3340#true} is VALID [2022-02-20 18:24:52,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {3340#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3340#true} is VALID [2022-02-20 18:24:52,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {3340#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {3340#true} is VALID [2022-02-20 18:24:52,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {3340#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3340#true} is VALID [2022-02-20 18:24:52,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {3340#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {3340#true} is VALID [2022-02-20 18:24:52,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {3340#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3340#true} is VALID [2022-02-20 18:24:52,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {3340#true} assume ~id1~0 != ~id2~0; {3340#true} is VALID [2022-02-20 18:24:52,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {3340#true} assume ~id1~0 != ~id3~0; {3340#true} is VALID [2022-02-20 18:24:52,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {3340#true} assume ~id2~0 != ~id3~0; {3340#true} is VALID [2022-02-20 18:24:52,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {3340#true} assume ~id1~0 >= 0; {3340#true} is VALID [2022-02-20 18:24:52,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {3340#true} assume ~id2~0 >= 0; {3340#true} is VALID [2022-02-20 18:24:52,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {3340#true} assume ~id3~0 >= 0; {3340#true} is VALID [2022-02-20 18:24:52,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {3340#true} assume 0 == ~r1~0 % 256; {3340#true} is VALID [2022-02-20 18:24:52,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {3340#true} assume 0 == ~r2~0 % 256; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~r3~0 % 256; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r122~0#1 % 256; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r132~0#1 % 256; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r212~0#1 % 256; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r232~0#1 % 256; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r312~0#1 % 256; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r322~0#1 % 256; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max1~0 == ~id1~0; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max2~0 == ~id2~0; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,282 INFO L290 TraceCheckUtils]: 31: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max3~0 == ~id3~0; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,282 INFO L290 TraceCheckUtils]: 32: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st1~0; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,282 INFO L290 TraceCheckUtils]: 33: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st2~0; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,283 INFO L290 TraceCheckUtils]: 34: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st3~0; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,283 INFO L290 TraceCheckUtils]: 35: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl1~0; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl2~0; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl3~0; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode1~0 % 256; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,285 INFO L290 TraceCheckUtils]: 39: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode2~0 % 256; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,285 INFO L290 TraceCheckUtils]: 40: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,285 INFO L290 TraceCheckUtils]: 41: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} init_#res#1 := init_~tmp___5~0#1; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,286 INFO L290 TraceCheckUtils]: 42: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} 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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,286 INFO L290 TraceCheckUtils]: 43: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,286 INFO L290 TraceCheckUtils]: 44: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume { :end_inline_assume_abort_if_not } true;~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; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,287 INFO L290 TraceCheckUtils]: 45: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,287 INFO L290 TraceCheckUtils]: 46: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode1~0 % 256); {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,288 INFO L290 TraceCheckUtils]: 47: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~r1~0 % 256 < 2; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,288 INFO L290 TraceCheckUtils]: 48: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep12~0 % 256); {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,288 INFO L290 TraceCheckUtils]: 49: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep13~0 % 256); {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,289 INFO L290 TraceCheckUtils]: 50: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} ~mode1~0 := 1; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,289 INFO L290 TraceCheckUtils]: 51: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,289 INFO L290 TraceCheckUtils]: 52: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode2~0 % 256); {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:52,290 INFO L290 TraceCheckUtils]: 53: Hoare triple {3342#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(~r2~0 % 256 < 2); {3341#false} is VALID [2022-02-20 18:24:52,290 INFO L290 TraceCheckUtils]: 54: Hoare triple {3341#false} ~mode2~0 := 1; {3341#false} is VALID [2022-02-20 18:24:52,290 INFO L290 TraceCheckUtils]: 55: Hoare triple {3341#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {3341#false} is VALID [2022-02-20 18:24:52,290 INFO L290 TraceCheckUtils]: 56: Hoare triple {3341#false} assume !(0 != ~mode3~0 % 256); {3341#false} is VALID [2022-02-20 18:24:52,291 INFO L290 TraceCheckUtils]: 57: Hoare triple {3341#false} assume !(~r3~0 % 256 < 2); {3341#false} is VALID [2022-02-20 18:24:52,291 INFO L290 TraceCheckUtils]: 58: Hoare triple {3341#false} ~mode3~0 := 1; {3341#false} is VALID [2022-02-20 18:24:52,291 INFO L290 TraceCheckUtils]: 59: Hoare triple {3341#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; {3341#false} is VALID [2022-02-20 18:24:52,291 INFO L290 TraceCheckUtils]: 60: Hoare triple {3341#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {3341#false} is VALID [2022-02-20 18:24:52,291 INFO L290 TraceCheckUtils]: 61: Hoare triple {3341#false} check_#res#1 := check_~tmp~1#1; {3341#false} is VALID [2022-02-20 18:24:52,291 INFO L290 TraceCheckUtils]: 62: Hoare triple {3341#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; {3341#false} is VALID [2022-02-20 18:24:52,292 INFO L290 TraceCheckUtils]: 63: Hoare triple {3341#false} assume 0 == assert_~arg#1 % 256; {3341#false} is VALID [2022-02-20 18:24:52,292 INFO L290 TraceCheckUtils]: 64: Hoare triple {3341#false} assume !false; {3341#false} is VALID [2022-02-20 18:24:52,292 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:52,292 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:52,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123243819] [2022-02-20 18:24:52,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123243819] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:52,293 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:52,293 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:52,293 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569029445] [2022-02-20 18:24:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:52,294 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:52,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:52,294 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:52,340 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:52,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:52,340 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:52,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:52,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:52,341 INFO L87 Difference]: Start difference. First operand 241 states and 380 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:52,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:52,639 INFO L93 Difference]: Finished difference Result 584 states and 947 transitions. [2022-02-20 18:24:52,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:52,639 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:52,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:52,640 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:52,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-02-20 18:24:52,643 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:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-02-20 18:24:52,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 416 transitions. [2022-02-20 18:24:52,954 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:52,963 INFO L225 Difference]: With dead ends: 584 [2022-02-20 18:24:52,964 INFO L226 Difference]: Without dead ends: 402 [2022-02-20 18:24:52,964 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:52,965 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:52,966 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:52,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-02-20 18:24:53,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2022-02-20 18:24:53,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:53,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 402 states. Second operand has 400 states, 399 states have (on average 1.6040100250626566) internal successors, (640), 399 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have 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:53,005 INFO L74 IsIncluded]: Start isIncluded. First operand 402 states. Second operand has 400 states, 399 states have (on average 1.6040100250626566) internal successors, (640), 399 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have 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:53,006 INFO L87 Difference]: Start difference. First operand 402 states. Second operand has 400 states, 399 states have (on average 1.6040100250626566) internal successors, (640), 399 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have 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:53,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:53,018 INFO L93 Difference]: Finished difference Result 402 states and 641 transitions. [2022-02-20 18:24:53,018 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 641 transitions. [2022-02-20 18:24:53,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:53,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:53,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 399 states have (on average 1.6040100250626566) internal successors, (640), 399 states have internal predecessors, (640), 0 states have call successors, (0), 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 402 states. [2022-02-20 18:24:53,021 INFO L87 Difference]: Start difference. First operand has 400 states, 399 states have (on average 1.6040100250626566) internal successors, (640), 399 states have internal predecessors, (640), 0 states have call successors, (0), 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 402 states. [2022-02-20 18:24:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:53,034 INFO L93 Difference]: Finished difference Result 402 states and 641 transitions. [2022-02-20 18:24:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 641 transitions. [2022-02-20 18:24:53,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:53,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:53,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:53,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:53,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.6040100250626566) internal successors, (640), 399 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have 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:53,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 640 transitions. [2022-02-20 18:24:53,048 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 640 transitions. Word has length 65 [2022-02-20 18:24:53,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:53,049 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 640 transitions. [2022-02-20 18:24:53,049 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:53,049 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 640 transitions. [2022-02-20 18:24:53,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:24:53,050 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:53,050 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:53,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:24:53,050 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:53,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:53,051 INFO L85 PathProgramCache]: Analyzing trace with hash -812427391, now seen corresponding path program 1 times [2022-02-20 18:24:53,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:53,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485056882] [2022-02-20 18:24:53,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:53,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:53,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {5257#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(46, 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; {5257#true} is VALID [2022-02-20 18:24:53,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {5257#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_~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;~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;~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;~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; {5257#true} is VALID [2022-02-20 18:24:53,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {5257#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {5257#true} is VALID [2022-02-20 18:24:53,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {5257#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {5257#true} is VALID [2022-02-20 18:24:53,128 INFO L290 TraceCheckUtils]: 4: Hoare triple {5257#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {5257#true} is VALID [2022-02-20 18:24:53,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {5257#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {5257#true} is VALID [2022-02-20 18:24:53,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {5257#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {5257#true} is VALID [2022-02-20 18:24:53,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {5257#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {5257#true} is VALID [2022-02-20 18:24:53,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {5257#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {5257#true} is VALID [2022-02-20 18:24:53,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {5257#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {5257#true} is VALID [2022-02-20 18:24:53,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {5257#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {5257#true} is VALID [2022-02-20 18:24:53,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {5257#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {5257#true} is VALID [2022-02-20 18:24:53,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {5257#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {5257#true} is VALID [2022-02-20 18:24:53,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {5257#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {5257#true} is VALID [2022-02-20 18:24:53,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {5257#true} assume ~id1~0 != ~id2~0; {5257#true} is VALID [2022-02-20 18:24:53,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {5257#true} assume ~id1~0 != ~id3~0; {5257#true} is VALID [2022-02-20 18:24:53,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {5257#true} assume ~id2~0 != ~id3~0; {5257#true} is VALID [2022-02-20 18:24:53,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {5257#true} assume ~id1~0 >= 0; {5257#true} is VALID [2022-02-20 18:24:53,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {5257#true} assume ~id2~0 >= 0; {5257#true} is VALID [2022-02-20 18:24:53,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {5257#true} assume ~id3~0 >= 0; {5257#true} is VALID [2022-02-20 18:24:53,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {5257#true} assume 0 == ~r1~0 % 256; {5257#true} is VALID [2022-02-20 18:24:53,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {5257#true} assume 0 == ~r2~0 % 256; {5257#true} is VALID [2022-02-20 18:24:53,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {5257#true} assume 0 == ~r3~0 % 256; {5257#true} is VALID [2022-02-20 18:24:53,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {5257#true} assume 0 != init_~r122~0#1 % 256; {5257#true} is VALID [2022-02-20 18:24:53,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {5257#true} assume 0 != init_~r132~0#1 % 256; {5257#true} is VALID [2022-02-20 18:24:53,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {5257#true} assume 0 != init_~r212~0#1 % 256; {5257#true} is VALID [2022-02-20 18:24:53,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {5257#true} assume 0 != init_~r232~0#1 % 256; {5257#true} is VALID [2022-02-20 18:24:53,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {5257#true} assume 0 != init_~r312~0#1 % 256; {5257#true} is VALID [2022-02-20 18:24:53,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {5257#true} assume 0 != init_~r322~0#1 % 256; {5257#true} is VALID [2022-02-20 18:24:53,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {5257#true} assume ~max1~0 == ~id1~0; {5257#true} is VALID [2022-02-20 18:24:53,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {5257#true} assume ~max2~0 == ~id2~0; {5257#true} is VALID [2022-02-20 18:24:53,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {5257#true} assume ~max3~0 == ~id3~0; {5257#true} is VALID [2022-02-20 18:24:53,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {5257#true} assume 0 == ~st1~0; {5257#true} is VALID [2022-02-20 18:24:53,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {5257#true} assume 0 == ~st2~0; {5257#true} is VALID [2022-02-20 18:24:53,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {5257#true} assume 0 == ~st3~0; {5257#true} is VALID [2022-02-20 18:24:53,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {5257#true} assume 0 == ~nl1~0; {5257#true} is VALID [2022-02-20 18:24:53,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {5257#true} assume 0 == ~nl2~0; {5257#true} is VALID [2022-02-20 18:24:53,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {5257#true} assume 0 == ~nl3~0; {5257#true} is VALID [2022-02-20 18:24:53,133 INFO L290 TraceCheckUtils]: 38: Hoare triple {5257#true} assume 0 == ~mode1~0 % 256; {5257#true} is VALID [2022-02-20 18:24:53,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {5257#true} assume 0 == ~mode2~0 % 256; {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:53,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:53,135 INFO L290 TraceCheckUtils]: 41: Hoare triple {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:53,135 INFO L290 TraceCheckUtils]: 42: Hoare triple {5259#(= (+ (* (- 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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:53,136 INFO L290 TraceCheckUtils]: 43: Hoare triple {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:53,136 INFO L290 TraceCheckUtils]: 44: Hoare triple {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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; {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:53,137 INFO L290 TraceCheckUtils]: 45: Hoare triple {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:53,137 INFO L290 TraceCheckUtils]: 46: Hoare triple {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:53,138 INFO L290 TraceCheckUtils]: 47: Hoare triple {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 % 256 < 2; {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:53,138 INFO L290 TraceCheckUtils]: 48: Hoare triple {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep12~0 % 256); {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:53,139 INFO L290 TraceCheckUtils]: 49: Hoare triple {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep13~0 % 256); {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:53,139 INFO L290 TraceCheckUtils]: 50: Hoare triple {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:53,139 INFO L290 TraceCheckUtils]: 51: Hoare triple {5259#(= (+ (* (- 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; {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:53,140 INFO L290 TraceCheckUtils]: 52: Hoare triple {5259#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;~r2~0 := 1 + ~r2~0 % 256; {5258#false} is VALID [2022-02-20 18:24:53,140 INFO L290 TraceCheckUtils]: 53: Hoare triple {5258#false} assume !(0 != ~ep12~0 % 256); {5258#false} is VALID [2022-02-20 18:24:53,140 INFO L290 TraceCheckUtils]: 54: Hoare triple {5258#false} assume !(0 != ~ep32~0 % 256); {5258#false} is VALID [2022-02-20 18:24:53,141 INFO L290 TraceCheckUtils]: 55: Hoare triple {5258#false} assume !(2 == ~r2~0 % 256); {5258#false} is VALID [2022-02-20 18:24:53,141 INFO L290 TraceCheckUtils]: 56: Hoare triple {5258#false} ~mode2~0 := 0; {5258#false} is VALID [2022-02-20 18:24:53,141 INFO L290 TraceCheckUtils]: 57: Hoare triple {5258#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {5258#false} is VALID [2022-02-20 18:24:53,141 INFO L290 TraceCheckUtils]: 58: Hoare triple {5258#false} assume !(0 != ~mode3~0 % 256); {5258#false} is VALID [2022-02-20 18:24:53,141 INFO L290 TraceCheckUtils]: 59: Hoare triple {5258#false} assume !(~r3~0 % 256 < 2); {5258#false} is VALID [2022-02-20 18:24:53,141 INFO L290 TraceCheckUtils]: 60: Hoare triple {5258#false} ~mode3~0 := 1; {5258#false} is VALID [2022-02-20 18:24:53,142 INFO L290 TraceCheckUtils]: 61: Hoare triple {5258#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; {5258#false} is VALID [2022-02-20 18:24:53,142 INFO L290 TraceCheckUtils]: 62: Hoare triple {5258#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {5258#false} is VALID [2022-02-20 18:24:53,142 INFO L290 TraceCheckUtils]: 63: Hoare triple {5258#false} check_#res#1 := check_~tmp~1#1; {5258#false} is VALID [2022-02-20 18:24:53,142 INFO L290 TraceCheckUtils]: 64: Hoare triple {5258#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; {5258#false} is VALID [2022-02-20 18:24:53,142 INFO L290 TraceCheckUtils]: 65: Hoare triple {5258#false} assume 0 == assert_~arg#1 % 256; {5258#false} is VALID [2022-02-20 18:24:53,142 INFO L290 TraceCheckUtils]: 66: Hoare triple {5258#false} assume !false; {5258#false} is VALID [2022-02-20 18:24:53,143 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:53,143 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:53,143 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485056882] [2022-02-20 18:24:53,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485056882] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:53,144 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:53,144 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:53,144 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174064484] [2022-02-20 18:24:53,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:53,145 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:53,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:53,145 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:53,195 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:53,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:53,195 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:53,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:53,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:53,196 INFO L87 Difference]: Start difference. First operand 400 states and 640 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:53,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:53,504 INFO L93 Difference]: Finished difference Result 729 states and 1183 transitions. [2022-02-20 18:24:53,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:53,504 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:53,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:53,505 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:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-02-20 18:24:53,507 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:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-02-20 18:24:53,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 403 transitions. [2022-02-20 18:24:53,802 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:53,818 INFO L225 Difference]: With dead ends: 729 [2022-02-20 18:24:53,819 INFO L226 Difference]: Without dead ends: 547 [2022-02-20 18:24:53,819 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:53,820 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:53,821 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:53,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-02-20 18:24:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2022-02-20 18:24:53,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:53,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 547 states. Second operand has 545 states, 544 states have (on average 1.6084558823529411) internal successors, (875), 544 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have 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:53,869 INFO L74 IsIncluded]: Start isIncluded. First operand 547 states. Second operand has 545 states, 544 states have (on average 1.6084558823529411) internal successors, (875), 544 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have 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:53,870 INFO L87 Difference]: Start difference. First operand 547 states. Second operand has 545 states, 544 states have (on average 1.6084558823529411) internal successors, (875), 544 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have 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:53,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:53,890 INFO L93 Difference]: Finished difference Result 547 states and 876 transitions. [2022-02-20 18:24:53,890 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 876 transitions. [2022-02-20 18:24:53,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:53,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:53,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 545 states, 544 states have (on average 1.6084558823529411) internal successors, (875), 544 states have internal predecessors, (875), 0 states have call successors, (0), 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 547 states. [2022-02-20 18:24:53,893 INFO L87 Difference]: Start difference. First operand has 545 states, 544 states have (on average 1.6084558823529411) internal successors, (875), 544 states have internal predecessors, (875), 0 states have call successors, (0), 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 547 states. [2022-02-20 18:24:53,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:53,920 INFO L93 Difference]: Finished difference Result 547 states and 876 transitions. [2022-02-20 18:24:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 876 transitions. [2022-02-20 18:24:53,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:53,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:53,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:53,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.6084558823529411) internal successors, (875), 544 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have 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:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 875 transitions. [2022-02-20 18:24:53,942 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 875 transitions. Word has length 67 [2022-02-20 18:24:53,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:53,943 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 875 transitions. [2022-02-20 18:24:53,943 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:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 875 transitions. [2022-02-20 18:24:53,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:24:53,944 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:53,944 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:53,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:24:53,945 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:53,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:53,945 INFO L85 PathProgramCache]: Analyzing trace with hash 221435787, now seen corresponding path program 1 times [2022-02-20 18:24:53,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:53,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048476262] [2022-02-20 18:24:53,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:53,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:54,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {7804#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(46, 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; {7804#true} is VALID [2022-02-20 18:24:54,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {7804#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_~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;~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;~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;~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; {7804#true} is VALID [2022-02-20 18:24:54,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {7804#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {7804#true} is VALID [2022-02-20 18:24:54,003 INFO L290 TraceCheckUtils]: 3: Hoare triple {7804#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {7804#true} is VALID [2022-02-20 18:24:54,003 INFO L290 TraceCheckUtils]: 4: Hoare triple {7804#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {7804#true} is VALID [2022-02-20 18:24:54,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {7804#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {7804#true} is VALID [2022-02-20 18:24:54,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {7804#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {7804#true} is VALID [2022-02-20 18:24:54,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {7804#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {7804#true} is VALID [2022-02-20 18:24:54,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {7804#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {7804#true} is VALID [2022-02-20 18:24:54,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {7804#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {7804#true} is VALID [2022-02-20 18:24:54,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {7804#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {7804#true} is VALID [2022-02-20 18:24:54,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {7804#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {7804#true} is VALID [2022-02-20 18:24:54,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {7804#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {7804#true} is VALID [2022-02-20 18:24:54,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {7804#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {7804#true} is VALID [2022-02-20 18:24:54,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {7804#true} assume ~id1~0 != ~id2~0; {7804#true} is VALID [2022-02-20 18:24:54,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {7804#true} assume ~id1~0 != ~id3~0; {7804#true} is VALID [2022-02-20 18:24:54,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {7804#true} assume ~id2~0 != ~id3~0; {7804#true} is VALID [2022-02-20 18:24:54,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {7804#true} assume ~id1~0 >= 0; {7804#true} is VALID [2022-02-20 18:24:54,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {7804#true} assume ~id2~0 >= 0; {7804#true} is VALID [2022-02-20 18:24:54,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {7804#true} assume ~id3~0 >= 0; {7804#true} is VALID [2022-02-20 18:24:54,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {7804#true} assume 0 == ~r1~0 % 256; {7804#true} is VALID [2022-02-20 18:24:54,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {7804#true} assume 0 == ~r2~0 % 256; {7804#true} is VALID [2022-02-20 18:24:54,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {7804#true} assume 0 == ~r3~0 % 256; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r122~0#1 % 256; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r132~0#1 % 256; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r212~0#1 % 256; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r232~0#1 % 256; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r312~0#1 % 256; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r322~0#1 % 256; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max1~0 == ~id1~0; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max2~0 == ~id2~0; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max3~0 == ~id3~0; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,011 INFO L290 TraceCheckUtils]: 32: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st1~0; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st2~0; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st3~0; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl1~0; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,014 INFO L290 TraceCheckUtils]: 36: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl2~0; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,015 INFO L290 TraceCheckUtils]: 37: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl3~0; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,019 INFO L290 TraceCheckUtils]: 38: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode1~0 % 256; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,019 INFO L290 TraceCheckUtils]: 39: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode2~0 % 256; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,020 INFO L290 TraceCheckUtils]: 40: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} init_#res#1 := init_~tmp___5~0#1; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} 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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,021 INFO L290 TraceCheckUtils]: 43: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,021 INFO L290 TraceCheckUtils]: 44: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume { :end_inline_assume_abort_if_not } true;~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; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,022 INFO L290 TraceCheckUtils]: 45: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,022 INFO L290 TraceCheckUtils]: 46: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode1~0 % 256); {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,022 INFO L290 TraceCheckUtils]: 47: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r1~0 % 256 < 2; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,023 INFO L290 TraceCheckUtils]: 48: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep12~0 % 256); {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,023 INFO L290 TraceCheckUtils]: 49: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep13~0 % 256); {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,023 INFO L290 TraceCheckUtils]: 50: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode1~0 := 1; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,024 INFO L290 TraceCheckUtils]: 51: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,024 INFO L290 TraceCheckUtils]: 52: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode2~0 % 256); {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,025 INFO L290 TraceCheckUtils]: 53: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r2~0 % 256 < 2; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,025 INFO L290 TraceCheckUtils]: 54: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep21~0 % 256); {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,025 INFO L290 TraceCheckUtils]: 55: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep23~0 % 256); {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,026 INFO L290 TraceCheckUtils]: 56: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode2~0 := 1; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,026 INFO L290 TraceCheckUtils]: 57: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode3~0 % 256); {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:54,027 INFO L290 TraceCheckUtils]: 59: Hoare triple {7806#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(~r3~0 % 256 < 2); {7805#false} is VALID [2022-02-20 18:24:54,027 INFO L290 TraceCheckUtils]: 60: Hoare triple {7805#false} ~mode3~0 := 1; {7805#false} is VALID [2022-02-20 18:24:54,027 INFO L290 TraceCheckUtils]: 61: Hoare triple {7805#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; {7805#false} is VALID [2022-02-20 18:24:54,027 INFO L290 TraceCheckUtils]: 62: Hoare triple {7805#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {7805#false} is VALID [2022-02-20 18:24:54,028 INFO L290 TraceCheckUtils]: 63: Hoare triple {7805#false} check_#res#1 := check_~tmp~1#1; {7805#false} is VALID [2022-02-20 18:24:54,028 INFO L290 TraceCheckUtils]: 64: Hoare triple {7805#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; {7805#false} is VALID [2022-02-20 18:24:54,028 INFO L290 TraceCheckUtils]: 65: Hoare triple {7805#false} assume 0 == assert_~arg#1 % 256; {7805#false} is VALID [2022-02-20 18:24:54,028 INFO L290 TraceCheckUtils]: 66: Hoare triple {7805#false} assume !false; {7805#false} is VALID [2022-02-20 18:24:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:54,029 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:54,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048476262] [2022-02-20 18:24:54,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048476262] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:54,029 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:54,029 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:54,029 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405895149] [2022-02-20 18:24:54,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:54,030 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:54,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:54,031 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:54,085 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:54,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:54,085 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:54,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:54,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:54,086 INFO L87 Difference]: Start difference. First operand 545 states and 875 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:54,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:54,538 INFO L93 Difference]: Finished difference Result 1434 states and 2326 transitions. [2022-02-20 18:24:54,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:54,539 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:54,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:54,540 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:54,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-02-20 18:24:54,546 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:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-02-20 18:24:54,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 416 transitions. [2022-02-20 18:24:54,849 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:54,896 INFO L225 Difference]: With dead ends: 1434 [2022-02-20 18:24:54,896 INFO L226 Difference]: Without dead ends: 958 [2022-02-20 18:24:54,897 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:54,898 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:54,898 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:54,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2022-02-20 18:24:55,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 956. [2022-02-20 18:24:55,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:55,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 958 states. Second operand has 956 states, 955 states have (on average 1.6041884816753926) internal successors, (1532), 955 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have 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,026 INFO L74 IsIncluded]: Start isIncluded. First operand 958 states. Second operand has 956 states, 955 states have (on average 1.6041884816753926) internal successors, (1532), 955 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have 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,028 INFO L87 Difference]: Start difference. First operand 958 states. Second operand has 956 states, 955 states have (on average 1.6041884816753926) internal successors, (1532), 955 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have 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,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:55,077 INFO L93 Difference]: Finished difference Result 958 states and 1533 transitions. [2022-02-20 18:24:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1533 transitions. [2022-02-20 18:24:55,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:55,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:55,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 956 states, 955 states have (on average 1.6041884816753926) internal successors, (1532), 955 states have internal predecessors, (1532), 0 states have call successors, (0), 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 958 states. [2022-02-20 18:24:55,082 INFO L87 Difference]: Start difference. First operand has 956 states, 955 states have (on average 1.6041884816753926) internal successors, (1532), 955 states have internal predecessors, (1532), 0 states have call successors, (0), 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 958 states. [2022-02-20 18:24:55,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:55,130 INFO L93 Difference]: Finished difference Result 958 states and 1533 transitions. [2022-02-20 18:24:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1533 transitions. [2022-02-20 18:24:55,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:55,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:55,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:55,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 955 states have (on average 1.6041884816753926) internal successors, (1532), 955 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have 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,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1532 transitions. [2022-02-20 18:24:55,213 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1532 transitions. Word has length 67 [2022-02-20 18:24:55,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:55,213 INFO L470 AbstractCegarLoop]: Abstraction has 956 states and 1532 transitions. [2022-02-20 18:24:55,213 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:55,214 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1532 transitions. [2022-02-20 18:24:55,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:24:55,214 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:55,214 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:55,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:24:55,215 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:55,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:55,215 INFO L85 PathProgramCache]: Analyzing trace with hash 664156592, now seen corresponding path program 1 times [2022-02-20 18:24:55,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:55,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550572921] [2022-02-20 18:24:55,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:55,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {12481#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(46, 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; {12481#true} is VALID [2022-02-20 18:24:55,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {12481#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_~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;~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;~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;~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; {12481#true} is VALID [2022-02-20 18:24:55,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {12481#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {12481#true} is VALID [2022-02-20 18:24:55,260 INFO L290 TraceCheckUtils]: 3: Hoare triple {12481#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {12481#true} is VALID [2022-02-20 18:24:55,260 INFO L290 TraceCheckUtils]: 4: Hoare triple {12481#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {12481#true} is VALID [2022-02-20 18:24:55,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {12481#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {12481#true} is VALID [2022-02-20 18:24:55,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {12481#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {12481#true} is VALID [2022-02-20 18:24:55,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {12481#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {12481#true} is VALID [2022-02-20 18:24:55,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {12481#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {12481#true} is VALID [2022-02-20 18:24:55,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {12481#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {12481#true} is VALID [2022-02-20 18:24:55,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {12481#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {12481#true} is VALID [2022-02-20 18:24:55,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {12481#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {12481#true} is VALID [2022-02-20 18:24:55,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {12481#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {12481#true} is VALID [2022-02-20 18:24:55,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {12481#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {12481#true} is VALID [2022-02-20 18:24:55,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {12481#true} assume ~id1~0 != ~id2~0; {12481#true} is VALID [2022-02-20 18:24:55,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {12481#true} assume ~id1~0 != ~id3~0; {12481#true} is VALID [2022-02-20 18:24:55,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {12481#true} assume ~id2~0 != ~id3~0; {12481#true} is VALID [2022-02-20 18:24:55,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {12481#true} assume ~id1~0 >= 0; {12481#true} is VALID [2022-02-20 18:24:55,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {12481#true} assume ~id2~0 >= 0; {12481#true} is VALID [2022-02-20 18:24:55,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {12481#true} assume ~id3~0 >= 0; {12481#true} is VALID [2022-02-20 18:24:55,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {12481#true} assume 0 == ~r1~0 % 256; {12481#true} is VALID [2022-02-20 18:24:55,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {12481#true} assume 0 == ~r2~0 % 256; {12481#true} is VALID [2022-02-20 18:24:55,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {12481#true} assume 0 == ~r3~0 % 256; {12481#true} is VALID [2022-02-20 18:24:55,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {12481#true} assume 0 != init_~r122~0#1 % 256; {12481#true} is VALID [2022-02-20 18:24:55,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {12481#true} assume 0 != init_~r132~0#1 % 256; {12481#true} is VALID [2022-02-20 18:24:55,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {12481#true} assume 0 != init_~r212~0#1 % 256; {12481#true} is VALID [2022-02-20 18:24:55,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {12481#true} assume 0 != init_~r232~0#1 % 256; {12481#true} is VALID [2022-02-20 18:24:55,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {12481#true} assume 0 != init_~r312~0#1 % 256; {12481#true} is VALID [2022-02-20 18:24:55,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {12481#true} assume 0 != init_~r322~0#1 % 256; {12481#true} is VALID [2022-02-20 18:24:55,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {12481#true} assume ~max1~0 == ~id1~0; {12481#true} is VALID [2022-02-20 18:24:55,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {12481#true} assume ~max2~0 == ~id2~0; {12481#true} is VALID [2022-02-20 18:24:55,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {12481#true} assume ~max3~0 == ~id3~0; {12481#true} is VALID [2022-02-20 18:24:55,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {12481#true} assume 0 == ~st1~0; {12481#true} is VALID [2022-02-20 18:24:55,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {12481#true} assume 0 == ~st2~0; {12481#true} is VALID [2022-02-20 18:24:55,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {12481#true} assume 0 == ~st3~0; {12481#true} is VALID [2022-02-20 18:24:55,265 INFO L290 TraceCheckUtils]: 35: Hoare triple {12481#true} assume 0 == ~nl1~0; {12481#true} is VALID [2022-02-20 18:24:55,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {12481#true} assume 0 == ~nl2~0; {12481#true} is VALID [2022-02-20 18:24:55,265 INFO L290 TraceCheckUtils]: 37: Hoare triple {12481#true} assume 0 == ~nl3~0; {12481#true} is VALID [2022-02-20 18:24:55,266 INFO L290 TraceCheckUtils]: 38: Hoare triple {12481#true} assume 0 == ~mode1~0 % 256; {12481#true} is VALID [2022-02-20 18:24:55,266 INFO L290 TraceCheckUtils]: 39: Hoare triple {12481#true} assume 0 == ~mode2~0 % 256; {12481#true} is VALID [2022-02-20 18:24:55,266 INFO L290 TraceCheckUtils]: 40: Hoare triple {12481#true} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:55,267 INFO L290 TraceCheckUtils]: 41: Hoare triple {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:55,267 INFO L290 TraceCheckUtils]: 42: Hoare triple {12483#(= (+ (* (- 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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:55,268 INFO L290 TraceCheckUtils]: 43: Hoare triple {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:55,268 INFO L290 TraceCheckUtils]: 44: Hoare triple {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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; {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:55,269 INFO L290 TraceCheckUtils]: 45: Hoare triple {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:55,269 INFO L290 TraceCheckUtils]: 46: Hoare triple {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:55,270 INFO L290 TraceCheckUtils]: 47: Hoare triple {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 % 256 < 2; {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:55,270 INFO L290 TraceCheckUtils]: 48: Hoare triple {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep12~0 % 256); {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:55,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep13~0 % 256); {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:55,271 INFO L290 TraceCheckUtils]: 50: Hoare triple {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:55,271 INFO L290 TraceCheckUtils]: 51: Hoare triple {12483#(= (+ (* (- 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; {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:55,272 INFO L290 TraceCheckUtils]: 52: Hoare triple {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:55,272 INFO L290 TraceCheckUtils]: 53: Hoare triple {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 % 256 < 2; {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:55,273 INFO L290 TraceCheckUtils]: 54: Hoare triple {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep21~0 % 256); {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:55,273 INFO L290 TraceCheckUtils]: 55: Hoare triple {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep23~0 % 256); {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:55,274 INFO L290 TraceCheckUtils]: 56: Hoare triple {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:55,274 INFO L290 TraceCheckUtils]: 57: Hoare triple {12483#(= (+ (* (- 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; {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:55,275 INFO L290 TraceCheckUtils]: 58: Hoare triple {12483#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;~r3~0 := 1 + ~r3~0 % 256; {12482#false} is VALID [2022-02-20 18:24:55,275 INFO L290 TraceCheckUtils]: 59: Hoare triple {12482#false} assume !(0 != ~ep13~0 % 256); {12482#false} is VALID [2022-02-20 18:24:55,275 INFO L290 TraceCheckUtils]: 60: Hoare triple {12482#false} assume !(0 != ~ep23~0 % 256); {12482#false} is VALID [2022-02-20 18:24:55,275 INFO L290 TraceCheckUtils]: 61: Hoare triple {12482#false} assume !(2 == ~r3~0 % 256); {12482#false} is VALID [2022-02-20 18:24:55,275 INFO L290 TraceCheckUtils]: 62: Hoare triple {12482#false} ~mode3~0 := 0; {12482#false} is VALID [2022-02-20 18:24:55,275 INFO L290 TraceCheckUtils]: 63: Hoare triple {12482#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; {12482#false} is VALID [2022-02-20 18:24:55,275 INFO L290 TraceCheckUtils]: 64: Hoare triple {12482#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {12482#false} is VALID [2022-02-20 18:24:55,276 INFO L290 TraceCheckUtils]: 65: Hoare triple {12482#false} check_#res#1 := check_~tmp~1#1; {12482#false} is VALID [2022-02-20 18:24:55,276 INFO L290 TraceCheckUtils]: 66: Hoare triple {12482#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; {12482#false} is VALID [2022-02-20 18:24:55,276 INFO L290 TraceCheckUtils]: 67: Hoare triple {12482#false} assume 0 == assert_~arg#1 % 256; {12482#false} is VALID [2022-02-20 18:24:55,276 INFO L290 TraceCheckUtils]: 68: Hoare triple {12482#false} assume !false; {12482#false} is VALID [2022-02-20 18:24:55,276 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:55,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:55,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550572921] [2022-02-20 18:24:55,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550572921] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:55,277 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:55,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:55,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111230386] [2022-02-20 18:24:55,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:55,278 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:55,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:55,278 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:55,333 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:55,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:55,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:55,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:55,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:55,335 INFO L87 Difference]: Start difference. First operand 956 states and 1532 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:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:55,882 INFO L93 Difference]: Finished difference Result 1783 states and 2881 transitions. [2022-02-20 18:24:55,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:55,883 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:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:55,883 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:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-02-20 18:24:55,885 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:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-02-20 18:24:55,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 403 transitions. [2022-02-20 18:24:56,166 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:56,246 INFO L225 Difference]: With dead ends: 1783 [2022-02-20 18:24:56,246 INFO L226 Difference]: Without dead ends: 1307 [2022-02-20 18:24:56,247 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:56,248 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:56,248 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:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2022-02-20 18:24:56,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1305. [2022-02-20 18:24:56,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:56,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1307 states. Second operand has 1305 states, 1304 states have (on average 1.5996932515337423) internal successors, (2086), 1304 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have 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:56,409 INFO L74 IsIncluded]: Start isIncluded. First operand 1307 states. Second operand has 1305 states, 1304 states have (on average 1.5996932515337423) internal successors, (2086), 1304 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have 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:56,412 INFO L87 Difference]: Start difference. First operand 1307 states. Second operand has 1305 states, 1304 states have (on average 1.5996932515337423) internal successors, (2086), 1304 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have 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:56,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:56,490 INFO L93 Difference]: Finished difference Result 1307 states and 2087 transitions. [2022-02-20 18:24:56,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 2087 transitions. [2022-02-20 18:24:56,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:56,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:56,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 1305 states, 1304 states have (on average 1.5996932515337423) internal successors, (2086), 1304 states have internal predecessors, (2086), 0 states have call successors, (0), 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 1307 states. [2022-02-20 18:24:56,497 INFO L87 Difference]: Start difference. First operand has 1305 states, 1304 states have (on average 1.5996932515337423) internal successors, (2086), 1304 states have internal predecessors, (2086), 0 states have call successors, (0), 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 1307 states. [2022-02-20 18:24:56,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:56,575 INFO L93 Difference]: Finished difference Result 1307 states and 2087 transitions. [2022-02-20 18:24:56,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 2087 transitions. [2022-02-20 18:24:56,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:56,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:56,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:56,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 1304 states have (on average 1.5996932515337423) internal successors, (2086), 1304 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have 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:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 2086 transitions. [2022-02-20 18:24:56,679 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 2086 transitions. Word has length 69 [2022-02-20 18:24:56,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:56,681 INFO L470 AbstractCegarLoop]: Abstraction has 1305 states and 2086 transitions. [2022-02-20 18:24:56,682 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:56,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 2086 transitions. [2022-02-20 18:24:56,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:24:56,683 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:56,683 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:56,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:24:56,684 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:56,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:56,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1757720902, now seen corresponding path program 1 times [2022-02-20 18:24:56,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:56,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740668839] [2022-02-20 18:24:56,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:56,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:56,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {18700#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(46, 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; {18700#true} is VALID [2022-02-20 18:24:56,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {18700#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_~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;~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;~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;~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; {18700#true} is VALID [2022-02-20 18:24:56,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {18700#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {18700#true} is VALID [2022-02-20 18:24:56,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {18700#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {18700#true} is VALID [2022-02-20 18:24:56,772 INFO L290 TraceCheckUtils]: 4: Hoare triple {18700#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {18700#true} is VALID [2022-02-20 18:24:56,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {18700#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {18700#true} is VALID [2022-02-20 18:24:56,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {18700#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {18700#true} is VALID [2022-02-20 18:24:56,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {18700#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {18700#true} is VALID [2022-02-20 18:24:56,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {18700#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {18700#true} is VALID [2022-02-20 18:24:56,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {18700#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {18700#true} is VALID [2022-02-20 18:24:56,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {18700#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {18700#true} is VALID [2022-02-20 18:24:56,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {18700#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {18700#true} is VALID [2022-02-20 18:24:56,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {18700#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {18700#true} is VALID [2022-02-20 18:24:56,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {18700#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {18700#true} is VALID [2022-02-20 18:24:56,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {18700#true} assume ~id1~0 != ~id2~0; {18700#true} is VALID [2022-02-20 18:24:56,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {18700#true} assume ~id1~0 != ~id3~0; {18700#true} is VALID [2022-02-20 18:24:56,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {18700#true} assume ~id2~0 != ~id3~0; {18700#true} is VALID [2022-02-20 18:24:56,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {18700#true} assume ~id1~0 >= 0; {18700#true} is VALID [2022-02-20 18:24:56,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {18700#true} assume ~id2~0 >= 0; {18700#true} is VALID [2022-02-20 18:24:56,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {18700#true} assume ~id3~0 >= 0; {18700#true} is VALID [2022-02-20 18:24:56,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {18700#true} assume 0 == ~r1~0 % 256; {18700#true} is VALID [2022-02-20 18:24:56,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {18700#true} assume 0 == ~r2~0 % 256; {18700#true} is VALID [2022-02-20 18:24:56,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {18700#true} assume 0 == ~r3~0 % 256; {18700#true} is VALID [2022-02-20 18:24:56,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {18700#true} assume 0 != init_~r122~0#1 % 256; {18700#true} is VALID [2022-02-20 18:24:56,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {18700#true} assume 0 != init_~r132~0#1 % 256; {18700#true} is VALID [2022-02-20 18:24:56,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {18700#true} assume 0 != init_~r212~0#1 % 256; {18700#true} is VALID [2022-02-20 18:24:56,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {18700#true} assume 0 != init_~r232~0#1 % 256; {18700#true} is VALID [2022-02-20 18:24:56,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {18700#true} assume 0 != init_~r312~0#1 % 256; {18700#true} is VALID [2022-02-20 18:24:56,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {18700#true} assume 0 != init_~r322~0#1 % 256; {18700#true} is VALID [2022-02-20 18:24:56,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {18700#true} assume ~max1~0 == ~id1~0; {18700#true} is VALID [2022-02-20 18:24:56,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {18700#true} assume ~max2~0 == ~id2~0; {18700#true} is VALID [2022-02-20 18:24:56,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {18700#true} assume ~max3~0 == ~id3~0; {18700#true} is VALID [2022-02-20 18:24:56,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {18700#true} assume 0 == ~st1~0; {18702#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:56,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {18702#(<= ~st1~0 0)} assume 0 == ~st2~0; {18703#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {18703#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,779 INFO L290 TraceCheckUtils]: 37: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,780 INFO L290 TraceCheckUtils]: 40: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,781 INFO L290 TraceCheckUtils]: 41: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,781 INFO L290 TraceCheckUtils]: 42: Hoare triple {18704#(<= (+ ~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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,782 INFO L290 TraceCheckUtils]: 43: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,782 INFO L290 TraceCheckUtils]: 44: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,782 INFO L290 TraceCheckUtils]: 45: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,783 INFO L290 TraceCheckUtils]: 46: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,783 INFO L290 TraceCheckUtils]: 47: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,783 INFO L290 TraceCheckUtils]: 48: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,784 INFO L290 TraceCheckUtils]: 49: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,785 INFO L290 TraceCheckUtils]: 50: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,785 INFO L290 TraceCheckUtils]: 51: Hoare triple {18704#(<= (+ ~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; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,786 INFO L290 TraceCheckUtils]: 52: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,786 INFO L290 TraceCheckUtils]: 53: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,786 INFO L290 TraceCheckUtils]: 54: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,787 INFO L290 TraceCheckUtils]: 55: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,787 INFO L290 TraceCheckUtils]: 56: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,787 INFO L290 TraceCheckUtils]: 57: Hoare triple {18704#(<= (+ ~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; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,788 INFO L290 TraceCheckUtils]: 58: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,788 INFO L290 TraceCheckUtils]: 59: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,788 INFO L290 TraceCheckUtils]: 60: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,789 INFO L290 TraceCheckUtils]: 61: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,789 INFO L290 TraceCheckUtils]: 62: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,789 INFO L290 TraceCheckUtils]: 63: Hoare triple {18704#(<= (+ ~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; {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:56,790 INFO L290 TraceCheckUtils]: 64: Hoare triple {18704#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {18701#false} is VALID [2022-02-20 18:24:56,790 INFO L290 TraceCheckUtils]: 65: Hoare triple {18701#false} check_#res#1 := check_~tmp~1#1; {18701#false} is VALID [2022-02-20 18:24:56,790 INFO L290 TraceCheckUtils]: 66: Hoare triple {18701#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; {18701#false} is VALID [2022-02-20 18:24:56,790 INFO L290 TraceCheckUtils]: 67: Hoare triple {18701#false} assume 0 == assert_~arg#1 % 256; {18701#false} is VALID [2022-02-20 18:24:56,791 INFO L290 TraceCheckUtils]: 68: Hoare triple {18701#false} assume !false; {18701#false} is VALID [2022-02-20 18:24:56,795 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:56,795 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:56,795 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740668839] [2022-02-20 18:24:56,795 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740668839] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:56,796 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:56,796 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:24:56,796 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683281820] [2022-02-20 18:24:56,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:56,797 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:56,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:56,798 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:56,844 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:56,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:24:56,845 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:56,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:24:56,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:24:56,846 INFO L87 Difference]: Start difference. First operand 1305 states and 2086 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:25:00,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:00,679 INFO L93 Difference]: Finished difference Result 6582 states and 10723 transitions. [2022-02-20 18:25:00,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:25:00,680 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:25:00,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:25:00,680 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:25:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 901 transitions. [2022-02-20 18:25:00,685 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:25:00,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 901 transitions. [2022-02-20 18:25:00,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 901 transitions. [2022-02-20 18:25:01,252 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:25:02,090 INFO L225 Difference]: With dead ends: 6582 [2022-02-20 18:25:02,090 INFO L226 Difference]: Without dead ends: 5356 [2022-02-20 18:25:02,091 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:25:02,092 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:25:02,092 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:25:02,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5356 states. [2022-02-20 18:25:02,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5356 to 2452. [2022-02-20 18:25:02,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:25:02,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5356 states. Second operand has 2452 states, 2451 states have (on average 1.5968992248062015) internal successors, (3914), 2451 states have internal predecessors, (3914), 0 states have call successors, (0), 0 states have 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:02,871 INFO L74 IsIncluded]: Start isIncluded. First operand 5356 states. Second operand has 2452 states, 2451 states have (on average 1.5968992248062015) internal successors, (3914), 2451 states have internal predecessors, (3914), 0 states have call successors, (0), 0 states have 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:02,874 INFO L87 Difference]: Start difference. First operand 5356 states. Second operand has 2452 states, 2451 states have (on average 1.5968992248062015) internal successors, (3914), 2451 states have internal predecessors, (3914), 0 states have call successors, (0), 0 states have 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:03,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:03,793 INFO L93 Difference]: Finished difference Result 5356 states and 8631 transitions. [2022-02-20 18:25:03,793 INFO L276 IsEmpty]: Start isEmpty. Operand 5356 states and 8631 transitions. [2022-02-20 18:25:03,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:03,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:03,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 2452 states, 2451 states have (on average 1.5968992248062015) internal successors, (3914), 2451 states have internal predecessors, (3914), 0 states have call successors, (0), 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 5356 states. [2022-02-20 18:25:03,808 INFO L87 Difference]: Start difference. First operand has 2452 states, 2451 states have (on average 1.5968992248062015) internal successors, (3914), 2451 states have internal predecessors, (3914), 0 states have call successors, (0), 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 5356 states. [2022-02-20 18:25:04,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:04,729 INFO L93 Difference]: Finished difference Result 5356 states and 8631 transitions. [2022-02-20 18:25:04,729 INFO L276 IsEmpty]: Start isEmpty. Operand 5356 states and 8631 transitions. [2022-02-20 18:25:04,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:04,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:04,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:25:04,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:25:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 2451 states have (on average 1.5968992248062015) internal successors, (3914), 2451 states have internal predecessors, (3914), 0 states have call successors, (0), 0 states have 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:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3914 transitions. [2022-02-20 18:25:05,052 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3914 transitions. Word has length 69 [2022-02-20 18:25:05,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:25:05,052 INFO L470 AbstractCegarLoop]: Abstraction has 2452 states and 3914 transitions. [2022-02-20 18:25:05,052 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:25:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3914 transitions. [2022-02-20 18:25:05,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:25:05,053 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:25:05,053 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:25:05,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:25:05,054 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:25:05,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:25:05,054 INFO L85 PathProgramCache]: Analyzing trace with hash -577605759, now seen corresponding path program 1 times [2022-02-20 18:25:05,054 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:25:05,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030792323] [2022-02-20 18:25:05,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:25:05,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:25:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:25:05,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {39984#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(46, 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; {39984#true} is VALID [2022-02-20 18:25:05,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {39984#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_~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;~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;~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;~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; {39984#true} is VALID [2022-02-20 18:25:05,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {39984#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {39984#true} is VALID [2022-02-20 18:25:05,113 INFO L290 TraceCheckUtils]: 3: Hoare triple {39984#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {39984#true} is VALID [2022-02-20 18:25:05,113 INFO L290 TraceCheckUtils]: 4: Hoare triple {39984#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {39984#true} is VALID [2022-02-20 18:25:05,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {39984#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {39984#true} is VALID [2022-02-20 18:25:05,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {39984#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {39984#true} is VALID [2022-02-20 18:25:05,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {39984#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {39984#true} is VALID [2022-02-20 18:25:05,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {39984#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {39984#true} is VALID [2022-02-20 18:25:05,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {39984#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {39984#true} is VALID [2022-02-20 18:25:05,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {39984#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {39984#true} is VALID [2022-02-20 18:25:05,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {39984#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {39984#true} is VALID [2022-02-20 18:25:05,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {39984#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {39984#true} is VALID [2022-02-20 18:25:05,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {39984#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {39984#true} is VALID [2022-02-20 18:25:05,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {39984#true} assume ~id1~0 != ~id2~0; {39984#true} is VALID [2022-02-20 18:25:05,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {39984#true} assume ~id1~0 != ~id3~0; {39984#true} is VALID [2022-02-20 18:25:05,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {39984#true} assume ~id2~0 != ~id3~0; {39984#true} is VALID [2022-02-20 18:25:05,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {39984#true} assume ~id1~0 >= 0; {39984#true} is VALID [2022-02-20 18:25:05,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {39984#true} assume ~id2~0 >= 0; {39984#true} is VALID [2022-02-20 18:25:05,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {39984#true} assume ~id3~0 >= 0; {39984#true} is VALID [2022-02-20 18:25:05,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {39984#true} assume 0 == ~r1~0 % 256; {39984#true} is VALID [2022-02-20 18:25:05,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {39984#true} assume 0 == ~r2~0 % 256; {39984#true} is VALID [2022-02-20 18:25:05,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {39984#true} assume 0 == ~r3~0 % 256; {39984#true} is VALID [2022-02-20 18:25:05,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {39984#true} assume 0 != init_~r122~0#1 % 256; {39984#true} is VALID [2022-02-20 18:25:05,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {39984#true} assume 0 != init_~r132~0#1 % 256; {39984#true} is VALID [2022-02-20 18:25:05,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {39984#true} assume 0 != init_~r212~0#1 % 256; {39984#true} is VALID [2022-02-20 18:25:05,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {39984#true} assume 0 != init_~r232~0#1 % 256; {39984#true} is VALID [2022-02-20 18:25:05,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {39984#true} assume 0 != init_~r312~0#1 % 256; {39984#true} is VALID [2022-02-20 18:25:05,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {39984#true} assume 0 != init_~r322~0#1 % 256; {39984#true} is VALID [2022-02-20 18:25:05,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {39984#true} assume ~max1~0 == ~id1~0; {39984#true} is VALID [2022-02-20 18:25:05,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {39984#true} assume ~max2~0 == ~id2~0; {39984#true} is VALID [2022-02-20 18:25:05,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {39984#true} assume ~max3~0 == ~id3~0; {39984#true} is VALID [2022-02-20 18:25:05,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {39984#true} assume 0 == ~st1~0; {39986#(<= ~st1~0 0)} is VALID [2022-02-20 18:25:05,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {39986#(<= ~st1~0 0)} assume 0 == ~st2~0; {39986#(<= ~st1~0 0)} is VALID [2022-02-20 18:25:05,118 INFO L290 TraceCheckUtils]: 34: Hoare triple {39986#(<= ~st1~0 0)} assume 0 == ~st3~0; {39986#(<= ~st1~0 0)} is VALID [2022-02-20 18:25:05,118 INFO L290 TraceCheckUtils]: 35: Hoare triple {39986#(<= ~st1~0 0)} assume 0 == ~nl1~0; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,118 INFO L290 TraceCheckUtils]: 36: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,119 INFO L290 TraceCheckUtils]: 39: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,120 INFO L290 TraceCheckUtils]: 40: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,120 INFO L290 TraceCheckUtils]: 41: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,120 INFO L290 TraceCheckUtils]: 42: Hoare triple {39987#(<= (+ ~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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,121 INFO L290 TraceCheckUtils]: 43: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,121 INFO L290 TraceCheckUtils]: 44: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,121 INFO L290 TraceCheckUtils]: 45: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,122 INFO L290 TraceCheckUtils]: 46: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,123 INFO L290 TraceCheckUtils]: 49: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,123 INFO L290 TraceCheckUtils]: 50: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,123 INFO L290 TraceCheckUtils]: 51: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,124 INFO L290 TraceCheckUtils]: 52: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,124 INFO L290 TraceCheckUtils]: 53: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,124 INFO L290 TraceCheckUtils]: 54: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,125 INFO L290 TraceCheckUtils]: 55: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,125 INFO L290 TraceCheckUtils]: 56: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,125 INFO L290 TraceCheckUtils]: 57: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,126 INFO L290 TraceCheckUtils]: 58: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,126 INFO L290 TraceCheckUtils]: 59: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,126 INFO L290 TraceCheckUtils]: 60: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,127 INFO L290 TraceCheckUtils]: 61: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,127 INFO L290 TraceCheckUtils]: 62: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,127 INFO L290 TraceCheckUtils]: 63: Hoare triple {39987#(<= (+ ~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; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,128 INFO L290 TraceCheckUtils]: 64: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {39987#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:05,128 INFO L290 TraceCheckUtils]: 65: Hoare triple {39987#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);check_~tmp~1#1 := 0; {39985#false} is VALID [2022-02-20 18:25:05,128 INFO L290 TraceCheckUtils]: 66: Hoare triple {39985#false} check_#res#1 := check_~tmp~1#1; {39985#false} is VALID [2022-02-20 18:25:05,128 INFO L290 TraceCheckUtils]: 67: Hoare triple {39985#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; {39985#false} is VALID [2022-02-20 18:25:05,129 INFO L290 TraceCheckUtils]: 68: Hoare triple {39985#false} assume 0 == assert_~arg#1 % 256; {39985#false} is VALID [2022-02-20 18:25:05,129 INFO L290 TraceCheckUtils]: 69: Hoare triple {39985#false} assume !false; {39985#false} is VALID [2022-02-20 18:25:05,129 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:05,129 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:25:05,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030792323] [2022-02-20 18:25:05,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030792323] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:25:05,130 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:25:05,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:25:05,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377106155] [2022-02-20 18:25:05,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:25:05,131 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:25:05,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:25:05,131 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:25:05,179 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:25:05,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:25:05,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:25:05,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:25:05,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:25:05,180 INFO L87 Difference]: Start difference. First operand 2452 states and 3914 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:25:09,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:09,577 INFO L93 Difference]: Finished difference Result 7943 states and 12835 transitions. [2022-02-20 18:25:09,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:25:09,577 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:25:09,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:25:09,577 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:25:09,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-02-20 18:25:09,580 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:25:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-02-20 18:25:09,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 547 transitions. [2022-02-20 18:25:09,944 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:10,863 INFO L225 Difference]: With dead ends: 7943 [2022-02-20 18:25:10,863 INFO L226 Difference]: Without dead ends: 5570 [2022-02-20 18:25:10,866 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:10,867 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:25:10,867 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:25:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states. [2022-02-20 18:25:12,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 3992. [2022-02-20 18:25:12,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:25:12,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5570 states. Second operand has 3992 states, 3991 states have (on average 1.5995990979704335) internal successors, (6384), 3991 states have internal predecessors, (6384), 0 states have call successors, (0), 0 states have 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:12,299 INFO L74 IsIncluded]: Start isIncluded. First operand 5570 states. Second operand has 3992 states, 3991 states have (on average 1.5995990979704335) internal successors, (6384), 3991 states have internal predecessors, (6384), 0 states have call successors, (0), 0 states have 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:12,303 INFO L87 Difference]: Start difference. First operand 5570 states. Second operand has 3992 states, 3991 states have (on average 1.5995990979704335) internal successors, (6384), 3991 states have internal predecessors, (6384), 0 states have call successors, (0), 0 states have 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:13,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:13,215 INFO L93 Difference]: Finished difference Result 5570 states and 8975 transitions. [2022-02-20 18:25:13,215 INFO L276 IsEmpty]: Start isEmpty. Operand 5570 states and 8975 transitions. [2022-02-20 18:25:13,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:13,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:13,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 3992 states, 3991 states have (on average 1.5995990979704335) internal successors, (6384), 3991 states have internal predecessors, (6384), 0 states have call successors, (0), 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 5570 states. [2022-02-20 18:25:13,254 INFO L87 Difference]: Start difference. First operand has 3992 states, 3991 states have (on average 1.5995990979704335) internal successors, (6384), 3991 states have internal predecessors, (6384), 0 states have call successors, (0), 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 5570 states. [2022-02-20 18:25:14,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:14,173 INFO L93 Difference]: Finished difference Result 5570 states and 8975 transitions. [2022-02-20 18:25:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand 5570 states and 8975 transitions. [2022-02-20 18:25:14,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:14,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:14,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:25:14,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:25:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3992 states, 3991 states have (on average 1.5995990979704335) internal successors, (6384), 3991 states have internal predecessors, (6384), 0 states have call successors, (0), 0 states have 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:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3992 states to 3992 states and 6384 transitions. [2022-02-20 18:25:14,857 INFO L78 Accepts]: Start accepts. Automaton has 3992 states and 6384 transitions. Word has length 70 [2022-02-20 18:25:14,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:25:14,858 INFO L470 AbstractCegarLoop]: Abstraction has 3992 states and 6384 transitions. [2022-02-20 18:25:14,858 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:25:14,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3992 states and 6384 transitions. [2022-02-20 18:25:14,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 18:25:14,858 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:25:14,858 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:25:14,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:25:14,859 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:25:14,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:25:14,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1815229649, now seen corresponding path program 1 times [2022-02-20 18:25:14,859 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:25:14,859 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819484088] [2022-02-20 18:25:14,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:25:14,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:25:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:25:14,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {65092#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(46, 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; {65092#true} is VALID [2022-02-20 18:25:14,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {65092#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_~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;~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;~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;~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; {65092#true} is VALID [2022-02-20 18:25:14,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {65092#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {65092#true} is VALID [2022-02-20 18:25:14,930 INFO L290 TraceCheckUtils]: 3: Hoare triple {65092#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {65092#true} is VALID [2022-02-20 18:25:14,930 INFO L290 TraceCheckUtils]: 4: Hoare triple {65092#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {65092#true} is VALID [2022-02-20 18:25:14,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {65092#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {65092#true} is VALID [2022-02-20 18:25:14,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {65092#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {65092#true} is VALID [2022-02-20 18:25:14,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {65092#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {65092#true} is VALID [2022-02-20 18:25:14,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {65092#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {65092#true} is VALID [2022-02-20 18:25:14,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {65092#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {65092#true} is VALID [2022-02-20 18:25:14,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {65092#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {65092#true} is VALID [2022-02-20 18:25:14,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {65092#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {65092#true} is VALID [2022-02-20 18:25:14,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {65092#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {65092#true} is VALID [2022-02-20 18:25:14,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {65092#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {65092#true} is VALID [2022-02-20 18:25:14,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {65092#true} assume ~id1~0 != ~id2~0; {65092#true} is VALID [2022-02-20 18:25:14,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {65092#true} assume ~id1~0 != ~id3~0; {65092#true} is VALID [2022-02-20 18:25:14,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {65092#true} assume ~id2~0 != ~id3~0; {65092#true} is VALID [2022-02-20 18:25:14,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {65092#true} assume ~id1~0 >= 0; {65092#true} is VALID [2022-02-20 18:25:14,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {65092#true} assume ~id2~0 >= 0; {65092#true} is VALID [2022-02-20 18:25:14,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {65092#true} assume ~id3~0 >= 0; {65092#true} is VALID [2022-02-20 18:25:14,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {65092#true} assume 0 == ~r1~0 % 256; {65092#true} is VALID [2022-02-20 18:25:14,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {65092#true} assume 0 == ~r2~0 % 256; {65092#true} is VALID [2022-02-20 18:25:14,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {65092#true} assume 0 == ~r3~0 % 256; {65092#true} is VALID [2022-02-20 18:25:14,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {65092#true} assume 0 != init_~r122~0#1 % 256; {65092#true} is VALID [2022-02-20 18:25:14,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {65092#true} assume 0 != init_~r132~0#1 % 256; {65092#true} is VALID [2022-02-20 18:25:14,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {65092#true} assume 0 != init_~r212~0#1 % 256; {65092#true} is VALID [2022-02-20 18:25:14,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {65092#true} assume 0 != init_~r232~0#1 % 256; {65092#true} is VALID [2022-02-20 18:25:14,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {65092#true} assume 0 != init_~r312~0#1 % 256; {65092#true} is VALID [2022-02-20 18:25:14,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {65092#true} assume 0 != init_~r322~0#1 % 256; {65092#true} is VALID [2022-02-20 18:25:14,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {65092#true} assume ~max1~0 == ~id1~0; {65092#true} is VALID [2022-02-20 18:25:14,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {65092#true} assume ~max2~0 == ~id2~0; {65092#true} is VALID [2022-02-20 18:25:14,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {65092#true} assume ~max3~0 == ~id3~0; {65092#true} is VALID [2022-02-20 18:25:14,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {65092#true} assume 0 == ~st1~0; {65092#true} is VALID [2022-02-20 18:25:14,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {65092#true} assume 0 == ~st2~0; {65094#(<= ~st2~0 0)} is VALID [2022-02-20 18:25:14,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {65094#(<= ~st2~0 0)} assume 0 == ~st3~0; {65094#(<= ~st2~0 0)} is VALID [2022-02-20 18:25:14,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {65094#(<= ~st2~0 0)} assume 0 == ~nl1~0; {65094#(<= ~st2~0 0)} is VALID [2022-02-20 18:25:14,936 INFO L290 TraceCheckUtils]: 36: Hoare triple {65094#(<= ~st2~0 0)} assume 0 == ~nl2~0; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,936 INFO L290 TraceCheckUtils]: 37: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,937 INFO L290 TraceCheckUtils]: 38: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,937 INFO L290 TraceCheckUtils]: 39: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,938 INFO L290 TraceCheckUtils]: 41: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,938 INFO L290 TraceCheckUtils]: 42: Hoare triple {65095#(<= (+ ~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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,940 INFO L290 TraceCheckUtils]: 45: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,940 INFO L290 TraceCheckUtils]: 46: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode1~0 % 256); {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,940 INFO L290 TraceCheckUtils]: 47: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 % 256 < 2; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,941 INFO L290 TraceCheckUtils]: 48: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep12~0 % 256); {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,941 INFO L290 TraceCheckUtils]: 49: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep13~0 % 256); {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,942 INFO L290 TraceCheckUtils]: 50: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,942 INFO L290 TraceCheckUtils]: 51: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,942 INFO L290 TraceCheckUtils]: 52: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode2~0 % 256); {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,943 INFO L290 TraceCheckUtils]: 53: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 % 256 < 2; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,943 INFO L290 TraceCheckUtils]: 54: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep21~0 % 256); {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,943 INFO L290 TraceCheckUtils]: 55: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep23~0 % 256); {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,944 INFO L290 TraceCheckUtils]: 56: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,944 INFO L290 TraceCheckUtils]: 57: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,944 INFO L290 TraceCheckUtils]: 58: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode3~0 % 256); {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,945 INFO L290 TraceCheckUtils]: 59: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 % 256 < 2; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,945 INFO L290 TraceCheckUtils]: 60: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep31~0 % 256); {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,946 INFO L290 TraceCheckUtils]: 61: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep32~0 % 256); {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,946 INFO L290 TraceCheckUtils]: 62: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,946 INFO L290 TraceCheckUtils]: 63: Hoare triple {65095#(<= (+ ~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; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,947 INFO L290 TraceCheckUtils]: 64: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,947 INFO L290 TraceCheckUtils]: 65: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {65095#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:14,948 INFO L290 TraceCheckUtils]: 66: Hoare triple {65095#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);check_~tmp~1#1 := 0; {65093#false} is VALID [2022-02-20 18:25:14,948 INFO L290 TraceCheckUtils]: 67: Hoare triple {65093#false} check_#res#1 := check_~tmp~1#1; {65093#false} is VALID [2022-02-20 18:25:14,948 INFO L290 TraceCheckUtils]: 68: Hoare triple {65093#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; {65093#false} is VALID [2022-02-20 18:25:14,948 INFO L290 TraceCheckUtils]: 69: Hoare triple {65093#false} assume 0 == assert_~arg#1 % 256; {65093#false} is VALID [2022-02-20 18:25:14,948 INFO L290 TraceCheckUtils]: 70: Hoare triple {65093#false} assume !false; {65093#false} is VALID [2022-02-20 18:25:14,949 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:14,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:25:14,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819484088] [2022-02-20 18:25:14,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819484088] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:25:14,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:25:14,949 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:25:14,949 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299508334] [2022-02-20 18:25:14,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:25:14,951 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:14,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:25:14,951 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:25:15,003 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:25:15,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:25:15,004 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:25:15,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:25:15,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:25:15,005 INFO L87 Difference]: Start difference. First operand 3992 states and 6384 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:24,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:24,252 INFO L93 Difference]: Finished difference Result 12755 states and 20495 transitions. [2022-02-20 18:25:24,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:25:24,252 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:24,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:25:24,252 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:24,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-02-20 18:25:24,254 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:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-02-20 18:25:24,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 547 transitions. [2022-02-20 18:25:24,600 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:26,835 INFO L225 Difference]: With dead ends: 12755 [2022-02-20 18:25:26,835 INFO L226 Difference]: Without dead ends: 8842 [2022-02-20 18:25:26,840 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:26,840 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:26,841 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:26,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2022-02-20 18:25:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 6388. [2022-02-20 18:25:29,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:25:29,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8842 states. Second operand has 6388 states, 6387 states have (on average 1.5913574448097698) internal successors, (10164), 6387 states have internal predecessors, (10164), 0 states have call successors, (0), 0 states have 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:29,588 INFO L74 IsIncluded]: Start isIncluded. First operand 8842 states. Second operand has 6388 states, 6387 states have (on average 1.5913574448097698) internal successors, (10164), 6387 states have internal predecessors, (10164), 0 states have call successors, (0), 0 states have 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:29,597 INFO L87 Difference]: Start difference. First operand 8842 states. Second operand has 6388 states, 6387 states have (on average 1.5913574448097698) internal successors, (10164), 6387 states have internal predecessors, (10164), 0 states have call successors, (0), 0 states have 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:31,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:31,957 INFO L93 Difference]: Finished difference Result 8842 states and 14135 transitions. [2022-02-20 18:25:31,957 INFO L276 IsEmpty]: Start isEmpty. Operand 8842 states and 14135 transitions. [2022-02-20 18:25:31,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:31,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:31,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 6388 states, 6387 states have (on average 1.5913574448097698) internal successors, (10164), 6387 states have internal predecessors, (10164), 0 states have call successors, (0), 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 8842 states. [2022-02-20 18:25:31,979 INFO L87 Difference]: Start difference. First operand has 6388 states, 6387 states have (on average 1.5913574448097698) internal successors, (10164), 6387 states have internal predecessors, (10164), 0 states have call successors, (0), 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 8842 states. [2022-02-20 18:25:34,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:34,329 INFO L93 Difference]: Finished difference Result 8842 states and 14135 transitions. [2022-02-20 18:25:34,330 INFO L276 IsEmpty]: Start isEmpty. Operand 8842 states and 14135 transitions. [2022-02-20 18:25:34,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:34,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:34,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:25:34,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:25:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6388 states, 6387 states have (on average 1.5913574448097698) internal successors, (10164), 6387 states have internal predecessors, (10164), 0 states have call successors, (0), 0 states have 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:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6388 states to 6388 states and 10164 transitions. [2022-02-20 18:25:35,786 INFO L78 Accepts]: Start accepts. Automaton has 6388 states and 10164 transitions. Word has length 71 [2022-02-20 18:25:35,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:25:35,787 INFO L470 AbstractCegarLoop]: Abstraction has 6388 states and 10164 transitions. [2022-02-20 18:25:35,787 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:35,787 INFO L276 IsEmpty]: Start isEmpty. Operand 6388 states and 10164 transitions. [2022-02-20 18:25:35,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:25:35,787 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:25:35,788 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:35,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:25:35,788 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:25:35,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:25:35,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1147279688, now seen corresponding path program 1 times [2022-02-20 18:25:35,789 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:25:35,789 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680245590] [2022-02-20 18:25:35,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:25:35,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:25:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:25:35,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {105212#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(46, 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; {105212#true} is VALID [2022-02-20 18:25:35,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {105212#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_~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;~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;~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;~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; {105212#true} is VALID [2022-02-20 18:25:35,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {105212#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {105212#true} is VALID [2022-02-20 18:25:35,860 INFO L290 TraceCheckUtils]: 3: Hoare triple {105212#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {105212#true} is VALID [2022-02-20 18:25:35,860 INFO L290 TraceCheckUtils]: 4: Hoare triple {105212#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {105212#true} is VALID [2022-02-20 18:25:35,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {105212#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {105212#true} is VALID [2022-02-20 18:25:35,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {105212#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {105212#true} is VALID [2022-02-20 18:25:35,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {105212#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {105212#true} is VALID [2022-02-20 18:25:35,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {105212#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {105212#true} is VALID [2022-02-20 18:25:35,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {105212#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {105212#true} is VALID [2022-02-20 18:25:35,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {105212#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {105212#true} is VALID [2022-02-20 18:25:35,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {105212#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {105212#true} is VALID [2022-02-20 18:25:35,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {105212#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {105212#true} is VALID [2022-02-20 18:25:35,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {105212#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {105212#true} is VALID [2022-02-20 18:25:35,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {105212#true} assume ~id1~0 != ~id2~0; {105212#true} is VALID [2022-02-20 18:25:35,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {105212#true} assume ~id1~0 != ~id3~0; {105212#true} is VALID [2022-02-20 18:25:35,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {105212#true} assume ~id2~0 != ~id3~0; {105212#true} is VALID [2022-02-20 18:25:35,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {105212#true} assume ~id1~0 >= 0; {105212#true} is VALID [2022-02-20 18:25:35,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {105212#true} assume ~id2~0 >= 0; {105212#true} is VALID [2022-02-20 18:25:35,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {105212#true} assume ~id3~0 >= 0; {105212#true} is VALID [2022-02-20 18:25:35,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {105212#true} assume 0 == ~r1~0 % 256; {105212#true} is VALID [2022-02-20 18:25:35,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {105212#true} assume 0 == ~r2~0 % 256; {105212#true} is VALID [2022-02-20 18:25:35,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {105212#true} assume 0 == ~r3~0 % 256; {105212#true} is VALID [2022-02-20 18:25:35,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {105212#true} assume 0 != init_~r122~0#1 % 256; {105212#true} is VALID [2022-02-20 18:25:35,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {105212#true} assume 0 != init_~r132~0#1 % 256; {105212#true} is VALID [2022-02-20 18:25:35,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {105212#true} assume 0 != init_~r212~0#1 % 256; {105212#true} is VALID [2022-02-20 18:25:35,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {105212#true} assume 0 != init_~r232~0#1 % 256; {105212#true} is VALID [2022-02-20 18:25:35,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {105212#true} assume 0 != init_~r312~0#1 % 256; {105212#true} is VALID [2022-02-20 18:25:35,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {105212#true} assume 0 != init_~r322~0#1 % 256; {105212#true} is VALID [2022-02-20 18:25:35,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {105212#true} assume ~max1~0 == ~id1~0; {105212#true} is VALID [2022-02-20 18:25:35,866 INFO L290 TraceCheckUtils]: 30: Hoare triple {105212#true} assume ~max2~0 == ~id2~0; {105212#true} is VALID [2022-02-20 18:25:35,866 INFO L290 TraceCheckUtils]: 31: Hoare triple {105212#true} assume ~max3~0 == ~id3~0; {105212#true} is VALID [2022-02-20 18:25:35,866 INFO L290 TraceCheckUtils]: 32: Hoare triple {105212#true} assume 0 == ~st1~0; {105212#true} is VALID [2022-02-20 18:25:35,866 INFO L290 TraceCheckUtils]: 33: Hoare triple {105212#true} assume 0 == ~st2~0; {105212#true} is VALID [2022-02-20 18:25:35,867 INFO L290 TraceCheckUtils]: 34: Hoare triple {105212#true} assume 0 == ~st3~0; {105214#(<= ~st3~0 0)} is VALID [2022-02-20 18:25:35,867 INFO L290 TraceCheckUtils]: 35: Hoare triple {105214#(<= ~st3~0 0)} assume 0 == ~nl1~0; {105214#(<= ~st3~0 0)} is VALID [2022-02-20 18:25:35,867 INFO L290 TraceCheckUtils]: 36: Hoare triple {105214#(<= ~st3~0 0)} assume 0 == ~nl2~0; {105214#(<= ~st3~0 0)} is VALID [2022-02-20 18:25:35,868 INFO L290 TraceCheckUtils]: 37: Hoare triple {105214#(<= ~st3~0 0)} assume 0 == ~nl3~0; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,869 INFO L290 TraceCheckUtils]: 39: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,872 INFO L290 TraceCheckUtils]: 42: Hoare triple {105215#(<= (+ ~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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,872 INFO L290 TraceCheckUtils]: 43: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,873 INFO L290 TraceCheckUtils]: 46: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode1~0 % 256); {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,874 INFO L290 TraceCheckUtils]: 47: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 % 256 < 2; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,874 INFO L290 TraceCheckUtils]: 48: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep12~0 % 256); {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,875 INFO L290 TraceCheckUtils]: 49: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep13~0 % 256); {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,875 INFO L290 TraceCheckUtils]: 50: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,875 INFO L290 TraceCheckUtils]: 51: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,876 INFO L290 TraceCheckUtils]: 52: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode2~0 % 256); {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,876 INFO L290 TraceCheckUtils]: 53: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 % 256 < 2; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,876 INFO L290 TraceCheckUtils]: 54: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep21~0 % 256); {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,877 INFO L290 TraceCheckUtils]: 55: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep23~0 % 256); {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,877 INFO L290 TraceCheckUtils]: 56: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,878 INFO L290 TraceCheckUtils]: 57: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,878 INFO L290 TraceCheckUtils]: 58: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode3~0 % 256); {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,878 INFO L290 TraceCheckUtils]: 59: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 % 256 < 2; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,879 INFO L290 TraceCheckUtils]: 60: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep31~0 % 256); {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,879 INFO L290 TraceCheckUtils]: 61: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep32~0 % 256); {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,879 INFO L290 TraceCheckUtils]: 62: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,880 INFO L290 TraceCheckUtils]: 63: Hoare triple {105215#(<= (+ ~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; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,880 INFO L290 TraceCheckUtils]: 64: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,881 INFO L290 TraceCheckUtils]: 65: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,881 INFO L290 TraceCheckUtils]: 66: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {105215#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:35,882 INFO L290 TraceCheckUtils]: 67: Hoare triple {105215#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);check_~tmp~1#1 := 0; {105213#false} is VALID [2022-02-20 18:25:35,882 INFO L290 TraceCheckUtils]: 68: Hoare triple {105213#false} check_#res#1 := check_~tmp~1#1; {105213#false} is VALID [2022-02-20 18:25:35,882 INFO L290 TraceCheckUtils]: 69: Hoare triple {105213#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; {105213#false} is VALID [2022-02-20 18:25:35,882 INFO L290 TraceCheckUtils]: 70: Hoare triple {105213#false} assume 0 == assert_~arg#1 % 256; {105213#false} is VALID [2022-02-20 18:25:35,882 INFO L290 TraceCheckUtils]: 71: Hoare triple {105213#false} assume !false; {105213#false} is VALID [2022-02-20 18:25:35,882 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:35,883 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:25:35,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680245590] [2022-02-20 18:25:35,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680245590] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:25:35,883 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:25:35,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:25:35,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777571107] [2022-02-20 18:25:35,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:25:35,884 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:35,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:25:35,884 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:35,939 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:35,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:25:35,940 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:25:35,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:25:35,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:25:35,940 INFO L87 Difference]: Start difference. First operand 6388 states and 10164 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)