./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.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.4.ufo.UNBOUNDED.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 b178b656343d0e2ffc6b5c87d592ef5d1e640f986fa3fd9fab639777f6d58eb8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:39:25,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:39:25,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:39:25,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:39:25,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:39:25,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:39:25,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:39:25,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:39:25,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:39:25,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:39:25,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:39:25,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:39:25,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:39:25,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:39:25,528 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:39:25,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:39:25,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:39:25,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:39:25,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:39:25,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:39:25,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:39:25,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:39:25,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:39:25,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:39:25,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:39:25,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:39:25,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:39:25,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:39:25,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:39:25,552 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:39:25,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:39:25,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:39:25,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:39:25,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:39:25,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:39:25,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:39:25,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:39:25,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:39:25,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:39:25,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:39:25,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:39:25,561 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:39:25,590 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:39:25,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:39:25,591 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:39:25,591 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:39:25,591 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:39:25,592 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:39:25,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:39:25,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:39:25,593 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:39:25,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:39:25,594 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:39:25,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:39:25,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:39:25,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:39:25,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:39:25,595 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:39:25,595 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:39:25,595 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:39:25,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:39:25,595 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:39:25,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:39:25,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:39:25,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:39:25,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:39:25,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:39:25,596 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:39:25,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:39:25,597 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:39:25,597 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:39:25,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:39:25,597 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:39:25,598 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:39:25,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:39:25,598 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 -> b178b656343d0e2ffc6b5c87d592ef5d1e640f986fa3fd9fab639777f6d58eb8 [2022-02-20 18:39:25,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:39:25,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:39:25,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:39:25,829 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:39:25,829 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:39:25,831 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.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:39:25,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cf06fe70/372d0be202eb4e4ca8ca3965f401d4a6/FLAG1a975219b [2022-02-20 18:39:26,262 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:39:26,262 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:39:26,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cf06fe70/372d0be202eb4e4ca8ca3965f401d4a6/FLAG1a975219b [2022-02-20 18:39:26,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cf06fe70/372d0be202eb4e4ca8ca3965f401d4a6 [2022-02-20 18:39:26,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:39:26,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:39:26,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:39:26,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:39:26,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:39:26,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:39:26" (1/1) ... [2022-02-20 18:39:26,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a8a3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:26, skipping insertion in model container [2022-02-20 18:39:26,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:39:26" (1/1) ... [2022-02-20 18:39:26,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:39:26,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:39:26,912 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.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7349,7362] [2022-02-20 18:39:26,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:39:26,952 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:39:26,994 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.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7349,7362] [2022-02-20 18:39:27,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:39:27,028 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:39:27,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:27 WrapperNode [2022-02-20 18:39:27,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:39:27,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:39:27,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:39:27,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:39:27,042 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:39:27" (1/1) ... [2022-02-20 18:39:27,051 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:39:27" (1/1) ... [2022-02-20 18:39:27,098 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 590 [2022-02-20 18:39:27,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:39:27,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:39:27,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:39:27,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:39:27,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:27" (1/1) ... [2022-02-20 18:39:27,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:27" (1/1) ... [2022-02-20 18:39:27,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:27" (1/1) ... [2022-02-20 18:39:27,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:27" (1/1) ... [2022-02-20 18:39:27,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:27" (1/1) ... [2022-02-20 18:39:27,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:27" (1/1) ... [2022-02-20 18:39:27,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:27" (1/1) ... [2022-02-20 18:39:27,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:39:27,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:39:27,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:39:27,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:39:27,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:27" (1/1) ... [2022-02-20 18:39:27,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:39:27,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:39:27,176 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:39:27,195 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:39:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:39:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:39:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:39:27,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:39:27,307 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:39:27,308 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:39:27,929 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:39:27,940 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:39:27,940 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:39:27,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:39:27 BoogieIcfgContainer [2022-02-20 18:39:27,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:39:27,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:39:27,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:39:27,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:39:27,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:39:26" (1/3) ... [2022-02-20 18:39:27,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d36b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:39:27, skipping insertion in model container [2022-02-20 18:39:27,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:27" (2/3) ... [2022-02-20 18:39:27,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d36b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:39:27, skipping insertion in model container [2022-02-20 18:39:27,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:39:27" (3/3) ... [2022-02-20 18:39:27,950 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:39:27,954 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:39:27,954 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:39:27,999 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:39:28,004 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:39:28,004 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:39:28,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 138 states have (on average 1.7608695652173914) internal successors, (243), 139 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call 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:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:39:28,034 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:28,035 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] [2022-02-20 18:39:28,035 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:28,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:28,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1890044597, now seen corresponding path program 1 times [2022-02-20 18:39:28,047 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:28,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437759956] [2022-02-20 18:39:28,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:28,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:28,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {143#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_1767~0 := 0;~__return_1898~0 := 0; {143#true} is VALID [2022-02-20 18:39:28,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#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_~__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;~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;~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;~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; {143#true} is VALID [2022-02-20 18:39:28,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {143#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {143#true} is VALID [2022-02-20 18:39:28,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {143#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {143#true} is VALID [2022-02-20 18:39:28,437 INFO L290 TraceCheckUtils]: 4: Hoare triple {143#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {143#true} is VALID [2022-02-20 18:39:28,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {143#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {143#true} is VALID [2022-02-20 18:39:28,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {143#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {143#true} is VALID [2022-02-20 18:39:28,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {143#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {143#true} is VALID [2022-02-20 18:39:28,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {143#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {143#true} is VALID [2022-02-20 18:39:28,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {143#true} is VALID [2022-02-20 18:39:28,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {143#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {143#true} is VALID [2022-02-20 18:39:28,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {143#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {143#true} is VALID [2022-02-20 18:39:28,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {143#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {143#true} is VALID [2022-02-20 18:39:28,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {143#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {143#true} is VALID [2022-02-20 18:39:28,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {143#true} assume ~id1~0 != ~id2~0; {143#true} is VALID [2022-02-20 18:39:28,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {143#true} assume ~id1~0 != ~id3~0; {143#true} is VALID [2022-02-20 18:39:28,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {143#true} assume ~id2~0 != ~id3~0; {143#true} is VALID [2022-02-20 18:39:28,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {143#true} assume ~id1~0 >= 0; {143#true} is VALID [2022-02-20 18:39:28,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {143#true} assume ~id2~0 >= 0; {143#true} is VALID [2022-02-20 18:39:28,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {143#true} assume ~id3~0 >= 0; {143#true} is VALID [2022-02-20 18:39:28,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {143#true} assume 0 == ~r1~0 % 256; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r2~0 % 256; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r3~0 % 256; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r122~0#1 % 256); {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r132~0#1 % 256); {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r212~0#1 % 256); {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r232~0#1 % 256); {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r312~0#1 % 256); {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r322~0#1 % 256); {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max1~0 == ~id1~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max2~0 == ~id2~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max3~0 == ~id3~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,453 INFO L290 TraceCheckUtils]: 32: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,454 INFO L290 TraceCheckUtils]: 34: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl1~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,455 INFO L290 TraceCheckUtils]: 36: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl2~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl3~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1767~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1767~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,459 INFO L290 TraceCheckUtils]: 41: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,459 INFO L290 TraceCheckUtils]: 42: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode1~0 % 256); {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:28,460 INFO L290 TraceCheckUtils]: 43: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 1); {144#false} is VALID [2022-02-20 18:39:28,460 INFO L290 TraceCheckUtils]: 44: Hoare triple {144#false} ~mode1~0 := 1; {144#false} is VALID [2022-02-20 18:39:28,461 INFO L290 TraceCheckUtils]: 45: Hoare triple {144#false} assume !!(0 == ~mode2~0 % 256); {144#false} is VALID [2022-02-20 18:39:28,462 INFO L290 TraceCheckUtils]: 46: Hoare triple {144#false} assume !(~r2~0 % 256 < 2); {144#false} is VALID [2022-02-20 18:39:28,463 INFO L290 TraceCheckUtils]: 47: Hoare triple {144#false} ~mode2~0 := 1; {144#false} is VALID [2022-02-20 18:39:28,463 INFO L290 TraceCheckUtils]: 48: Hoare triple {144#false} assume !!(0 == ~mode3~0 % 256); {144#false} is VALID [2022-02-20 18:39:28,464 INFO L290 TraceCheckUtils]: 49: Hoare triple {144#false} assume !(~r3~0 % 256 < 2); {144#false} is VALID [2022-02-20 18:39:28,468 INFO L290 TraceCheckUtils]: 50: Hoare triple {144#false} ~mode3~0 := 1; {144#false} is VALID [2022-02-20 18:39:28,468 INFO L290 TraceCheckUtils]: 51: Hoare triple {144#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; {144#false} is VALID [2022-02-20 18:39:28,469 INFO L290 TraceCheckUtils]: 52: Hoare triple {144#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {144#false} is VALID [2022-02-20 18:39:28,469 INFO L290 TraceCheckUtils]: 53: Hoare triple {144#false} ~__return_1898~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1898~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; {144#false} is VALID [2022-02-20 18:39:28,470 INFO L290 TraceCheckUtils]: 54: Hoare triple {144#false} assume 0 == main_~assert__arg~0#1 % 256; {144#false} is VALID [2022-02-20 18:39:28,471 INFO L290 TraceCheckUtils]: 55: Hoare triple {144#false} assume !false; {144#false} is VALID [2022-02-20 18:39:28,476 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:39:28,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:28,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437759956] [2022-02-20 18:39:28,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437759956] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:28,478 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:28,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:39:28,480 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259432887] [2022-02-20 18:39:28,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:28,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:39:28,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:28,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call 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:28,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:28,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:39:28,560 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:28,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:39:28,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:28,580 INFO L87 Difference]: Start difference. First operand has 140 states, 138 states have (on average 1.7608695652173914) internal successors, (243), 139 states have internal predecessors, (243), 0 states have call successors, (0), 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 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call 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:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:29,048 INFO L93 Difference]: Finished difference Result 293 states and 496 transitions. [2022-02-20 18:39:29,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:39:29,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:39:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call 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:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2022-02-20 18:39:29,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call 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:29,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2022-02-20 18:39:29,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 496 transitions. [2022-02-20 18:39:29,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 496 edges. 496 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:29,525 INFO L225 Difference]: With dead ends: 293 [2022-02-20 18:39:29,526 INFO L226 Difference]: Without dead ends: 201 [2022-02-20 18:39:29,528 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:39:29,531 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 138 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:29,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 402 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:29,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-02-20 18:39:29,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2022-02-20 18:39:29,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:29,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 198 states, 197 states have (on average 1.5786802030456852) internal successors, (311), 197 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call 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:29,595 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 198 states, 197 states have (on average 1.5786802030456852) internal successors, (311), 197 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call 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:29,596 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 198 states, 197 states have (on average 1.5786802030456852) internal successors, (311), 197 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call 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:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:29,606 INFO L93 Difference]: Finished difference Result 201 states and 313 transitions. [2022-02-20 18:39:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 313 transitions. [2022-02-20 18:39:29,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:29,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:29,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 197 states have (on average 1.5786802030456852) internal successors, (311), 197 states have internal predecessors, (311), 0 states have call successors, (0), 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 201 states. [2022-02-20 18:39:29,609 INFO L87 Difference]: Start difference. First operand has 198 states, 197 states have (on average 1.5786802030456852) internal successors, (311), 197 states have internal predecessors, (311), 0 states have call successors, (0), 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 201 states. [2022-02-20 18:39:29,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:29,617 INFO L93 Difference]: Finished difference Result 201 states and 313 transitions. [2022-02-20 18:39:29,617 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 313 transitions. [2022-02-20 18:39:29,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:29,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:29,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:29,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:29,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.5786802030456852) internal successors, (311), 197 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call 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:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 311 transitions. [2022-02-20 18:39:29,628 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 311 transitions. Word has length 56 [2022-02-20 18:39:29,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:29,628 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 311 transitions. [2022-02-20 18:39:29,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call 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:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 311 transitions. [2022-02-20 18:39:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:39:29,630 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:29,630 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:39:29,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:39:29,631 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:29,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1610685192, now seen corresponding path program 1 times [2022-02-20 18:39:29,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:29,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114108116] [2022-02-20 18:39:29,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:29,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:29,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {1229#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_1767~0 := 0;~__return_1898~0 := 0; {1229#true} is VALID [2022-02-20 18:39:29,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {1229#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_~__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;~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;~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;~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; {1229#true} is VALID [2022-02-20 18:39:29,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {1229#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {1229#true} is VALID [2022-02-20 18:39:29,732 INFO L290 TraceCheckUtils]: 3: Hoare triple {1229#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {1229#true} is VALID [2022-02-20 18:39:29,732 INFO L290 TraceCheckUtils]: 4: Hoare triple {1229#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {1229#true} is VALID [2022-02-20 18:39:29,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {1229#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {1229#true} is VALID [2022-02-20 18:39:29,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {1229#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {1229#true} is VALID [2022-02-20 18:39:29,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {1229#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {1229#true} is VALID [2022-02-20 18:39:29,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {1229#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {1229#true} is VALID [2022-02-20 18:39:29,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {1229#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {1229#true} is VALID [2022-02-20 18:39:29,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {1229#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {1229#true} is VALID [2022-02-20 18:39:29,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {1229#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {1229#true} is VALID [2022-02-20 18:39:29,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {1229#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {1229#true} is VALID [2022-02-20 18:39:29,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {1229#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {1229#true} is VALID [2022-02-20 18:39:29,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {1229#true} assume ~id1~0 != ~id2~0; {1229#true} is VALID [2022-02-20 18:39:29,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {1229#true} assume ~id1~0 != ~id3~0; {1229#true} is VALID [2022-02-20 18:39:29,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#true} assume ~id2~0 != ~id3~0; {1229#true} is VALID [2022-02-20 18:39:29,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {1229#true} assume ~id1~0 >= 0; {1229#true} is VALID [2022-02-20 18:39:29,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {1229#true} assume ~id2~0 >= 0; {1229#true} is VALID [2022-02-20 18:39:29,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {1229#true} assume ~id3~0 >= 0; {1229#true} is VALID [2022-02-20 18:39:29,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {1229#true} assume 0 == ~r1~0 % 256; {1229#true} is VALID [2022-02-20 18:39:29,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {1229#true} assume 0 == ~r2~0 % 256; {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~r3~0 % 256; {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r122~0#1 % 256); {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r132~0#1 % 256); {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r212~0#1 % 256); {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r232~0#1 % 256); {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r312~0#1 % 256); {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r322~0#1 % 256); {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max1~0 == ~id1~0; {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max2~0 == ~id2~0; {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max3~0 == ~id3~0; {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st1~0; {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st2~0; {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st3~0; {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl1~0; {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl2~0; {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl3~0; {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,743 INFO L290 TraceCheckUtils]: 38: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode1~0 % 256; {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode2~0 % 256; {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1767~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1767~0; {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,745 INFO L290 TraceCheckUtils]: 41: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} 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; {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,745 INFO L290 TraceCheckUtils]: 42: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~mode1~0 % 256); {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,746 INFO L290 TraceCheckUtils]: 43: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~r1~0 % 256 < 1; {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~ep12~0 % 256); {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,747 INFO L290 TraceCheckUtils]: 45: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~ep13~0 % 256); {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,747 INFO L290 TraceCheckUtils]: 46: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} ~mode1~0 := 1; {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,747 INFO L290 TraceCheckUtils]: 47: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~mode2~0 % 256); {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:29,748 INFO L290 TraceCheckUtils]: 48: Hoare triple {1231#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(~r2~0 % 256 < 2); {1230#false} is VALID [2022-02-20 18:39:29,748 INFO L290 TraceCheckUtils]: 49: Hoare triple {1230#false} ~mode2~0 := 1; {1230#false} is VALID [2022-02-20 18:39:29,748 INFO L290 TraceCheckUtils]: 50: Hoare triple {1230#false} assume !!(0 == ~mode3~0 % 256); {1230#false} is VALID [2022-02-20 18:39:29,749 INFO L290 TraceCheckUtils]: 51: Hoare triple {1230#false} assume !(~r3~0 % 256 < 2); {1230#false} is VALID [2022-02-20 18:39:29,749 INFO L290 TraceCheckUtils]: 52: Hoare triple {1230#false} ~mode3~0 := 1; {1230#false} is VALID [2022-02-20 18:39:29,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {1230#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; {1230#false} is VALID [2022-02-20 18:39:29,749 INFO L290 TraceCheckUtils]: 54: Hoare triple {1230#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1230#false} is VALID [2022-02-20 18:39:29,750 INFO L290 TraceCheckUtils]: 55: Hoare triple {1230#false} ~__return_1898~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1898~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; {1230#false} is VALID [2022-02-20 18:39:29,750 INFO L290 TraceCheckUtils]: 56: Hoare triple {1230#false} assume 0 == main_~assert__arg~0#1 % 256; {1230#false} is VALID [2022-02-20 18:39:29,750 INFO L290 TraceCheckUtils]: 57: Hoare triple {1230#false} assume !false; {1230#false} is VALID [2022-02-20 18:39:29,750 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:39:29,751 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:29,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114108116] [2022-02-20 18:39:29,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114108116] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:29,751 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:29,752 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:39:29,752 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670767883] [2022-02-20 18:39:29,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:29,753 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:39:29,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:29,754 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:39:29,794 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:39:29,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:39:29,794 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:29,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:39:29,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:29,796 INFO L87 Difference]: Start difference. First operand 198 states and 311 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:39:30,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:30,180 INFO L93 Difference]: Finished difference Result 472 states and 763 transitions. [2022-02-20 18:39:30,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:39:30,181 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:39:30,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:30,182 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:39:30,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-02-20 18:39:30,186 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:39:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-02-20 18:39:30,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 479 transitions. [2022-02-20 18:39:30,534 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:39:30,543 INFO L225 Difference]: With dead ends: 472 [2022-02-20 18:39:30,543 INFO L226 Difference]: Without dead ends: 328 [2022-02-20 18:39:30,544 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:39:30,545 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 118 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:30,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 391 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:30,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-02-20 18:39:30,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2022-02-20 18:39:30,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:30,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 328 states. Second operand has 324 states, 323 states have (on average 1.6006191950464397) internal successors, (517), 323 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call 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:30,632 INFO L74 IsIncluded]: Start isIncluded. First operand 328 states. Second operand has 324 states, 323 states have (on average 1.6006191950464397) internal successors, (517), 323 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call 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:30,633 INFO L87 Difference]: Start difference. First operand 328 states. Second operand has 324 states, 323 states have (on average 1.6006191950464397) internal successors, (517), 323 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call 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:30,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:30,643 INFO L93 Difference]: Finished difference Result 328 states and 520 transitions. [2022-02-20 18:39:30,644 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 520 transitions. [2022-02-20 18:39:30,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:30,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:30,645 INFO L74 IsIncluded]: Start isIncluded. First operand has 324 states, 323 states have (on average 1.6006191950464397) internal successors, (517), 323 states have internal predecessors, (517), 0 states have call successors, (0), 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 328 states. [2022-02-20 18:39:30,646 INFO L87 Difference]: Start difference. First operand has 324 states, 323 states have (on average 1.6006191950464397) internal successors, (517), 323 states have internal predecessors, (517), 0 states have call successors, (0), 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 328 states. [2022-02-20 18:39:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:30,656 INFO L93 Difference]: Finished difference Result 328 states and 520 transitions. [2022-02-20 18:39:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 520 transitions. [2022-02-20 18:39:30,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:30,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:30,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:30,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.6006191950464397) internal successors, (517), 323 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call 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:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 517 transitions. [2022-02-20 18:39:30,670 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 517 transitions. Word has length 58 [2022-02-20 18:39:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:30,670 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 517 transitions. [2022-02-20 18:39:30,670 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:39:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 517 transitions. [2022-02-20 18:39:30,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:39:30,672 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:30,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, 1] [2022-02-20 18:39:30,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:39:30,672 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:30,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:30,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1017067947, now seen corresponding path program 1 times [2022-02-20 18:39:30,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:30,674 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338290062] [2022-02-20 18:39:30,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:30,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:30,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {3019#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_1767~0 := 0;~__return_1898~0 := 0; {3019#true} is VALID [2022-02-20 18:39:30,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {3019#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_~__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;~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;~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;~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; {3019#true} is VALID [2022-02-20 18:39:30,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {3019#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {3019#true} is VALID [2022-02-20 18:39:30,773 INFO L290 TraceCheckUtils]: 3: Hoare triple {3019#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {3019#true} is VALID [2022-02-20 18:39:30,773 INFO L290 TraceCheckUtils]: 4: Hoare triple {3019#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {3019#true} is VALID [2022-02-20 18:39:30,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {3019#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {3019#true} is VALID [2022-02-20 18:39:30,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {3019#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {3019#true} is VALID [2022-02-20 18:39:30,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {3019#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {3019#true} is VALID [2022-02-20 18:39:30,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {3019#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {3019#true} is VALID [2022-02-20 18:39:30,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {3019#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {3019#true} is VALID [2022-02-20 18:39:30,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {3019#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {3019#true} is VALID [2022-02-20 18:39:30,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {3019#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {3019#true} is VALID [2022-02-20 18:39:30,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {3019#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {3019#true} is VALID [2022-02-20 18:39:30,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {3019#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {3019#true} is VALID [2022-02-20 18:39:30,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {3019#true} assume ~id1~0 != ~id2~0; {3019#true} is VALID [2022-02-20 18:39:30,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {3019#true} assume ~id1~0 != ~id3~0; {3019#true} is VALID [2022-02-20 18:39:30,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {3019#true} assume ~id2~0 != ~id3~0; {3019#true} is VALID [2022-02-20 18:39:30,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {3019#true} assume ~id1~0 >= 0; {3019#true} is VALID [2022-02-20 18:39:30,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {3019#true} assume ~id2~0 >= 0; {3019#true} is VALID [2022-02-20 18:39:30,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {3019#true} assume ~id3~0 >= 0; {3019#true} is VALID [2022-02-20 18:39:30,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {3019#true} assume 0 == ~r1~0 % 256; {3019#true} is VALID [2022-02-20 18:39:30,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {3019#true} assume 0 == ~r2~0 % 256; {3019#true} is VALID [2022-02-20 18:39:30,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {3019#true} assume 0 == ~r3~0 % 256; {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r122~0#1 % 256); {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r132~0#1 % 256); {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r212~0#1 % 256); {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r232~0#1 % 256); {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r312~0#1 % 256); {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r322~0#1 % 256); {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max1~0 == ~id1~0; {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max2~0 == ~id2~0; {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max3~0 == ~id3~0; {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st1~0; {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st2~0; {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,795 INFO L290 TraceCheckUtils]: 34: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st3~0; {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl1~0; {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl2~0; {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl3~0; {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode1~0 % 256; {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode2~0 % 256; {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1767~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1767~0; {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,797 INFO L290 TraceCheckUtils]: 41: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} 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; {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,798 INFO L290 TraceCheckUtils]: 42: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~mode1~0 % 256); {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,798 INFO L290 TraceCheckUtils]: 43: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r1~0 % 256 < 1; {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep12~0 % 256); {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,799 INFO L290 TraceCheckUtils]: 45: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep13~0 % 256); {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,799 INFO L290 TraceCheckUtils]: 46: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode1~0 := 1; {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~mode2~0 % 256); {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,800 INFO L290 TraceCheckUtils]: 48: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r2~0 % 256 < 2; {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,800 INFO L290 TraceCheckUtils]: 49: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep21~0 % 256); {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep23~0 % 256); {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,801 INFO L290 TraceCheckUtils]: 51: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode2~0 := 1; {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,802 INFO L290 TraceCheckUtils]: 52: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~mode3~0 % 256); {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:30,802 INFO L290 TraceCheckUtils]: 53: Hoare triple {3021#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(~r3~0 % 256 < 2); {3020#false} is VALID [2022-02-20 18:39:30,802 INFO L290 TraceCheckUtils]: 54: Hoare triple {3020#false} ~mode3~0 := 1; {3020#false} is VALID [2022-02-20 18:39:30,803 INFO L290 TraceCheckUtils]: 55: Hoare triple {3020#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; {3020#false} is VALID [2022-02-20 18:39:30,803 INFO L290 TraceCheckUtils]: 56: Hoare triple {3020#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {3020#false} is VALID [2022-02-20 18:39:30,803 INFO L290 TraceCheckUtils]: 57: Hoare triple {3020#false} ~__return_1898~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1898~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; {3020#false} is VALID [2022-02-20 18:39:30,803 INFO L290 TraceCheckUtils]: 58: Hoare triple {3020#false} assume 0 == main_~assert__arg~0#1 % 256; {3020#false} is VALID [2022-02-20 18:39:30,803 INFO L290 TraceCheckUtils]: 59: Hoare triple {3020#false} assume !false; {3020#false} is VALID [2022-02-20 18:39:30,804 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:39:30,804 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:30,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338290062] [2022-02-20 18:39:30,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338290062] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:30,806 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:30,806 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:39:30,806 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676573220] [2022-02-20 18:39:30,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:30,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 18:39:30,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:30,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call 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:30,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:30,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:39:30,851 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:30,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:39:30,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:30,852 INFO L87 Difference]: Start difference. First operand 324 states and 517 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call 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:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:31,360 INFO L93 Difference]: Finished difference Result 836 states and 1355 transitions. [2022-02-20 18:39:31,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:39:31,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 18:39:31,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call 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:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-02-20 18:39:31,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call 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:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-02-20 18:39:31,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 479 transitions. [2022-02-20 18:39:31,701 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:39:31,724 INFO L225 Difference]: With dead ends: 836 [2022-02-20 18:39:31,724 INFO L226 Difference]: Without dead ends: 566 [2022-02-20 18:39:31,725 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:39:31,727 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 113 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:31,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 392 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:31,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-02-20 18:39:31,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 560. [2022-02-20 18:39:31,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:31,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 566 states. Second operand has 560 states, 559 states have (on average 1.6046511627906976) internal successors, (897), 559 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call 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:31,919 INFO L74 IsIncluded]: Start isIncluded. First operand 566 states. Second operand has 560 states, 559 states have (on average 1.6046511627906976) internal successors, (897), 559 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call 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:31,920 INFO L87 Difference]: Start difference. First operand 566 states. Second operand has 560 states, 559 states have (on average 1.6046511627906976) internal successors, (897), 559 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call 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:31,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:31,940 INFO L93 Difference]: Finished difference Result 566 states and 902 transitions. [2022-02-20 18:39:31,940 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 902 transitions. [2022-02-20 18:39:31,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:31,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:31,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 560 states, 559 states have (on average 1.6046511627906976) internal successors, (897), 559 states have internal predecessors, (897), 0 states have call successors, (0), 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 566 states. [2022-02-20 18:39:31,944 INFO L87 Difference]: Start difference. First operand has 560 states, 559 states have (on average 1.6046511627906976) internal successors, (897), 559 states have internal predecessors, (897), 0 states have call successors, (0), 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 566 states. [2022-02-20 18:39:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:31,963 INFO L93 Difference]: Finished difference Result 566 states and 902 transitions. [2022-02-20 18:39:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 902 transitions. [2022-02-20 18:39:31,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:31,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:31,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:31,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.6046511627906976) internal successors, (897), 559 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call 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:31,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 897 transitions. [2022-02-20 18:39:31,990 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 897 transitions. Word has length 60 [2022-02-20 18:39:31,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:31,990 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 897 transitions. [2022-02-20 18:39:31,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call 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:31,991 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 897 transitions. [2022-02-20 18:39:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:39:31,992 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:31,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:39:31,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:39:31,993 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:31,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:31,993 INFO L85 PathProgramCache]: Analyzing trace with hash 291448600, now seen corresponding path program 1 times [2022-02-20 18:39:31,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:31,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132965735] [2022-02-20 18:39:31,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:31,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:32,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {6166#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_1767~0 := 0;~__return_1898~0 := 0; {6166#true} is VALID [2022-02-20 18:39:32,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {6166#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_~__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;~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;~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;~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; {6166#true} is VALID [2022-02-20 18:39:32,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {6166#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {6166#true} is VALID [2022-02-20 18:39:32,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {6166#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {6166#true} is VALID [2022-02-20 18:39:32,113 INFO L290 TraceCheckUtils]: 4: Hoare triple {6166#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {6166#true} is VALID [2022-02-20 18:39:32,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {6166#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {6166#true} is VALID [2022-02-20 18:39:32,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {6166#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {6166#true} is VALID [2022-02-20 18:39:32,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {6166#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {6166#true} is VALID [2022-02-20 18:39:32,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {6166#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {6166#true} is VALID [2022-02-20 18:39:32,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {6166#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {6166#true} is VALID [2022-02-20 18:39:32,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {6166#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {6166#true} is VALID [2022-02-20 18:39:32,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {6166#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {6166#true} is VALID [2022-02-20 18:39:32,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {6166#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {6166#true} is VALID [2022-02-20 18:39:32,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {6166#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {6166#true} is VALID [2022-02-20 18:39:32,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {6166#true} assume ~id1~0 != ~id2~0; {6166#true} is VALID [2022-02-20 18:39:32,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {6166#true} assume ~id1~0 != ~id3~0; {6166#true} is VALID [2022-02-20 18:39:32,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {6166#true} assume ~id2~0 != ~id3~0; {6166#true} is VALID [2022-02-20 18:39:32,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {6166#true} assume ~id1~0 >= 0; {6166#true} is VALID [2022-02-20 18:39:32,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {6166#true} assume ~id2~0 >= 0; {6166#true} is VALID [2022-02-20 18:39:32,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {6166#true} assume ~id3~0 >= 0; {6166#true} is VALID [2022-02-20 18:39:32,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {6166#true} assume 0 == ~r1~0 % 256; {6166#true} is VALID [2022-02-20 18:39:32,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {6166#true} assume 0 == ~r2~0 % 256; {6166#true} is VALID [2022-02-20 18:39:32,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {6166#true} assume 0 == ~r3~0 % 256; {6166#true} is VALID [2022-02-20 18:39:32,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {6166#true} assume !(0 == main_~init__r122~0#1 % 256); {6166#true} is VALID [2022-02-20 18:39:32,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {6166#true} assume !(0 == main_~init__r132~0#1 % 256); {6166#true} is VALID [2022-02-20 18:39:32,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {6166#true} assume !(0 == main_~init__r212~0#1 % 256); {6166#true} is VALID [2022-02-20 18:39:32,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {6166#true} assume !(0 == main_~init__r232~0#1 % 256); {6166#true} is VALID [2022-02-20 18:39:32,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {6166#true} assume !(0 == main_~init__r312~0#1 % 256); {6166#true} is VALID [2022-02-20 18:39:32,117 INFO L290 TraceCheckUtils]: 28: Hoare triple {6166#true} assume !(0 == main_~init__r322~0#1 % 256); {6166#true} is VALID [2022-02-20 18:39:32,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {6166#true} assume ~max1~0 == ~id1~0; {6166#true} is VALID [2022-02-20 18:39:32,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {6166#true} assume ~max2~0 == ~id2~0; {6166#true} is VALID [2022-02-20 18:39:32,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {6166#true} assume ~max3~0 == ~id3~0; {6166#true} is VALID [2022-02-20 18:39:32,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {6166#true} assume 0 == ~st1~0; {6168#(<= ~st1~0 0)} is VALID [2022-02-20 18:39:32,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {6168#(<= ~st1~0 0)} assume 0 == ~st2~0; {6169#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {6169#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,120 INFO L290 TraceCheckUtils]: 36: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,120 INFO L290 TraceCheckUtils]: 37: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,121 INFO L290 TraceCheckUtils]: 38: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,121 INFO L290 TraceCheckUtils]: 39: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1767~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1767~0; {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,122 INFO L290 TraceCheckUtils]: 41: Hoare triple {6170#(<= (+ ~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; {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,122 INFO L290 TraceCheckUtils]: 42: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,123 INFO L290 TraceCheckUtils]: 43: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 1; {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,123 INFO L290 TraceCheckUtils]: 44: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,123 INFO L290 TraceCheckUtils]: 45: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,124 INFO L290 TraceCheckUtils]: 46: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,124 INFO L290 TraceCheckUtils]: 47: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,125 INFO L290 TraceCheckUtils]: 48: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,125 INFO L290 TraceCheckUtils]: 49: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,125 INFO L290 TraceCheckUtils]: 50: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,126 INFO L290 TraceCheckUtils]: 51: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,126 INFO L290 TraceCheckUtils]: 52: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,127 INFO L290 TraceCheckUtils]: 53: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,127 INFO L290 TraceCheckUtils]: 54: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,127 INFO L290 TraceCheckUtils]: 55: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,128 INFO L290 TraceCheckUtils]: 56: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,128 INFO L290 TraceCheckUtils]: 57: Hoare triple {6170#(<= (+ ~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; {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:32,129 INFO L290 TraceCheckUtils]: 58: Hoare triple {6170#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {6167#false} is VALID [2022-02-20 18:39:32,129 INFO L290 TraceCheckUtils]: 59: Hoare triple {6167#false} ~__return_1898~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1898~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; {6167#false} is VALID [2022-02-20 18:39:32,129 INFO L290 TraceCheckUtils]: 60: Hoare triple {6167#false} assume 0 == main_~assert__arg~0#1 % 256; {6167#false} is VALID [2022-02-20 18:39:32,129 INFO L290 TraceCheckUtils]: 61: Hoare triple {6167#false} assume !false; {6167#false} is VALID [2022-02-20 18:39:32,130 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:39:32,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:32,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132965735] [2022-02-20 18:39:32,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132965735] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:32,130 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:32,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:39:32,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125663596] [2022-02-20 18:39:32,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:32,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 18:39:32,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:32,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call 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:32,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:32,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:39:32,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:32,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:39:32,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:39:32,174 INFO L87 Difference]: Start difference. First operand 560 states and 897 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call 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:35,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:35,312 INFO L93 Difference]: Finished difference Result 2856 states and 4667 transitions. [2022-02-20 18:39:35,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:39:35,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 18:39:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:35,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call 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:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1052 transitions. [2022-02-20 18:39:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call 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:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1052 transitions. [2022-02-20 18:39:35,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1052 transitions. [2022-02-20 18:39:36,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1052 edges. 1052 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:36,353 INFO L225 Difference]: With dead ends: 2856 [2022-02-20 18:39:36,353 INFO L226 Difference]: Without dead ends: 2350 [2022-02-20 18:39:36,354 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:39:36,355 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 851 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:36,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [851 Valid, 1318 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:39:36,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2022-02-20 18:39:37,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 1048. [2022-02-20 18:39:37,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:37,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2350 states. Second operand has 1048 states, 1047 states have (on average 1.6131805157593124) internal successors, (1689), 1047 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call 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:37,159 INFO L74 IsIncluded]: Start isIncluded. First operand 2350 states. Second operand has 1048 states, 1047 states have (on average 1.6131805157593124) internal successors, (1689), 1047 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call 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:37,161 INFO L87 Difference]: Start difference. First operand 2350 states. Second operand has 1048 states, 1047 states have (on average 1.6131805157593124) internal successors, (1689), 1047 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call 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:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:37,412 INFO L93 Difference]: Finished difference Result 2350 states and 3812 transitions. [2022-02-20 18:39:37,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 3812 transitions. [2022-02-20 18:39:37,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:37,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:37,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 1048 states, 1047 states have (on average 1.6131805157593124) internal successors, (1689), 1047 states have internal predecessors, (1689), 0 states have call successors, (0), 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 2350 states. [2022-02-20 18:39:37,420 INFO L87 Difference]: Start difference. First operand has 1048 states, 1047 states have (on average 1.6131805157593124) internal successors, (1689), 1047 states have internal predecessors, (1689), 0 states have call successors, (0), 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 2350 states. [2022-02-20 18:39:37,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:37,646 INFO L93 Difference]: Finished difference Result 2350 states and 3812 transitions. [2022-02-20 18:39:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 3812 transitions. [2022-02-20 18:39:37,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:37,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:37,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:37,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:37,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1047 states have (on average 1.6131805157593124) internal successors, (1689), 1047 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call 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:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1689 transitions. [2022-02-20 18:39:37,725 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1689 transitions. Word has length 62 [2022-02-20 18:39:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:37,725 INFO L470 AbstractCegarLoop]: Abstraction has 1048 states and 1689 transitions. [2022-02-20 18:39:37,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call 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:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1689 transitions. [2022-02-20 18:39:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:39:37,727 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:37,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:39:37,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:39:37,728 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:37,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:37,728 INFO L85 PathProgramCache]: Analyzing trace with hash 382467820, now seen corresponding path program 1 times [2022-02-20 18:39:37,729 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:37,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843665786] [2022-02-20 18:39:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:37,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:37,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {16554#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_1767~0 := 0;~__return_1898~0 := 0; {16554#true} is VALID [2022-02-20 18:39:37,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {16554#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_~__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;~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;~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;~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; {16554#true} is VALID [2022-02-20 18:39:37,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {16554#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {16554#true} is VALID [2022-02-20 18:39:37,812 INFO L290 TraceCheckUtils]: 3: Hoare triple {16554#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {16554#true} is VALID [2022-02-20 18:39:37,812 INFO L290 TraceCheckUtils]: 4: Hoare triple {16554#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {16554#true} is VALID [2022-02-20 18:39:37,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {16554#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {16554#true} is VALID [2022-02-20 18:39:37,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {16554#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {16554#true} is VALID [2022-02-20 18:39:37,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {16554#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {16554#true} is VALID [2022-02-20 18:39:37,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {16554#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {16554#true} is VALID [2022-02-20 18:39:37,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {16554#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {16554#true} is VALID [2022-02-20 18:39:37,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {16554#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {16554#true} is VALID [2022-02-20 18:39:37,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {16554#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {16554#true} is VALID [2022-02-20 18:39:37,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {16554#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {16554#true} is VALID [2022-02-20 18:39:37,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {16554#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {16554#true} is VALID [2022-02-20 18:39:37,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {16554#true} assume ~id1~0 != ~id2~0; {16554#true} is VALID [2022-02-20 18:39:37,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {16554#true} assume ~id1~0 != ~id3~0; {16554#true} is VALID [2022-02-20 18:39:37,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {16554#true} assume ~id2~0 != ~id3~0; {16554#true} is VALID [2022-02-20 18:39:37,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {16554#true} assume ~id1~0 >= 0; {16554#true} is VALID [2022-02-20 18:39:37,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {16554#true} assume ~id2~0 >= 0; {16554#true} is VALID [2022-02-20 18:39:37,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {16554#true} assume ~id3~0 >= 0; {16554#true} is VALID [2022-02-20 18:39:37,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {16554#true} assume 0 == ~r1~0 % 256; {16554#true} is VALID [2022-02-20 18:39:37,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {16554#true} assume 0 == ~r2~0 % 256; {16554#true} is VALID [2022-02-20 18:39:37,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {16554#true} assume 0 == ~r3~0 % 256; {16554#true} is VALID [2022-02-20 18:39:37,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {16554#true} assume !(0 == main_~init__r122~0#1 % 256); {16554#true} is VALID [2022-02-20 18:39:37,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {16554#true} assume !(0 == main_~init__r132~0#1 % 256); {16554#true} is VALID [2022-02-20 18:39:37,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {16554#true} assume !(0 == main_~init__r212~0#1 % 256); {16554#true} is VALID [2022-02-20 18:39:37,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {16554#true} assume !(0 == main_~init__r232~0#1 % 256); {16554#true} is VALID [2022-02-20 18:39:37,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {16554#true} assume !(0 == main_~init__r312~0#1 % 256); {16554#true} is VALID [2022-02-20 18:39:37,825 INFO L290 TraceCheckUtils]: 28: Hoare triple {16554#true} assume !(0 == main_~init__r322~0#1 % 256); {16554#true} is VALID [2022-02-20 18:39:37,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {16554#true} assume ~max1~0 == ~id1~0; {16554#true} is VALID [2022-02-20 18:39:37,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {16554#true} assume ~max2~0 == ~id2~0; {16554#true} is VALID [2022-02-20 18:39:37,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {16554#true} assume ~max3~0 == ~id3~0; {16554#true} is VALID [2022-02-20 18:39:37,826 INFO L290 TraceCheckUtils]: 32: Hoare triple {16554#true} assume 0 == ~st1~0; {16556#(<= ~st1~0 0)} is VALID [2022-02-20 18:39:37,826 INFO L290 TraceCheckUtils]: 33: Hoare triple {16556#(<= ~st1~0 0)} assume 0 == ~st2~0; {16556#(<= ~st1~0 0)} is VALID [2022-02-20 18:39:37,827 INFO L290 TraceCheckUtils]: 34: Hoare triple {16556#(<= ~st1~0 0)} assume 0 == ~st3~0; {16556#(<= ~st1~0 0)} is VALID [2022-02-20 18:39:37,827 INFO L290 TraceCheckUtils]: 35: Hoare triple {16556#(<= ~st1~0 0)} assume 0 == ~nl1~0; {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,828 INFO L290 TraceCheckUtils]: 36: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,828 INFO L290 TraceCheckUtils]: 37: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,828 INFO L290 TraceCheckUtils]: 38: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,829 INFO L290 TraceCheckUtils]: 39: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,829 INFO L290 TraceCheckUtils]: 40: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1767~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1767~0; {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,829 INFO L290 TraceCheckUtils]: 41: Hoare triple {16557#(<= (+ ~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; {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,830 INFO L290 TraceCheckUtils]: 42: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,830 INFO L290 TraceCheckUtils]: 43: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 % 256 < 1; {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,830 INFO L290 TraceCheckUtils]: 44: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,831 INFO L290 TraceCheckUtils]: 45: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,831 INFO L290 TraceCheckUtils]: 46: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,832 INFO L290 TraceCheckUtils]: 47: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,833 INFO L290 TraceCheckUtils]: 48: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,833 INFO L290 TraceCheckUtils]: 49: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,833 INFO L290 TraceCheckUtils]: 50: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,834 INFO L290 TraceCheckUtils]: 51: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,834 INFO L290 TraceCheckUtils]: 52: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,834 INFO L290 TraceCheckUtils]: 53: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,835 INFO L290 TraceCheckUtils]: 54: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,835 INFO L290 TraceCheckUtils]: 55: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,835 INFO L290 TraceCheckUtils]: 56: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,836 INFO L290 TraceCheckUtils]: 57: Hoare triple {16557#(<= (+ ~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; {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,836 INFO L290 TraceCheckUtils]: 58: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16557#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:37,837 INFO L290 TraceCheckUtils]: 59: Hoare triple {16557#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);main_~check__tmp~0#1 := 0; {16555#false} is VALID [2022-02-20 18:39:37,837 INFO L290 TraceCheckUtils]: 60: Hoare triple {16555#false} ~__return_1898~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1898~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; {16555#false} is VALID [2022-02-20 18:39:37,837 INFO L290 TraceCheckUtils]: 61: Hoare triple {16555#false} assume 0 == main_~assert__arg~0#1 % 256; {16555#false} is VALID [2022-02-20 18:39:37,837 INFO L290 TraceCheckUtils]: 62: Hoare triple {16555#false} assume !false; {16555#false} is VALID [2022-02-20 18:39:37,840 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:39:37,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:37,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843665786] [2022-02-20 18:39:37,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843665786] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:37,841 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:37,841 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:39:37,841 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127369263] [2022-02-20 18:39:37,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:37,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:39:37,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:37,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:37,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:37,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:39:37,885 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:37,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:39:37,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:39:37,886 INFO L87 Difference]: Start difference. First operand 1048 states and 1689 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:41,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:41,558 INFO L93 Difference]: Finished difference Result 3818 states and 6202 transitions. [2022-02-20 18:39:41,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:39:41,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:39:41,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:41,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 632 transitions. [2022-02-20 18:39:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 632 transitions. [2022-02-20 18:39:41,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 632 transitions. [2022-02-20 18:39:41,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 632 edges. 632 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:42,292 INFO L225 Difference]: With dead ends: 3818 [2022-02-20 18:39:42,293 INFO L226 Difference]: Without dead ends: 2824 [2022-02-20 18:39:42,294 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:39:42,295 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 404 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 709 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:39:42,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 709 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:42,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2022-02-20 18:39:43,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 1927. [2022-02-20 18:39:43,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:44,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2824 states. Second operand has 1927 states, 1926 states have (on average 1.6137071651090342) internal successors, (3108), 1926 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call 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:44,005 INFO L74 IsIncluded]: Start isIncluded. First operand 2824 states. Second operand has 1927 states, 1926 states have (on average 1.6137071651090342) internal successors, (3108), 1926 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call 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:44,008 INFO L87 Difference]: Start difference. First operand 2824 states. Second operand has 1927 states, 1926 states have (on average 1.6137071651090342) internal successors, (3108), 1926 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call 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:44,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:44,235 INFO L93 Difference]: Finished difference Result 2824 states and 4571 transitions. [2022-02-20 18:39:44,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 4571 transitions. [2022-02-20 18:39:44,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:44,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:44,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 1927 states, 1926 states have (on average 1.6137071651090342) internal successors, (3108), 1926 states have internal predecessors, (3108), 0 states have call successors, (0), 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 2824 states. [2022-02-20 18:39:44,244 INFO L87 Difference]: Start difference. First operand has 1927 states, 1926 states have (on average 1.6137071651090342) internal successors, (3108), 1926 states have internal predecessors, (3108), 0 states have call successors, (0), 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 2824 states. [2022-02-20 18:39:44,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:44,457 INFO L93 Difference]: Finished difference Result 2824 states and 4571 transitions. [2022-02-20 18:39:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 4571 transitions. [2022-02-20 18:39:44,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:44,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:44,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:44,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:44,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1926 states have (on average 1.6137071651090342) internal successors, (3108), 1926 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call 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:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 3108 transitions. [2022-02-20 18:39:44,663 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 3108 transitions. Word has length 63 [2022-02-20 18:39:44,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:44,663 INFO L470 AbstractCegarLoop]: Abstraction has 1927 states and 3108 transitions. [2022-02-20 18:39:44,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:44,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 3108 transitions. [2022-02-20 18:39:44,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:39:44,665 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:44,665 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:39:44,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:39:44,665 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:44,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:44,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1086345633, now seen corresponding path program 1 times [2022-02-20 18:39:44,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:44,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727137661] [2022-02-20 18:39:44,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:44,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:44,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {30584#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_1767~0 := 0;~__return_1898~0 := 0; {30584#true} is VALID [2022-02-20 18:39:44,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {30584#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_~__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;~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;~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;~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; {30584#true} is VALID [2022-02-20 18:39:44,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {30584#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {30584#true} is VALID [2022-02-20 18:39:44,720 INFO L290 TraceCheckUtils]: 3: Hoare triple {30584#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {30584#true} is VALID [2022-02-20 18:39:44,720 INFO L290 TraceCheckUtils]: 4: Hoare triple {30584#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {30584#true} is VALID [2022-02-20 18:39:44,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {30584#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {30584#true} is VALID [2022-02-20 18:39:44,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {30584#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {30584#true} is VALID [2022-02-20 18:39:44,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {30584#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {30584#true} is VALID [2022-02-20 18:39:44,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {30584#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {30584#true} is VALID [2022-02-20 18:39:44,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {30584#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {30584#true} is VALID [2022-02-20 18:39:44,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {30584#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {30584#true} is VALID [2022-02-20 18:39:44,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {30584#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {30584#true} is VALID [2022-02-20 18:39:44,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {30584#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {30584#true} is VALID [2022-02-20 18:39:44,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {30584#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {30584#true} is VALID [2022-02-20 18:39:44,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {30584#true} assume ~id1~0 != ~id2~0; {30584#true} is VALID [2022-02-20 18:39:44,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {30584#true} assume ~id1~0 != ~id3~0; {30584#true} is VALID [2022-02-20 18:39:44,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {30584#true} assume ~id2~0 != ~id3~0; {30584#true} is VALID [2022-02-20 18:39:44,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {30584#true} assume ~id1~0 >= 0; {30584#true} is VALID [2022-02-20 18:39:44,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {30584#true} assume ~id2~0 >= 0; {30584#true} is VALID [2022-02-20 18:39:44,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {30584#true} assume ~id3~0 >= 0; {30584#true} is VALID [2022-02-20 18:39:44,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {30584#true} assume 0 == ~r1~0 % 256; {30584#true} is VALID [2022-02-20 18:39:44,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {30584#true} assume 0 == ~r2~0 % 256; {30584#true} is VALID [2022-02-20 18:39:44,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {30584#true} assume 0 == ~r3~0 % 256; {30584#true} is VALID [2022-02-20 18:39:44,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {30584#true} assume !(0 == main_~init__r122~0#1 % 256); {30584#true} is VALID [2022-02-20 18:39:44,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {30584#true} assume !(0 == main_~init__r132~0#1 % 256); {30584#true} is VALID [2022-02-20 18:39:44,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {30584#true} assume !(0 == main_~init__r212~0#1 % 256); {30584#true} is VALID [2022-02-20 18:39:44,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {30584#true} assume !(0 == main_~init__r232~0#1 % 256); {30584#true} is VALID [2022-02-20 18:39:44,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {30584#true} assume !(0 == main_~init__r312~0#1 % 256); {30584#true} is VALID [2022-02-20 18:39:44,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {30584#true} assume !(0 == main_~init__r322~0#1 % 256); {30584#true} is VALID [2022-02-20 18:39:44,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {30584#true} assume ~max1~0 == ~id1~0; {30584#true} is VALID [2022-02-20 18:39:44,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {30584#true} assume ~max2~0 == ~id2~0; {30584#true} is VALID [2022-02-20 18:39:44,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {30584#true} assume ~max3~0 == ~id3~0; {30584#true} is VALID [2022-02-20 18:39:44,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {30584#true} assume 0 == ~st1~0; {30584#true} is VALID [2022-02-20 18:39:44,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {30584#true} assume 0 == ~st2~0; {30586#(<= ~st2~0 0)} is VALID [2022-02-20 18:39:44,725 INFO L290 TraceCheckUtils]: 34: Hoare triple {30586#(<= ~st2~0 0)} assume 0 == ~st3~0; {30586#(<= ~st2~0 0)} is VALID [2022-02-20 18:39:44,726 INFO L290 TraceCheckUtils]: 35: Hoare triple {30586#(<= ~st2~0 0)} assume 0 == ~nl1~0; {30586#(<= ~st2~0 0)} is VALID [2022-02-20 18:39:44,726 INFO L290 TraceCheckUtils]: 36: Hoare triple {30586#(<= ~st2~0 0)} assume 0 == ~nl2~0; {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,728 INFO L290 TraceCheckUtils]: 40: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1767~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1767~0; {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,728 INFO L290 TraceCheckUtils]: 41: Hoare triple {30587#(<= (+ ~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; {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,729 INFO L290 TraceCheckUtils]: 42: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256); {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,729 INFO L290 TraceCheckUtils]: 43: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 % 256 < 1; {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,729 INFO L290 TraceCheckUtils]: 44: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep12~0 % 256); {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,730 INFO L290 TraceCheckUtils]: 45: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep13~0 % 256); {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,730 INFO L290 TraceCheckUtils]: 46: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,731 INFO L290 TraceCheckUtils]: 47: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256); {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,731 INFO L290 TraceCheckUtils]: 48: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 % 256 < 2; {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,731 INFO L290 TraceCheckUtils]: 49: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep21~0 % 256); {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,732 INFO L290 TraceCheckUtils]: 50: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep23~0 % 256); {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,732 INFO L290 TraceCheckUtils]: 51: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,733 INFO L290 TraceCheckUtils]: 52: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256); {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,733 INFO L290 TraceCheckUtils]: 53: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 % 256 < 2; {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,733 INFO L290 TraceCheckUtils]: 54: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep31~0 % 256); {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,734 INFO L290 TraceCheckUtils]: 55: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep32~0 % 256); {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,734 INFO L290 TraceCheckUtils]: 56: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,735 INFO L290 TraceCheckUtils]: 57: Hoare triple {30587#(<= (+ ~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; {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,735 INFO L290 TraceCheckUtils]: 58: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,735 INFO L290 TraceCheckUtils]: 59: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {30587#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:44,736 INFO L290 TraceCheckUtils]: 60: Hoare triple {30587#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);main_~check__tmp~0#1 := 0; {30585#false} is VALID [2022-02-20 18:39:44,736 INFO L290 TraceCheckUtils]: 61: Hoare triple {30585#false} ~__return_1898~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1898~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; {30585#false} is VALID [2022-02-20 18:39:44,736 INFO L290 TraceCheckUtils]: 62: Hoare triple {30585#false} assume 0 == main_~assert__arg~0#1 % 256; {30585#false} is VALID [2022-02-20 18:39:44,736 INFO L290 TraceCheckUtils]: 63: Hoare triple {30585#false} assume !false; {30585#false} is VALID [2022-02-20 18:39:44,737 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:39:44,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:44,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727137661] [2022-02-20 18:39:44,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727137661] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:44,737 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:44,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:39:44,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131198672] [2022-02-20 18:39:44,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:44,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:39:44,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:44,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:44,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:44,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:39:44,780 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:44,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:39:44,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:39:44,781 INFO L87 Difference]: Start difference. First operand 1927 states and 3108 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:50,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:50,309 INFO L93 Difference]: Finished difference Result 5666 states and 9208 transitions. [2022-02-20 18:39:50,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:39:50,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:39:50,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 632 transitions. [2022-02-20 18:39:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 632 transitions. [2022-02-20 18:39:50,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 632 transitions. [2022-02-20 18:39:50,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 632 edges. 632 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:51,355 INFO L225 Difference]: With dead ends: 5666 [2022-02-20 18:39:51,356 INFO L226 Difference]: Without dead ends: 3793 [2022-02-20 18:39:51,358 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:39:51,359 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 402 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 717 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:39:51,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 717 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:51,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3793 states. [2022-02-20 18:39:54,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3793 to 2844. [2022-02-20 18:39:54,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:54,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3793 states. Second operand has 2844 states, 2843 states have (on average 1.6120295462539571) internal successors, (4583), 2843 states have internal predecessors, (4583), 0 states have call successors, (0), 0 states have call 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:54,753 INFO L74 IsIncluded]: Start isIncluded. First operand 3793 states. Second operand has 2844 states, 2843 states have (on average 1.6120295462539571) internal successors, (4583), 2843 states have internal predecessors, (4583), 0 states have call successors, (0), 0 states have call 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:54,756 INFO L87 Difference]: Start difference. First operand 3793 states. Second operand has 2844 states, 2843 states have (on average 1.6120295462539571) internal successors, (4583), 2843 states have internal predecessors, (4583), 0 states have call successors, (0), 0 states have call 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:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:55,162 INFO L93 Difference]: Finished difference Result 3793 states and 6144 transitions. [2022-02-20 18:39:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3793 states and 6144 transitions. [2022-02-20 18:39:55,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:55,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:55,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 2844 states, 2843 states have (on average 1.6120295462539571) internal successors, (4583), 2843 states have internal predecessors, (4583), 0 states have call successors, (0), 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 3793 states. [2022-02-20 18:39:55,176 INFO L87 Difference]: Start difference. First operand has 2844 states, 2843 states have (on average 1.6120295462539571) internal successors, (4583), 2843 states have internal predecessors, (4583), 0 states have call successors, (0), 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 3793 states. [2022-02-20 18:39:55,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:55,612 INFO L93 Difference]: Finished difference Result 3793 states and 6144 transitions. [2022-02-20 18:39:55,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3793 states and 6144 transitions. [2022-02-20 18:39:55,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:55,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:55,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:55,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 2843 states have (on average 1.6120295462539571) internal successors, (4583), 2843 states have internal predecessors, (4583), 0 states have call successors, (0), 0 states have call 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:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 4583 transitions. [2022-02-20 18:39:55,952 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 4583 transitions. Word has length 64 [2022-02-20 18:39:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:55,952 INFO L470 AbstractCegarLoop]: Abstraction has 2844 states and 4583 transitions. [2022-02-20 18:39:55,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 4583 transitions. [2022-02-20 18:39:55,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:39:55,954 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:55,954 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:39:55,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:39:55,955 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:55,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:55,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1879078355, now seen corresponding path program 1 times [2022-02-20 18:39:55,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:55,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699158323] [2022-02-20 18:39:55,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:55,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:56,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {50625#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_1767~0 := 0;~__return_1898~0 := 0; {50625#true} is VALID [2022-02-20 18:39:56,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {50625#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_~__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;~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;~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;~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; {50625#true} is VALID [2022-02-20 18:39:56,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {50625#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {50625#true} is VALID [2022-02-20 18:39:56,019 INFO L290 TraceCheckUtils]: 3: Hoare triple {50625#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {50625#true} is VALID [2022-02-20 18:39:56,019 INFO L290 TraceCheckUtils]: 4: Hoare triple {50625#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {50625#true} is VALID [2022-02-20 18:39:56,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {50625#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {50625#true} is VALID [2022-02-20 18:39:56,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {50625#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {50625#true} is VALID [2022-02-20 18:39:56,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {50625#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {50625#true} is VALID [2022-02-20 18:39:56,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {50625#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {50625#true} is VALID [2022-02-20 18:39:56,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {50625#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {50625#true} is VALID [2022-02-20 18:39:56,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {50625#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {50625#true} is VALID [2022-02-20 18:39:56,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {50625#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {50625#true} is VALID [2022-02-20 18:39:56,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {50625#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {50625#true} is VALID [2022-02-20 18:39:56,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {50625#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {50625#true} is VALID [2022-02-20 18:39:56,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {50625#true} assume ~id1~0 != ~id2~0; {50625#true} is VALID [2022-02-20 18:39:56,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {50625#true} assume ~id1~0 != ~id3~0; {50625#true} is VALID [2022-02-20 18:39:56,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {50625#true} assume ~id2~0 != ~id3~0; {50625#true} is VALID [2022-02-20 18:39:56,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {50625#true} assume ~id1~0 >= 0; {50625#true} is VALID [2022-02-20 18:39:56,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {50625#true} assume ~id2~0 >= 0; {50625#true} is VALID [2022-02-20 18:39:56,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {50625#true} assume ~id3~0 >= 0; {50625#true} is VALID [2022-02-20 18:39:56,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {50625#true} assume 0 == ~r1~0 % 256; {50625#true} is VALID [2022-02-20 18:39:56,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {50625#true} assume 0 == ~r2~0 % 256; {50625#true} is VALID [2022-02-20 18:39:56,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {50625#true} assume 0 == ~r3~0 % 256; {50625#true} is VALID [2022-02-20 18:39:56,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {50625#true} assume !(0 == main_~init__r122~0#1 % 256); {50625#true} is VALID [2022-02-20 18:39:56,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {50625#true} assume !(0 == main_~init__r132~0#1 % 256); {50625#true} is VALID [2022-02-20 18:39:56,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {50625#true} assume !(0 == main_~init__r212~0#1 % 256); {50625#true} is VALID [2022-02-20 18:39:56,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {50625#true} assume !(0 == main_~init__r232~0#1 % 256); {50625#true} is VALID [2022-02-20 18:39:56,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {50625#true} assume !(0 == main_~init__r312~0#1 % 256); {50625#true} is VALID [2022-02-20 18:39:56,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {50625#true} assume !(0 == main_~init__r322~0#1 % 256); {50625#true} is VALID [2022-02-20 18:39:56,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {50625#true} assume ~max1~0 == ~id1~0; {50625#true} is VALID [2022-02-20 18:39:56,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {50625#true} assume ~max2~0 == ~id2~0; {50625#true} is VALID [2022-02-20 18:39:56,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {50625#true} assume ~max3~0 == ~id3~0; {50625#true} is VALID [2022-02-20 18:39:56,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {50625#true} assume 0 == ~st1~0; {50625#true} is VALID [2022-02-20 18:39:56,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {50625#true} assume 0 == ~st2~0; {50625#true} is VALID [2022-02-20 18:39:56,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {50625#true} assume 0 == ~st3~0; {50625#true} is VALID [2022-02-20 18:39:56,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {50625#true} assume 0 == ~nl1~0; {50625#true} is VALID [2022-02-20 18:39:56,023 INFO L290 TraceCheckUtils]: 36: Hoare triple {50625#true} assume 0 == ~nl2~0; {50625#true} is VALID [2022-02-20 18:39:56,023 INFO L290 TraceCheckUtils]: 37: Hoare triple {50625#true} assume 0 == ~nl3~0; {50625#true} is VALID [2022-02-20 18:39:56,023 INFO L290 TraceCheckUtils]: 38: Hoare triple {50625#true} assume 0 == ~mode1~0 % 256; {50625#true} is VALID [2022-02-20 18:39:56,024 INFO L290 TraceCheckUtils]: 39: Hoare triple {50625#true} assume 0 == ~mode2~0 % 256; {50627#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:39:56,024 INFO L290 TraceCheckUtils]: 40: Hoare triple {50627#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1767~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1767~0; {50627#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:39:56,025 INFO L290 TraceCheckUtils]: 41: Hoare triple {50627#(= (+ (* (- 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; {50627#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:39:56,025 INFO L290 TraceCheckUtils]: 42: Hoare triple {50627#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {50627#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:39:56,026 INFO L290 TraceCheckUtils]: 43: Hoare triple {50627#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 % 256 < 1; {50627#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:39:56,026 INFO L290 TraceCheckUtils]: 44: Hoare triple {50627#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~ep12~0 % 256); {50627#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:39:56,026 INFO L290 TraceCheckUtils]: 45: Hoare triple {50627#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~ep13~0 % 256); {50627#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:39:56,027 INFO L290 TraceCheckUtils]: 46: Hoare triple {50627#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {50627#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:39:56,027 INFO L290 TraceCheckUtils]: 47: Hoare triple {50627#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256); {50626#false} is VALID [2022-02-20 18:39:56,028 INFO L290 TraceCheckUtils]: 48: Hoare triple {50626#false} assume !(255 == ~r2~0 % 256); {50626#false} is VALID [2022-02-20 18:39:56,028 INFO L290 TraceCheckUtils]: 49: Hoare triple {50626#false} ~r2~0 := 1 + ~r2~0 % 256; {50626#false} is VALID [2022-02-20 18:39:56,028 INFO L290 TraceCheckUtils]: 50: Hoare triple {50626#false} assume !!(0 == ~ep12~0 % 256); {50626#false} is VALID [2022-02-20 18:39:56,028 INFO L290 TraceCheckUtils]: 51: Hoare triple {50626#false} assume !!(0 == ~ep32~0 % 256); {50626#false} is VALID [2022-02-20 18:39:56,028 INFO L290 TraceCheckUtils]: 52: Hoare triple {50626#false} assume 2 == ~r2~0 % 256; {50626#false} is VALID [2022-02-20 18:39:56,028 INFO L290 TraceCheckUtils]: 53: Hoare triple {50626#false} assume ~max2~0 == ~id2~0;~st2~0 := 1; {50626#false} is VALID [2022-02-20 18:39:56,028 INFO L290 TraceCheckUtils]: 54: Hoare triple {50626#false} ~mode2~0 := 0; {50626#false} is VALID [2022-02-20 18:39:56,028 INFO L290 TraceCheckUtils]: 55: Hoare triple {50626#false} assume !!(0 == ~mode3~0 % 256); {50626#false} is VALID [2022-02-20 18:39:56,029 INFO L290 TraceCheckUtils]: 56: Hoare triple {50626#false} assume ~r3~0 % 256 < 2; {50626#false} is VALID [2022-02-20 18:39:56,029 INFO L290 TraceCheckUtils]: 57: Hoare triple {50626#false} assume !!(0 == ~ep31~0 % 256); {50626#false} is VALID [2022-02-20 18:39:56,029 INFO L290 TraceCheckUtils]: 58: Hoare triple {50626#false} assume !!(0 == ~ep32~0 % 256); {50626#false} is VALID [2022-02-20 18:39:56,029 INFO L290 TraceCheckUtils]: 59: Hoare triple {50626#false} ~mode3~0 := 1; {50626#false} is VALID [2022-02-20 18:39:56,029 INFO L290 TraceCheckUtils]: 60: Hoare triple {50626#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; {50626#false} is VALID [2022-02-20 18:39:56,029 INFO L290 TraceCheckUtils]: 61: Hoare triple {50626#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {50626#false} is VALID [2022-02-20 18:39:56,029 INFO L290 TraceCheckUtils]: 62: Hoare triple {50626#false} ~__return_1898~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1898~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; {50626#false} is VALID [2022-02-20 18:39:56,029 INFO L290 TraceCheckUtils]: 63: Hoare triple {50626#false} assume 0 == main_~assert__arg~0#1 % 256; {50626#false} is VALID [2022-02-20 18:39:56,030 INFO L290 TraceCheckUtils]: 64: Hoare triple {50626#false} assume !false; {50626#false} is VALID [2022-02-20 18:39:56,030 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:39:56,030 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:56,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699158323] [2022-02-20 18:39:56,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699158323] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:56,030 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:56,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:39:56,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677543903] [2022-02-20 18:39:56,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:56,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:39:56,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:56,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:56,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:56,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:39:56,073 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:56,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:39:56,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:56,074 INFO L87 Difference]: Start difference. First operand 2844 states and 4583 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:40:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:40:02,464 INFO L93 Difference]: Finished difference Result 6202 states and 10046 transitions. [2022-02-20 18:40:02,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:40:02,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:40:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:40:02,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:40:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2022-02-20 18:40:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:40:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2022-02-20 18:40:02,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 457 transitions. [2022-02-20 18:40:02,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:40:03,562 INFO L225 Difference]: With dead ends: 6202 [2022-02-20 18:40:03,562 INFO L226 Difference]: Without dead ends: 4227 [2022-02-20 18:40:03,564 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:40:03,565 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 117 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 463 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:40:03,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 463 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:40:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4227 states. [2022-02-20 18:40:08,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4227 to 4225. [2022-02-20 18:40:08,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:40:08,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4227 states. Second operand has 4225 states, 4224 states have (on average 1.6072443181818181) internal successors, (6789), 4224 states have internal predecessors, (6789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:40:08,213 INFO L74 IsIncluded]: Start isIncluded. First operand 4227 states. Second operand has 4225 states, 4224 states have (on average 1.6072443181818181) internal successors, (6789), 4224 states have internal predecessors, (6789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:40:08,219 INFO L87 Difference]: Start difference. First operand 4227 states. Second operand has 4225 states, 4224 states have (on average 1.6072443181818181) internal successors, (6789), 4224 states have internal predecessors, (6789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:40:08,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:40:08,767 INFO L93 Difference]: Finished difference Result 4227 states and 6790 transitions. [2022-02-20 18:40:08,767 INFO L276 IsEmpty]: Start isEmpty. Operand 4227 states and 6790 transitions. [2022-02-20 18:40:08,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:40:08,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:40:08,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 4225 states, 4224 states have (on average 1.6072443181818181) internal successors, (6789), 4224 states have internal predecessors, (6789), 0 states have call successors, (0), 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 4227 states. [2022-02-20 18:40:08,777 INFO L87 Difference]: Start difference. First operand has 4225 states, 4224 states have (on average 1.6072443181818181) internal successors, (6789), 4224 states have internal predecessors, (6789), 0 states have call successors, (0), 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 4227 states. [2022-02-20 18:40:09,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:40:09,249 INFO L93 Difference]: Finished difference Result 4227 states and 6790 transitions. [2022-02-20 18:40:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 4227 states and 6790 transitions. [2022-02-20 18:40:09,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:40:09,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:40:09,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:40:09,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:40:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4225 states, 4224 states have (on average 1.6072443181818181) internal successors, (6789), 4224 states have internal predecessors, (6789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:40:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4225 states to 4225 states and 6789 transitions. [2022-02-20 18:40:10,035 INFO L78 Accepts]: Start accepts. Automaton has 4225 states and 6789 transitions. Word has length 65 [2022-02-20 18:40:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:40:10,036 INFO L470 AbstractCegarLoop]: Abstraction has 4225 states and 6789 transitions. [2022-02-20 18:40:10,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:40:10,036 INFO L276 IsEmpty]: Start isEmpty. Operand 4225 states and 6789 transitions. [2022-02-20 18:40:10,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:40:10,037 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:40:10,037 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:40:10,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:40:10,037 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:40:10,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:40:10,038 INFO L85 PathProgramCache]: Analyzing trace with hash -450865020, now seen corresponding path program 1 times [2022-02-20 18:40:10,038 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:40:10,038 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727057870] [2022-02-20 18:40:10,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:40:10,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:40:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:40:10,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {74357#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_1767~0 := 0;~__return_1898~0 := 0; {74357#true} is VALID [2022-02-20 18:40:10,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {74357#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_~__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;~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;~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;~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; {74357#true} is VALID [2022-02-20 18:40:10,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {74357#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {74357#true} is VALID [2022-02-20 18:40:10,082 INFO L290 TraceCheckUtils]: 3: Hoare triple {74357#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {74357#true} is VALID [2022-02-20 18:40:10,082 INFO L290 TraceCheckUtils]: 4: Hoare triple {74357#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {74357#true} is VALID [2022-02-20 18:40:10,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {74357#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {74357#true} is VALID [2022-02-20 18:40:10,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {74357#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {74357#true} is VALID [2022-02-20 18:40:10,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {74357#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {74357#true} is VALID [2022-02-20 18:40:10,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {74357#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {74357#true} is VALID [2022-02-20 18:40:10,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {74357#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {74357#true} is VALID [2022-02-20 18:40:10,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {74357#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {74357#true} is VALID [2022-02-20 18:40:10,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {74357#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {74357#true} is VALID [2022-02-20 18:40:10,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {74357#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {74357#true} is VALID [2022-02-20 18:40:10,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {74357#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {74357#true} is VALID [2022-02-20 18:40:10,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {74357#true} assume ~id1~0 != ~id2~0; {74357#true} is VALID [2022-02-20 18:40:10,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {74357#true} assume ~id1~0 != ~id3~0; {74357#true} is VALID [2022-02-20 18:40:10,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {74357#true} assume ~id2~0 != ~id3~0; {74357#true} is VALID [2022-02-20 18:40:10,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {74357#true} assume ~id1~0 >= 0; {74357#true} is VALID [2022-02-20 18:40:10,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {74357#true} assume ~id2~0 >= 0; {74357#true} is VALID [2022-02-20 18:40:10,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {74357#true} assume ~id3~0 >= 0; {74357#true} is VALID [2022-02-20 18:40:10,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {74357#true} assume 0 == ~r1~0 % 256; {74357#true} is VALID [2022-02-20 18:40:10,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {74357#true} assume 0 == ~r2~0 % 256; {74357#true} is VALID [2022-02-20 18:40:10,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {74357#true} assume 0 == ~r3~0 % 256; {74357#true} is VALID [2022-02-20 18:40:10,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {74357#true} assume !(0 == main_~init__r122~0#1 % 256); {74357#true} is VALID [2022-02-20 18:40:10,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {74357#true} assume !(0 == main_~init__r132~0#1 % 256); {74357#true} is VALID [2022-02-20 18:40:10,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {74357#true} assume !(0 == main_~init__r212~0#1 % 256); {74357#true} is VALID [2022-02-20 18:40:10,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {74357#true} assume !(0 == main_~init__r232~0#1 % 256); {74357#true} is VALID [2022-02-20 18:40:10,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {74357#true} assume !(0 == main_~init__r312~0#1 % 256); {74357#true} is VALID [2022-02-20 18:40:10,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {74357#true} assume !(0 == main_~init__r322~0#1 % 256); {74357#true} is VALID [2022-02-20 18:40:10,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {74357#true} assume ~max1~0 == ~id1~0; {74357#true} is VALID [2022-02-20 18:40:10,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {74357#true} assume ~max2~0 == ~id2~0; {74357#true} is VALID [2022-02-20 18:40:10,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {74357#true} assume ~max3~0 == ~id3~0; {74357#true} is VALID [2022-02-20 18:40:10,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {74357#true} assume 0 == ~st1~0; {74357#true} is VALID [2022-02-20 18:40:10,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {74357#true} assume 0 == ~st2~0; {74357#true} is VALID [2022-02-20 18:40:10,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {74357#true} assume 0 == ~st3~0; {74357#true} is VALID [2022-02-20 18:40:10,087 INFO L290 TraceCheckUtils]: 35: Hoare triple {74357#true} assume 0 == ~nl1~0; {74357#true} is VALID [2022-02-20 18:40:10,087 INFO L290 TraceCheckUtils]: 36: Hoare triple {74357#true} assume 0 == ~nl2~0; {74357#true} is VALID [2022-02-20 18:40:10,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {74357#true} assume 0 == ~nl3~0; {74357#true} is VALID [2022-02-20 18:40:10,087 INFO L290 TraceCheckUtils]: 38: Hoare triple {74357#true} assume 0 == ~mode1~0 % 256; {74357#true} is VALID [2022-02-20 18:40:10,087 INFO L290 TraceCheckUtils]: 39: Hoare triple {74357#true} assume 0 == ~mode2~0 % 256; {74357#true} is VALID [2022-02-20 18:40:10,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {74357#true} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1767~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1767~0; {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:40:10,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {74359#(= (+ (* (- 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; {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:40:10,089 INFO L290 TraceCheckUtils]: 42: Hoare triple {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:40:10,089 INFO L290 TraceCheckUtils]: 43: Hoare triple {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 % 256 < 1; {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:40:10,090 INFO L290 TraceCheckUtils]: 44: Hoare triple {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep12~0 % 256); {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:40:10,090 INFO L290 TraceCheckUtils]: 45: Hoare triple {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep13~0 % 256); {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:40:10,091 INFO L290 TraceCheckUtils]: 46: Hoare triple {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:40:10,091 INFO L290 TraceCheckUtils]: 47: Hoare triple {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:40:10,091 INFO L290 TraceCheckUtils]: 48: Hoare triple {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 % 256 < 2; {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:40:10,092 INFO L290 TraceCheckUtils]: 49: Hoare triple {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep21~0 % 256); {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:40:10,092 INFO L290 TraceCheckUtils]: 50: Hoare triple {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep23~0 % 256); {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:40:10,093 INFO L290 TraceCheckUtils]: 51: Hoare triple {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:40:10,093 INFO L290 TraceCheckUtils]: 52: Hoare triple {74359#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256); {74358#false} is VALID [2022-02-20 18:40:10,093 INFO L290 TraceCheckUtils]: 53: Hoare triple {74358#false} assume !(255 == ~r3~0 % 256); {74358#false} is VALID [2022-02-20 18:40:10,093 INFO L290 TraceCheckUtils]: 54: Hoare triple {74358#false} ~r3~0 := 1 + ~r3~0 % 256; {74358#false} is VALID [2022-02-20 18:40:10,094 INFO L290 TraceCheckUtils]: 55: Hoare triple {74358#false} assume !!(0 == ~ep13~0 % 256); {74358#false} is VALID [2022-02-20 18:40:10,094 INFO L290 TraceCheckUtils]: 56: Hoare triple {74358#false} assume !!(0 == ~ep23~0 % 256); {74358#false} is VALID [2022-02-20 18:40:10,094 INFO L290 TraceCheckUtils]: 57: Hoare triple {74358#false} assume 2 == ~r3~0 % 256; {74358#false} is VALID [2022-02-20 18:40:10,094 INFO L290 TraceCheckUtils]: 58: Hoare triple {74358#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {74358#false} is VALID [2022-02-20 18:40:10,094 INFO L290 TraceCheckUtils]: 59: Hoare triple {74358#false} ~mode3~0 := 0; {74358#false} is VALID [2022-02-20 18:40:10,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {74358#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; {74358#false} is VALID [2022-02-20 18:40:10,095 INFO L290 TraceCheckUtils]: 61: Hoare triple {74358#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {74358#false} is VALID [2022-02-20 18:40:10,095 INFO L290 TraceCheckUtils]: 62: Hoare triple {74358#false} ~__return_1898~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1898~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; {74358#false} is VALID [2022-02-20 18:40:10,095 INFO L290 TraceCheckUtils]: 63: Hoare triple {74358#false} assume 0 == main_~assert__arg~0#1 % 256; {74358#false} is VALID [2022-02-20 18:40:10,095 INFO L290 TraceCheckUtils]: 64: Hoare triple {74358#false} assume !false; {74358#false} is VALID [2022-02-20 18:40:10,095 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:40:10,096 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:40:10,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727057870] [2022-02-20 18:40:10,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727057870] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:40:10,096 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:40:10,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:40:10,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650745384] [2022-02-20 18:40:10,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:40:10,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:40:10,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:40:10,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:40:10,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:40:10,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:40:10,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:40:10,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:40:10,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:40:10,144 INFO L87 Difference]: Start difference. First operand 4225 states and 6789 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:40:19,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:40:19,237 INFO L93 Difference]: Finished difference Result 8209 states and 13267 transitions. [2022-02-20 18:40:19,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:40:19,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:40:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:40:19,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:40:19,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2022-02-20 18:40:19,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:40:19,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2022-02-20 18:40:19,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 457 transitions. [2022-02-20 18:40:19,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:40:21,075 INFO L225 Difference]: With dead ends: 8209 [2022-02-20 18:40:21,075 INFO L226 Difference]: Without dead ends: 5821 [2022-02-20 18:40:21,078 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:40:21,079 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 112 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 446 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:40:21,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 446 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:40:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5821 states.