./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.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-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.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 81fc918e1fab83089d488e981f8e2fc461bd57864199cdfbd6916c01a7d86fab --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:38:03,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:38:03,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:38:03,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:38:03,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:38:03,287 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:38:03,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:38:03,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:38:03,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:38:03,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:38:03,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:38:03,297 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:38:03,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:38:03,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:38:03,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:38:03,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:38:03,303 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:38:03,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:38:03,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:38:03,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:38:03,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:38:03,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:38:03,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:38:03,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:38:03,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:38:03,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:38:03,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:38:03,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:38:03,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:38:03,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:38:03,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:38:03,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:38:03,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:38:03,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:38:03,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:38:03,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:38:03,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:38:03,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:38:03,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:38:03,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:38:03,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:38:03,330 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:38:03,354 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:38:03,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:38:03,355 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:38:03,355 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:38:03,356 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:38:03,356 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:38:03,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:38:03,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:38:03,356 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:38:03,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:38:03,357 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:38:03,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:38:03,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:38:03,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:38:03,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:38:03,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:38:03,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:38:03,358 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:38:03,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:38:03,359 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:38:03,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:38:03,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:38:03,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:38:03,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:38:03,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:38:03,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:38:03,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:38:03,360 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:38:03,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:38:03,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:38:03,360 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:38:03,361 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:38:03,361 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:38:03,361 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 -> 81fc918e1fab83089d488e981f8e2fc461bd57864199cdfbd6916c01a7d86fab [2022-02-20 18:38:03,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:38:03,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:38:03,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:38:03,613 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:38:03,614 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:38:03,616 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:38:03,675 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb6189501/fc3f12196ca4469ea784b0051f75faef/FLAG736f6ee17 [2022-02-20 18:38:04,142 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:38:04,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:38:04,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb6189501/fc3f12196ca4469ea784b0051f75faef/FLAG736f6ee17 [2022-02-20 18:38:04,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb6189501/fc3f12196ca4469ea784b0051f75faef [2022-02-20 18:38:04,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:38:04,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:38:04,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:38:04,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:38:04,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:38:04,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:38:04" (1/1) ... [2022-02-20 18:38:04,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6884a923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:04, skipping insertion in model container [2022-02-20 18:38:04,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:38:04" (1/1) ... [2022-02-20 18:38:04,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:38:04,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:38:04,866 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-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7067,7080] [2022-02-20 18:38:04,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:38:04,922 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:38:04,967 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-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7067,7080] [2022-02-20 18:38:04,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:38:05,005 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:38:05,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:05 WrapperNode [2022-02-20 18:38:05,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:38:05,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:38:05,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:38:05,009 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:38:05,014 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:38:05" (1/1) ... [2022-02-20 18:38:05,033 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:38:05" (1/1) ... [2022-02-20 18:38:05,085 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 570 [2022-02-20 18:38:05,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:38:05,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:38:05,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:38:05,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:38:05,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:05" (1/1) ... [2022-02-20 18:38:05,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:05" (1/1) ... [2022-02-20 18:38:05,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:05" (1/1) ... [2022-02-20 18:38:05,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:05" (1/1) ... [2022-02-20 18:38:05,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:05" (1/1) ... [2022-02-20 18:38:05,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:05" (1/1) ... [2022-02-20 18:38:05,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:05" (1/1) ... [2022-02-20 18:38:05,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:38:05,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:38:05,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:38:05,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:38:05,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:05" (1/1) ... [2022-02-20 18:38:05,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:38:05,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:38:05,170 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:38:05,172 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:38:05,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:38:05,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:38:05,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:38:05,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:38:05,324 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:38:05,325 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:38:05,830 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:38:05,838 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:38:05,839 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:38:05,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:38:05 BoogieIcfgContainer [2022-02-20 18:38:05,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:38:05,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:38:05,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:38:05,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:38:05,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:38:04" (1/3) ... [2022-02-20 18:38:05,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b2d84fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:38:05, skipping insertion in model container [2022-02-20 18:38:05,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:05" (2/3) ... [2022-02-20 18:38:05,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b2d84fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:38:05, skipping insertion in model container [2022-02-20 18:38:05,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:38:05" (3/3) ... [2022-02-20 18:38:05,849 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:38:05,853 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:38:05,854 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:38:05,886 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:38:05,891 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:38:05,891 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:38:05,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.763779527559055) internal successors, (224), 128 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:05,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:38:05,912 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:05,912 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] [2022-02-20 18:38:05,913 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:05,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:05,916 INFO L85 PathProgramCache]: Analyzing trace with hash 794226412, now seen corresponding path program 1 times [2022-02-20 18:38:05,922 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:05,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805251012] [2022-02-20 18:38:05,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:05,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:06,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {132#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1756~0 := 0;~__return_1887~0 := 0;~__return_1985~0 := 0; {132#true} is VALID [2022-02-20 18:38:06,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {132#true} is VALID [2022-02-20 18:38:06,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {132#true} is VALID [2022-02-20 18:38:06,167 INFO L290 TraceCheckUtils]: 3: Hoare triple {132#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {132#true} is VALID [2022-02-20 18:38:06,167 INFO L290 TraceCheckUtils]: 4: Hoare triple {132#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {132#true} is VALID [2022-02-20 18:38:06,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {132#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {132#true} is VALID [2022-02-20 18:38:06,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {132#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {132#true} is VALID [2022-02-20 18:38:06,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {132#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {132#true} is VALID [2022-02-20 18:38:06,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {132#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {132#true} is VALID [2022-02-20 18:38:06,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {132#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {132#true} is VALID [2022-02-20 18:38:06,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {132#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {132#true} is VALID [2022-02-20 18:38:06,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {132#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {132#true} is VALID [2022-02-20 18:38:06,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {132#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {132#true} is VALID [2022-02-20 18:38:06,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {132#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {132#true} is VALID [2022-02-20 18:38:06,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {132#true} assume ~id1~0 != ~id2~0; {132#true} is VALID [2022-02-20 18:38:06,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {132#true} assume ~id1~0 != ~id3~0; {132#true} is VALID [2022-02-20 18:38:06,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {132#true} assume ~id2~0 != ~id3~0; {132#true} is VALID [2022-02-20 18:38:06,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {132#true} assume ~id1~0 >= 0; {132#true} is VALID [2022-02-20 18:38:06,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {132#true} assume ~id2~0 >= 0; {132#true} is VALID [2022-02-20 18:38:06,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {132#true} assume ~id3~0 >= 0; {132#true} is VALID [2022-02-20 18:38:06,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {132#true} assume 0 == ~r1~0; {134#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:06,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {134#(<= ~r1~0 0)} assume 0 == ~r2~0; {134#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:06,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {134#(<= ~r1~0 0)} assume 0 == ~r3~0; {134#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:06,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {134#(<= ~r1~0 0)} assume ~max1~0 == ~id1~0; {134#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:06,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {134#(<= ~r1~0 0)} assume ~max2~0 == ~id2~0; {134#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:06,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {134#(<= ~r1~0 0)} assume ~max3~0 == ~id3~0; {134#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:06,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {134#(<= ~r1~0 0)} assume 0 == ~st1~0; {134#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:06,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {134#(<= ~r1~0 0)} assume 0 == ~st2~0; {134#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:06,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {134#(<= ~r1~0 0)} assume 0 == ~st3~0; {134#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:06,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {134#(<= ~r1~0 0)} assume 0 == ~nl1~0; {134#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:06,175 INFO L290 TraceCheckUtils]: 30: Hoare triple {134#(<= ~r1~0 0)} assume 0 == ~nl2~0; {134#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:06,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {134#(<= ~r1~0 0)} assume 0 == ~nl3~0; {134#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:06,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {134#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {134#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:06,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {134#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {134#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:06,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {134#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1756~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1756~0; {134#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:06,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {134#(<= ~r1~0 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {134#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:06,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {134#(<= ~r1~0 0)} assume main_~main__i2~0#1 < 6; {134#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:06,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {134#(<= ~r1~0 0)} assume !!(0 == ~mode1~0 % 256); {134#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:06,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {134#(<= ~r1~0 0)} assume !(~r1~0 < 2); {133#false} is VALID [2022-02-20 18:38:06,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {133#false} ~mode1~0 := 1; {133#false} is VALID [2022-02-20 18:38:06,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {133#false} assume !!(0 == ~mode2~0 % 256); {133#false} is VALID [2022-02-20 18:38:06,180 INFO L290 TraceCheckUtils]: 41: Hoare triple {133#false} assume !(~r2~0 < 2); {133#false} is VALID [2022-02-20 18:38:06,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {133#false} ~mode2~0 := 1; {133#false} is VALID [2022-02-20 18:38:06,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {133#false} assume !!(0 == ~mode3~0 % 256); {133#false} is VALID [2022-02-20 18:38:06,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {133#false} assume !(~r3~0 < 2); {133#false} is VALID [2022-02-20 18:38:06,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {133#false} ~mode3~0 := 1; {133#false} is VALID [2022-02-20 18:38:06,181 INFO L290 TraceCheckUtils]: 46: Hoare triple {133#false} ~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;havoc main_~check__tmp~0#1; {133#false} is VALID [2022-02-20 18:38:06,181 INFO L290 TraceCheckUtils]: 47: Hoare triple {133#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {133#false} is VALID [2022-02-20 18:38:06,181 INFO L290 TraceCheckUtils]: 48: Hoare triple {133#false} ~__return_1887~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1887~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {133#false} is VALID [2022-02-20 18:38:06,184 INFO L290 TraceCheckUtils]: 49: Hoare triple {133#false} assume 0 == main_~assert__arg~0#1 % 256; {133#false} is VALID [2022-02-20 18:38:06,186 INFO L290 TraceCheckUtils]: 50: Hoare triple {133#false} assume !false; {133#false} is VALID [2022-02-20 18:38:06,187 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:38:06,188 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:06,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805251012] [2022-02-20 18:38:06,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805251012] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:06,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:06,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:06,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394531477] [2022-02-20 18:38:06,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:06,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:38:06,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:06,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:06,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:06,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:06,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:06,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:06,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:06,275 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.763779527559055) internal successors, (224), 128 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:06,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:06,672 INFO L93 Difference]: Finished difference Result 282 states and 479 transitions. [2022-02-20 18:38:06,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:06,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:38:06,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-02-20 18:38:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-02-20 18:38:06,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 479 transitions. [2022-02-20 18:38:07,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:07,023 INFO L225 Difference]: With dead ends: 282 [2022-02-20 18:38:07,023 INFO L226 Difference]: Without dead ends: 195 [2022-02-20 18:38:07,026 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:38:07,029 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 125 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:07,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 400 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:07,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-02-20 18:38:07,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2022-02-20 18:38:07,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:07,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand has 193 states, 192 states have (on average 1.5989583333333333) internal successors, (307), 192 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:07,086 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand has 193 states, 192 states have (on average 1.5989583333333333) internal successors, (307), 192 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:07,086 INFO L87 Difference]: Start difference. First operand 195 states. Second operand has 193 states, 192 states have (on average 1.5989583333333333) internal successors, (307), 192 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:07,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:07,101 INFO L93 Difference]: Finished difference Result 195 states and 308 transitions. [2022-02-20 18:38:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 308 transitions. [2022-02-20 18:38:07,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:07,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:07,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 192 states have (on average 1.5989583333333333) internal successors, (307), 192 states have internal predecessors, (307), 0 states have call successors, (0), 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 195 states. [2022-02-20 18:38:07,103 INFO L87 Difference]: Start difference. First operand has 193 states, 192 states have (on average 1.5989583333333333) internal successors, (307), 192 states have internal predecessors, (307), 0 states have call successors, (0), 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 195 states. [2022-02-20 18:38:07,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:07,110 INFO L93 Difference]: Finished difference Result 195 states and 308 transitions. [2022-02-20 18:38:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 308 transitions. [2022-02-20 18:38:07,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:07,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:07,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:07,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.5989583333333333) internal successors, (307), 192 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:07,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 307 transitions. [2022-02-20 18:38:07,119 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 307 transitions. Word has length 51 [2022-02-20 18:38:07,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:07,119 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 307 transitions. [2022-02-20 18:38:07,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:07,120 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 307 transitions. [2022-02-20 18:38:07,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:38:07,121 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:07,121 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] [2022-02-20 18:38:07,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:38:07,122 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:07,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:07,122 INFO L85 PathProgramCache]: Analyzing trace with hash -797280551, now seen corresponding path program 1 times [2022-02-20 18:38:07,122 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:07,123 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467387200] [2022-02-20 18:38:07,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:07,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:07,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {1186#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1756~0 := 0;~__return_1887~0 := 0;~__return_1985~0 := 0; {1186#true} is VALID [2022-02-20 18:38:07,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {1186#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {1186#true} is VALID [2022-02-20 18:38:07,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {1186#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {1186#true} is VALID [2022-02-20 18:38:07,265 INFO L290 TraceCheckUtils]: 3: Hoare triple {1186#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {1186#true} is VALID [2022-02-20 18:38:07,265 INFO L290 TraceCheckUtils]: 4: Hoare triple {1186#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {1186#true} is VALID [2022-02-20 18:38:07,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {1186#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {1186#true} is VALID [2022-02-20 18:38:07,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {1186#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {1186#true} is VALID [2022-02-20 18:38:07,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {1186#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {1186#true} is VALID [2022-02-20 18:38:07,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {1186#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {1186#true} is VALID [2022-02-20 18:38:07,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {1186#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {1186#true} is VALID [2022-02-20 18:38:07,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {1186#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {1186#true} is VALID [2022-02-20 18:38:07,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {1186#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {1186#true} is VALID [2022-02-20 18:38:07,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {1186#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {1186#true} is VALID [2022-02-20 18:38:07,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {1186#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {1186#true} is VALID [2022-02-20 18:38:07,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {1186#true} assume ~id1~0 != ~id2~0; {1186#true} is VALID [2022-02-20 18:38:07,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {1186#true} assume ~id1~0 != ~id3~0; {1186#true} is VALID [2022-02-20 18:38:07,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {1186#true} assume ~id2~0 != ~id3~0; {1186#true} is VALID [2022-02-20 18:38:07,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {1186#true} assume ~id1~0 >= 0; {1186#true} is VALID [2022-02-20 18:38:07,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {1186#true} assume ~id2~0 >= 0; {1186#true} is VALID [2022-02-20 18:38:07,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {1186#true} assume ~id3~0 >= 0; {1186#true} is VALID [2022-02-20 18:38:07,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {1186#true} assume 0 == ~r1~0; {1186#true} is VALID [2022-02-20 18:38:07,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {1186#true} assume 0 == ~r2~0; {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {1188#(<= ~r2~0 0)} assume 0 == ~r3~0; {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {1188#(<= ~r2~0 0)} assume ~max1~0 == ~id1~0; {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {1188#(<= ~r2~0 0)} assume ~max2~0 == ~id2~0; {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {1188#(<= ~r2~0 0)} assume ~max3~0 == ~id3~0; {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {1188#(<= ~r2~0 0)} assume 0 == ~st1~0; {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {1188#(<= ~r2~0 0)} assume 0 == ~st2~0; {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {1188#(<= ~r2~0 0)} assume 0 == ~st3~0; {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {1188#(<= ~r2~0 0)} assume 0 == ~nl1~0; {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,270 INFO L290 TraceCheckUtils]: 30: Hoare triple {1188#(<= ~r2~0 0)} assume 0 == ~nl2~0; {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {1188#(<= ~r2~0 0)} assume 0 == ~nl3~0; {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,271 INFO L290 TraceCheckUtils]: 32: Hoare triple {1188#(<= ~r2~0 0)} assume 0 == ~mode1~0 % 256; {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,271 INFO L290 TraceCheckUtils]: 33: Hoare triple {1188#(<= ~r2~0 0)} assume 0 == ~mode2~0 % 256; {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,271 INFO L290 TraceCheckUtils]: 34: Hoare triple {1188#(<= ~r2~0 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1756~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1756~0; {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,272 INFO L290 TraceCheckUtils]: 35: Hoare triple {1188#(<= ~r2~0 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {1188#(<= ~r2~0 0)} assume main_~main__i2~0#1 < 6; {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,272 INFO L290 TraceCheckUtils]: 37: Hoare triple {1188#(<= ~r2~0 0)} assume !!(0 == ~mode1~0 % 256); {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,273 INFO L290 TraceCheckUtils]: 38: Hoare triple {1188#(<= ~r2~0 0)} assume ~r1~0 < 2; {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,273 INFO L290 TraceCheckUtils]: 39: Hoare triple {1188#(<= ~r2~0 0)} assume !!(0 == ~ep12~0 % 256); {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,273 INFO L290 TraceCheckUtils]: 40: Hoare triple {1188#(<= ~r2~0 0)} assume !!(0 == ~ep13~0 % 256); {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {1188#(<= ~r2~0 0)} ~mode1~0 := 1; {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {1188#(<= ~r2~0 0)} assume !!(0 == ~mode2~0 % 256); {1188#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:07,274 INFO L290 TraceCheckUtils]: 43: Hoare triple {1188#(<= ~r2~0 0)} assume !(~r2~0 < 2); {1187#false} is VALID [2022-02-20 18:38:07,275 INFO L290 TraceCheckUtils]: 44: Hoare triple {1187#false} ~mode2~0 := 1; {1187#false} is VALID [2022-02-20 18:38:07,275 INFO L290 TraceCheckUtils]: 45: Hoare triple {1187#false} assume !!(0 == ~mode3~0 % 256); {1187#false} is VALID [2022-02-20 18:38:07,275 INFO L290 TraceCheckUtils]: 46: Hoare triple {1187#false} assume !(~r3~0 < 2); {1187#false} is VALID [2022-02-20 18:38:07,275 INFO L290 TraceCheckUtils]: 47: Hoare triple {1187#false} ~mode3~0 := 1; {1187#false} is VALID [2022-02-20 18:38:07,275 INFO L290 TraceCheckUtils]: 48: Hoare triple {1187#false} ~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;havoc main_~check__tmp~0#1; {1187#false} is VALID [2022-02-20 18:38:07,275 INFO L290 TraceCheckUtils]: 49: Hoare triple {1187#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1187#false} is VALID [2022-02-20 18:38:07,275 INFO L290 TraceCheckUtils]: 50: Hoare triple {1187#false} ~__return_1887~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1887~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {1187#false} is VALID [2022-02-20 18:38:07,275 INFO L290 TraceCheckUtils]: 51: Hoare triple {1187#false} assume 0 == main_~assert__arg~0#1 % 256; {1187#false} is VALID [2022-02-20 18:38:07,275 INFO L290 TraceCheckUtils]: 52: Hoare triple {1187#false} assume !false; {1187#false} is VALID [2022-02-20 18:38:07,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:38:07,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:07,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467387200] [2022-02-20 18:38:07,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467387200] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:07,276 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:07,276 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:07,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813863419] [2022-02-20 18:38:07,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:07,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-02-20 18:38:07,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:07,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:07,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:07,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:07,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:07,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:07,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:07,308 INFO L87 Difference]: Start difference. First operand 193 states and 307 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:07,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:07,607 INFO L93 Difference]: Finished difference Result 469 states and 763 transitions. [2022-02-20 18:38:07,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:07,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-02-20 18:38:07,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2022-02-20 18:38:07,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2022-02-20 18:38:07,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 449 transitions. [2022-02-20 18:38:07,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 449 edges. 449 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:07,897 INFO L225 Difference]: With dead ends: 469 [2022-02-20 18:38:07,898 INFO L226 Difference]: Without dead ends: 324 [2022-02-20 18:38:07,899 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:38:07,900 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 110 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 436 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:38:07,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 436 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:07,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-02-20 18:38:07,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2022-02-20 18:38:07,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:07,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 324 states. Second operand has 322 states, 321 states have (on average 1.6168224299065421) internal successors, (519), 321 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:07,988 INFO L74 IsIncluded]: Start isIncluded. First operand 324 states. Second operand has 322 states, 321 states have (on average 1.6168224299065421) internal successors, (519), 321 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:07,989 INFO L87 Difference]: Start difference. First operand 324 states. Second operand has 322 states, 321 states have (on average 1.6168224299065421) internal successors, (519), 321 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:07,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:07,997 INFO L93 Difference]: Finished difference Result 324 states and 520 transitions. [2022-02-20 18:38:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 520 transitions. [2022-02-20 18:38:07,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:07,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:08,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 322 states, 321 states have (on average 1.6168224299065421) internal successors, (519), 321 states have internal predecessors, (519), 0 states have call successors, (0), 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 324 states. [2022-02-20 18:38:08,001 INFO L87 Difference]: Start difference. First operand has 322 states, 321 states have (on average 1.6168224299065421) internal successors, (519), 321 states have internal predecessors, (519), 0 states have call successors, (0), 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 324 states. [2022-02-20 18:38:08,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:08,011 INFO L93 Difference]: Finished difference Result 324 states and 520 transitions. [2022-02-20 18:38:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 520 transitions. [2022-02-20 18:38:08,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:08,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:08,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:08,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:08,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 1.6168224299065421) internal successors, (519), 321 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:08,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 519 transitions. [2022-02-20 18:38:08,026 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 519 transitions. Word has length 53 [2022-02-20 18:38:08,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:08,026 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 519 transitions. [2022-02-20 18:38:08,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:08,026 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 519 transitions. [2022-02-20 18:38:08,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:38:08,027 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:08,027 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] [2022-02-20 18:38:08,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:38:08,028 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:08,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:08,028 INFO L85 PathProgramCache]: Analyzing trace with hash 59105759, now seen corresponding path program 1 times [2022-02-20 18:38:08,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:08,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170100402] [2022-02-20 18:38:08,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:08,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:08,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {2965#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1756~0 := 0;~__return_1887~0 := 0;~__return_1985~0 := 0; {2965#true} is VALID [2022-02-20 18:38:08,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {2965#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {2965#true} is VALID [2022-02-20 18:38:08,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {2965#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {2965#true} is VALID [2022-02-20 18:38:08,103 INFO L290 TraceCheckUtils]: 3: Hoare triple {2965#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {2965#true} is VALID [2022-02-20 18:38:08,104 INFO L290 TraceCheckUtils]: 4: Hoare triple {2965#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {2965#true} is VALID [2022-02-20 18:38:08,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {2965#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {2965#true} is VALID [2022-02-20 18:38:08,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {2965#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {2965#true} is VALID [2022-02-20 18:38:08,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {2965#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {2965#true} is VALID [2022-02-20 18:38:08,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {2965#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {2965#true} is VALID [2022-02-20 18:38:08,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {2965#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {2965#true} is VALID [2022-02-20 18:38:08,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {2965#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {2965#true} is VALID [2022-02-20 18:38:08,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {2965#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {2965#true} is VALID [2022-02-20 18:38:08,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {2965#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {2965#true} is VALID [2022-02-20 18:38:08,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {2965#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {2965#true} is VALID [2022-02-20 18:38:08,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {2965#true} assume ~id1~0 != ~id2~0; {2965#true} is VALID [2022-02-20 18:38:08,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {2965#true} assume ~id1~0 != ~id3~0; {2965#true} is VALID [2022-02-20 18:38:08,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {2965#true} assume ~id2~0 != ~id3~0; {2965#true} is VALID [2022-02-20 18:38:08,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {2965#true} assume ~id1~0 >= 0; {2965#true} is VALID [2022-02-20 18:38:08,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {2965#true} assume ~id2~0 >= 0; {2965#true} is VALID [2022-02-20 18:38:08,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {2965#true} assume ~id3~0 >= 0; {2965#true} is VALID [2022-02-20 18:38:08,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {2965#true} assume 0 == ~r1~0; {2965#true} is VALID [2022-02-20 18:38:08,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {2965#true} assume 0 == ~r2~0; {2965#true} is VALID [2022-02-20 18:38:08,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {2965#true} assume 0 == ~r3~0; {2965#true} is VALID [2022-02-20 18:38:08,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {2965#true} assume ~max1~0 == ~id1~0; {2965#true} is VALID [2022-02-20 18:38:08,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {2965#true} assume ~max2~0 == ~id2~0; {2965#true} is VALID [2022-02-20 18:38:08,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {2965#true} assume ~max3~0 == ~id3~0; {2965#true} is VALID [2022-02-20 18:38:08,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {2965#true} assume 0 == ~st1~0; {2965#true} is VALID [2022-02-20 18:38:08,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {2965#true} assume 0 == ~st2~0; {2965#true} is VALID [2022-02-20 18:38:08,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {2965#true} assume 0 == ~st3~0; {2965#true} is VALID [2022-02-20 18:38:08,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {2965#true} assume 0 == ~nl1~0; {2965#true} is VALID [2022-02-20 18:38:08,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {2965#true} assume 0 == ~nl2~0; {2965#true} is VALID [2022-02-20 18:38:08,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {2965#true} assume 0 == ~nl3~0; {2965#true} is VALID [2022-02-20 18:38:08,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {2965#true} assume 0 == ~mode1~0 % 256; {2965#true} is VALID [2022-02-20 18:38:08,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {2965#true} assume 0 == ~mode2~0 % 256; {2967#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:08,109 INFO L290 TraceCheckUtils]: 34: Hoare triple {2967#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1756~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1756~0; {2967#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:08,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {2967#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {2967#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:08,110 INFO L290 TraceCheckUtils]: 36: Hoare triple {2967#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume main_~main__i2~0#1 < 6; {2967#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:08,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {2967#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {2967#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:08,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {2967#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 < 2; {2967#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:08,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {2967#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~ep12~0 % 256); {2967#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:08,112 INFO L290 TraceCheckUtils]: 40: Hoare triple {2967#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~ep13~0 % 256); {2967#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:08,112 INFO L290 TraceCheckUtils]: 41: Hoare triple {2967#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {2967#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:08,113 INFO L290 TraceCheckUtils]: 42: Hoare triple {2967#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {2966#false} is VALID [2022-02-20 18:38:08,113 INFO L290 TraceCheckUtils]: 43: Hoare triple {2966#false} assume !!(0 == ~ep12~0 % 256); {2966#false} is VALID [2022-02-20 18:38:08,113 INFO L290 TraceCheckUtils]: 44: Hoare triple {2966#false} assume !!(0 == ~ep32~0 % 256); {2966#false} is VALID [2022-02-20 18:38:08,114 INFO L290 TraceCheckUtils]: 45: Hoare triple {2966#false} assume !(2 == ~r2~0); {2966#false} is VALID [2022-02-20 18:38:08,114 INFO L290 TraceCheckUtils]: 46: Hoare triple {2966#false} ~mode2~0 := 0; {2966#false} is VALID [2022-02-20 18:38:08,114 INFO L290 TraceCheckUtils]: 47: Hoare triple {2966#false} assume !!(0 == ~mode3~0 % 256); {2966#false} is VALID [2022-02-20 18:38:08,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {2966#false} assume !(~r3~0 < 2); {2966#false} is VALID [2022-02-20 18:38:08,114 INFO L290 TraceCheckUtils]: 49: Hoare triple {2966#false} ~mode3~0 := 1; {2966#false} is VALID [2022-02-20 18:38:08,114 INFO L290 TraceCheckUtils]: 50: Hoare triple {2966#false} ~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;havoc main_~check__tmp~0#1; {2966#false} is VALID [2022-02-20 18:38:08,115 INFO L290 TraceCheckUtils]: 51: Hoare triple {2966#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {2966#false} is VALID [2022-02-20 18:38:08,115 INFO L290 TraceCheckUtils]: 52: Hoare triple {2966#false} ~__return_1887~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1887~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {2966#false} is VALID [2022-02-20 18:38:08,115 INFO L290 TraceCheckUtils]: 53: Hoare triple {2966#false} assume 0 == main_~assert__arg~0#1 % 256; {2966#false} is VALID [2022-02-20 18:38:08,115 INFO L290 TraceCheckUtils]: 54: Hoare triple {2966#false} assume !false; {2966#false} is VALID [2022-02-20 18:38:08,115 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:38:08,116 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:08,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170100402] [2022-02-20 18:38:08,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170100402] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:08,116 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:08,116 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:08,116 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622058002] [2022-02-20 18:38:08,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:08,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 18:38:08,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:08,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:08,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:08,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:08,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:08,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:08,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:08,145 INFO L87 Difference]: Start difference. First operand 322 states and 519 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:08,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:08,470 INFO L93 Difference]: Finished difference Result 597 states and 975 transitions. [2022-02-20 18:38:08,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:08,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 18:38:08,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:08,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-02-20 18:38:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-02-20 18:38:08,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 430 transitions. [2022-02-20 18:38:08,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:08,792 INFO L225 Difference]: With dead ends: 597 [2022-02-20 18:38:08,792 INFO L226 Difference]: Without dead ends: 452 [2022-02-20 18:38:08,793 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:38:08,794 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 111 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 432 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:38:08,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 432 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:08,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-02-20 18:38:08,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 450. [2022-02-20 18:38:08,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:08,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 452 states. Second operand has 450 states, 449 states have (on average 1.623608017817372) internal successors, (729), 449 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:08,870 INFO L74 IsIncluded]: Start isIncluded. First operand 452 states. Second operand has 450 states, 449 states have (on average 1.623608017817372) internal successors, (729), 449 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:08,871 INFO L87 Difference]: Start difference. First operand 452 states. Second operand has 450 states, 449 states have (on average 1.623608017817372) internal successors, (729), 449 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:08,882 INFO L93 Difference]: Finished difference Result 452 states and 730 transitions. [2022-02-20 18:38:08,882 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 730 transitions. [2022-02-20 18:38:08,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:08,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:08,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 450 states, 449 states have (on average 1.623608017817372) internal successors, (729), 449 states have internal predecessors, (729), 0 states have call successors, (0), 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 452 states. [2022-02-20 18:38:08,884 INFO L87 Difference]: Start difference. First operand has 450 states, 449 states have (on average 1.623608017817372) internal successors, (729), 449 states have internal predecessors, (729), 0 states have call successors, (0), 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 452 states. [2022-02-20 18:38:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:08,896 INFO L93 Difference]: Finished difference Result 452 states and 730 transitions. [2022-02-20 18:38:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 730 transitions. [2022-02-20 18:38:08,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:08,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:08,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:08,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 1.623608017817372) internal successors, (729), 449 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 729 transitions. [2022-02-20 18:38:08,909 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 729 transitions. Word has length 55 [2022-02-20 18:38:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:08,909 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 729 transitions. [2022-02-20 18:38:08,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 729 transitions. [2022-02-20 18:38:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:38:08,910 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:08,910 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] [2022-02-20 18:38:08,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:38:08,910 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:08,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:08,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1104417908, now seen corresponding path program 1 times [2022-02-20 18:38:08,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:08,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198956428] [2022-02-20 18:38:08,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:08,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:08,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {5378#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1756~0 := 0;~__return_1887~0 := 0;~__return_1985~0 := 0; {5378#true} is VALID [2022-02-20 18:38:08,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {5378#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {5378#true} is VALID [2022-02-20 18:38:08,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {5378#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {5378#true} is VALID [2022-02-20 18:38:08,962 INFO L290 TraceCheckUtils]: 3: Hoare triple {5378#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {5378#true} is VALID [2022-02-20 18:38:08,962 INFO L290 TraceCheckUtils]: 4: Hoare triple {5378#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {5378#true} is VALID [2022-02-20 18:38:08,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {5378#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {5378#true} is VALID [2022-02-20 18:38:08,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {5378#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {5378#true} is VALID [2022-02-20 18:38:08,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {5378#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {5378#true} is VALID [2022-02-20 18:38:08,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {5378#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {5378#true} is VALID [2022-02-20 18:38:08,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {5378#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {5378#true} is VALID [2022-02-20 18:38:08,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {5378#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {5378#true} is VALID [2022-02-20 18:38:08,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {5378#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {5378#true} is VALID [2022-02-20 18:38:08,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {5378#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {5378#true} is VALID [2022-02-20 18:38:08,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {5378#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {5378#true} is VALID [2022-02-20 18:38:08,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {5378#true} assume ~id1~0 != ~id2~0; {5378#true} is VALID [2022-02-20 18:38:08,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {5378#true} assume ~id1~0 != ~id3~0; {5378#true} is VALID [2022-02-20 18:38:08,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {5378#true} assume ~id2~0 != ~id3~0; {5378#true} is VALID [2022-02-20 18:38:08,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {5378#true} assume ~id1~0 >= 0; {5378#true} is VALID [2022-02-20 18:38:08,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {5378#true} assume ~id2~0 >= 0; {5378#true} is VALID [2022-02-20 18:38:08,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {5378#true} assume ~id3~0 >= 0; {5378#true} is VALID [2022-02-20 18:38:08,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {5378#true} assume 0 == ~r1~0; {5378#true} is VALID [2022-02-20 18:38:08,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {5378#true} assume 0 == ~r2~0; {5378#true} is VALID [2022-02-20 18:38:08,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {5378#true} assume 0 == ~r3~0; {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {5380#(<= ~r3~0 0)} assume ~max1~0 == ~id1~0; {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {5380#(<= ~r3~0 0)} assume ~max2~0 == ~id2~0; {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {5380#(<= ~r3~0 0)} assume ~max3~0 == ~id3~0; {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {5380#(<= ~r3~0 0)} assume 0 == ~st1~0; {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {5380#(<= ~r3~0 0)} assume 0 == ~st2~0; {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {5380#(<= ~r3~0 0)} assume 0 == ~st3~0; {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {5380#(<= ~r3~0 0)} assume 0 == ~nl1~0; {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {5380#(<= ~r3~0 0)} assume 0 == ~nl2~0; {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {5380#(<= ~r3~0 0)} assume 0 == ~nl3~0; {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {5380#(<= ~r3~0 0)} assume 0 == ~mode1~0 % 256; {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {5380#(<= ~r3~0 0)} assume 0 == ~mode2~0 % 256; {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {5380#(<= ~r3~0 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1756~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1756~0; {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,968 INFO L290 TraceCheckUtils]: 35: Hoare triple {5380#(<= ~r3~0 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {5380#(<= ~r3~0 0)} assume main_~main__i2~0#1 < 6; {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,968 INFO L290 TraceCheckUtils]: 37: Hoare triple {5380#(<= ~r3~0 0)} assume !!(0 == ~mode1~0 % 256); {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {5380#(<= ~r3~0 0)} assume ~r1~0 < 2; {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,969 INFO L290 TraceCheckUtils]: 39: Hoare triple {5380#(<= ~r3~0 0)} assume !!(0 == ~ep12~0 % 256); {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,969 INFO L290 TraceCheckUtils]: 40: Hoare triple {5380#(<= ~r3~0 0)} assume !!(0 == ~ep13~0 % 256); {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,969 INFO L290 TraceCheckUtils]: 41: Hoare triple {5380#(<= ~r3~0 0)} ~mode1~0 := 1; {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {5380#(<= ~r3~0 0)} assume !!(0 == ~mode2~0 % 256); {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {5380#(<= ~r3~0 0)} assume ~r2~0 < 2; {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {5380#(<= ~r3~0 0)} assume !!(0 == ~ep21~0 % 256); {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {5380#(<= ~r3~0 0)} assume !!(0 == ~ep23~0 % 256); {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {5380#(<= ~r3~0 0)} ~mode2~0 := 1; {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,971 INFO L290 TraceCheckUtils]: 47: Hoare triple {5380#(<= ~r3~0 0)} assume !!(0 == ~mode3~0 % 256); {5380#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:08,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {5380#(<= ~r3~0 0)} assume !(~r3~0 < 2); {5379#false} is VALID [2022-02-20 18:38:08,971 INFO L290 TraceCheckUtils]: 49: Hoare triple {5379#false} ~mode3~0 := 1; {5379#false} is VALID [2022-02-20 18:38:08,972 INFO L290 TraceCheckUtils]: 50: Hoare triple {5379#false} ~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;havoc main_~check__tmp~0#1; {5379#false} is VALID [2022-02-20 18:38:08,972 INFO L290 TraceCheckUtils]: 51: Hoare triple {5379#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {5379#false} is VALID [2022-02-20 18:38:08,972 INFO L290 TraceCheckUtils]: 52: Hoare triple {5379#false} ~__return_1887~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1887~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {5379#false} is VALID [2022-02-20 18:38:08,972 INFO L290 TraceCheckUtils]: 53: Hoare triple {5379#false} assume 0 == main_~assert__arg~0#1 % 256; {5379#false} is VALID [2022-02-20 18:38:08,972 INFO L290 TraceCheckUtils]: 54: Hoare triple {5379#false} assume !false; {5379#false} is VALID [2022-02-20 18:38:08,972 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:38:08,972 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:08,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198956428] [2022-02-20 18:38:08,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198956428] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:08,973 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:08,973 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:08,973 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210204219] [2022-02-20 18:38:08,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:08,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 18:38:08,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:08,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:08,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:08,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:09,000 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:09,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:09,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:09,000 INFO L87 Difference]: Start difference. First operand 450 states and 729 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:09,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:09,422 INFO L93 Difference]: Finished difference Result 1166 states and 1905 transitions. [2022-02-20 18:38:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:09,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 18:38:09,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:09,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2022-02-20 18:38:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2022-02-20 18:38:09,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 449 transitions. [2022-02-20 18:38:09,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 449 edges. 449 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:09,695 INFO L225 Difference]: With dead ends: 1166 [2022-02-20 18:38:09,696 INFO L226 Difference]: Without dead ends: 787 [2022-02-20 18:38:09,697 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:38:09,698 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 105 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 374 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:38:09,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 374 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:09,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2022-02-20 18:38:09,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 785. [2022-02-20 18:38:09,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:09,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 787 states. Second operand has 785 states, 784 states have (on average 1.621173469387755) internal successors, (1271), 784 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:09,911 INFO L74 IsIncluded]: Start isIncluded. First operand 787 states. Second operand has 785 states, 784 states have (on average 1.621173469387755) internal successors, (1271), 784 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:09,912 INFO L87 Difference]: Start difference. First operand 787 states. Second operand has 785 states, 784 states have (on average 1.621173469387755) internal successors, (1271), 784 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:09,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:09,935 INFO L93 Difference]: Finished difference Result 787 states and 1272 transitions. [2022-02-20 18:38:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1272 transitions. [2022-02-20 18:38:09,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:09,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:09,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 785 states, 784 states have (on average 1.621173469387755) internal successors, (1271), 784 states have internal predecessors, (1271), 0 states have call successors, (0), 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 787 states. [2022-02-20 18:38:09,939 INFO L87 Difference]: Start difference. First operand has 785 states, 784 states have (on average 1.621173469387755) internal successors, (1271), 784 states have internal predecessors, (1271), 0 states have call successors, (0), 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 787 states. [2022-02-20 18:38:09,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:09,960 INFO L93 Difference]: Finished difference Result 787 states and 1272 transitions. [2022-02-20 18:38:09,960 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1272 transitions. [2022-02-20 18:38:09,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:09,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:09,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:09,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:09,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 784 states have (on average 1.621173469387755) internal successors, (1271), 784 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1271 transitions. [2022-02-20 18:38:09,990 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1271 transitions. Word has length 55 [2022-02-20 18:38:09,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:09,990 INFO L470 AbstractCegarLoop]: Abstraction has 785 states and 1271 transitions. [2022-02-20 18:38:09,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1271 transitions. [2022-02-20 18:38:09,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:38:09,991 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:09,991 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:38:09,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:38:09,991 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:09,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash -179259079, now seen corresponding path program 1 times [2022-02-20 18:38:09,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:09,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48724846] [2022-02-20 18:38:09,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:09,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:10,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {9793#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1756~0 := 0;~__return_1887~0 := 0;~__return_1985~0 := 0; {9793#true} is VALID [2022-02-20 18:38:10,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {9793#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {9793#true} is VALID [2022-02-20 18:38:10,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {9793#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {9793#true} is VALID [2022-02-20 18:38:10,050 INFO L290 TraceCheckUtils]: 3: Hoare triple {9793#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {9793#true} is VALID [2022-02-20 18:38:10,051 INFO L290 TraceCheckUtils]: 4: Hoare triple {9793#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {9793#true} is VALID [2022-02-20 18:38:10,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {9793#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {9793#true} is VALID [2022-02-20 18:38:10,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {9793#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {9793#true} is VALID [2022-02-20 18:38:10,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {9793#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {9793#true} is VALID [2022-02-20 18:38:10,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {9793#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {9793#true} is VALID [2022-02-20 18:38:10,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {9793#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {9793#true} is VALID [2022-02-20 18:38:10,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {9793#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {9793#true} is VALID [2022-02-20 18:38:10,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {9793#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {9793#true} is VALID [2022-02-20 18:38:10,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {9793#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {9793#true} is VALID [2022-02-20 18:38:10,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {9793#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {9793#true} is VALID [2022-02-20 18:38:10,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {9793#true} assume ~id1~0 != ~id2~0; {9793#true} is VALID [2022-02-20 18:38:10,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {9793#true} assume ~id1~0 != ~id3~0; {9793#true} is VALID [2022-02-20 18:38:10,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {9793#true} assume ~id2~0 != ~id3~0; {9793#true} is VALID [2022-02-20 18:38:10,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {9793#true} assume ~id1~0 >= 0; {9793#true} is VALID [2022-02-20 18:38:10,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {9793#true} assume ~id2~0 >= 0; {9793#true} is VALID [2022-02-20 18:38:10,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {9793#true} assume ~id3~0 >= 0; {9793#true} is VALID [2022-02-20 18:38:10,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {9793#true} assume 0 == ~r1~0; {9793#true} is VALID [2022-02-20 18:38:10,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {9793#true} assume 0 == ~r2~0; {9793#true} is VALID [2022-02-20 18:38:10,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {9793#true} assume 0 == ~r3~0; {9793#true} is VALID [2022-02-20 18:38:10,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {9793#true} assume ~max1~0 == ~id1~0; {9793#true} is VALID [2022-02-20 18:38:10,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {9793#true} assume ~max2~0 == ~id2~0; {9793#true} is VALID [2022-02-20 18:38:10,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {9793#true} assume ~max3~0 == ~id3~0; {9793#true} is VALID [2022-02-20 18:38:10,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {9793#true} assume 0 == ~st1~0; {9795#(<= ~st1~0 0)} is VALID [2022-02-20 18:38:10,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {9795#(<= ~st1~0 0)} assume 0 == ~st2~0; {9796#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {9796#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1756~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1756~0; {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6; {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 2; {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,057 INFO L290 TraceCheckUtils]: 39: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 < 2; {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,059 INFO L290 TraceCheckUtils]: 44: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,059 INFO L290 TraceCheckUtils]: 45: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,059 INFO L290 TraceCheckUtils]: 46: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,060 INFO L290 TraceCheckUtils]: 47: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,060 INFO L290 TraceCheckUtils]: 48: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 < 2; {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,060 INFO L290 TraceCheckUtils]: 49: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,060 INFO L290 TraceCheckUtils]: 50: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,061 INFO L290 TraceCheckUtils]: 51: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,061 INFO L290 TraceCheckUtils]: 52: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~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;havoc main_~check__tmp~0#1; {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:10,061 INFO L290 TraceCheckUtils]: 53: Hoare triple {9797#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {9794#false} is VALID [2022-02-20 18:38:10,062 INFO L290 TraceCheckUtils]: 54: Hoare triple {9794#false} ~__return_1887~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1887~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {9794#false} is VALID [2022-02-20 18:38:10,062 INFO L290 TraceCheckUtils]: 55: Hoare triple {9794#false} assume 0 == main_~assert__arg~0#1 % 256; {9794#false} is VALID [2022-02-20 18:38:10,062 INFO L290 TraceCheckUtils]: 56: Hoare triple {9794#false} assume !false; {9794#false} is VALID [2022-02-20 18:38:10,062 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:38:10,062 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:10,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48724846] [2022-02-20 18:38:10,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48724846] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:10,063 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:10,063 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:38:10,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538725972] [2022-02-20 18:38:10,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:10,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-20 18:38:10,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:10,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:10,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:10,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:38:10,092 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:10,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:38:10,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:38:10,093 INFO L87 Difference]: Start difference. First operand 785 states and 1271 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:12,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:12,866 INFO L93 Difference]: Finished difference Result 3562 states and 5882 transitions. [2022-02-20 18:38:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:38:12,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-20 18:38:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:12,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 990 transitions. [2022-02-20 18:38:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 990 transitions. [2022-02-20 18:38:12,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 990 transitions. [2022-02-20 18:38:13,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 990 edges. 990 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:13,793 INFO L225 Difference]: With dead ends: 3562 [2022-02-20 18:38:13,793 INFO L226 Difference]: Without dead ends: 2848 [2022-02-20 18:38:13,794 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:38:13,795 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 883 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:13,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [883 Valid, 1235 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:38:13,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2022-02-20 18:38:14,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 1426. [2022-02-20 18:38:14,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:14,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2848 states. Second operand has 1426 states, 1425 states have (on average 1.6259649122807018) internal successors, (2317), 1425 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:14,884 INFO L74 IsIncluded]: Start isIncluded. First operand 2848 states. Second operand has 1426 states, 1425 states have (on average 1.6259649122807018) internal successors, (2317), 1425 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:14,886 INFO L87 Difference]: Start difference. First operand 2848 states. Second operand has 1426 states, 1425 states have (on average 1.6259649122807018) internal successors, (2317), 1425 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:15,084 INFO L93 Difference]: Finished difference Result 2848 states and 4671 transitions. [2022-02-20 18:38:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 4671 transitions. [2022-02-20 18:38:15,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:15,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:15,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 1426 states, 1425 states have (on average 1.6259649122807018) internal successors, (2317), 1425 states have internal predecessors, (2317), 0 states have call successors, (0), 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 2848 states. [2022-02-20 18:38:15,093 INFO L87 Difference]: Start difference. First operand has 1426 states, 1425 states have (on average 1.6259649122807018) internal successors, (2317), 1425 states have internal predecessors, (2317), 0 states have call successors, (0), 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 2848 states. [2022-02-20 18:38:15,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:15,298 INFO L93 Difference]: Finished difference Result 2848 states and 4671 transitions. [2022-02-20 18:38:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 4671 transitions. [2022-02-20 18:38:15,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:15,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:15,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:15,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1425 states have (on average 1.6259649122807018) internal successors, (2317), 1425 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2317 transitions. [2022-02-20 18:38:15,381 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 2317 transitions. Word has length 57 [2022-02-20 18:38:15,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:15,381 INFO L470 AbstractCegarLoop]: Abstraction has 1426 states and 2317 transitions. [2022-02-20 18:38:15,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:15,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2317 transitions. [2022-02-20 18:38:15,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:38:15,383 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:15,383 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] [2022-02-20 18:38:15,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:38:15,383 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:15,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:15,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1324568371, now seen corresponding path program 1 times [2022-02-20 18:38:15,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:15,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407964731] [2022-02-20 18:38:15,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:15,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:15,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {22784#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1756~0 := 0;~__return_1887~0 := 0;~__return_1985~0 := 0; {22784#true} is VALID [2022-02-20 18:38:15,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {22784#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {22784#true} is VALID [2022-02-20 18:38:15,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {22784#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {22784#true} is VALID [2022-02-20 18:38:15,456 INFO L290 TraceCheckUtils]: 3: Hoare triple {22784#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {22784#true} is VALID [2022-02-20 18:38:15,456 INFO L290 TraceCheckUtils]: 4: Hoare triple {22784#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {22784#true} is VALID [2022-02-20 18:38:15,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {22784#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {22784#true} is VALID [2022-02-20 18:38:15,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {22784#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {22784#true} is VALID [2022-02-20 18:38:15,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {22784#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {22784#true} is VALID [2022-02-20 18:38:15,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {22784#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {22784#true} is VALID [2022-02-20 18:38:15,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {22784#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {22784#true} is VALID [2022-02-20 18:38:15,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {22784#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {22784#true} is VALID [2022-02-20 18:38:15,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {22784#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {22784#true} is VALID [2022-02-20 18:38:15,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {22784#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {22784#true} is VALID [2022-02-20 18:38:15,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {22784#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {22784#true} is VALID [2022-02-20 18:38:15,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {22784#true} assume ~id1~0 != ~id2~0; {22784#true} is VALID [2022-02-20 18:38:15,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {22784#true} assume ~id1~0 != ~id3~0; {22784#true} is VALID [2022-02-20 18:38:15,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {22784#true} assume ~id2~0 != ~id3~0; {22784#true} is VALID [2022-02-20 18:38:15,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {22784#true} assume ~id1~0 >= 0; {22784#true} is VALID [2022-02-20 18:38:15,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {22784#true} assume ~id2~0 >= 0; {22784#true} is VALID [2022-02-20 18:38:15,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {22784#true} assume ~id3~0 >= 0; {22784#true} is VALID [2022-02-20 18:38:15,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {22784#true} assume 0 == ~r1~0; {22784#true} is VALID [2022-02-20 18:38:15,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {22784#true} assume 0 == ~r2~0; {22784#true} is VALID [2022-02-20 18:38:15,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {22784#true} assume 0 == ~r3~0; {22784#true} is VALID [2022-02-20 18:38:15,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {22784#true} assume ~max1~0 == ~id1~0; {22784#true} is VALID [2022-02-20 18:38:15,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {22784#true} assume ~max2~0 == ~id2~0; {22784#true} is VALID [2022-02-20 18:38:15,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {22784#true} assume ~max3~0 == ~id3~0; {22784#true} is VALID [2022-02-20 18:38:15,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {22784#true} assume 0 == ~st1~0; {22786#(<= ~st1~0 0)} is VALID [2022-02-20 18:38:15,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {22786#(<= ~st1~0 0)} assume 0 == ~st2~0; {22786#(<= ~st1~0 0)} is VALID [2022-02-20 18:38:15,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {22786#(<= ~st1~0 0)} assume 0 == ~st3~0; {22786#(<= ~st1~0 0)} is VALID [2022-02-20 18:38:15,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {22786#(<= ~st1~0 0)} assume 0 == ~nl1~0; {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,463 INFO L290 TraceCheckUtils]: 31: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,464 INFO L290 TraceCheckUtils]: 32: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1756~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1756~0; {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6; {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,467 INFO L290 TraceCheckUtils]: 38: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 < 2; {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 < 2; {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,468 INFO L290 TraceCheckUtils]: 45: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,469 INFO L290 TraceCheckUtils]: 47: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,469 INFO L290 TraceCheckUtils]: 48: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 < 2; {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,470 INFO L290 TraceCheckUtils]: 49: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,470 INFO L290 TraceCheckUtils]: 50: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,470 INFO L290 TraceCheckUtils]: 51: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,470 INFO L290 TraceCheckUtils]: 52: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} ~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;havoc main_~check__tmp~0#1; {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,471 INFO L290 TraceCheckUtils]: 53: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {22787#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:15,471 INFO L290 TraceCheckUtils]: 54: Hoare triple {22787#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);main_~check__tmp~0#1 := 0; {22785#false} is VALID [2022-02-20 18:38:15,471 INFO L290 TraceCheckUtils]: 55: Hoare triple {22785#false} ~__return_1887~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1887~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {22785#false} is VALID [2022-02-20 18:38:15,471 INFO L290 TraceCheckUtils]: 56: Hoare triple {22785#false} assume 0 == main_~assert__arg~0#1 % 256; {22785#false} is VALID [2022-02-20 18:38:15,471 INFO L290 TraceCheckUtils]: 57: Hoare triple {22785#false} assume !false; {22785#false} is VALID [2022-02-20 18:38:15,472 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:38:15,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:15,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407964731] [2022-02-20 18:38:15,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407964731] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:15,472 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:15,473 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:38:15,473 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021408100] [2022-02-20 18:38:15,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:15,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:38:15,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:15,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:15,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:15,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:38:15,503 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:15,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:38:15,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:38:15,506 INFO L87 Difference]: Start difference. First operand 1426 states and 2317 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:18,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:18,631 INFO L93 Difference]: Finished difference Result 4193 states and 6904 transitions. [2022-02-20 18:38:18,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:38:18,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:38:18,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 594 transitions. [2022-02-20 18:38:18,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 594 transitions. [2022-02-20 18:38:18,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 594 transitions. [2022-02-20 18:38:18,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 594 edges. 594 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:19,297 INFO L225 Difference]: With dead ends: 4193 [2022-02-20 18:38:19,302 INFO L226 Difference]: Without dead ends: 2840 [2022-02-20 18:38:19,304 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:38:19,306 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 379 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:19,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 589 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:19,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2022-02-20 18:38:20,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 2121. [2022-02-20 18:38:20,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:20,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2840 states. Second operand has 2121 states, 2120 states have (on average 1.6320754716981132) internal successors, (3460), 2120 states have internal predecessors, (3460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:20,861 INFO L74 IsIncluded]: Start isIncluded. First operand 2840 states. Second operand has 2121 states, 2120 states have (on average 1.6320754716981132) internal successors, (3460), 2120 states have internal predecessors, (3460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:20,863 INFO L87 Difference]: Start difference. First operand 2840 states. Second operand has 2121 states, 2120 states have (on average 1.6320754716981132) internal successors, (3460), 2120 states have internal predecessors, (3460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:21,089 INFO L93 Difference]: Finished difference Result 2840 states and 4669 transitions. [2022-02-20 18:38:21,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 4669 transitions. [2022-02-20 18:38:21,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:21,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:21,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 2121 states, 2120 states have (on average 1.6320754716981132) internal successors, (3460), 2120 states have internal predecessors, (3460), 0 states have call successors, (0), 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 2840 states. [2022-02-20 18:38:21,099 INFO L87 Difference]: Start difference. First operand has 2121 states, 2120 states have (on average 1.6320754716981132) internal successors, (3460), 2120 states have internal predecessors, (3460), 0 states have call successors, (0), 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 2840 states. [2022-02-20 18:38:21,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:21,310 INFO L93 Difference]: Finished difference Result 2840 states and 4669 transitions. [2022-02-20 18:38:21,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 4669 transitions. [2022-02-20 18:38:21,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:21,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:21,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:21,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 2120 states have (on average 1.6320754716981132) internal successors, (3460), 2120 states have internal predecessors, (3460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:21,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 3460 transitions. [2022-02-20 18:38:21,492 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 3460 transitions. Word has length 58 [2022-02-20 18:38:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:21,492 INFO L470 AbstractCegarLoop]: Abstraction has 2121 states and 3460 transitions. [2022-02-20 18:38:21,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 3460 transitions. [2022-02-20 18:38:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:38:21,493 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:21,493 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] [2022-02-20 18:38:21,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:38:21,494 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:21,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:21,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1037107898, now seen corresponding path program 1 times [2022-02-20 18:38:21,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:21,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344893736] [2022-02-20 18:38:21,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:21,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:21,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {37699#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1756~0 := 0;~__return_1887~0 := 0;~__return_1985~0 := 0; {37699#true} is VALID [2022-02-20 18:38:21,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {37699#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {37699#true} is VALID [2022-02-20 18:38:21,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {37699#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {37699#true} is VALID [2022-02-20 18:38:21,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {37699#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {37699#true} is VALID [2022-02-20 18:38:21,537 INFO L290 TraceCheckUtils]: 4: Hoare triple {37699#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {37699#true} is VALID [2022-02-20 18:38:21,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {37699#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {37699#true} is VALID [2022-02-20 18:38:21,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {37699#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {37699#true} is VALID [2022-02-20 18:38:21,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {37699#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {37699#true} is VALID [2022-02-20 18:38:21,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {37699#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {37699#true} is VALID [2022-02-20 18:38:21,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {37699#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {37699#true} is VALID [2022-02-20 18:38:21,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {37699#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {37699#true} is VALID [2022-02-20 18:38:21,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {37699#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {37699#true} is VALID [2022-02-20 18:38:21,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {37699#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {37699#true} is VALID [2022-02-20 18:38:21,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {37699#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {37699#true} is VALID [2022-02-20 18:38:21,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {37699#true} assume ~id1~0 != ~id2~0; {37699#true} is VALID [2022-02-20 18:38:21,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {37699#true} assume ~id1~0 != ~id3~0; {37699#true} is VALID [2022-02-20 18:38:21,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {37699#true} assume ~id2~0 != ~id3~0; {37699#true} is VALID [2022-02-20 18:38:21,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {37699#true} assume ~id1~0 >= 0; {37699#true} is VALID [2022-02-20 18:38:21,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {37699#true} assume ~id2~0 >= 0; {37699#true} is VALID [2022-02-20 18:38:21,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {37699#true} assume ~id3~0 >= 0; {37699#true} is VALID [2022-02-20 18:38:21,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {37699#true} assume 0 == ~r1~0; {37699#true} is VALID [2022-02-20 18:38:21,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {37699#true} assume 0 == ~r2~0; {37699#true} is VALID [2022-02-20 18:38:21,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {37699#true} assume 0 == ~r3~0; {37699#true} is VALID [2022-02-20 18:38:21,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {37699#true} assume ~max1~0 == ~id1~0; {37699#true} is VALID [2022-02-20 18:38:21,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {37699#true} assume ~max2~0 == ~id2~0; {37699#true} is VALID [2022-02-20 18:38:21,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {37699#true} assume ~max3~0 == ~id3~0; {37699#true} is VALID [2022-02-20 18:38:21,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {37699#true} assume 0 == ~st1~0; {37699#true} is VALID [2022-02-20 18:38:21,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {37699#true} assume 0 == ~st2~0; {37699#true} is VALID [2022-02-20 18:38:21,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {37699#true} assume 0 == ~st3~0; {37699#true} is VALID [2022-02-20 18:38:21,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {37699#true} assume 0 == ~nl1~0; {37699#true} is VALID [2022-02-20 18:38:21,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {37699#true} assume 0 == ~nl2~0; {37699#true} is VALID [2022-02-20 18:38:21,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {37699#true} assume 0 == ~nl3~0; {37699#true} is VALID [2022-02-20 18:38:21,540 INFO L290 TraceCheckUtils]: 32: Hoare triple {37699#true} assume 0 == ~mode1~0 % 256; {37699#true} is VALID [2022-02-20 18:38:21,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {37699#true} assume 0 == ~mode2~0 % 256; {37699#true} is VALID [2022-02-20 18:38:21,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {37699#true} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1756~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1756~0; {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:21,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:21,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume main_~main__i2~0#1 < 6; {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:21,542 INFO L290 TraceCheckUtils]: 37: Hoare triple {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:21,543 INFO L290 TraceCheckUtils]: 38: Hoare triple {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 < 2; {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:21,543 INFO L290 TraceCheckUtils]: 39: Hoare triple {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep12~0 % 256); {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:21,543 INFO L290 TraceCheckUtils]: 40: Hoare triple {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep13~0 % 256); {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:21,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:21,544 INFO L290 TraceCheckUtils]: 42: Hoare triple {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:21,544 INFO L290 TraceCheckUtils]: 43: Hoare triple {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 < 2; {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:21,545 INFO L290 TraceCheckUtils]: 44: Hoare triple {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep21~0 % 256); {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:21,545 INFO L290 TraceCheckUtils]: 45: Hoare triple {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep23~0 % 256); {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:21,545 INFO L290 TraceCheckUtils]: 46: Hoare triple {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:21,546 INFO L290 TraceCheckUtils]: 47: Hoare triple {37701#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {37700#false} is VALID [2022-02-20 18:38:21,546 INFO L290 TraceCheckUtils]: 48: Hoare triple {37700#false} assume !!(0 == ~ep13~0 % 256); {37700#false} is VALID [2022-02-20 18:38:21,546 INFO L290 TraceCheckUtils]: 49: Hoare triple {37700#false} assume !!(0 == ~ep23~0 % 256); {37700#false} is VALID [2022-02-20 18:38:21,546 INFO L290 TraceCheckUtils]: 50: Hoare triple {37700#false} assume 2 == ~r3~0; {37700#false} is VALID [2022-02-20 18:38:21,547 INFO L290 TraceCheckUtils]: 51: Hoare triple {37700#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {37700#false} is VALID [2022-02-20 18:38:21,547 INFO L290 TraceCheckUtils]: 52: Hoare triple {37700#false} ~mode3~0 := 0; {37700#false} is VALID [2022-02-20 18:38:21,547 INFO L290 TraceCheckUtils]: 53: Hoare triple {37700#false} ~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;havoc main_~check__tmp~0#1; {37700#false} is VALID [2022-02-20 18:38:21,547 INFO L290 TraceCheckUtils]: 54: Hoare triple {37700#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {37700#false} is VALID [2022-02-20 18:38:21,547 INFO L290 TraceCheckUtils]: 55: Hoare triple {37700#false} ~__return_1887~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1887~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {37700#false} is VALID [2022-02-20 18:38:21,547 INFO L290 TraceCheckUtils]: 56: Hoare triple {37700#false} assume 0 == main_~assert__arg~0#1 % 256; {37700#false} is VALID [2022-02-20 18:38:21,547 INFO L290 TraceCheckUtils]: 57: Hoare triple {37700#false} assume !false; {37700#false} is VALID [2022-02-20 18:38:21,548 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:38:21,548 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:21,548 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344893736] [2022-02-20 18:38:21,548 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344893736] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:21,548 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:21,548 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:21,548 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700830011] [2022-02-20 18:38:21,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:21,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:38:21,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:21,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:21,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:21,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:21,579 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:21,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:21,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:21,579 INFO L87 Difference]: Start difference. First operand 2121 states and 3460 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:24,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:24,505 INFO L93 Difference]: Finished difference Result 4115 states and 6746 transitions. [2022-02-20 18:38:24,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:24,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:38:24,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-02-20 18:38:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-02-20 18:38:24,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 430 transitions. [2022-02-20 18:38:24,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:25,102 INFO L225 Difference]: With dead ends: 4115 [2022-02-20 18:38:25,102 INFO L226 Difference]: Without dead ends: 2973 [2022-02-20 18:38:25,103 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:38:25,104 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 106 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 414 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:38:25,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 414 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2022-02-20 18:38:27,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2971. [2022-02-20 18:38:27,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:27,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2973 states. Second operand has 2971 states, 2970 states have (on average 1.626936026936027) internal successors, (4832), 2970 states have internal predecessors, (4832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:27,226 INFO L74 IsIncluded]: Start isIncluded. First operand 2973 states. Second operand has 2971 states, 2970 states have (on average 1.626936026936027) internal successors, (4832), 2970 states have internal predecessors, (4832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:27,228 INFO L87 Difference]: Start difference. First operand 2973 states. Second operand has 2971 states, 2970 states have (on average 1.626936026936027) internal successors, (4832), 2970 states have internal predecessors, (4832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:27,446 INFO L93 Difference]: Finished difference Result 2973 states and 4833 transitions. [2022-02-20 18:38:27,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2973 states and 4833 transitions. [2022-02-20 18:38:27,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:27,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:27,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 2971 states, 2970 states have (on average 1.626936026936027) internal successors, (4832), 2970 states have internal predecessors, (4832), 0 states have call successors, (0), 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 2973 states. [2022-02-20 18:38:27,456 INFO L87 Difference]: Start difference. First operand has 2971 states, 2970 states have (on average 1.626936026936027) internal successors, (4832), 2970 states have internal predecessors, (4832), 0 states have call successors, (0), 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 2973 states. [2022-02-20 18:38:27,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:27,676 INFO L93 Difference]: Finished difference Result 2973 states and 4833 transitions. [2022-02-20 18:38:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2973 states and 4833 transitions. [2022-02-20 18:38:27,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:27,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:27,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:27,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2971 states, 2970 states have (on average 1.626936026936027) internal successors, (4832), 2970 states have internal predecessors, (4832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 4832 transitions. [2022-02-20 18:38:28,053 INFO L78 Accepts]: Start accepts. Automaton has 2971 states and 4832 transitions. Word has length 58 [2022-02-20 18:38:28,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:28,053 INFO L470 AbstractCegarLoop]: Abstraction has 2971 states and 4832 transitions. [2022-02-20 18:38:28,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:28,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 4832 transitions. [2022-02-20 18:38:28,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:38:28,054 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:28,054 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] [2022-02-20 18:38:28,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:38:28,054 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:28,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:28,055 INFO L85 PathProgramCache]: Analyzing trace with hash 405262074, now seen corresponding path program 1 times [2022-02-20 18:38:28,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:28,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092061225] [2022-02-20 18:38:28,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:28,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:28,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {54017#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1756~0 := 0;~__return_1887~0 := 0;~__return_1985~0 := 0; {54017#true} is VALID [2022-02-20 18:38:28,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {54017#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {54017#true} is VALID [2022-02-20 18:38:28,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {54017#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {54017#true} is VALID [2022-02-20 18:38:28,101 INFO L290 TraceCheckUtils]: 3: Hoare triple {54017#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {54017#true} is VALID [2022-02-20 18:38:28,101 INFO L290 TraceCheckUtils]: 4: Hoare triple {54017#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {54017#true} is VALID [2022-02-20 18:38:28,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {54017#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {54017#true} is VALID [2022-02-20 18:38:28,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {54017#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {54017#true} is VALID [2022-02-20 18:38:28,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {54017#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {54017#true} is VALID [2022-02-20 18:38:28,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {54017#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {54017#true} is VALID [2022-02-20 18:38:28,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {54017#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {54017#true} is VALID [2022-02-20 18:38:28,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {54017#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {54017#true} is VALID [2022-02-20 18:38:28,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {54017#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {54017#true} is VALID [2022-02-20 18:38:28,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {54017#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {54017#true} is VALID [2022-02-20 18:38:28,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {54017#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {54017#true} is VALID [2022-02-20 18:38:28,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {54017#true} assume ~id1~0 != ~id2~0; {54017#true} is VALID [2022-02-20 18:38:28,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {54017#true} assume ~id1~0 != ~id3~0; {54017#true} is VALID [2022-02-20 18:38:28,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {54017#true} assume ~id2~0 != ~id3~0; {54017#true} is VALID [2022-02-20 18:38:28,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {54017#true} assume ~id1~0 >= 0; {54017#true} is VALID [2022-02-20 18:38:28,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {54017#true} assume ~id2~0 >= 0; {54017#true} is VALID [2022-02-20 18:38:28,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {54017#true} assume ~id3~0 >= 0; {54017#true} is VALID [2022-02-20 18:38:28,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {54017#true} assume 0 == ~r1~0; {54017#true} is VALID [2022-02-20 18:38:28,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {54017#true} assume 0 == ~r2~0; {54017#true} is VALID [2022-02-20 18:38:28,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {54017#true} assume 0 == ~r3~0; {54017#true} is VALID [2022-02-20 18:38:28,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {54017#true} assume ~max1~0 == ~id1~0; {54017#true} is VALID [2022-02-20 18:38:28,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {54017#true} assume ~max2~0 == ~id2~0; {54017#true} is VALID [2022-02-20 18:38:28,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {54017#true} assume ~max3~0 == ~id3~0; {54017#true} is VALID [2022-02-20 18:38:28,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {54017#true} assume 0 == ~st1~0; {54017#true} is VALID [2022-02-20 18:38:28,112 INFO L290 TraceCheckUtils]: 27: Hoare triple {54017#true} assume 0 == ~st2~0; {54017#true} is VALID [2022-02-20 18:38:28,112 INFO L290 TraceCheckUtils]: 28: Hoare triple {54017#true} assume 0 == ~st3~0; {54017#true} is VALID [2022-02-20 18:38:28,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {54017#true} assume 0 == ~nl1~0; {54017#true} is VALID [2022-02-20 18:38:28,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {54017#true} assume 0 == ~nl2~0; {54017#true} is VALID [2022-02-20 18:38:28,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {54017#true} assume 0 == ~nl3~0; {54017#true} is VALID [2022-02-20 18:38:28,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {54017#true} assume 0 == ~mode1~0 % 256; {54019#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:38:28,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {54019#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {54019#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:38:28,114 INFO L290 TraceCheckUtils]: 34: Hoare triple {54019#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1756~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1756~0; {54019#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:38:28,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {54019#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {54019#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:38:28,115 INFO L290 TraceCheckUtils]: 36: Hoare triple {54019#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume main_~main__i2~0#1 < 6; {54019#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:38:28,115 INFO L290 TraceCheckUtils]: 37: Hoare triple {54019#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {54018#false} is VALID [2022-02-20 18:38:28,115 INFO L290 TraceCheckUtils]: 38: Hoare triple {54018#false} assume !!(0 == ~ep21~0 % 256); {54018#false} is VALID [2022-02-20 18:38:28,115 INFO L290 TraceCheckUtils]: 39: Hoare triple {54018#false} assume !!(0 == ~ep31~0 % 256); {54018#false} is VALID [2022-02-20 18:38:28,116 INFO L290 TraceCheckUtils]: 40: Hoare triple {54018#false} assume 2 == ~r1~0; {54018#false} is VALID [2022-02-20 18:38:28,116 INFO L290 TraceCheckUtils]: 41: Hoare triple {54018#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {54018#false} is VALID [2022-02-20 18:38:28,116 INFO L290 TraceCheckUtils]: 42: Hoare triple {54018#false} ~mode1~0 := 0; {54018#false} is VALID [2022-02-20 18:38:28,116 INFO L290 TraceCheckUtils]: 43: Hoare triple {54018#false} assume !!(0 == ~mode2~0 % 256); {54018#false} is VALID [2022-02-20 18:38:28,116 INFO L290 TraceCheckUtils]: 44: Hoare triple {54018#false} assume ~r2~0 < 2; {54018#false} is VALID [2022-02-20 18:38:28,116 INFO L290 TraceCheckUtils]: 45: Hoare triple {54018#false} assume !!(0 == ~ep21~0 % 256); {54018#false} is VALID [2022-02-20 18:38:28,116 INFO L290 TraceCheckUtils]: 46: Hoare triple {54018#false} assume !!(0 == ~ep23~0 % 256); {54018#false} is VALID [2022-02-20 18:38:28,117 INFO L290 TraceCheckUtils]: 47: Hoare triple {54018#false} ~mode2~0 := 1; {54018#false} is VALID [2022-02-20 18:38:28,117 INFO L290 TraceCheckUtils]: 48: Hoare triple {54018#false} assume !!(0 == ~mode3~0 % 256); {54018#false} is VALID [2022-02-20 18:38:28,117 INFO L290 TraceCheckUtils]: 49: Hoare triple {54018#false} assume ~r3~0 < 2; {54018#false} is VALID [2022-02-20 18:38:28,117 INFO L290 TraceCheckUtils]: 50: Hoare triple {54018#false} assume !!(0 == ~ep31~0 % 256); {54018#false} is VALID [2022-02-20 18:38:28,117 INFO L290 TraceCheckUtils]: 51: Hoare triple {54018#false} assume !!(0 == ~ep32~0 % 256); {54018#false} is VALID [2022-02-20 18:38:28,117 INFO L290 TraceCheckUtils]: 52: Hoare triple {54018#false} ~mode3~0 := 1; {54018#false} is VALID [2022-02-20 18:38:28,117 INFO L290 TraceCheckUtils]: 53: Hoare triple {54018#false} ~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;havoc main_~check__tmp~0#1; {54018#false} is VALID [2022-02-20 18:38:28,117 INFO L290 TraceCheckUtils]: 54: Hoare triple {54018#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {54018#false} is VALID [2022-02-20 18:38:28,118 INFO L290 TraceCheckUtils]: 55: Hoare triple {54018#false} ~__return_1887~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1887~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {54018#false} is VALID [2022-02-20 18:38:28,118 INFO L290 TraceCheckUtils]: 56: Hoare triple {54018#false} assume 0 == main_~assert__arg~0#1 % 256; {54018#false} is VALID [2022-02-20 18:38:28,118 INFO L290 TraceCheckUtils]: 57: Hoare triple {54018#false} assume !false; {54018#false} is VALID [2022-02-20 18:38:28,118 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:38:28,118 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:28,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092061225] [2022-02-20 18:38:28,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092061225] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:28,119 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:28,119 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:28,119 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858226769] [2022-02-20 18:38:28,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:28,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:38:28,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:28,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:28,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:28,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:28,149 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:28,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:28,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:28,150 INFO L87 Difference]: Start difference. First operand 2971 states and 4832 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:32,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:32,892 INFO L93 Difference]: Finished difference Result 6393 states and 10544 transitions. [2022-02-20 18:38:32,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:32,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:38:32,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:32,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:32,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-02-20 18:38:32,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-02-20 18:38:32,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 430 transitions. [2022-02-20 18:38:33,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:33,937 INFO L225 Difference]: With dead ends: 6393 [2022-02-20 18:38:33,937 INFO L226 Difference]: Without dead ends: 4307 [2022-02-20 18:38:33,939 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:38:33,940 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 116 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 455 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:38:33,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 455 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4307 states. [2022-02-20 18:38:36,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4307 to 4305. [2022-02-20 18:38:36,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:36,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4307 states. Second operand has 4305 states, 4304 states have (on average 1.634061338289963) internal successors, (7033), 4304 states have internal predecessors, (7033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:36,856 INFO L74 IsIncluded]: Start isIncluded. First operand 4307 states. Second operand has 4305 states, 4304 states have (on average 1.634061338289963) internal successors, (7033), 4304 states have internal predecessors, (7033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:36,862 INFO L87 Difference]: Start difference. First operand 4307 states. Second operand has 4305 states, 4304 states have (on average 1.634061338289963) internal successors, (7033), 4304 states have internal predecessors, (7033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:37,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:37,363 INFO L93 Difference]: Finished difference Result 4307 states and 7034 transitions. [2022-02-20 18:38:37,363 INFO L276 IsEmpty]: Start isEmpty. Operand 4307 states and 7034 transitions. [2022-02-20 18:38:37,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:37,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:37,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 4305 states, 4304 states have (on average 1.634061338289963) internal successors, (7033), 4304 states have internal predecessors, (7033), 0 states have call successors, (0), 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 4307 states. [2022-02-20 18:38:37,378 INFO L87 Difference]: Start difference. First operand has 4305 states, 4304 states have (on average 1.634061338289963) internal successors, (7033), 4304 states have internal predecessors, (7033), 0 states have call successors, (0), 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 4307 states. [2022-02-20 18:38:37,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:37,886 INFO L93 Difference]: Finished difference Result 4307 states and 7034 transitions. [2022-02-20 18:38:37,887 INFO L276 IsEmpty]: Start isEmpty. Operand 4307 states and 7034 transitions. [2022-02-20 18:38:37,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:37,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:37,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:37,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:37,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4305 states, 4304 states have (on average 1.634061338289963) internal successors, (7033), 4304 states have internal predecessors, (7033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:38,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 7033 transitions. [2022-02-20 18:38:38,671 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 7033 transitions. Word has length 58 [2022-02-20 18:38:38,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:38,671 INFO L470 AbstractCegarLoop]: Abstraction has 4305 states and 7033 transitions. [2022-02-20 18:38:38,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 7033 transitions. [2022-02-20 18:38:38,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:38:38,672 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:38,672 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:38:38,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:38:38,672 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:38,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:38,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1830107264, now seen corresponding path program 1 times [2022-02-20 18:38:38,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:38,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876832021] [2022-02-20 18:38:38,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:38,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:38,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {78254#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1756~0 := 0;~__return_1887~0 := 0;~__return_1985~0 := 0; {78254#true} is VALID [2022-02-20 18:38:38,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {78254#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {78254#true} is VALID [2022-02-20 18:38:38,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {78254#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {78254#true} is VALID [2022-02-20 18:38:38,727 INFO L290 TraceCheckUtils]: 3: Hoare triple {78254#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {78254#true} is VALID [2022-02-20 18:38:38,727 INFO L290 TraceCheckUtils]: 4: Hoare triple {78254#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {78254#true} is VALID [2022-02-20 18:38:38,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {78254#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {78254#true} is VALID [2022-02-20 18:38:38,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {78254#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {78254#true} is VALID [2022-02-20 18:38:38,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {78254#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {78254#true} is VALID [2022-02-20 18:38:38,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {78254#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {78254#true} is VALID [2022-02-20 18:38:38,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {78254#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {78254#true} is VALID [2022-02-20 18:38:38,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {78254#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {78254#true} is VALID [2022-02-20 18:38:38,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {78254#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {78254#true} is VALID [2022-02-20 18:38:38,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {78254#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {78254#true} is VALID [2022-02-20 18:38:38,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {78254#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {78254#true} is VALID [2022-02-20 18:38:38,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {78254#true} assume ~id1~0 != ~id2~0; {78254#true} is VALID [2022-02-20 18:38:38,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {78254#true} assume ~id1~0 != ~id3~0; {78254#true} is VALID [2022-02-20 18:38:38,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {78254#true} assume ~id2~0 != ~id3~0; {78254#true} is VALID [2022-02-20 18:38:38,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {78254#true} assume ~id1~0 >= 0; {78254#true} is VALID [2022-02-20 18:38:38,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {78254#true} assume ~id2~0 >= 0; {78254#true} is VALID [2022-02-20 18:38:38,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {78254#true} assume ~id3~0 >= 0; {78254#true} is VALID [2022-02-20 18:38:38,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {78254#true} assume 0 == ~r1~0; {78254#true} is VALID [2022-02-20 18:38:38,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {78254#true} assume 0 == ~r2~0; {78254#true} is VALID [2022-02-20 18:38:38,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {78254#true} assume 0 == ~r3~0; {78254#true} is VALID [2022-02-20 18:38:38,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {78254#true} assume ~max1~0 == ~id1~0; {78254#true} is VALID [2022-02-20 18:38:38,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {78254#true} assume ~max2~0 == ~id2~0; {78254#true} is VALID [2022-02-20 18:38:38,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {78254#true} assume ~max3~0 == ~id3~0; {78254#true} is VALID [2022-02-20 18:38:38,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {78254#true} assume 0 == ~st1~0; {78254#true} is VALID [2022-02-20 18:38:38,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {78254#true} assume 0 == ~st2~0; {78256#(<= ~st2~0 0)} is VALID [2022-02-20 18:38:38,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {78256#(<= ~st2~0 0)} assume 0 == ~st3~0; {78256#(<= ~st2~0 0)} is VALID [2022-02-20 18:38:38,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {78256#(<= ~st2~0 0)} assume 0 == ~nl1~0; {78256#(<= ~st2~0 0)} is VALID [2022-02-20 18:38:38,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {78256#(<= ~st2~0 0)} assume 0 == ~nl2~0; {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,731 INFO L290 TraceCheckUtils]: 32: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1756~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1756~0; {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 6; {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256); {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 < 2; {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,734 INFO L290 TraceCheckUtils]: 39: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep12~0 % 256); {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,734 INFO L290 TraceCheckUtils]: 40: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep13~0 % 256); {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,735 INFO L290 TraceCheckUtils]: 42: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256); {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 < 2; {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,735 INFO L290 TraceCheckUtils]: 44: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep21~0 % 256); {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,736 INFO L290 TraceCheckUtils]: 45: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep23~0 % 256); {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,736 INFO L290 TraceCheckUtils]: 46: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,736 INFO L290 TraceCheckUtils]: 47: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256); {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,736 INFO L290 TraceCheckUtils]: 48: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 < 2; {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,737 INFO L290 TraceCheckUtils]: 49: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep31~0 % 256); {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,737 INFO L290 TraceCheckUtils]: 50: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep32~0 % 256); {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,737 INFO L290 TraceCheckUtils]: 51: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,738 INFO L290 TraceCheckUtils]: 52: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} ~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;havoc main_~check__tmp~0#1; {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,738 INFO L290 TraceCheckUtils]: 53: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,738 INFO L290 TraceCheckUtils]: 54: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {78257#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:38,739 INFO L290 TraceCheckUtils]: 55: Hoare triple {78257#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);main_~check__tmp~0#1 := 0; {78255#false} is VALID [2022-02-20 18:38:38,739 INFO L290 TraceCheckUtils]: 56: Hoare triple {78255#false} ~__return_1887~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1887~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {78255#false} is VALID [2022-02-20 18:38:38,739 INFO L290 TraceCheckUtils]: 57: Hoare triple {78255#false} assume 0 == main_~assert__arg~0#1 % 256; {78255#false} is VALID [2022-02-20 18:38:38,739 INFO L290 TraceCheckUtils]: 58: Hoare triple {78255#false} assume !false; {78255#false} is VALID [2022-02-20 18:38:38,739 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:38:38,740 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:38,740 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876832021] [2022-02-20 18:38:38,740 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876832021] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:38,740 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:38,740 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:38:38,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915395946] [2022-02-20 18:38:38,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:38,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-02-20 18:38:38,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:38,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:38,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:38,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:38:38,784 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:38,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:38:38,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:38:38,785 INFO L87 Difference]: Start difference. First operand 4305 states and 7033 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:54,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:54,977 INFO L93 Difference]: Finished difference Result 13696 states and 22476 transitions. [2022-02-20 18:38:54,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:38:54,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-02-20 18:38:54,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:54,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 594 transitions. [2022-02-20 18:38:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 594 transitions. [2022-02-20 18:38:54,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 594 transitions. [2022-02-20 18:38:55,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 594 edges. 594 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:59,023 INFO L225 Difference]: With dead ends: 13696 [2022-02-20 18:38:59,023 INFO L226 Difference]: Without dead ends: 9467 [2022-02-20 18:38:59,036 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:38:59,037 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 377 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 663 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:38:59,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 663 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9467 states. [2022-02-20 18:39:05,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9467 to 6857. [2022-02-20 18:39:05,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:05,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9467 states. Second operand has 6857 states, 6856 states have (on average 1.6270420070011669) internal successors, (11155), 6856 states have internal predecessors, (11155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:05,219 INFO L74 IsIncluded]: Start isIncluded. First operand 9467 states. Second operand has 6857 states, 6856 states have (on average 1.6270420070011669) internal successors, (11155), 6856 states have internal predecessors, (11155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:05,224 INFO L87 Difference]: Start difference. First operand 9467 states. Second operand has 6857 states, 6856 states have (on average 1.6270420070011669) internal successors, (11155), 6856 states have internal predecessors, (11155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:07,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:07,630 INFO L93 Difference]: Finished difference Result 9467 states and 15468 transitions. [2022-02-20 18:39:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 9467 states and 15468 transitions. [2022-02-20 18:39:07,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:07,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:07,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 6857 states, 6856 states have (on average 1.6270420070011669) internal successors, (11155), 6856 states have internal predecessors, (11155), 0 states have call successors, (0), 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 9467 states. [2022-02-20 18:39:07,652 INFO L87 Difference]: Start difference. First operand has 6857 states, 6856 states have (on average 1.6270420070011669) internal successors, (11155), 6856 states have internal predecessors, (11155), 0 states have call successors, (0), 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 9467 states.