./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.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.1.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 291c2115713bbaa0f9f6deebfd096e226de91dfa7091a11105c0815d1cda6526 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:38:07,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:38:07,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:38:07,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:38:07,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:38:07,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:38:07,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:38:07,519 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:38:07,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:38:07,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:38:07,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:38:07,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:38:07,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:38:07,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:38:07,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:38:07,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:38:07,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:38:07,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:38:07,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:38:07,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:38:07,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:38:07,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:38:07,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:38:07,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:38:07,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:38:07,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:38:07,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:38:07,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:38:07,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:38:07,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:38:07,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:38:07,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:38:07,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:38:07,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:38:07,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:38:07,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:38:07,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:38:07,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:38:07,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:38:07,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:38:07,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:38:07,562 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:38:07,591 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:38:07,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:38:07,597 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:38:07,597 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:38:07,598 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:38:07,598 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:38:07,598 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:38:07,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:38:07,599 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:38:07,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:38:07,600 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:38:07,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:38:07,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:38:07,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:38:07,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:38:07,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:38:07,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:38:07,601 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:38:07,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:38:07,601 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:38:07,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:38:07,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:38:07,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:38:07,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:38:07,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:38:07,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:38:07,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:38:07,602 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:38:07,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:38:07,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:38:07,603 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:38:07,603 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:38:07,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:38:07,603 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 -> 291c2115713bbaa0f9f6deebfd096e226de91dfa7091a11105c0815d1cda6526 [2022-02-20 18:38:07,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:38:07,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:38:07,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:38:07,836 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:38:07,837 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:38:07,838 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:38:07,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ce5ed42c/384690a3e9cd4a6196a30640fd7d0f04/FLAG227e96be4 [2022-02-20 18:38:08,298 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:38:08,315 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:38:08,333 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ce5ed42c/384690a3e9cd4a6196a30640fd7d0f04/FLAG227e96be4 [2022-02-20 18:38:08,345 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ce5ed42c/384690a3e9cd4a6196a30640fd7d0f04 [2022-02-20 18:38:08,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:38:08,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:38:08,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:38:08,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:38:08,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:38:08,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:38:08" (1/1) ... [2022-02-20 18:38:08,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@109d814d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:08, skipping insertion in model container [2022-02-20 18:38:08,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:38:08" (1/1) ... [2022-02-20 18:38:08,363 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:38:08,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:38:08,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7181,7194] [2022-02-20 18:38:08,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:38:08,603 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:38:08,649 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7181,7194] [2022-02-20 18:38:08,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:38:08,675 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:38:08,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:08 WrapperNode [2022-02-20 18:38:08,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:38:08,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:38:08,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:38:08,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:38:08,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:08" (1/1) ... [2022-02-20 18:38:08,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:08" (1/1) ... [2022-02-20 18:38:08,755 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 572 [2022-02-20 18:38:08,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:38:08,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:38:08,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:38:08,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:38:08,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:08" (1/1) ... [2022-02-20 18:38:08,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:08" (1/1) ... [2022-02-20 18:38:08,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:08" (1/1) ... [2022-02-20 18:38:08,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:08" (1/1) ... [2022-02-20 18:38:08,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:08" (1/1) ... [2022-02-20 18:38:08,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:08" (1/1) ... [2022-02-20 18:38:08,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:08" (1/1) ... [2022-02-20 18:38:08,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:38:08,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:38:08,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:38:08,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:38:08,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:08" (1/1) ... [2022-02-20 18:38:08,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:38:08,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:38:08,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:38:08,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:38:08,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:38:08,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:38:08,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:38:08,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:38:08,935 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:38:08,937 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:38:09,351 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:38:09,356 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:38:09,357 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:38:09,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:38:09 BoogieIcfgContainer [2022-02-20 18:38:09,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:38:09,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:38:09,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:38:09,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:38:09,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:38:08" (1/3) ... [2022-02-20 18:38:09,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790ed44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:38:09, skipping insertion in model container [2022-02-20 18:38:09,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:08" (2/3) ... [2022-02-20 18:38:09,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790ed44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:38:09, skipping insertion in model container [2022-02-20 18:38:09,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:38:09" (3/3) ... [2022-02-20 18:38:09,364 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:38:09,368 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:38:09,368 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:38:09,399 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:38:09,403 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:38:09,404 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:38:09,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 132 states have (on average 1.75) internal successors, (231), 133 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:38:09,425 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:09,425 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] [2022-02-20 18:38:09,425 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:09,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:09,430 INFO L85 PathProgramCache]: Analyzing trace with hash -278043806, now seen corresponding path program 1 times [2022-02-20 18:38:09,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:09,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036091278] [2022-02-20 18:38:09,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:09,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:09,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {137#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_1766~0 := 0;~__return_1897~0 := 0; {137#true} is VALID [2022-02-20 18:38:09,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {137#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; {137#true} is VALID [2022-02-20 18:38:09,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {137#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {137#true} is VALID [2022-02-20 18:38:09,696 INFO L290 TraceCheckUtils]: 3: Hoare triple {137#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {137#true} is VALID [2022-02-20 18:38:09,700 INFO L290 TraceCheckUtils]: 4: Hoare triple {137#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {137#true} is VALID [2022-02-20 18:38:09,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {137#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {137#true} is VALID [2022-02-20 18:38:09,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {137#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {137#true} is VALID [2022-02-20 18:38:09,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {137#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {137#true} is VALID [2022-02-20 18:38:09,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {137#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {137#true} is VALID [2022-02-20 18:38:09,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {137#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {137#true} is VALID [2022-02-20 18:38:09,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {137#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {137#true} is VALID [2022-02-20 18:38:09,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {137#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {137#true} is VALID [2022-02-20 18:38:09,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {137#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {137#true} is VALID [2022-02-20 18:38:09,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {137#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {137#true} is VALID [2022-02-20 18:38:09,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {137#true} assume ~id1~0 != ~id2~0; {137#true} is VALID [2022-02-20 18:38:09,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {137#true} assume ~id1~0 != ~id3~0; {137#true} is VALID [2022-02-20 18:38:09,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {137#true} assume ~id2~0 != ~id3~0; {137#true} is VALID [2022-02-20 18:38:09,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {137#true} assume ~id1~0 >= 0; {137#true} is VALID [2022-02-20 18:38:09,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {137#true} assume ~id2~0 >= 0; {137#true} is VALID [2022-02-20 18:38:09,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {137#true} assume ~id3~0 >= 0; {137#true} is VALID [2022-02-20 18:38:09,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {137#true} assume 0 == ~r1~0 % 256; {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:38:09,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r2~0 % 256; {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:38:09,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r3~0 % 256; {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:38:09,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max1~0 == ~id1~0; {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:38:09,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max2~0 == ~id2~0; {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:38:09,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max3~0 == ~id3~0; {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:38:09,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:38:09,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:38:09,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:38:09,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl1~0; {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:38:09,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl2~0; {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:38:09,712 INFO L290 TraceCheckUtils]: 31: Hoare triple {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl3~0; {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:38:09,712 INFO L290 TraceCheckUtils]: 32: Hoare triple {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:38:09,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:38:09,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1766~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1766~0; {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:38:09,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {139#(<= ~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; {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:38:09,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode1~0 % 256); {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:38:09,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {139#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 2); {138#false} is VALID [2022-02-20 18:38:09,716 INFO L290 TraceCheckUtils]: 38: Hoare triple {138#false} ~mode1~0 := 1; {138#false} is VALID [2022-02-20 18:38:09,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {138#false} assume !!(0 == ~mode2~0 % 256); {138#false} is VALID [2022-02-20 18:38:09,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {138#false} assume !(~r2~0 % 256 < 2); {138#false} is VALID [2022-02-20 18:38:09,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {138#false} ~mode2~0 := 1; {138#false} is VALID [2022-02-20 18:38:09,716 INFO L290 TraceCheckUtils]: 42: Hoare triple {138#false} assume !!(0 == ~mode3~0 % 256); {138#false} is VALID [2022-02-20 18:38:09,716 INFO L290 TraceCheckUtils]: 43: Hoare triple {138#false} assume !(~r3~0 % 256 < 2); {138#false} is VALID [2022-02-20 18:38:09,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {138#false} ~mode3~0 := 1; {138#false} is VALID [2022-02-20 18:38:09,717 INFO L290 TraceCheckUtils]: 45: Hoare triple {138#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; {138#false} is VALID [2022-02-20 18:38:09,717 INFO L290 TraceCheckUtils]: 46: Hoare triple {138#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {138#false} is VALID [2022-02-20 18:38:09,718 INFO L290 TraceCheckUtils]: 47: Hoare triple {138#false} ~__return_1897~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1897~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; {138#false} is VALID [2022-02-20 18:38:09,718 INFO L290 TraceCheckUtils]: 48: Hoare triple {138#false} assume 0 == main_~assert__arg~0#1 % 256; {138#false} is VALID [2022-02-20 18:38:09,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {138#false} assume !false; {138#false} is VALID [2022-02-20 18:38:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:38:09,721 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:09,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036091278] [2022-02-20 18:38:09,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036091278] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:09,722 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:09,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:09,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204895363] [2022-02-20 18:38:09,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:09,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-02-20 18:38:09,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:09,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:09,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:09,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:09,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:09,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:09,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:09,809 INFO L87 Difference]: Start difference. First operand has 134 states, 132 states have (on average 1.75) internal successors, (231), 133 states have internal predecessors, (231), 0 states have call successors, (0), 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 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:10,183 INFO L93 Difference]: Finished difference Result 297 states and 500 transitions. [2022-02-20 18:38:10,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:10,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-02-20 18:38:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:10,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-02-20 18:38:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-02-20 18:38:10,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 500 transitions. [2022-02-20 18:38:10,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 500 edges. 500 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:10,555 INFO L225 Difference]: With dead ends: 297 [2022-02-20 18:38:10,556 INFO L226 Difference]: Without dead ends: 205 [2022-02-20 18:38:10,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:10,563 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 132 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:10,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 406 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:10,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-02-20 18:38:10,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2022-02-20 18:38:10,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:10,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 202 states, 201 states have (on average 1.5970149253731343) internal successors, (321), 201 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:10,628 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 202 states, 201 states have (on average 1.5970149253731343) internal successors, (321), 201 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:10,629 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 202 states, 201 states have (on average 1.5970149253731343) internal successors, (321), 201 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:10,635 INFO L93 Difference]: Finished difference Result 205 states and 323 transitions. [2022-02-20 18:38:10,636 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 323 transitions. [2022-02-20 18:38:10,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:10,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:10,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 202 states, 201 states have (on average 1.5970149253731343) internal successors, (321), 201 states have internal predecessors, (321), 0 states have call successors, (0), 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 205 states. [2022-02-20 18:38:10,638 INFO L87 Difference]: Start difference. First operand has 202 states, 201 states have (on average 1.5970149253731343) internal successors, (321), 201 states have internal predecessors, (321), 0 states have call successors, (0), 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 205 states. [2022-02-20 18:38:10,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:10,644 INFO L93 Difference]: Finished difference Result 205 states and 323 transitions. [2022-02-20 18:38:10,644 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 323 transitions. [2022-02-20 18:38:10,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:10,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:10,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:10,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.5970149253731343) internal successors, (321), 201 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 321 transitions. [2022-02-20 18:38:10,653 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 321 transitions. Word has length 50 [2022-02-20 18:38:10,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:10,653 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 321 transitions. [2022-02-20 18:38:10,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:10,653 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 321 transitions. [2022-02-20 18:38:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:38:10,655 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:10,655 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] [2022-02-20 18:38:10,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:38:10,659 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:10,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:10,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1333847823, now seen corresponding path program 1 times [2022-02-20 18:38:10,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:10,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454378087] [2022-02-20 18:38:10,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:10,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:10,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {1249#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_1766~0 := 0;~__return_1897~0 := 0; {1249#true} is VALID [2022-02-20 18:38:10,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {1249#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; {1249#true} is VALID [2022-02-20 18:38:10,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {1249#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {1249#true} is VALID [2022-02-20 18:38:10,742 INFO L290 TraceCheckUtils]: 3: Hoare triple {1249#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {1249#true} is VALID [2022-02-20 18:38:10,742 INFO L290 TraceCheckUtils]: 4: Hoare triple {1249#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {1249#true} is VALID [2022-02-20 18:38:10,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {1249#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {1249#true} is VALID [2022-02-20 18:38:10,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {1249#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {1249#true} is VALID [2022-02-20 18:38:10,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {1249#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {1249#true} is VALID [2022-02-20 18:38:10,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {1249#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {1249#true} is VALID [2022-02-20 18:38:10,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {1249#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {1249#true} is VALID [2022-02-20 18:38:10,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {1249#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {1249#true} is VALID [2022-02-20 18:38:10,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {1249#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {1249#true} is VALID [2022-02-20 18:38:10,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {1249#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {1249#true} is VALID [2022-02-20 18:38:10,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {1249#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {1249#true} is VALID [2022-02-20 18:38:10,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {1249#true} assume ~id1~0 != ~id2~0; {1249#true} is VALID [2022-02-20 18:38:10,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {1249#true} assume ~id1~0 != ~id3~0; {1249#true} is VALID [2022-02-20 18:38:10,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {1249#true} assume ~id2~0 != ~id3~0; {1249#true} is VALID [2022-02-20 18:38:10,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {1249#true} assume ~id1~0 >= 0; {1249#true} is VALID [2022-02-20 18:38:10,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {1249#true} assume ~id2~0 >= 0; {1249#true} is VALID [2022-02-20 18:38:10,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {1249#true} assume ~id3~0 >= 0; {1249#true} is VALID [2022-02-20 18:38:10,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {1249#true} assume 0 == ~r1~0 % 256; {1249#true} is VALID [2022-02-20 18:38:10,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {1249#true} assume 0 == ~r2~0 % 256; {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~r3~0 % 256; {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max1~0 == ~id1~0; {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max2~0 == ~id2~0; {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max3~0 == ~id3~0; {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st1~0; {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st2~0; {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st3~0; {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl1~0; {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl2~0; {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl3~0; {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode1~0 % 256; {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode2~0 % 256; {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1766~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1766~0; {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {1251#(<= ~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; {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,751 INFO L290 TraceCheckUtils]: 36: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~mode1~0 % 256); {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,751 INFO L290 TraceCheckUtils]: 37: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~r1~0 % 256 < 2; {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,752 INFO L290 TraceCheckUtils]: 38: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~ep12~0 % 256); {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,752 INFO L290 TraceCheckUtils]: 39: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~ep13~0 % 256); {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,752 INFO L290 TraceCheckUtils]: 40: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} ~mode1~0 := 1; {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,753 INFO L290 TraceCheckUtils]: 41: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~mode2~0 % 256); {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:38:10,753 INFO L290 TraceCheckUtils]: 42: Hoare triple {1251#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(~r2~0 % 256 < 2); {1250#false} is VALID [2022-02-20 18:38:10,753 INFO L290 TraceCheckUtils]: 43: Hoare triple {1250#false} ~mode2~0 := 1; {1250#false} is VALID [2022-02-20 18:38:10,754 INFO L290 TraceCheckUtils]: 44: Hoare triple {1250#false} assume !!(0 == ~mode3~0 % 256); {1250#false} is VALID [2022-02-20 18:38:10,754 INFO L290 TraceCheckUtils]: 45: Hoare triple {1250#false} assume !(~r3~0 % 256 < 2); {1250#false} is VALID [2022-02-20 18:38:10,754 INFO L290 TraceCheckUtils]: 46: Hoare triple {1250#false} ~mode3~0 := 1; {1250#false} is VALID [2022-02-20 18:38:10,754 INFO L290 TraceCheckUtils]: 47: Hoare triple {1250#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; {1250#false} is VALID [2022-02-20 18:38:10,754 INFO L290 TraceCheckUtils]: 48: Hoare triple {1250#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1250#false} is VALID [2022-02-20 18:38:10,755 INFO L290 TraceCheckUtils]: 49: Hoare triple {1250#false} ~__return_1897~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1897~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; {1250#false} is VALID [2022-02-20 18:38:10,755 INFO L290 TraceCheckUtils]: 50: Hoare triple {1250#false} assume 0 == main_~assert__arg~0#1 % 256; {1250#false} is VALID [2022-02-20 18:38:10,755 INFO L290 TraceCheckUtils]: 51: Hoare triple {1250#false} assume !false; {1250#false} is VALID [2022-02-20 18:38:10,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:38:10,756 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:10,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454378087] [2022-02-20 18:38:10,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454378087] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:10,756 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:10,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:10,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941441044] [2022-02-20 18:38:10,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:10,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:38:10,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:10,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:10,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:10,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:10,787 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:10,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:10,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:10,788 INFO L87 Difference]: Start difference. First operand 202 states and 321 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:11,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:11,090 INFO L93 Difference]: Finished difference Result 496 states and 805 transitions. [2022-02-20 18:38:11,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:11,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:38:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:11,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2022-02-20 18:38:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2022-02-20 18:38:11,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 473 transitions. [2022-02-20 18:38:11,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:11,450 INFO L225 Difference]: With dead ends: 496 [2022-02-20 18:38:11,451 INFO L226 Difference]: Without dead ends: 342 [2022-02-20 18:38:11,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:11,453 INFO L933 BasicCegarLoop]: 203 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, 385 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:38:11,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 385 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-02-20 18:38:11,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 338. [2022-02-20 18:38:11,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:11,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 338 states, 337 states have (on average 1.6112759643916914) internal successors, (543), 337 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:11,558 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 338 states, 337 states have (on average 1.6112759643916914) internal successors, (543), 337 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:11,558 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 338 states, 337 states have (on average 1.6112759643916914) internal successors, (543), 337 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:11,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:11,569 INFO L93 Difference]: Finished difference Result 342 states and 546 transitions. [2022-02-20 18:38:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 546 transitions. [2022-02-20 18:38:11,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:11,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:11,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 337 states have (on average 1.6112759643916914) internal successors, (543), 337 states have internal predecessors, (543), 0 states have call successors, (0), 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 342 states. [2022-02-20 18:38:11,572 INFO L87 Difference]: Start difference. First operand has 338 states, 337 states have (on average 1.6112759643916914) internal successors, (543), 337 states have internal predecessors, (543), 0 states have call successors, (0), 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 342 states. [2022-02-20 18:38:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:11,583 INFO L93 Difference]: Finished difference Result 342 states and 546 transitions. [2022-02-20 18:38:11,583 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 546 transitions. [2022-02-20 18:38:11,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:11,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:11,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:11,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 1.6112759643916914) internal successors, (543), 337 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 543 transitions. [2022-02-20 18:38:11,597 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 543 transitions. Word has length 52 [2022-02-20 18:38:11,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:11,598 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 543 transitions. [2022-02-20 18:38:11,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 543 transitions. [2022-02-20 18:38:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:38:11,615 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:11,615 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] [2022-02-20 18:38:11,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:38:11,616 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:11,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:11,616 INFO L85 PathProgramCache]: Analyzing trace with hash 329846722, now seen corresponding path program 1 times [2022-02-20 18:38:11,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:11,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442676089] [2022-02-20 18:38:11,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:11,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:11,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {3130#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_1766~0 := 0;~__return_1897~0 := 0; {3130#true} is VALID [2022-02-20 18:38:11,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {3130#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; {3130#true} is VALID [2022-02-20 18:38:11,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {3130#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {3130#true} is VALID [2022-02-20 18:38:11,718 INFO L290 TraceCheckUtils]: 3: Hoare triple {3130#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {3130#true} is VALID [2022-02-20 18:38:11,718 INFO L290 TraceCheckUtils]: 4: Hoare triple {3130#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {3130#true} is VALID [2022-02-20 18:38:11,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {3130#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {3130#true} is VALID [2022-02-20 18:38:11,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {3130#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {3130#true} is VALID [2022-02-20 18:38:11,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {3130#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {3130#true} is VALID [2022-02-20 18:38:11,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {3130#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {3130#true} is VALID [2022-02-20 18:38:11,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {3130#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {3130#true} is VALID [2022-02-20 18:38:11,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {3130#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {3130#true} is VALID [2022-02-20 18:38:11,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {3130#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {3130#true} is VALID [2022-02-20 18:38:11,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {3130#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {3130#true} is VALID [2022-02-20 18:38:11,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {3130#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {3130#true} is VALID [2022-02-20 18:38:11,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {3130#true} assume ~id1~0 != ~id2~0; {3130#true} is VALID [2022-02-20 18:38:11,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {3130#true} assume ~id1~0 != ~id3~0; {3130#true} is VALID [2022-02-20 18:38:11,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {3130#true} assume ~id2~0 != ~id3~0; {3130#true} is VALID [2022-02-20 18:38:11,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {3130#true} assume ~id1~0 >= 0; {3130#true} is VALID [2022-02-20 18:38:11,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {3130#true} assume ~id2~0 >= 0; {3130#true} is VALID [2022-02-20 18:38:11,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {3130#true} assume ~id3~0 >= 0; {3130#true} is VALID [2022-02-20 18:38:11,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {3130#true} assume 0 == ~r1~0 % 256; {3130#true} is VALID [2022-02-20 18:38:11,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {3130#true} assume 0 == ~r2~0 % 256; {3130#true} is VALID [2022-02-20 18:38:11,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {3130#true} assume 0 == ~r3~0 % 256; {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max1~0 == ~id1~0; {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max2~0 == ~id2~0; {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max3~0 == ~id3~0; {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st1~0; {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st2~0; {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st3~0; {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl1~0; {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl2~0; {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl3~0; {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode1~0 % 256; {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,724 INFO L290 TraceCheckUtils]: 33: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode2~0 % 256; {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1766~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1766~0; {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {3132#(<= ~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; {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~mode1~0 % 256); {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r1~0 % 256 < 2; {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,726 INFO L290 TraceCheckUtils]: 38: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep12~0 % 256); {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep13~0 % 256); {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode1~0 := 1; {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,727 INFO L290 TraceCheckUtils]: 41: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~mode2~0 % 256); {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,727 INFO L290 TraceCheckUtils]: 42: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r2~0 % 256 < 2; {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,727 INFO L290 TraceCheckUtils]: 43: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep21~0 % 256); {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,728 INFO L290 TraceCheckUtils]: 44: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep23~0 % 256); {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,728 INFO L290 TraceCheckUtils]: 45: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode2~0 := 1; {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,728 INFO L290 TraceCheckUtils]: 46: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~mode3~0 % 256); {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:38:11,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {3132#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(~r3~0 % 256 < 2); {3131#false} is VALID [2022-02-20 18:38:11,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {3131#false} ~mode3~0 := 1; {3131#false} is VALID [2022-02-20 18:38:11,729 INFO L290 TraceCheckUtils]: 49: Hoare triple {3131#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; {3131#false} is VALID [2022-02-20 18:38:11,729 INFO L290 TraceCheckUtils]: 50: Hoare triple {3131#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {3131#false} is VALID [2022-02-20 18:38:11,729 INFO L290 TraceCheckUtils]: 51: Hoare triple {3131#false} ~__return_1897~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1897~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; {3131#false} is VALID [2022-02-20 18:38:11,729 INFO L290 TraceCheckUtils]: 52: Hoare triple {3131#false} assume 0 == main_~assert__arg~0#1 % 256; {3131#false} is VALID [2022-02-20 18:38:11,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {3131#false} assume !false; {3131#false} is VALID [2022-02-20 18:38:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:38:11,730 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:11,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442676089] [2022-02-20 18:38:11,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442676089] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:11,730 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:11,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:11,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520322554] [2022-02-20 18:38:11,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:11,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 18:38:11,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:11,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:11,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:11,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:11,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:11,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:11,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:11,767 INFO L87 Difference]: Start difference. First operand 338 states and 543 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:12,209 INFO L93 Difference]: Finished difference Result 890 states and 1445 transitions. [2022-02-20 18:38:12,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:12,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 18:38:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2022-02-20 18:38:12,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2022-02-20 18:38:12,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 473 transitions. [2022-02-20 18:38:12,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:12,495 INFO L225 Difference]: With dead ends: 890 [2022-02-20 18:38:12,496 INFO L226 Difference]: Without dead ends: 600 [2022-02-20 18:38:12,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:12,497 INFO L933 BasicCegarLoop]: 203 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, 386 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:38:12,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 386 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:12,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-02-20 18:38:12,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 594. [2022-02-20 18:38:12,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:12,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 600 states. Second operand has 594 states, 593 states have (on average 1.6104553119730185) internal successors, (955), 593 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:12,662 INFO L74 IsIncluded]: Start isIncluded. First operand 600 states. Second operand has 594 states, 593 states have (on average 1.6104553119730185) internal successors, (955), 593 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:12,663 INFO L87 Difference]: Start difference. First operand 600 states. Second operand has 594 states, 593 states have (on average 1.6104553119730185) internal successors, (955), 593 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:12,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:12,678 INFO L93 Difference]: Finished difference Result 600 states and 960 transitions. [2022-02-20 18:38:12,678 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 960 transitions. [2022-02-20 18:38:12,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:12,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:12,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 594 states, 593 states have (on average 1.6104553119730185) internal successors, (955), 593 states have internal predecessors, (955), 0 states have call successors, (0), 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 600 states. [2022-02-20 18:38:12,681 INFO L87 Difference]: Start difference. First operand has 594 states, 593 states have (on average 1.6104553119730185) internal successors, (955), 593 states have internal predecessors, (955), 0 states have call successors, (0), 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 600 states. [2022-02-20 18:38:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:12,697 INFO L93 Difference]: Finished difference Result 600 states and 960 transitions. [2022-02-20 18:38:12,697 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 960 transitions. [2022-02-20 18:38:12,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:12,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:12,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:12,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 1.6104553119730185) internal successors, (955), 593 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 955 transitions. [2022-02-20 18:38:12,727 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 955 transitions. Word has length 54 [2022-02-20 18:38:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:12,727 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 955 transitions. [2022-02-20 18:38:12,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:12,728 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 955 transitions. [2022-02-20 18:38:12,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:38:12,729 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:12,729 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:38:12,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:38:12,729 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:12,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:12,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1296814383, now seen corresponding path program 1 times [2022-02-20 18:38:12,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:12,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361993274] [2022-02-20 18:38:12,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:12,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:12,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {6483#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_1766~0 := 0;~__return_1897~0 := 0; {6483#true} is VALID [2022-02-20 18:38:12,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {6483#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; {6483#true} is VALID [2022-02-20 18:38:12,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {6483#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {6483#true} is VALID [2022-02-20 18:38:12,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {6483#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {6483#true} is VALID [2022-02-20 18:38:12,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {6483#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {6483#true} is VALID [2022-02-20 18:38:12,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {6483#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {6483#true} is VALID [2022-02-20 18:38:12,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {6483#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {6483#true} is VALID [2022-02-20 18:38:12,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {6483#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {6483#true} is VALID [2022-02-20 18:38:12,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {6483#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {6483#true} is VALID [2022-02-20 18:38:12,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {6483#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {6483#true} is VALID [2022-02-20 18:38:12,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {6483#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {6483#true} is VALID [2022-02-20 18:38:12,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {6483#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {6483#true} is VALID [2022-02-20 18:38:12,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {6483#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {6483#true} is VALID [2022-02-20 18:38:12,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {6483#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {6483#true} is VALID [2022-02-20 18:38:12,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {6483#true} assume ~id1~0 != ~id2~0; {6483#true} is VALID [2022-02-20 18:38:12,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {6483#true} assume ~id1~0 != ~id3~0; {6483#true} is VALID [2022-02-20 18:38:12,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {6483#true} assume ~id2~0 != ~id3~0; {6483#true} is VALID [2022-02-20 18:38:12,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {6483#true} assume ~id1~0 >= 0; {6483#true} is VALID [2022-02-20 18:38:12,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {6483#true} assume ~id2~0 >= 0; {6483#true} is VALID [2022-02-20 18:38:12,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {6483#true} assume ~id3~0 >= 0; {6483#true} is VALID [2022-02-20 18:38:12,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {6483#true} assume 0 == ~r1~0 % 256; {6483#true} is VALID [2022-02-20 18:38:12,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {6483#true} assume 0 == ~r2~0 % 256; {6483#true} is VALID [2022-02-20 18:38:12,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {6483#true} assume 0 == ~r3~0 % 256; {6483#true} is VALID [2022-02-20 18:38:12,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {6483#true} assume ~max1~0 == ~id1~0; {6483#true} is VALID [2022-02-20 18:38:12,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {6483#true} assume ~max2~0 == ~id2~0; {6483#true} is VALID [2022-02-20 18:38:12,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {6483#true} assume ~max3~0 == ~id3~0; {6483#true} is VALID [2022-02-20 18:38:12,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {6483#true} assume 0 == ~st1~0; {6485#(<= ~st1~0 0)} is VALID [2022-02-20 18:38:12,803 INFO L290 TraceCheckUtils]: 27: Hoare triple {6485#(<= ~st1~0 0)} assume 0 == ~st2~0; {6486#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {6486#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1766~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1766~0; {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {6487#(<= (+ ~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; {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,806 INFO L290 TraceCheckUtils]: 36: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,807 INFO L290 TraceCheckUtils]: 37: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,807 INFO L290 TraceCheckUtils]: 38: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,810 INFO L290 TraceCheckUtils]: 41: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,811 INFO L290 TraceCheckUtils]: 43: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,811 INFO L290 TraceCheckUtils]: 44: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,812 INFO L290 TraceCheckUtils]: 45: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,812 INFO L290 TraceCheckUtils]: 46: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,812 INFO L290 TraceCheckUtils]: 47: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,813 INFO L290 TraceCheckUtils]: 48: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,813 INFO L290 TraceCheckUtils]: 49: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,813 INFO L290 TraceCheckUtils]: 50: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,816 INFO L290 TraceCheckUtils]: 51: Hoare triple {6487#(<= (+ ~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; {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:12,817 INFO L290 TraceCheckUtils]: 52: Hoare triple {6487#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {6484#false} is VALID [2022-02-20 18:38:12,817 INFO L290 TraceCheckUtils]: 53: Hoare triple {6484#false} ~__return_1897~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1897~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; {6484#false} is VALID [2022-02-20 18:38:12,817 INFO L290 TraceCheckUtils]: 54: Hoare triple {6484#false} assume 0 == main_~assert__arg~0#1 % 256; {6484#false} is VALID [2022-02-20 18:38:12,818 INFO L290 TraceCheckUtils]: 55: Hoare triple {6484#false} assume !false; {6484#false} is VALID [2022-02-20 18:38:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:38:12,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:12,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361993274] [2022-02-20 18:38:12,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361993274] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:12,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:12,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:38:12,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019680521] [2022-02-20 18:38:12,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:12,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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:38:12,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:12,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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:38:12,852 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:38:12,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:38:12,853 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:12,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:38:12,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:38:12,854 INFO L87 Difference]: Start difference. First operand 594 states and 955 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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:38:15,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:15,254 INFO L93 Difference]: Finished difference Result 2582 states and 4241 transitions. [2022-02-20 18:38:15,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:38:15,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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:38:15,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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:38:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1046 transitions. [2022-02-20 18:38:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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:38:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1046 transitions. [2022-02-20 18:38:15,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1046 transitions. [2022-02-20 18:38:15,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1046 edges. 1046 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:16,096 INFO L225 Difference]: With dead ends: 2582 [2022-02-20 18:38:16,096 INFO L226 Difference]: Without dead ends: 2036 [2022-02-20 18:38:16,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:38:16,105 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 851 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1294 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:38:16,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [851 Valid, 1294 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:38:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2022-02-20 18:38:16,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1071. [2022-02-20 18:38:16,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:16,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2036 states. Second operand has 1071 states, 1070 states have (on average 1.6196261682242992) internal successors, (1733), 1070 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:16,874 INFO L74 IsIncluded]: Start isIncluded. First operand 2036 states. Second operand has 1071 states, 1070 states have (on average 1.6196261682242992) internal successors, (1733), 1070 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:16,876 INFO L87 Difference]: Start difference. First operand 2036 states. Second operand has 1071 states, 1070 states have (on average 1.6196261682242992) internal successors, (1733), 1070 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:17,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:17,009 INFO L93 Difference]: Finished difference Result 2036 states and 3326 transitions. [2022-02-20 18:38:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 3326 transitions. [2022-02-20 18:38:17,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:17,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:17,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 1071 states, 1070 states have (on average 1.6196261682242992) internal successors, (1733), 1070 states have internal predecessors, (1733), 0 states have call successors, (0), 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 2036 states. [2022-02-20 18:38:17,016 INFO L87 Difference]: Start difference. First operand has 1071 states, 1070 states have (on average 1.6196261682242992) internal successors, (1733), 1070 states have internal predecessors, (1733), 0 states have call successors, (0), 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 2036 states. [2022-02-20 18:38:17,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:17,161 INFO L93 Difference]: Finished difference Result 2036 states and 3326 transitions. [2022-02-20 18:38:17,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 3326 transitions. [2022-02-20 18:38:17,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:17,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:17,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:17,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.6196261682242992) internal successors, (1733), 1070 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1733 transitions. [2022-02-20 18:38:17,226 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1733 transitions. Word has length 56 [2022-02-20 18:38:17,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:17,226 INFO L470 AbstractCegarLoop]: Abstraction has 1071 states and 1733 transitions. [2022-02-20 18:38:17,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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:38:17,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1733 transitions. [2022-02-20 18:38:17,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:38:17,228 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:17,228 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:38:17,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:38:17,229 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:17,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:17,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1484036003, now seen corresponding path program 1 times [2022-02-20 18:38:17,230 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:17,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341068551] [2022-02-20 18:38:17,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:17,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:17,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {15891#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_1766~0 := 0;~__return_1897~0 := 0; {15891#true} is VALID [2022-02-20 18:38:17,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {15891#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; {15891#true} is VALID [2022-02-20 18:38:17,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {15891#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {15891#true} is VALID [2022-02-20 18:38:17,309 INFO L290 TraceCheckUtils]: 3: Hoare triple {15891#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {15891#true} is VALID [2022-02-20 18:38:17,309 INFO L290 TraceCheckUtils]: 4: Hoare triple {15891#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {15891#true} is VALID [2022-02-20 18:38:17,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {15891#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {15891#true} is VALID [2022-02-20 18:38:17,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {15891#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {15891#true} is VALID [2022-02-20 18:38:17,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {15891#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {15891#true} is VALID [2022-02-20 18:38:17,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {15891#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {15891#true} is VALID [2022-02-20 18:38:17,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {15891#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {15891#true} is VALID [2022-02-20 18:38:17,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {15891#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {15891#true} is VALID [2022-02-20 18:38:17,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {15891#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {15891#true} is VALID [2022-02-20 18:38:17,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {15891#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {15891#true} is VALID [2022-02-20 18:38:17,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {15891#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {15891#true} is VALID [2022-02-20 18:38:17,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {15891#true} assume ~id1~0 != ~id2~0; {15891#true} is VALID [2022-02-20 18:38:17,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {15891#true} assume ~id1~0 != ~id3~0; {15891#true} is VALID [2022-02-20 18:38:17,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {15891#true} assume ~id2~0 != ~id3~0; {15891#true} is VALID [2022-02-20 18:38:17,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {15891#true} assume ~id1~0 >= 0; {15891#true} is VALID [2022-02-20 18:38:17,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {15891#true} assume ~id2~0 >= 0; {15891#true} is VALID [2022-02-20 18:38:17,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {15891#true} assume ~id3~0 >= 0; {15891#true} is VALID [2022-02-20 18:38:17,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {15891#true} assume 0 == ~r1~0 % 256; {15891#true} is VALID [2022-02-20 18:38:17,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {15891#true} assume 0 == ~r2~0 % 256; {15891#true} is VALID [2022-02-20 18:38:17,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {15891#true} assume 0 == ~r3~0 % 256; {15891#true} is VALID [2022-02-20 18:38:17,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {15891#true} assume ~max1~0 == ~id1~0; {15891#true} is VALID [2022-02-20 18:38:17,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {15891#true} assume ~max2~0 == ~id2~0; {15891#true} is VALID [2022-02-20 18:38:17,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {15891#true} assume ~max3~0 == ~id3~0; {15891#true} is VALID [2022-02-20 18:38:17,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {15891#true} assume 0 == ~st1~0; {15893#(<= ~st1~0 0)} is VALID [2022-02-20 18:38:17,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {15893#(<= ~st1~0 0)} assume 0 == ~st2~0; {15893#(<= ~st1~0 0)} is VALID [2022-02-20 18:38:17,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {15893#(<= ~st1~0 0)} assume 0 == ~st3~0; {15893#(<= ~st1~0 0)} is VALID [2022-02-20 18:38:17,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {15893#(<= ~st1~0 0)} assume 0 == ~nl1~0; {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,318 INFO L290 TraceCheckUtils]: 32: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1766~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1766~0; {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {15894#(<= (+ ~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; {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,323 INFO L290 TraceCheckUtils]: 36: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,323 INFO L290 TraceCheckUtils]: 37: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,324 INFO L290 TraceCheckUtils]: 39: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,325 INFO L290 TraceCheckUtils]: 40: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,325 INFO L290 TraceCheckUtils]: 41: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,325 INFO L290 TraceCheckUtils]: 42: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,328 INFO L290 TraceCheckUtils]: 43: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,328 INFO L290 TraceCheckUtils]: 44: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,329 INFO L290 TraceCheckUtils]: 47: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,329 INFO L290 TraceCheckUtils]: 48: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,329 INFO L290 TraceCheckUtils]: 49: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,330 INFO L290 TraceCheckUtils]: 50: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,330 INFO L290 TraceCheckUtils]: 51: Hoare triple {15894#(<= (+ ~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; {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,330 INFO L290 TraceCheckUtils]: 52: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15894#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:17,331 INFO L290 TraceCheckUtils]: 53: Hoare triple {15894#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);main_~check__tmp~0#1 := 0; {15892#false} is VALID [2022-02-20 18:38:17,331 INFO L290 TraceCheckUtils]: 54: Hoare triple {15892#false} ~__return_1897~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1897~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; {15892#false} is VALID [2022-02-20 18:38:17,331 INFO L290 TraceCheckUtils]: 55: Hoare triple {15892#false} assume 0 == main_~assert__arg~0#1 % 256; {15892#false} is VALID [2022-02-20 18:38:17,332 INFO L290 TraceCheckUtils]: 56: Hoare triple {15892#false} assume !false; {15892#false} is VALID [2022-02-20 18:38:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:38:17,335 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:17,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341068551] [2022-02-20 18:38:17,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341068551] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:17,335 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:17,335 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:38:17,336 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742276626] [2022-02-20 18:38:17,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:17,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-20 18:38:17,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:17,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:17,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:17,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:38:17,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:17,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:38:17,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:38:17,367 INFO L87 Difference]: Start difference. First operand 1071 states and 1733 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:19,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:19,688 INFO L93 Difference]: Finished difference Result 3136 states and 5140 transitions. [2022-02-20 18:38:19,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:38:19,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-20 18:38:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:19,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 626 transitions. [2022-02-20 18:38:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 626 transitions. [2022-02-20 18:38:19,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 626 transitions. [2022-02-20 18:38:20,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 626 edges. 626 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:20,236 INFO L225 Difference]: With dead ends: 3136 [2022-02-20 18:38:20,236 INFO L226 Difference]: Without dead ends: 2113 [2022-02-20 18:38:20,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:38:20,238 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 404 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:20,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 606 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:20,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2022-02-20 18:38:21,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 1583. [2022-02-20 18:38:21,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:21,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2113 states. Second operand has 1583 states, 1582 states have (on average 1.6270543615676358) internal successors, (2574), 1582 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:21,497 INFO L74 IsIncluded]: Start isIncluded. First operand 2113 states. Second operand has 1583 states, 1582 states have (on average 1.6270543615676358) internal successors, (2574), 1582 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:21,500 INFO L87 Difference]: Start difference. First operand 2113 states. Second operand has 1583 states, 1582 states have (on average 1.6270543615676358) internal successors, (2574), 1582 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:21,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:21,639 INFO L93 Difference]: Finished difference Result 2113 states and 3459 transitions. [2022-02-20 18:38:21,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 3459 transitions. [2022-02-20 18:38:21,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:21,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:21,645 INFO L74 IsIncluded]: Start isIncluded. First operand has 1583 states, 1582 states have (on average 1.6270543615676358) internal successors, (2574), 1582 states have internal predecessors, (2574), 0 states have call successors, (0), 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 2113 states. [2022-02-20 18:38:21,648 INFO L87 Difference]: Start difference. First operand has 1583 states, 1582 states have (on average 1.6270543615676358) internal successors, (2574), 1582 states have internal predecessors, (2574), 0 states have call successors, (0), 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 2113 states. [2022-02-20 18:38:21,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:21,787 INFO L93 Difference]: Finished difference Result 2113 states and 3459 transitions. [2022-02-20 18:38:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 3459 transitions. [2022-02-20 18:38:21,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:21,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:21,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:21,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:21,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1582 states have (on average 1.6270543615676358) internal successors, (2574), 1582 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2574 transitions. [2022-02-20 18:38:21,910 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2574 transitions. Word has length 57 [2022-02-20 18:38:21,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:21,910 INFO L470 AbstractCegarLoop]: Abstraction has 1583 states and 2574 transitions. [2022-02-20 18:38:21,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2574 transitions. [2022-02-20 18:38:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:38:21,912 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:21,912 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:38:21,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:38:21,912 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:21,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:21,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1297470346, now seen corresponding path program 1 times [2022-02-20 18:38:21,913 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:21,913 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176764928] [2022-02-20 18:38:21,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:21,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:21,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {27014#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_1766~0 := 0;~__return_1897~0 := 0; {27014#true} is VALID [2022-02-20 18:38:21,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {27014#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; {27014#true} is VALID [2022-02-20 18:38:21,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {27014#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {27014#true} is VALID [2022-02-20 18:38:21,986 INFO L290 TraceCheckUtils]: 3: Hoare triple {27014#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {27014#true} is VALID [2022-02-20 18:38:21,986 INFO L290 TraceCheckUtils]: 4: Hoare triple {27014#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {27014#true} is VALID [2022-02-20 18:38:21,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {27014#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {27014#true} is VALID [2022-02-20 18:38:21,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {27014#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {27014#true} is VALID [2022-02-20 18:38:21,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {27014#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {27014#true} is VALID [2022-02-20 18:38:21,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {27014#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {27014#true} is VALID [2022-02-20 18:38:21,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {27014#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {27014#true} is VALID [2022-02-20 18:38:21,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {27014#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {27014#true} is VALID [2022-02-20 18:38:21,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {27014#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {27014#true} is VALID [2022-02-20 18:38:21,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {27014#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {27014#true} is VALID [2022-02-20 18:38:21,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {27014#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {27014#true} is VALID [2022-02-20 18:38:21,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {27014#true} assume ~id1~0 != ~id2~0; {27014#true} is VALID [2022-02-20 18:38:21,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {27014#true} assume ~id1~0 != ~id3~0; {27014#true} is VALID [2022-02-20 18:38:21,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {27014#true} assume ~id2~0 != ~id3~0; {27014#true} is VALID [2022-02-20 18:38:21,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {27014#true} assume ~id1~0 >= 0; {27014#true} is VALID [2022-02-20 18:38:21,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {27014#true} assume ~id2~0 >= 0; {27014#true} is VALID [2022-02-20 18:38:21,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {27014#true} assume ~id3~0 >= 0; {27014#true} is VALID [2022-02-20 18:38:21,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {27014#true} assume 0 == ~r1~0 % 256; {27014#true} is VALID [2022-02-20 18:38:21,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {27014#true} assume 0 == ~r2~0 % 256; {27014#true} is VALID [2022-02-20 18:38:21,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {27014#true} assume 0 == ~r3~0 % 256; {27014#true} is VALID [2022-02-20 18:38:21,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {27014#true} assume ~max1~0 == ~id1~0; {27014#true} is VALID [2022-02-20 18:38:21,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {27014#true} assume ~max2~0 == ~id2~0; {27014#true} is VALID [2022-02-20 18:38:21,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {27014#true} assume ~max3~0 == ~id3~0; {27014#true} is VALID [2022-02-20 18:38:21,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {27014#true} assume 0 == ~st1~0; {27014#true} is VALID [2022-02-20 18:38:21,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {27014#true} assume 0 == ~st2~0; {27016#(<= ~st2~0 0)} is VALID [2022-02-20 18:38:21,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {27016#(<= ~st2~0 0)} assume 0 == ~st3~0; {27016#(<= ~st2~0 0)} is VALID [2022-02-20 18:38:21,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {27016#(<= ~st2~0 0)} assume 0 == ~nl1~0; {27016#(<= ~st2~0 0)} is VALID [2022-02-20 18:38:21,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {27016#(<= ~st2~0 0)} assume 0 == ~nl2~0; {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,991 INFO L290 TraceCheckUtils]: 32: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,991 INFO L290 TraceCheckUtils]: 33: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,992 INFO L290 TraceCheckUtils]: 34: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1766~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1766~0; {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,992 INFO L290 TraceCheckUtils]: 35: Hoare triple {27017#(<= (+ ~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; {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,993 INFO L290 TraceCheckUtils]: 36: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256); {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 % 256 < 2; {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,993 INFO L290 TraceCheckUtils]: 38: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep12~0 % 256); {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep13~0 % 256); {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,994 INFO L290 TraceCheckUtils]: 40: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256); {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 % 256 < 2; {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,995 INFO L290 TraceCheckUtils]: 43: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep21~0 % 256); {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,995 INFO L290 TraceCheckUtils]: 44: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep23~0 % 256); {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,995 INFO L290 TraceCheckUtils]: 45: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,996 INFO L290 TraceCheckUtils]: 46: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256); {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,996 INFO L290 TraceCheckUtils]: 47: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 % 256 < 2; {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,996 INFO L290 TraceCheckUtils]: 48: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep31~0 % 256); {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,997 INFO L290 TraceCheckUtils]: 49: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep32~0 % 256); {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,997 INFO L290 TraceCheckUtils]: 50: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,997 INFO L290 TraceCheckUtils]: 51: Hoare triple {27017#(<= (+ ~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; {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,998 INFO L290 TraceCheckUtils]: 52: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,998 INFO L290 TraceCheckUtils]: 53: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {27017#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:38:21,998 INFO L290 TraceCheckUtils]: 54: Hoare triple {27017#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);main_~check__tmp~0#1 := 0; {27015#false} is VALID [2022-02-20 18:38:21,999 INFO L290 TraceCheckUtils]: 55: Hoare triple {27015#false} ~__return_1897~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1897~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; {27015#false} is VALID [2022-02-20 18:38:21,999 INFO L290 TraceCheckUtils]: 56: Hoare triple {27015#false} assume 0 == main_~assert__arg~0#1 % 256; {27015#false} is VALID [2022-02-20 18:38:21,999 INFO L290 TraceCheckUtils]: 57: Hoare triple {27015#false} assume !false; {27015#false} is VALID [2022-02-20 18:38:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:38:22,000 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:22,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176764928] [2022-02-20 18:38:22,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176764928] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:22,000 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:22,000 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:38:22,000 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511003161] [2022-02-20 18:38:22,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:22,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-20 18:38:22,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:22,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:22,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:22,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:38:22,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:22,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:38:22,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:38:22,030 INFO L87 Difference]: Start difference. First operand 1583 states and 2574 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:26,144 INFO L93 Difference]: Finished difference Result 4604 states and 7538 transitions. [2022-02-20 18:38:26,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:38:26,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-20 18:38:26,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:26,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 626 transitions. [2022-02-20 18:38:26,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 626 transitions. [2022-02-20 18:38:26,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 626 transitions. [2022-02-20 18:38:26,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 626 edges. 626 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:26,906 INFO L225 Difference]: With dead ends: 4604 [2022-02-20 18:38:26,907 INFO L226 Difference]: Without dead ends: 3069 [2022-02-20 18:38:26,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:38:26,909 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 402 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:26,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 649 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:26,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2022-02-20 18:38:29,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2314. [2022-02-20 18:38:29,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:29,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3069 states. Second operand has 2314 states, 2313 states have (on average 1.6260268050151319) internal successors, (3761), 2313 states have internal predecessors, (3761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:29,255 INFO L74 IsIncluded]: Start isIncluded. First operand 3069 states. Second operand has 2314 states, 2313 states have (on average 1.6260268050151319) internal successors, (3761), 2313 states have internal predecessors, (3761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:29,259 INFO L87 Difference]: Start difference. First operand 3069 states. Second operand has 2314 states, 2313 states have (on average 1.6260268050151319) internal successors, (3761), 2313 states have internal predecessors, (3761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:29,519 INFO L93 Difference]: Finished difference Result 3069 states and 5010 transitions. [2022-02-20 18:38:29,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 5010 transitions. [2022-02-20 18:38:29,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:29,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:29,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 2314 states, 2313 states have (on average 1.6260268050151319) internal successors, (3761), 2313 states have internal predecessors, (3761), 0 states have call successors, (0), 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 3069 states. [2022-02-20 18:38:29,528 INFO L87 Difference]: Start difference. First operand has 2314 states, 2313 states have (on average 1.6260268050151319) internal successors, (3761), 2313 states have internal predecessors, (3761), 0 states have call successors, (0), 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 3069 states. [2022-02-20 18:38:29,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:29,791 INFO L93 Difference]: Finished difference Result 3069 states and 5010 transitions. [2022-02-20 18:38:29,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 5010 transitions. [2022-02-20 18:38:29,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:29,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:29,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:29,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:29,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2314 states, 2313 states have (on average 1.6260268050151319) internal successors, (3761), 2313 states have internal predecessors, (3761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 3761 transitions. [2022-02-20 18:38:30,045 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 3761 transitions. Word has length 58 [2022-02-20 18:38:30,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:30,045 INFO L470 AbstractCegarLoop]: Abstraction has 2314 states and 3761 transitions. [2022-02-20 18:38:30,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:30,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3761 transitions. [2022-02-20 18:38:30,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:38:30,046 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:30,046 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:38:30,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:38:30,047 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:30,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:30,047 INFO L85 PathProgramCache]: Analyzing trace with hash -370820470, now seen corresponding path program 1 times [2022-02-20 18:38:30,047 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:30,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677066688] [2022-02-20 18:38:30,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:30,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:30,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {43295#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_1766~0 := 0;~__return_1897~0 := 0; {43295#true} is VALID [2022-02-20 18:38:30,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {43295#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; {43295#true} is VALID [2022-02-20 18:38:30,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {43295#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {43295#true} is VALID [2022-02-20 18:38:30,088 INFO L290 TraceCheckUtils]: 3: Hoare triple {43295#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {43295#true} is VALID [2022-02-20 18:38:30,088 INFO L290 TraceCheckUtils]: 4: Hoare triple {43295#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {43295#true} is VALID [2022-02-20 18:38:30,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {43295#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {43295#true} is VALID [2022-02-20 18:38:30,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {43295#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {43295#true} is VALID [2022-02-20 18:38:30,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {43295#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {43295#true} is VALID [2022-02-20 18:38:30,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {43295#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {43295#true} is VALID [2022-02-20 18:38:30,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {43295#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {43295#true} is VALID [2022-02-20 18:38:30,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {43295#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {43295#true} is VALID [2022-02-20 18:38:30,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {43295#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {43295#true} is VALID [2022-02-20 18:38:30,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {43295#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {43295#true} is VALID [2022-02-20 18:38:30,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {43295#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {43295#true} is VALID [2022-02-20 18:38:30,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {43295#true} assume ~id1~0 != ~id2~0; {43295#true} is VALID [2022-02-20 18:38:30,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {43295#true} assume ~id1~0 != ~id3~0; {43295#true} is VALID [2022-02-20 18:38:30,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {43295#true} assume ~id2~0 != ~id3~0; {43295#true} is VALID [2022-02-20 18:38:30,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {43295#true} assume ~id1~0 >= 0; {43295#true} is VALID [2022-02-20 18:38:30,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {43295#true} assume ~id2~0 >= 0; {43295#true} is VALID [2022-02-20 18:38:30,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {43295#true} assume ~id3~0 >= 0; {43295#true} is VALID [2022-02-20 18:38:30,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {43295#true} assume 0 == ~r1~0 % 256; {43295#true} is VALID [2022-02-20 18:38:30,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {43295#true} assume 0 == ~r2~0 % 256; {43295#true} is VALID [2022-02-20 18:38:30,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {43295#true} assume 0 == ~r3~0 % 256; {43295#true} is VALID [2022-02-20 18:38:30,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {43295#true} assume ~max1~0 == ~id1~0; {43295#true} is VALID [2022-02-20 18:38:30,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {43295#true} assume ~max2~0 == ~id2~0; {43295#true} is VALID [2022-02-20 18:38:30,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {43295#true} assume ~max3~0 == ~id3~0; {43295#true} is VALID [2022-02-20 18:38:30,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {43295#true} assume 0 == ~st1~0; {43295#true} is VALID [2022-02-20 18:38:30,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {43295#true} assume 0 == ~st2~0; {43295#true} is VALID [2022-02-20 18:38:30,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {43295#true} assume 0 == ~st3~0; {43295#true} is VALID [2022-02-20 18:38:30,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {43295#true} assume 0 == ~nl1~0; {43295#true} is VALID [2022-02-20 18:38:30,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {43295#true} assume 0 == ~nl2~0; {43295#true} is VALID [2022-02-20 18:38:30,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {43295#true} assume 0 == ~nl3~0; {43295#true} is VALID [2022-02-20 18:38:30,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {43295#true} assume 0 == ~mode1~0 % 256; {43295#true} is VALID [2022-02-20 18:38:30,099 INFO L290 TraceCheckUtils]: 33: Hoare triple {43295#true} assume 0 == ~mode2~0 % 256; {43297#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:30,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {43297#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1766~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1766~0; {43297#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:30,100 INFO L290 TraceCheckUtils]: 35: Hoare triple {43297#(= (+ (* (- 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; {43297#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:30,100 INFO L290 TraceCheckUtils]: 36: Hoare triple {43297#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {43297#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:30,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {43297#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 % 256 < 2; {43297#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:30,101 INFO L290 TraceCheckUtils]: 38: Hoare triple {43297#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~ep12~0 % 256); {43297#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:30,101 INFO L290 TraceCheckUtils]: 39: Hoare triple {43297#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~ep13~0 % 256); {43297#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:30,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {43297#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {43297#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:30,102 INFO L290 TraceCheckUtils]: 41: Hoare triple {43297#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256); {43296#false} is VALID [2022-02-20 18:38:30,103 INFO L290 TraceCheckUtils]: 42: Hoare triple {43296#false} assume !(255 == ~r2~0 % 256); {43296#false} is VALID [2022-02-20 18:38:30,103 INFO L290 TraceCheckUtils]: 43: Hoare triple {43296#false} ~r2~0 := 1 + ~r2~0 % 256; {43296#false} is VALID [2022-02-20 18:38:30,103 INFO L290 TraceCheckUtils]: 44: Hoare triple {43296#false} assume !!(0 == ~ep12~0 % 256); {43296#false} is VALID [2022-02-20 18:38:30,103 INFO L290 TraceCheckUtils]: 45: Hoare triple {43296#false} assume !!(0 == ~ep32~0 % 256); {43296#false} is VALID [2022-02-20 18:38:30,103 INFO L290 TraceCheckUtils]: 46: Hoare triple {43296#false} assume 2 == ~r2~0 % 256; {43296#false} is VALID [2022-02-20 18:38:30,103 INFO L290 TraceCheckUtils]: 47: Hoare triple {43296#false} assume ~max2~0 == ~id2~0;~st2~0 := 1; {43296#false} is VALID [2022-02-20 18:38:30,103 INFO L290 TraceCheckUtils]: 48: Hoare triple {43296#false} ~mode2~0 := 0; {43296#false} is VALID [2022-02-20 18:38:30,104 INFO L290 TraceCheckUtils]: 49: Hoare triple {43296#false} assume !!(0 == ~mode3~0 % 256); {43296#false} is VALID [2022-02-20 18:38:30,104 INFO L290 TraceCheckUtils]: 50: Hoare triple {43296#false} assume ~r3~0 % 256 < 2; {43296#false} is VALID [2022-02-20 18:38:30,104 INFO L290 TraceCheckUtils]: 51: Hoare triple {43296#false} assume !!(0 == ~ep31~0 % 256); {43296#false} is VALID [2022-02-20 18:38:30,104 INFO L290 TraceCheckUtils]: 52: Hoare triple {43296#false} assume !!(0 == ~ep32~0 % 256); {43296#false} is VALID [2022-02-20 18:38:30,104 INFO L290 TraceCheckUtils]: 53: Hoare triple {43296#false} ~mode3~0 := 1; {43296#false} is VALID [2022-02-20 18:38:30,104 INFO L290 TraceCheckUtils]: 54: Hoare triple {43296#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; {43296#false} is VALID [2022-02-20 18:38:30,104 INFO L290 TraceCheckUtils]: 55: Hoare triple {43296#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {43296#false} is VALID [2022-02-20 18:38:30,104 INFO L290 TraceCheckUtils]: 56: Hoare triple {43296#false} ~__return_1897~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1897~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; {43296#false} is VALID [2022-02-20 18:38:30,105 INFO L290 TraceCheckUtils]: 57: Hoare triple {43296#false} assume 0 == main_~assert__arg~0#1 % 256; {43296#false} is VALID [2022-02-20 18:38:30,105 INFO L290 TraceCheckUtils]: 58: Hoare triple {43296#false} assume !false; {43296#false} is VALID [2022-02-20 18:38:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:38:30,105 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:30,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677066688] [2022-02-20 18:38:30,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677066688] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:30,105 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:30,106 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:30,106 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988265680] [2022-02-20 18:38:30,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:30,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-02-20 18:38:30,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:30,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:30,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:30,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:30,139 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:30,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:30,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:30,139 INFO L87 Difference]: Start difference. First operand 2314 states and 3761 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:34,735 INFO L93 Difference]: Finished difference Result 5104 states and 8336 transitions. [2022-02-20 18:38:34,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:34,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-02-20 18:38:34,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2022-02-20 18:38:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:34,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2022-02-20 18:38:34,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 451 transitions. [2022-02-20 18:38:34,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:35,509 INFO L225 Difference]: With dead ends: 5104 [2022-02-20 18:38:35,510 INFO L226 Difference]: Without dead ends: 3495 [2022-02-20 18:38:35,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:35,512 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 117 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:35,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 451 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:35,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2022-02-20 18:38:38,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3493. [2022-02-20 18:38:38,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:38,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3495 states. Second operand has 3493 states, 3492 states have (on average 1.622852233676976) internal successors, (5667), 3492 states have internal predecessors, (5667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:38,822 INFO L74 IsIncluded]: Start isIncluded. First operand 3495 states. Second operand has 3493 states, 3492 states have (on average 1.622852233676976) internal successors, (5667), 3492 states have internal predecessors, (5667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:38,825 INFO L87 Difference]: Start difference. First operand 3495 states. Second operand has 3493 states, 3492 states have (on average 1.622852233676976) internal successors, (5667), 3492 states have internal predecessors, (5667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:39,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:39,221 INFO L93 Difference]: Finished difference Result 3495 states and 5668 transitions. [2022-02-20 18:38:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 5668 transitions. [2022-02-20 18:38:39,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:39,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:39,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 3493 states, 3492 states have (on average 1.622852233676976) internal successors, (5667), 3492 states have internal predecessors, (5667), 0 states have call successors, (0), 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 3495 states. [2022-02-20 18:38:39,232 INFO L87 Difference]: Start difference. First operand has 3493 states, 3492 states have (on average 1.622852233676976) internal successors, (5667), 3492 states have internal predecessors, (5667), 0 states have call successors, (0), 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 3495 states. [2022-02-20 18:38:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:39,609 INFO L93 Difference]: Finished difference Result 3495 states and 5668 transitions. [2022-02-20 18:38:39,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 5668 transitions. [2022-02-20 18:38:39,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:39,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:39,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:39,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:39,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3493 states, 3492 states have (on average 1.622852233676976) internal successors, (5667), 3492 states have internal predecessors, (5667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3493 states to 3493 states and 5667 transitions. [2022-02-20 18:38:40,192 INFO L78 Accepts]: Start accepts. Automaton has 3493 states and 5667 transitions. Word has length 59 [2022-02-20 18:38:40,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:40,192 INFO L470 AbstractCegarLoop]: Abstraction has 3493 states and 5667 transitions. [2022-02-20 18:38:40,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3493 states and 5667 transitions. [2022-02-20 18:38:40,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:38:40,193 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:40,193 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:38:40,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:38:40,193 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:40,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:40,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1594203451, now seen corresponding path program 1 times [2022-02-20 18:38:40,194 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:40,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117543378] [2022-02-20 18:38:40,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:40,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:40,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {62906#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_1766~0 := 0;~__return_1897~0 := 0; {62906#true} is VALID [2022-02-20 18:38:40,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {62906#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; {62906#true} is VALID [2022-02-20 18:38:40,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {62906#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {62906#true} is VALID [2022-02-20 18:38:40,230 INFO L290 TraceCheckUtils]: 3: Hoare triple {62906#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {62906#true} is VALID [2022-02-20 18:38:40,230 INFO L290 TraceCheckUtils]: 4: Hoare triple {62906#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {62906#true} is VALID [2022-02-20 18:38:40,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {62906#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {62906#true} is VALID [2022-02-20 18:38:40,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {62906#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {62906#true} is VALID [2022-02-20 18:38:40,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {62906#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {62906#true} is VALID [2022-02-20 18:38:40,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {62906#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {62906#true} is VALID [2022-02-20 18:38:40,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {62906#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {62906#true} is VALID [2022-02-20 18:38:40,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {62906#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {62906#true} is VALID [2022-02-20 18:38:40,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {62906#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {62906#true} is VALID [2022-02-20 18:38:40,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {62906#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {62906#true} is VALID [2022-02-20 18:38:40,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {62906#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {62906#true} is VALID [2022-02-20 18:38:40,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {62906#true} assume ~id1~0 != ~id2~0; {62906#true} is VALID [2022-02-20 18:38:40,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {62906#true} assume ~id1~0 != ~id3~0; {62906#true} is VALID [2022-02-20 18:38:40,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {62906#true} assume ~id2~0 != ~id3~0; {62906#true} is VALID [2022-02-20 18:38:40,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {62906#true} assume ~id1~0 >= 0; {62906#true} is VALID [2022-02-20 18:38:40,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {62906#true} assume ~id2~0 >= 0; {62906#true} is VALID [2022-02-20 18:38:40,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {62906#true} assume ~id3~0 >= 0; {62906#true} is VALID [2022-02-20 18:38:40,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {62906#true} assume 0 == ~r1~0 % 256; {62906#true} is VALID [2022-02-20 18:38:40,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {62906#true} assume 0 == ~r2~0 % 256; {62906#true} is VALID [2022-02-20 18:38:40,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {62906#true} assume 0 == ~r3~0 % 256; {62906#true} is VALID [2022-02-20 18:38:40,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {62906#true} assume ~max1~0 == ~id1~0; {62906#true} is VALID [2022-02-20 18:38:40,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {62906#true} assume ~max2~0 == ~id2~0; {62906#true} is VALID [2022-02-20 18:38:40,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {62906#true} assume ~max3~0 == ~id3~0; {62906#true} is VALID [2022-02-20 18:38:40,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {62906#true} assume 0 == ~st1~0; {62906#true} is VALID [2022-02-20 18:38:40,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {62906#true} assume 0 == ~st2~0; {62906#true} is VALID [2022-02-20 18:38:40,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {62906#true} assume 0 == ~st3~0; {62906#true} is VALID [2022-02-20 18:38:40,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {62906#true} assume 0 == ~nl1~0; {62906#true} is VALID [2022-02-20 18:38:40,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {62906#true} assume 0 == ~nl2~0; {62906#true} is VALID [2022-02-20 18:38:40,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {62906#true} assume 0 == ~nl3~0; {62906#true} is VALID [2022-02-20 18:38:40,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {62906#true} assume 0 == ~mode1~0 % 256; {62906#true} is VALID [2022-02-20 18:38:40,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {62906#true} assume 0 == ~mode2~0 % 256; {62906#true} is VALID [2022-02-20 18:38:40,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {62906#true} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1766~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1766~0; {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:40,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {62908#(= (+ (* (- 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; {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:40,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:40,236 INFO L290 TraceCheckUtils]: 37: Hoare triple {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 % 256 < 2; {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:40,236 INFO L290 TraceCheckUtils]: 38: Hoare triple {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep12~0 % 256); {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:40,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep13~0 % 256); {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:40,237 INFO L290 TraceCheckUtils]: 40: Hoare triple {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:40,237 INFO L290 TraceCheckUtils]: 41: Hoare triple {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:40,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 % 256 < 2; {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:40,238 INFO L290 TraceCheckUtils]: 43: Hoare triple {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep21~0 % 256); {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:40,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep23~0 % 256); {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:40,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:38:40,239 INFO L290 TraceCheckUtils]: 46: Hoare triple {62908#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256); {62907#false} is VALID [2022-02-20 18:38:40,239 INFO L290 TraceCheckUtils]: 47: Hoare triple {62907#false} assume !(255 == ~r3~0 % 256); {62907#false} is VALID [2022-02-20 18:38:40,239 INFO L290 TraceCheckUtils]: 48: Hoare triple {62907#false} ~r3~0 := 1 + ~r3~0 % 256; {62907#false} is VALID [2022-02-20 18:38:40,239 INFO L290 TraceCheckUtils]: 49: Hoare triple {62907#false} assume !!(0 == ~ep13~0 % 256); {62907#false} is VALID [2022-02-20 18:38:40,239 INFO L290 TraceCheckUtils]: 50: Hoare triple {62907#false} assume !!(0 == ~ep23~0 % 256); {62907#false} is VALID [2022-02-20 18:38:40,239 INFO L290 TraceCheckUtils]: 51: Hoare triple {62907#false} assume 2 == ~r3~0 % 256; {62907#false} is VALID [2022-02-20 18:38:40,239 INFO L290 TraceCheckUtils]: 52: Hoare triple {62907#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {62907#false} is VALID [2022-02-20 18:38:40,240 INFO L290 TraceCheckUtils]: 53: Hoare triple {62907#false} ~mode3~0 := 0; {62907#false} is VALID [2022-02-20 18:38:40,240 INFO L290 TraceCheckUtils]: 54: Hoare triple {62907#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; {62907#false} is VALID [2022-02-20 18:38:40,240 INFO L290 TraceCheckUtils]: 55: Hoare triple {62907#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {62907#false} is VALID [2022-02-20 18:38:40,240 INFO L290 TraceCheckUtils]: 56: Hoare triple {62907#false} ~__return_1897~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1897~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; {62907#false} is VALID [2022-02-20 18:38:40,240 INFO L290 TraceCheckUtils]: 57: Hoare triple {62907#false} assume 0 == main_~assert__arg~0#1 % 256; {62907#false} is VALID [2022-02-20 18:38:40,240 INFO L290 TraceCheckUtils]: 58: Hoare triple {62907#false} assume !false; {62907#false} is VALID [2022-02-20 18:38:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:38:40,241 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:40,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117543378] [2022-02-20 18:38:40,241 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117543378] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:40,241 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:40,241 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:40,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709576668] [2022-02-20 18:38:40,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:40,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-02-20 18:38:40,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:40,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:40,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:40,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:40,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:40,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:40,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:40,276 INFO L87 Difference]: Start difference. First operand 3493 states and 5667 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:47,338 INFO L93 Difference]: Finished difference Result 6911 states and 11267 transitions. [2022-02-20 18:38:47,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:47,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-02-20 18:38:47,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:47,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2022-02-20 18:38:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:47,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2022-02-20 18:38:47,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 451 transitions. [2022-02-20 18:38:47,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:48,600 INFO L225 Difference]: With dead ends: 6911 [2022-02-20 18:38:48,600 INFO L226 Difference]: Without dead ends: 4911 [2022-02-20 18:38:48,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:48,603 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 112 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:48,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 434 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:48,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4911 states. [2022-02-20 18:38:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4911 to 4909. [2022-02-20 18:38:53,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:53,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4911 states. Second operand has 4909 states, 4908 states have (on average 1.6187856560717195) internal successors, (7945), 4908 states have internal predecessors, (7945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:53,120 INFO L74 IsIncluded]: Start isIncluded. First operand 4911 states. Second operand has 4909 states, 4908 states have (on average 1.6187856560717195) internal successors, (7945), 4908 states have internal predecessors, (7945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:53,123 INFO L87 Difference]: Start difference. First operand 4911 states. Second operand has 4909 states, 4908 states have (on average 1.6187856560717195) internal successors, (7945), 4908 states have internal predecessors, (7945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:53,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:53,832 INFO L93 Difference]: Finished difference Result 4911 states and 7946 transitions. [2022-02-20 18:38:53,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4911 states and 7946 transitions. [2022-02-20 18:38:53,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:53,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:53,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 4909 states, 4908 states have (on average 1.6187856560717195) internal successors, (7945), 4908 states have internal predecessors, (7945), 0 states have call successors, (0), 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 4911 states. [2022-02-20 18:38:53,845 INFO L87 Difference]: Start difference. First operand has 4909 states, 4908 states have (on average 1.6187856560717195) internal successors, (7945), 4908 states have internal predecessors, (7945), 0 states have call successors, (0), 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 4911 states. [2022-02-20 18:38:54,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:54,538 INFO L93 Difference]: Finished difference Result 4911 states and 7946 transitions. [2022-02-20 18:38:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 4911 states and 7946 transitions. [2022-02-20 18:38:54,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:54,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:54,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:54,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:54,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4909 states, 4908 states have (on average 1.6187856560717195) internal successors, (7945), 4908 states have internal predecessors, (7945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4909 states to 4909 states and 7945 transitions. [2022-02-20 18:38:55,688 INFO L78 Accepts]: Start accepts. Automaton has 4909 states and 7945 transitions. Word has length 59 [2022-02-20 18:38:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:55,688 INFO L470 AbstractCegarLoop]: Abstraction has 4909 states and 7945 transitions. [2022-02-20 18:38:55,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:55,688 INFO L276 IsEmpty]: Start isEmpty. Operand 4909 states and 7945 transitions. [2022-02-20 18:38:55,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:38:55,688 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:55,688 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:38:55,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:38:55,689 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:55,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:55,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1620263222, now seen corresponding path program 1 times [2022-02-20 18:38:55,689 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:55,689 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214577181] [2022-02-20 18:38:55,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:55,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:55,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {90092#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_1766~0 := 0;~__return_1897~0 := 0; {90092#true} is VALID [2022-02-20 18:38:55,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {90092#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; {90092#true} is VALID [2022-02-20 18:38:55,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {90092#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {90092#true} is VALID [2022-02-20 18:38:55,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {90092#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {90092#true} is VALID [2022-02-20 18:38:55,729 INFO L290 TraceCheckUtils]: 4: Hoare triple {90092#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {90092#true} is VALID [2022-02-20 18:38:55,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {90092#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {90092#true} is VALID [2022-02-20 18:38:55,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {90092#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {90092#true} is VALID [2022-02-20 18:38:55,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {90092#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {90092#true} is VALID [2022-02-20 18:38:55,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {90092#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {90092#true} is VALID [2022-02-20 18:38:55,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {90092#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {90092#true} is VALID [2022-02-20 18:38:55,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {90092#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {90092#true} is VALID [2022-02-20 18:38:55,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {90092#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {90092#true} is VALID [2022-02-20 18:38:55,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {90092#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {90092#true} is VALID [2022-02-20 18:38:55,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {90092#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {90092#true} is VALID [2022-02-20 18:38:55,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {90092#true} assume ~id1~0 != ~id2~0; {90092#true} is VALID [2022-02-20 18:38:55,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {90092#true} assume ~id1~0 != ~id3~0; {90092#true} is VALID [2022-02-20 18:38:55,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {90092#true} assume ~id2~0 != ~id3~0; {90092#true} is VALID [2022-02-20 18:38:55,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {90092#true} assume ~id1~0 >= 0; {90092#true} is VALID [2022-02-20 18:38:55,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {90092#true} assume ~id2~0 >= 0; {90092#true} is VALID [2022-02-20 18:38:55,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {90092#true} assume ~id3~0 >= 0; {90092#true} is VALID [2022-02-20 18:38:55,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {90092#true} assume 0 == ~r1~0 % 256; {90092#true} is VALID [2022-02-20 18:38:55,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {90092#true} assume 0 == ~r2~0 % 256; {90092#true} is VALID [2022-02-20 18:38:55,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {90092#true} assume 0 == ~r3~0 % 256; {90092#true} is VALID [2022-02-20 18:38:55,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {90092#true} assume ~max1~0 == ~id1~0; {90092#true} is VALID [2022-02-20 18:38:55,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {90092#true} assume ~max2~0 == ~id2~0; {90092#true} is VALID [2022-02-20 18:38:55,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {90092#true} assume ~max3~0 == ~id3~0; {90092#true} is VALID [2022-02-20 18:38:55,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {90092#true} assume 0 == ~st1~0; {90092#true} is VALID [2022-02-20 18:38:55,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {90092#true} assume 0 == ~st2~0; {90092#true} is VALID [2022-02-20 18:38:55,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {90092#true} assume 0 == ~st3~0; {90094#(<= ~st3~0 0)} is VALID [2022-02-20 18:38:55,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {90094#(<= ~st3~0 0)} assume 0 == ~nl1~0; {90094#(<= ~st3~0 0)} is VALID [2022-02-20 18:38:55,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {90094#(<= ~st3~0 0)} assume 0 == ~nl2~0; {90094#(<= ~st3~0 0)} is VALID [2022-02-20 18:38:55,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {90094#(<= ~st3~0 0)} assume 0 == ~nl3~0; {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1766~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1766~0; {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~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; {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~mode1~0 % 256); {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 % 256 < 2; {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep12~0 % 256); {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep13~0 % 256); {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,736 INFO L290 TraceCheckUtils]: 41: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~mode2~0 % 256); {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 % 256 < 2; {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep21~0 % 256); {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,737 INFO L290 TraceCheckUtils]: 44: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep23~0 % 256); {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,737 INFO L290 TraceCheckUtils]: 45: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~mode3~0 % 256); {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 % 256 < 2; {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,738 INFO L290 TraceCheckUtils]: 48: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep31~0 % 256); {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep32~0 % 256); {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,739 INFO L290 TraceCheckUtils]: 50: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,739 INFO L290 TraceCheckUtils]: 51: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~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; {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,740 INFO L290 TraceCheckUtils]: 52: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,740 INFO L290 TraceCheckUtils]: 53: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,740 INFO L290 TraceCheckUtils]: 54: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {90095#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:38:55,741 INFO L290 TraceCheckUtils]: 55: Hoare triple {90095#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);main_~check__tmp~0#1 := 0; {90093#false} is VALID [2022-02-20 18:38:55,741 INFO L290 TraceCheckUtils]: 56: Hoare triple {90093#false} ~__return_1897~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1897~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; {90093#false} is VALID [2022-02-20 18:38:55,741 INFO L290 TraceCheckUtils]: 57: Hoare triple {90093#false} assume 0 == main_~assert__arg~0#1 % 256; {90093#false} is VALID [2022-02-20 18:38:55,741 INFO L290 TraceCheckUtils]: 58: Hoare triple {90093#false} assume !false; {90093#false} is VALID [2022-02-20 18:38:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:38:55,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:55,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214577181] [2022-02-20 18:38:55,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214577181] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:55,742 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:55,742 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:38:55,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392462661] [2022-02-20 18:38:55,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:55,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-02-20 18:38:55,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:55,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:55,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:55,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:38:55,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:55,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:38:55,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:38:55,771 INFO L87 Difference]: Start difference. First operand 4909 states and 7945 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)