./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a10c9e6583b7bb9620d063f223dce3a6f04929588e6f4ac23db6236ec494c7b2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:31:27,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:31:27,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:31:27,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:31:27,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:31:27,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:31:27,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:31:27,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:31:27,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:31:27,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:31:27,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:31:27,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:31:27,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:31:27,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:31:27,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:31:27,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:31:27,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:31:27,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:31:27,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:31:27,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:31:27,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:31:27,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:31:27,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:31:27,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:31:27,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:31:27,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:31:27,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:31:27,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:31:27,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:31:27,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:31:27,966 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:31:27,967 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:31:27,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:31:27,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:31:27,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:31:27,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:31:27,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:31:27,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:31:27,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:31:27,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:31:27,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:31:27,972 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:31:28,008 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:31:28,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:31:28,011 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:31:28,011 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:31:28,012 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:31:28,012 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:31:28,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:31:28,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:31:28,013 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:31:28,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:31:28,015 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:31:28,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:31:28,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:31:28,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:31:28,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:31:28,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:31:28,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:31:28,016 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:31:28,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:31:28,016 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:31:28,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:31:28,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:31:28,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:31:28,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:31:28,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:31:28,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:31:28,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:31:28,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:31:28,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:31:28,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:31:28,018 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:31:28,019 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:31:28,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:31:28,019 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 -> a10c9e6583b7bb9620d063f223dce3a6f04929588e6f4ac23db6236ec494c7b2 [2022-02-20 18:31:28,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:31:28,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:31:28,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:31:28,319 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:31:28,320 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:31:28,321 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2022-02-20 18:31:28,396 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/211beb474/3eeea330cfd34b59aa9949d43347e7ab/FLAG39a254fe8 [2022-02-20 18:31:28,787 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:31:28,787 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2022-02-20 18:31:28,798 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/211beb474/3eeea330cfd34b59aa9949d43347e7ab/FLAG39a254fe8 [2022-02-20 18:31:28,807 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/211beb474/3eeea330cfd34b59aa9949d43347e7ab [2022-02-20 18:31:28,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:31:28,811 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:31:28,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:31:28,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:31:28,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:31:28,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:31:28" (1/1) ... [2022-02-20 18:31:28,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@690931f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:28, skipping insertion in model container [2022-02-20 18:31:28,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:31:28" (1/1) ... [2022-02-20 18:31:28,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:31:28,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:31:29,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c[14521,14534] [2022-02-20 18:31:29,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:31:29,020 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:31:29,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c[14521,14534] [2022-02-20 18:31:29,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:31:29,072 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:31:29,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:29 WrapperNode [2022-02-20 18:31:29,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:31:29,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:31:29,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:31:29,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:31:29,088 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:31:29" (1/1) ... [2022-02-20 18:31:29,095 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:31:29" (1/1) ... [2022-02-20 18:31:29,147 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 481 [2022-02-20 18:31:29,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:31:29,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:31:29,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:31:29,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:31:29,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:29" (1/1) ... [2022-02-20 18:31:29,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:29" (1/1) ... [2022-02-20 18:31:29,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:29" (1/1) ... [2022-02-20 18:31:29,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:29" (1/1) ... [2022-02-20 18:31:29,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:29" (1/1) ... [2022-02-20 18:31:29,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:29" (1/1) ... [2022-02-20 18:31:29,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:29" (1/1) ... [2022-02-20 18:31:29,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:31:29,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:31:29,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:31:29,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:31:29,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:29" (1/1) ... [2022-02-20 18:31:29,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:31:29,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:31:29,263 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:31:29,278 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:31:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:31:29,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:31:29,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:31:29,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:31:29,372 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:31:29,373 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:31:29,981 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:31:29,986 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:31:29,991 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:31:29,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:31:29 BoogieIcfgContainer [2022-02-20 18:31:29,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:31:29,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:31:29,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:31:29,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:31:29,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:31:28" (1/3) ... [2022-02-20 18:31:29,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b989f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:31:29, skipping insertion in model container [2022-02-20 18:31:29,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:29" (2/3) ... [2022-02-20 18:31:29,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b989f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:31:29, skipping insertion in model container [2022-02-20 18:31:29,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:31:29" (3/3) ... [2022-02-20 18:31:30,000 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2022-02-20 18:31:30,004 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:31:30,004 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:31:30,040 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:31:30,047 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:31:30,048 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:31:30,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 147 states have (on average 1.748299319727891) internal successors, (257), 148 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:30,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:31:30,072 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:30,072 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:31:30,073 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:30,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:30,076 INFO L85 PathProgramCache]: Analyzing trace with hash -812713456, now seen corresponding path program 1 times [2022-02-20 18:31:30,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:30,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165847723] [2022-02-20 18:31:30,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:30,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:30,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {152#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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {152#true} is VALID [2022-02-20 18:31:30,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {152#true} is VALID [2022-02-20 18:31:30,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {152#true} is VALID [2022-02-20 18:31:30,318 INFO L290 TraceCheckUtils]: 3: Hoare triple {152#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:31:30,318 INFO L290 TraceCheckUtils]: 4: Hoare triple {152#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {152#true} is VALID [2022-02-20 18:31:30,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:31:30,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {152#true} is VALID [2022-02-20 18:31:30,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:31:30,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {152#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {152#true} is VALID [2022-02-20 18:31:30,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {152#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:31:30,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {152#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {152#true} is VALID [2022-02-20 18:31:30,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {152#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:31:30,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {152#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {152#true} is VALID [2022-02-20 18:31:30,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {152#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:31:30,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {152#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {152#true} is VALID [2022-02-20 18:31:30,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {152#true} init_#res#1 := init_~tmp___5~0#1; {152#true} is VALID [2022-02-20 18:31:30,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {152#true} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {152#true} is VALID [2022-02-20 18:31:30,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {152#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {153#false} is VALID [2022-02-20 18:31:30,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {153#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {153#false} is VALID [2022-02-20 18:31:30,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {153#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {153#false} is VALID [2022-02-20 18:31:30,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {153#false} assume !(0 != ~mode1~0 % 256); {153#false} is VALID [2022-02-20 18:31:30,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {153#false} assume !(~r1~0 % 256 < 2); {153#false} is VALID [2022-02-20 18:31:30,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {153#false} ~mode1~0 := 1; {153#false} is VALID [2022-02-20 18:31:30,324 INFO L290 TraceCheckUtils]: 23: Hoare triple {153#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {153#false} is VALID [2022-02-20 18:31:30,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {153#false} assume !(0 != ~mode2~0 % 256); {153#false} is VALID [2022-02-20 18:31:30,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {153#false} assume !(~r2~0 % 256 < 2); {153#false} is VALID [2022-02-20 18:31:30,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {153#false} ~mode2~0 := 1; {153#false} is VALID [2022-02-20 18:31:30,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {153#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {153#false} is VALID [2022-02-20 18:31:30,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {153#false} assume !(0 != ~mode3~0 % 256); {153#false} is VALID [2022-02-20 18:31:30,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {153#false} assume !(~r3~0 % 256 < 2); {153#false} is VALID [2022-02-20 18:31:30,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {153#false} ~mode3~0 := 1; {153#false} is VALID [2022-02-20 18:31:30,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {153#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {153#false} is VALID [2022-02-20 18:31:30,325 INFO L290 TraceCheckUtils]: 32: Hoare triple {153#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {153#false} is VALID [2022-02-20 18:31:30,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {153#false} check_#res#1 := check_~tmp~1#1; {153#false} is VALID [2022-02-20 18:31:30,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {153#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {153#false} is VALID [2022-02-20 18:31:30,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {153#false} assume 0 == assert_~arg#1 % 256; {153#false} is VALID [2022-02-20 18:31:30,326 INFO L290 TraceCheckUtils]: 36: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-02-20 18:31:30,327 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:31:30,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:30,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165847723] [2022-02-20 18:31:30,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165847723] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:30,328 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:30,329 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:31:30,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7603332] [2022-02-20 18:31:30,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:30,333 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 18:31:30,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:30,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:30,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:30,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:31:30,372 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:30,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:31:30,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:31:30,398 INFO L87 Difference]: Start difference. First operand has 149 states, 147 states have (on average 1.748299319727891) internal successors, (257), 148 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:30,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:30,547 INFO L93 Difference]: Finished difference Result 235 states and 403 transitions. [2022-02-20 18:31:30,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:31:30,548 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 18:31:30,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:30,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 403 transitions. [2022-02-20 18:31:30,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 403 transitions. [2022-02-20 18:31:30,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 403 transitions. [2022-02-20 18:31:30,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 403 edges. 403 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:30,879 INFO L225 Difference]: With dead ends: 235 [2022-02-20 18:31:30,880 INFO L226 Difference]: Without dead ends: 145 [2022-02-20 18:31:30,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:31:30,884 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:30,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:30,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-02-20 18:31:30,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-02-20 18:31:30,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:30,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:30,910 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:30,910 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:30,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:30,915 INFO L93 Difference]: Finished difference Result 145 states and 250 transitions. [2022-02-20 18:31:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 250 transitions. [2022-02-20 18:31:30,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:30,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:30,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 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 145 states. [2022-02-20 18:31:30,919 INFO L87 Difference]: Start difference. First operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 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 145 states. [2022-02-20 18:31:30,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:30,924 INFO L93 Difference]: Finished difference Result 145 states and 250 transitions. [2022-02-20 18:31:30,924 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 250 transitions. [2022-02-20 18:31:30,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:30,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:30,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:30,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:30,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 250 transitions. [2022-02-20 18:31:30,930 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 250 transitions. Word has length 37 [2022-02-20 18:31:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:30,931 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 250 transitions. [2022-02-20 18:31:30,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 250 transitions. [2022-02-20 18:31:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:31:30,932 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:30,933 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:31:30,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:31:30,933 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:30,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:30,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1630361906, now seen corresponding path program 1 times [2022-02-20 18:31:30,934 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:30,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248976861] [2022-02-20 18:31:30,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:30,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:31,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {853#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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {853#true} is VALID [2022-02-20 18:31:31,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {853#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {853#true} is VALID [2022-02-20 18:31:31,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {853#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {853#true} is VALID [2022-02-20 18:31:31,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {853#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {853#true} is VALID [2022-02-20 18:31:31,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {853#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {853#true} is VALID [2022-02-20 18:31:31,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {853#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {853#true} is VALID [2022-02-20 18:31:31,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {853#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {853#true} is VALID [2022-02-20 18:31:31,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {853#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {853#true} is VALID [2022-02-20 18:31:31,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {853#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {853#true} is VALID [2022-02-20 18:31:31,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {853#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {853#true} is VALID [2022-02-20 18:31:31,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {853#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {853#true} is VALID [2022-02-20 18:31:31,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {853#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {853#true} is VALID [2022-02-20 18:31:31,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {853#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {853#true} is VALID [2022-02-20 18:31:31,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {853#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {853#true} is VALID [2022-02-20 18:31:31,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {853#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {855#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-20 18:31:31,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {855#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {856#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:31:31,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {856#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {857#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:31:31,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {857#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {854#false} is VALID [2022-02-20 18:31:31,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {854#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {854#false} is VALID [2022-02-20 18:31:31,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {854#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {854#false} is VALID [2022-02-20 18:31:31,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {854#false} assume !(0 != ~mode1~0 % 256); {854#false} is VALID [2022-02-20 18:31:31,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {854#false} assume !(~r1~0 % 256 < 2); {854#false} is VALID [2022-02-20 18:31:31,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {854#false} ~mode1~0 := 1; {854#false} is VALID [2022-02-20 18:31:31,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {854#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {854#false} is VALID [2022-02-20 18:31:31,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {854#false} assume !(0 != ~mode2~0 % 256); {854#false} is VALID [2022-02-20 18:31:31,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {854#false} assume !(~r2~0 % 256 < 2); {854#false} is VALID [2022-02-20 18:31:31,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {854#false} ~mode2~0 := 1; {854#false} is VALID [2022-02-20 18:31:31,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {854#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {854#false} is VALID [2022-02-20 18:31:31,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {854#false} assume !(0 != ~mode3~0 % 256); {854#false} is VALID [2022-02-20 18:31:31,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {854#false} assume !(~r3~0 % 256 < 2); {854#false} is VALID [2022-02-20 18:31:31,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {854#false} ~mode3~0 := 1; {854#false} is VALID [2022-02-20 18:31:31,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {854#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {854#false} is VALID [2022-02-20 18:31:31,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {854#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {854#false} is VALID [2022-02-20 18:31:31,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {854#false} check_#res#1 := check_~tmp~1#1; {854#false} is VALID [2022-02-20 18:31:31,015 INFO L290 TraceCheckUtils]: 34: Hoare triple {854#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {854#false} is VALID [2022-02-20 18:31:31,016 INFO L290 TraceCheckUtils]: 35: Hoare triple {854#false} assume 0 == assert_~arg#1 % 256; {854#false} is VALID [2022-02-20 18:31:31,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {854#false} assume !false; {854#false} is VALID [2022-02-20 18:31:31,016 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:31:31,016 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:31,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248976861] [2022-02-20 18:31:31,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248976861] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:31,017 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:31,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:31:31,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605222761] [2022-02-20 18:31:31,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:31,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 18:31:31,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:31,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:31,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:31,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:31:31,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:31,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:31:31,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:31:31,046 INFO L87 Difference]: Start difference. First operand 145 states and 250 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:31,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:31,458 INFO L93 Difference]: Finished difference Result 234 states and 396 transitions. [2022-02-20 18:31:31,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:31:31,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 18:31:31,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 396 transitions. [2022-02-20 18:31:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:31,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 396 transitions. [2022-02-20 18:31:31,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 396 transitions. [2022-02-20 18:31:31,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:31,688 INFO L225 Difference]: With dead ends: 234 [2022-02-20 18:31:31,689 INFO L226 Difference]: Without dead ends: 145 [2022-02-20 18:31:31,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:31:31,694 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 3 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:31,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 959 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:31,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-02-20 18:31:31,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-02-20 18:31:31,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:31,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:31,710 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:31,711 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:31,715 INFO L93 Difference]: Finished difference Result 145 states and 220 transitions. [2022-02-20 18:31:31,715 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2022-02-20 18:31:31,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:31,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:31,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 145 states. [2022-02-20 18:31:31,722 INFO L87 Difference]: Start difference. First operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 145 states. [2022-02-20 18:31:31,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:31,727 INFO L93 Difference]: Finished difference Result 145 states and 220 transitions. [2022-02-20 18:31:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2022-02-20 18:31:31,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:31,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:31,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:31,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:31,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 220 transitions. [2022-02-20 18:31:31,731 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 220 transitions. Word has length 37 [2022-02-20 18:31:31,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:31,732 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 220 transitions. [2022-02-20 18:31:31,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2022-02-20 18:31:31,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:31:31,735 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:31,737 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:31:31,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:31:31,737 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:31,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:31,738 INFO L85 PathProgramCache]: Analyzing trace with hash 190573204, now seen corresponding path program 1 times [2022-02-20 18:31:31,739 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:31,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692966580] [2022-02-20 18:31:31,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:31,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:31,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {1560#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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {1560#true} is VALID [2022-02-20 18:31:31,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {1560#true} is VALID [2022-02-20 18:31:31,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1560#true} is VALID [2022-02-20 18:31:31,839 INFO L290 TraceCheckUtils]: 3: Hoare triple {1560#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1560#true} is VALID [2022-02-20 18:31:31,839 INFO L290 TraceCheckUtils]: 4: Hoare triple {1560#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1560#true} is VALID [2022-02-20 18:31:31,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1560#true} is VALID [2022-02-20 18:31:31,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {1560#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {1560#true} is VALID [2022-02-20 18:31:31,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {1560#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1560#true} is VALID [2022-02-20 18:31:31,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {1560#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {1560#true} is VALID [2022-02-20 18:31:31,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {1560#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1560#true} is VALID [2022-02-20 18:31:31,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {1560#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {1560#true} is VALID [2022-02-20 18:31:31,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {1560#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1560#true} is VALID [2022-02-20 18:31:31,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {1560#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {1560#true} is VALID [2022-02-20 18:31:31,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {1560#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1560#true} is VALID [2022-02-20 18:31:31,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {1560#true} assume ~id1~0 != ~id2~0; {1560#true} is VALID [2022-02-20 18:31:31,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {1560#true} assume ~id1~0 != ~id3~0; {1560#true} is VALID [2022-02-20 18:31:31,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {1560#true} assume ~id2~0 != ~id3~0; {1560#true} is VALID [2022-02-20 18:31:31,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {1560#true} assume ~id1~0 >= 0; {1560#true} is VALID [2022-02-20 18:31:31,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {1560#true} assume ~id2~0 >= 0; {1560#true} is VALID [2022-02-20 18:31:31,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {1560#true} assume ~id3~0 >= 0; {1560#true} is VALID [2022-02-20 18:31:31,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {1560#true} assume 0 == ~r1~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r2~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r3~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r122~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r132~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r212~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r232~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r312~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r322~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max1~0 == ~id1~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max2~0 == ~id2~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max3~0 == ~id3~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,846 INFO L290 TraceCheckUtils]: 32: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,847 INFO L290 TraceCheckUtils]: 35: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl1~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,847 INFO L290 TraceCheckUtils]: 36: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl2~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,847 INFO L290 TraceCheckUtils]: 37: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl3~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,848 INFO L290 TraceCheckUtils]: 38: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,848 INFO L290 TraceCheckUtils]: 39: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,848 INFO L290 TraceCheckUtils]: 40: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,849 INFO L290 TraceCheckUtils]: 41: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~newmax1~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,849 INFO L290 TraceCheckUtils]: 42: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~newmax2~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,849 INFO L290 TraceCheckUtils]: 43: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp___5~0#1; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,851 INFO L290 TraceCheckUtils]: 47: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,851 INFO L290 TraceCheckUtils]: 48: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,851 INFO L290 TraceCheckUtils]: 49: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:31,852 INFO L290 TraceCheckUtils]: 50: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 2); {1561#false} is VALID [2022-02-20 18:31:31,852 INFO L290 TraceCheckUtils]: 51: Hoare triple {1561#false} ~mode1~0 := 1; {1561#false} is VALID [2022-02-20 18:31:31,852 INFO L290 TraceCheckUtils]: 52: Hoare triple {1561#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {1561#false} is VALID [2022-02-20 18:31:31,852 INFO L290 TraceCheckUtils]: 53: Hoare triple {1561#false} assume !(0 != ~mode2~0 % 256); {1561#false} is VALID [2022-02-20 18:31:31,852 INFO L290 TraceCheckUtils]: 54: Hoare triple {1561#false} assume !(~r2~0 % 256 < 2); {1561#false} is VALID [2022-02-20 18:31:31,853 INFO L290 TraceCheckUtils]: 55: Hoare triple {1561#false} ~mode2~0 := 1; {1561#false} is VALID [2022-02-20 18:31:31,853 INFO L290 TraceCheckUtils]: 56: Hoare triple {1561#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {1561#false} is VALID [2022-02-20 18:31:31,853 INFO L290 TraceCheckUtils]: 57: Hoare triple {1561#false} assume !(0 != ~mode3~0 % 256); {1561#false} is VALID [2022-02-20 18:31:31,853 INFO L290 TraceCheckUtils]: 58: Hoare triple {1561#false} assume !(~r3~0 % 256 < 2); {1561#false} is VALID [2022-02-20 18:31:31,853 INFO L290 TraceCheckUtils]: 59: Hoare triple {1561#false} ~mode3~0 := 1; {1561#false} is VALID [2022-02-20 18:31:31,853 INFO L290 TraceCheckUtils]: 60: Hoare triple {1561#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1561#false} is VALID [2022-02-20 18:31:31,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {1561#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1561#false} is VALID [2022-02-20 18:31:31,854 INFO L290 TraceCheckUtils]: 62: Hoare triple {1561#false} check_#res#1 := check_~tmp~1#1; {1561#false} is VALID [2022-02-20 18:31:31,854 INFO L290 TraceCheckUtils]: 63: Hoare triple {1561#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1561#false} is VALID [2022-02-20 18:31:31,854 INFO L290 TraceCheckUtils]: 64: Hoare triple {1561#false} assume 0 == assert_~arg#1 % 256; {1561#false} is VALID [2022-02-20 18:31:31,854 INFO L290 TraceCheckUtils]: 65: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-02-20 18:31:31,855 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:31:31,855 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:31,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692966580] [2022-02-20 18:31:31,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692966580] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:31,855 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:31,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:31,856 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51231857] [2022-02-20 18:31:31,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:31,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:31:31,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:31,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:31,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:31,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:31,899 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:31,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:31,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:31,900 INFO L87 Difference]: Start difference. First operand 145 states and 220 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:32,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:32,153 INFO L93 Difference]: Finished difference Result 305 states and 486 transitions. [2022-02-20 18:31:32,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:32,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:31:32,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2022-02-20 18:31:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2022-02-20 18:31:32,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 486 transitions. [2022-02-20 18:31:32,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:32,452 INFO L225 Difference]: With dead ends: 305 [2022-02-20 18:31:32,452 INFO L226 Difference]: Without dead ends: 220 [2022-02-20 18:31:32,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:31:32,453 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 115 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:32,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 388 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:32,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-02-20 18:31:32,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2022-02-20 18:31:32,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:32,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 220 states. Second operand has 217 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 216 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:32,467 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand has 217 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 216 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:32,468 INFO L87 Difference]: Start difference. First operand 220 states. Second operand has 217 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 216 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:32,472 INFO L93 Difference]: Finished difference Result 220 states and 338 transitions. [2022-02-20 18:31:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 338 transitions. [2022-02-20 18:31:32,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:32,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:32,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 216 states have internal predecessors, (336), 0 states have call successors, (0), 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 220 states. [2022-02-20 18:31:32,474 INFO L87 Difference]: Start difference. First operand has 217 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 216 states have internal predecessors, (336), 0 states have call successors, (0), 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 220 states. [2022-02-20 18:31:32,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:32,478 INFO L93 Difference]: Finished difference Result 220 states and 338 transitions. [2022-02-20 18:31:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 338 transitions. [2022-02-20 18:31:32,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:32,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:32,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:32,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 216 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:32,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 336 transitions. [2022-02-20 18:31:32,484 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 336 transitions. Word has length 66 [2022-02-20 18:31:32,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:32,484 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 336 transitions. [2022-02-20 18:31:32,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:32,485 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 336 transitions. [2022-02-20 18:31:32,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 18:31:32,485 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:32,485 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:31:32,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:31:32,486 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:32,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:32,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1527919177, now seen corresponding path program 1 times [2022-02-20 18:31:32,487 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:32,487 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040113517] [2022-02-20 18:31:32,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:32,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:32,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {2569#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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {2569#true} is VALID [2022-02-20 18:31:32,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {2569#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {2569#true} is VALID [2022-02-20 18:31:32,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {2569#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2569#true} is VALID [2022-02-20 18:31:32,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {2569#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2569#true} is VALID [2022-02-20 18:31:32,586 INFO L290 TraceCheckUtils]: 4: Hoare triple {2569#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2569#true} is VALID [2022-02-20 18:31:32,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {2569#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2569#true} is VALID [2022-02-20 18:31:32,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {2569#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2569#true} is VALID [2022-02-20 18:31:32,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {2569#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2569#true} is VALID [2022-02-20 18:31:32,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {2569#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2569#true} is VALID [2022-02-20 18:31:32,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {2569#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2569#true} is VALID [2022-02-20 18:31:32,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {2569#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2569#true} is VALID [2022-02-20 18:31:32,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {2569#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2569#true} is VALID [2022-02-20 18:31:32,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {2569#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2569#true} is VALID [2022-02-20 18:31:32,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {2569#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2569#true} is VALID [2022-02-20 18:31:32,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {2569#true} assume ~id1~0 != ~id2~0; {2569#true} is VALID [2022-02-20 18:31:32,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {2569#true} assume ~id1~0 != ~id3~0; {2569#true} is VALID [2022-02-20 18:31:32,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {2569#true} assume ~id2~0 != ~id3~0; {2569#true} is VALID [2022-02-20 18:31:32,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {2569#true} assume ~id1~0 >= 0; {2569#true} is VALID [2022-02-20 18:31:32,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {2569#true} assume ~id2~0 >= 0; {2569#true} is VALID [2022-02-20 18:31:32,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {2569#true} assume ~id3~0 >= 0; {2569#true} is VALID [2022-02-20 18:31:32,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {2569#true} assume 0 == ~r1~0 % 256; {2569#true} is VALID [2022-02-20 18:31:32,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {2569#true} assume 0 == ~r2~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~r3~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r122~0#1 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r132~0#1 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r212~0#1 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r232~0#1 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r312~0#1 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r322~0#1 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max1~0 == ~id1~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max2~0 == ~id2~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,602 INFO L290 TraceCheckUtils]: 31: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max3~0 == ~id3~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st1~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,603 INFO L290 TraceCheckUtils]: 33: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st2~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st3~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl1~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl2~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl3~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,604 INFO L290 TraceCheckUtils]: 38: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode1~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,605 INFO L290 TraceCheckUtils]: 39: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode2~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode3~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,605 INFO L290 TraceCheckUtils]: 41: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != ~newmax1~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,606 INFO L290 TraceCheckUtils]: 42: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != ~newmax2~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,606 INFO L290 TraceCheckUtils]: 44: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} init_#res#1 := init_~tmp___5~0#1; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,607 INFO L290 TraceCheckUtils]: 45: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,607 INFO L290 TraceCheckUtils]: 46: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,607 INFO L290 TraceCheckUtils]: 47: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,608 INFO L290 TraceCheckUtils]: 48: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,608 INFO L290 TraceCheckUtils]: 49: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode1~0 % 256); {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,608 INFO L290 TraceCheckUtils]: 50: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~r1~0 % 256 < 2; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,609 INFO L290 TraceCheckUtils]: 51: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep12~0 % 256); {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,609 INFO L290 TraceCheckUtils]: 52: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep13~0 % 256); {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,609 INFO L290 TraceCheckUtils]: 53: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} ~mode1~0 := 1; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,610 INFO L290 TraceCheckUtils]: 54: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,610 INFO L290 TraceCheckUtils]: 55: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode2~0 % 256); {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:32,611 INFO L290 TraceCheckUtils]: 56: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(~r2~0 % 256 < 2); {2570#false} is VALID [2022-02-20 18:31:32,611 INFO L290 TraceCheckUtils]: 57: Hoare triple {2570#false} ~mode2~0 := 1; {2570#false} is VALID [2022-02-20 18:31:32,611 INFO L290 TraceCheckUtils]: 58: Hoare triple {2570#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {2570#false} is VALID [2022-02-20 18:31:32,611 INFO L290 TraceCheckUtils]: 59: Hoare triple {2570#false} assume !(0 != ~mode3~0 % 256); {2570#false} is VALID [2022-02-20 18:31:32,611 INFO L290 TraceCheckUtils]: 60: Hoare triple {2570#false} assume !(~r3~0 % 256 < 2); {2570#false} is VALID [2022-02-20 18:31:32,611 INFO L290 TraceCheckUtils]: 61: Hoare triple {2570#false} ~mode3~0 := 1; {2570#false} is VALID [2022-02-20 18:31:32,612 INFO L290 TraceCheckUtils]: 62: Hoare triple {2570#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2570#false} is VALID [2022-02-20 18:31:32,612 INFO L290 TraceCheckUtils]: 63: Hoare triple {2570#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {2570#false} is VALID [2022-02-20 18:31:32,612 INFO L290 TraceCheckUtils]: 64: Hoare triple {2570#false} check_#res#1 := check_~tmp~1#1; {2570#false} is VALID [2022-02-20 18:31:32,612 INFO L290 TraceCheckUtils]: 65: Hoare triple {2570#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2570#false} is VALID [2022-02-20 18:31:32,612 INFO L290 TraceCheckUtils]: 66: Hoare triple {2570#false} assume 0 == assert_~arg#1 % 256; {2570#false} is VALID [2022-02-20 18:31:32,612 INFO L290 TraceCheckUtils]: 67: Hoare triple {2570#false} assume !false; {2570#false} is VALID [2022-02-20 18:31:32,613 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:31:32,613 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:32,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040113517] [2022-02-20 18:31:32,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040113517] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:32,613 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:32,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:32,614 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989350908] [2022-02-20 18:31:32,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:32,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2022-02-20 18:31:32,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:32,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:32,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:32,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:32,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:32,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:32,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:32,661 INFO L87 Difference]: Start difference. First operand 217 states and 336 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:32,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:32,872 INFO L93 Difference]: Finished difference Result 515 states and 824 transitions. [2022-02-20 18:31:32,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:32,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2022-02-20 18:31:32,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:32,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2022-02-20 18:31:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2022-02-20 18:31:32,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 490 transitions. [2022-02-20 18:31:33,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:33,148 INFO L225 Difference]: With dead ends: 515 [2022-02-20 18:31:33,148 INFO L226 Difference]: Without dead ends: 358 [2022-02-20 18:31:33,150 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:31:33,158 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 117 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 401 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:31:33,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 401 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:33,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-02-20 18:31:33,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 354. [2022-02-20 18:31:33,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:33,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 358 states. Second operand has 354 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 353 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:33,198 INFO L74 IsIncluded]: Start isIncluded. First operand 358 states. Second operand has 354 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 353 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:33,198 INFO L87 Difference]: Start difference. First operand 358 states. Second operand has 354 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 353 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:33,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:33,204 INFO L93 Difference]: Finished difference Result 358 states and 562 transitions. [2022-02-20 18:31:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 562 transitions. [2022-02-20 18:31:33,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:33,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:33,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 354 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 353 states have internal predecessors, (559), 0 states have call successors, (0), 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 358 states. [2022-02-20 18:31:33,206 INFO L87 Difference]: Start difference. First operand has 354 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 353 states have internal predecessors, (559), 0 states have call successors, (0), 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 358 states. [2022-02-20 18:31:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:33,212 INFO L93 Difference]: Finished difference Result 358 states and 562 transitions. [2022-02-20 18:31:33,212 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 562 transitions. [2022-02-20 18:31:33,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:33,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:33,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:33,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 353 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 559 transitions. [2022-02-20 18:31:33,219 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 559 transitions. Word has length 68 [2022-02-20 18:31:33,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:33,220 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 559 transitions. [2022-02-20 18:31:33,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:33,220 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 559 transitions. [2022-02-20 18:31:33,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:31:33,222 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:33,222 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:31:33,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:31:33,222 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:33,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:33,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1063335298, now seen corresponding path program 1 times [2022-02-20 18:31:33,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:33,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62727615] [2022-02-20 18:31:33,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:33,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:33,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {4241#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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {4241#true} is VALID [2022-02-20 18:31:33,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {4241#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {4241#true} is VALID [2022-02-20 18:31:33,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {4241#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {4241#true} is VALID [2022-02-20 18:31:33,319 INFO L290 TraceCheckUtils]: 3: Hoare triple {4241#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {4241#true} is VALID [2022-02-20 18:31:33,319 INFO L290 TraceCheckUtils]: 4: Hoare triple {4241#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {4241#true} is VALID [2022-02-20 18:31:33,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {4241#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {4241#true} is VALID [2022-02-20 18:31:33,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {4241#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {4241#true} is VALID [2022-02-20 18:31:33,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {4241#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {4241#true} is VALID [2022-02-20 18:31:33,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {4241#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {4241#true} is VALID [2022-02-20 18:31:33,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {4241#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {4241#true} is VALID [2022-02-20 18:31:33,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {4241#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {4241#true} is VALID [2022-02-20 18:31:33,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {4241#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {4241#true} is VALID [2022-02-20 18:31:33,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {4241#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {4241#true} is VALID [2022-02-20 18:31:33,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {4241#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {4241#true} is VALID [2022-02-20 18:31:33,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {4241#true} assume ~id1~0 != ~id2~0; {4241#true} is VALID [2022-02-20 18:31:33,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {4241#true} assume ~id1~0 != ~id3~0; {4241#true} is VALID [2022-02-20 18:31:33,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {4241#true} assume ~id2~0 != ~id3~0; {4241#true} is VALID [2022-02-20 18:31:33,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {4241#true} assume ~id1~0 >= 0; {4241#true} is VALID [2022-02-20 18:31:33,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {4241#true} assume ~id2~0 >= 0; {4241#true} is VALID [2022-02-20 18:31:33,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {4241#true} assume ~id3~0 >= 0; {4241#true} is VALID [2022-02-20 18:31:33,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {4241#true} assume 0 == ~r1~0 % 256; {4241#true} is VALID [2022-02-20 18:31:33,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {4241#true} assume 0 == ~r2~0 % 256; {4241#true} is VALID [2022-02-20 18:31:33,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {4241#true} assume 0 == ~r3~0 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r122~0#1 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r132~0#1 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r212~0#1 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r232~0#1 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r312~0#1 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r322~0#1 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max1~0 == ~id1~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max2~0 == ~id2~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max3~0 == ~id3~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,325 INFO L290 TraceCheckUtils]: 32: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st1~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st2~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st3~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,331 INFO L290 TraceCheckUtils]: 35: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl1~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl2~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl3~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,335 INFO L290 TraceCheckUtils]: 38: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode1~0 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,335 INFO L290 TraceCheckUtils]: 39: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode2~0 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,335 INFO L290 TraceCheckUtils]: 40: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode3~0 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,336 INFO L290 TraceCheckUtils]: 41: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != ~newmax1~0 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,336 INFO L290 TraceCheckUtils]: 42: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != ~newmax2~0 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,336 INFO L290 TraceCheckUtils]: 43: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,337 INFO L290 TraceCheckUtils]: 44: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} init_#res#1 := init_~tmp___5~0#1; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,337 INFO L290 TraceCheckUtils]: 45: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,337 INFO L290 TraceCheckUtils]: 46: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,338 INFO L290 TraceCheckUtils]: 47: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,338 INFO L290 TraceCheckUtils]: 48: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,338 INFO L290 TraceCheckUtils]: 49: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode1~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,339 INFO L290 TraceCheckUtils]: 50: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r1~0 % 256 < 2; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,339 INFO L290 TraceCheckUtils]: 51: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep12~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,339 INFO L290 TraceCheckUtils]: 52: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep13~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,340 INFO L290 TraceCheckUtils]: 53: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode1~0 := 1; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,340 INFO L290 TraceCheckUtils]: 54: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,340 INFO L290 TraceCheckUtils]: 55: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode2~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,341 INFO L290 TraceCheckUtils]: 56: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r2~0 % 256 < 2; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,341 INFO L290 TraceCheckUtils]: 57: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep21~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,341 INFO L290 TraceCheckUtils]: 58: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep23~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,342 INFO L290 TraceCheckUtils]: 59: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode2~0 := 1; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,342 INFO L290 TraceCheckUtils]: 60: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,342 INFO L290 TraceCheckUtils]: 61: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode3~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:33,343 INFO L290 TraceCheckUtils]: 62: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(~r3~0 % 256 < 2); {4242#false} is VALID [2022-02-20 18:31:33,343 INFO L290 TraceCheckUtils]: 63: Hoare triple {4242#false} ~mode3~0 := 1; {4242#false} is VALID [2022-02-20 18:31:33,343 INFO L290 TraceCheckUtils]: 64: Hoare triple {4242#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {4242#false} is VALID [2022-02-20 18:31:33,343 INFO L290 TraceCheckUtils]: 65: Hoare triple {4242#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {4242#false} is VALID [2022-02-20 18:31:33,343 INFO L290 TraceCheckUtils]: 66: Hoare triple {4242#false} check_#res#1 := check_~tmp~1#1; {4242#false} is VALID [2022-02-20 18:31:33,343 INFO L290 TraceCheckUtils]: 67: Hoare triple {4242#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {4242#false} is VALID [2022-02-20 18:31:33,344 INFO L290 TraceCheckUtils]: 68: Hoare triple {4242#false} assume 0 == assert_~arg#1 % 256; {4242#false} is VALID [2022-02-20 18:31:33,344 INFO L290 TraceCheckUtils]: 69: Hoare triple {4242#false} assume !false; {4242#false} is VALID [2022-02-20 18:31:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:31:33,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:33,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62727615] [2022-02-20 18:31:33,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62727615] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:33,345 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:33,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:33,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163970762] [2022-02-20 18:31:33,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:33,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-20 18:31:33,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:33,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:33,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:33,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:33,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:33,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:33,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:33,400 INFO L87 Difference]: Start difference. First operand 354 states and 559 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:33,723 INFO L93 Difference]: Finished difference Result 910 states and 1465 transitions. [2022-02-20 18:31:33,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:33,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-20 18:31:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2022-02-20 18:31:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2022-02-20 18:31:33,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 490 transitions. [2022-02-20 18:31:34,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:34,033 INFO L225 Difference]: With dead ends: 910 [2022-02-20 18:31:34,034 INFO L226 Difference]: Without dead ends: 616 [2022-02-20 18:31:34,034 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:31:34,035 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 111 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 402 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:31:34,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 402 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:34,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-02-20 18:31:34,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 610. [2022-02-20 18:31:34,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:34,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 616 states. Second operand has 610 states, 609 states have (on average 1.5944170771756978) internal successors, (971), 609 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:34,091 INFO L74 IsIncluded]: Start isIncluded. First operand 616 states. Second operand has 610 states, 609 states have (on average 1.5944170771756978) internal successors, (971), 609 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:34,092 INFO L87 Difference]: Start difference. First operand 616 states. Second operand has 610 states, 609 states have (on average 1.5944170771756978) internal successors, (971), 609 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:34,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:34,106 INFO L93 Difference]: Finished difference Result 616 states and 976 transitions. [2022-02-20 18:31:34,106 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 976 transitions. [2022-02-20 18:31:34,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:34,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:34,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 610 states, 609 states have (on average 1.5944170771756978) internal successors, (971), 609 states have internal predecessors, (971), 0 states have call successors, (0), 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 616 states. [2022-02-20 18:31:34,108 INFO L87 Difference]: Start difference. First operand has 610 states, 609 states have (on average 1.5944170771756978) internal successors, (971), 609 states have internal predecessors, (971), 0 states have call successors, (0), 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 616 states. [2022-02-20 18:31:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:34,121 INFO L93 Difference]: Finished difference Result 616 states and 976 transitions. [2022-02-20 18:31:34,122 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 976 transitions. [2022-02-20 18:31:34,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:34,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:34,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:34,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 609 states have (on average 1.5944170771756978) internal successors, (971), 609 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 971 transitions. [2022-02-20 18:31:34,137 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 971 transitions. Word has length 70 [2022-02-20 18:31:34,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:34,137 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 971 transitions. [2022-02-20 18:31:34,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:34,138 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 971 transitions. [2022-02-20 18:31:34,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:31:34,138 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:34,138 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:31:34,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:31:34,139 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:34,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:34,139 INFO L85 PathProgramCache]: Analyzing trace with hash 845837107, now seen corresponding path program 1 times [2022-02-20 18:31:34,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:34,139 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325324638] [2022-02-20 18:31:34,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:34,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:34,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {7160#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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {7160#true} is VALID [2022-02-20 18:31:34,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {7160#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {7160#true} is VALID [2022-02-20 18:31:34,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {7160#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {7160#true} is VALID [2022-02-20 18:31:34,213 INFO L290 TraceCheckUtils]: 3: Hoare triple {7160#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {7160#true} is VALID [2022-02-20 18:31:34,213 INFO L290 TraceCheckUtils]: 4: Hoare triple {7160#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {7160#true} is VALID [2022-02-20 18:31:34,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {7160#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {7160#true} is VALID [2022-02-20 18:31:34,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {7160#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {7160#true} is VALID [2022-02-20 18:31:34,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {7160#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {7160#true} is VALID [2022-02-20 18:31:34,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {7160#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {7160#true} is VALID [2022-02-20 18:31:34,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {7160#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {7160#true} is VALID [2022-02-20 18:31:34,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {7160#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {7160#true} is VALID [2022-02-20 18:31:34,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {7160#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {7160#true} is VALID [2022-02-20 18:31:34,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {7160#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {7160#true} is VALID [2022-02-20 18:31:34,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {7160#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {7160#true} is VALID [2022-02-20 18:31:34,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {7160#true} assume ~id1~0 != ~id2~0; {7160#true} is VALID [2022-02-20 18:31:34,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {7160#true} assume ~id1~0 != ~id3~0; {7160#true} is VALID [2022-02-20 18:31:34,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {7160#true} assume ~id2~0 != ~id3~0; {7160#true} is VALID [2022-02-20 18:31:34,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {7160#true} assume ~id1~0 >= 0; {7160#true} is VALID [2022-02-20 18:31:34,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {7160#true} assume ~id2~0 >= 0; {7160#true} is VALID [2022-02-20 18:31:34,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {7160#true} assume ~id3~0 >= 0; {7160#true} is VALID [2022-02-20 18:31:34,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {7160#true} assume 0 == ~r1~0 % 256; {7160#true} is VALID [2022-02-20 18:31:34,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {7160#true} assume 0 == ~r2~0 % 256; {7160#true} is VALID [2022-02-20 18:31:34,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {7160#true} assume 0 == ~r3~0 % 256; {7160#true} is VALID [2022-02-20 18:31:34,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {7160#true} assume 0 != init_~r122~0#1 % 256; {7160#true} is VALID [2022-02-20 18:31:34,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {7160#true} assume 0 != init_~r132~0#1 % 256; {7160#true} is VALID [2022-02-20 18:31:34,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {7160#true} assume 0 != init_~r212~0#1 % 256; {7160#true} is VALID [2022-02-20 18:31:34,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {7160#true} assume 0 != init_~r232~0#1 % 256; {7160#true} is VALID [2022-02-20 18:31:34,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {7160#true} assume 0 != init_~r312~0#1 % 256; {7160#true} is VALID [2022-02-20 18:31:34,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {7160#true} assume 0 != init_~r322~0#1 % 256; {7160#true} is VALID [2022-02-20 18:31:34,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {7160#true} assume ~max1~0 == ~id1~0; {7160#true} is VALID [2022-02-20 18:31:34,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {7160#true} assume ~max2~0 == ~id2~0; {7160#true} is VALID [2022-02-20 18:31:34,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {7160#true} assume ~max3~0 == ~id3~0; {7160#true} is VALID [2022-02-20 18:31:34,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {7160#true} assume 0 == ~st1~0; {7162#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:34,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {7162#(<= ~st1~0 0)} assume 0 == ~st2~0; {7163#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {7163#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,221 INFO L290 TraceCheckUtils]: 39: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,221 INFO L290 TraceCheckUtils]: 40: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,222 INFO L290 TraceCheckUtils]: 41: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax1~0 % 256; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,222 INFO L290 TraceCheckUtils]: 42: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax2~0 % 256; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,222 INFO L290 TraceCheckUtils]: 43: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,223 INFO L290 TraceCheckUtils]: 44: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,223 INFO L290 TraceCheckUtils]: 45: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,223 INFO L290 TraceCheckUtils]: 46: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,224 INFO L290 TraceCheckUtils]: 47: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,224 INFO L290 TraceCheckUtils]: 48: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,224 INFO L290 TraceCheckUtils]: 49: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,224 INFO L290 TraceCheckUtils]: 50: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,225 INFO L290 TraceCheckUtils]: 51: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,225 INFO L290 TraceCheckUtils]: 52: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,225 INFO L290 TraceCheckUtils]: 53: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,226 INFO L290 TraceCheckUtils]: 54: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,226 INFO L290 TraceCheckUtils]: 55: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,226 INFO L290 TraceCheckUtils]: 56: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,227 INFO L290 TraceCheckUtils]: 57: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,227 INFO L290 TraceCheckUtils]: 58: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,227 INFO L290 TraceCheckUtils]: 59: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,228 INFO L290 TraceCheckUtils]: 60: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,228 INFO L290 TraceCheckUtils]: 61: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,228 INFO L290 TraceCheckUtils]: 62: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,229 INFO L290 TraceCheckUtils]: 63: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,229 INFO L290 TraceCheckUtils]: 64: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,229 INFO L290 TraceCheckUtils]: 65: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,230 INFO L290 TraceCheckUtils]: 66: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:34,230 INFO L290 TraceCheckUtils]: 67: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {7161#false} is VALID [2022-02-20 18:31:34,230 INFO L290 TraceCheckUtils]: 68: Hoare triple {7161#false} check_#res#1 := check_~tmp~1#1; {7161#false} is VALID [2022-02-20 18:31:34,230 INFO L290 TraceCheckUtils]: 69: Hoare triple {7161#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {7161#false} is VALID [2022-02-20 18:31:34,231 INFO L290 TraceCheckUtils]: 70: Hoare triple {7161#false} assume 0 == assert_~arg#1 % 256; {7161#false} is VALID [2022-02-20 18:31:34,231 INFO L290 TraceCheckUtils]: 71: Hoare triple {7161#false} assume !false; {7161#false} is VALID [2022-02-20 18:31:34,231 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:31:34,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:34,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325324638] [2022-02-20 18:31:34,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325324638] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:34,232 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:34,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:31:34,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039264482] [2022-02-20 18:31:34,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:34,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-02-20 18:31:34,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:34,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:34,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:34,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:31:34,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:34,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:31:34,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:31:34,273 INFO L87 Difference]: Start difference. First operand 610 states and 971 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:35,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:35,533 INFO L93 Difference]: Finished difference Result 2622 states and 4281 transitions. [2022-02-20 18:31:35,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:31:35,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-02-20 18:31:35,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1072 transitions. [2022-02-20 18:31:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:35,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1072 transitions. [2022-02-20 18:31:35,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1072 transitions. [2022-02-20 18:31:36,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1072 edges. 1072 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:36,387 INFO L225 Difference]: With dead ends: 2622 [2022-02-20 18:31:36,387 INFO L226 Difference]: Without dead ends: 2072 [2022-02-20 18:31:36,388 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:31:36,389 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 936 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:36,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [936 Valid, 1286 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:31:36,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2022-02-20 18:31:36,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1092. [2022-02-20 18:31:36,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:36,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2072 states. Second operand has 1092 states, 1091 states have (on average 1.6076993583868011) internal successors, (1754), 1091 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:36,585 INFO L74 IsIncluded]: Start isIncluded. First operand 2072 states. Second operand has 1092 states, 1091 states have (on average 1.6076993583868011) internal successors, (1754), 1091 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:36,587 INFO L87 Difference]: Start difference. First operand 2072 states. Second operand has 1092 states, 1091 states have (on average 1.6076993583868011) internal successors, (1754), 1091 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:36,724 INFO L93 Difference]: Finished difference Result 2072 states and 3362 transitions. [2022-02-20 18:31:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3362 transitions. [2022-02-20 18:31:36,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:36,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:36,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 1092 states, 1091 states have (on average 1.6076993583868011) internal successors, (1754), 1091 states have internal predecessors, (1754), 0 states have call successors, (0), 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 2072 states. [2022-02-20 18:31:36,730 INFO L87 Difference]: Start difference. First operand has 1092 states, 1091 states have (on average 1.6076993583868011) internal successors, (1754), 1091 states have internal predecessors, (1754), 0 states have call successors, (0), 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 2072 states. [2022-02-20 18:31:36,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:36,850 INFO L93 Difference]: Finished difference Result 2072 states and 3362 transitions. [2022-02-20 18:31:36,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3362 transitions. [2022-02-20 18:31:36,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:36,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:36,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:36,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:36,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1091 states have (on average 1.6076993583868011) internal successors, (1754), 1091 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1754 transitions. [2022-02-20 18:31:36,898 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1754 transitions. Word has length 72 [2022-02-20 18:31:36,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:36,898 INFO L470 AbstractCegarLoop]: Abstraction has 1092 states and 1754 transitions. [2022-02-20 18:31:36,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1754 transitions. [2022-02-20 18:31:36,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 18:31:36,899 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:36,899 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:31:36,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:31:36,900 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:36,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:36,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1471686026, now seen corresponding path program 1 times [2022-02-20 18:31:36,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:36,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275929208] [2022-02-20 18:31:36,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:36,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:36,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {15421#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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {15421#true} is VALID [2022-02-20 18:31:36,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {15421#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {15421#true} is VALID [2022-02-20 18:31:36,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {15421#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {15421#true} is VALID [2022-02-20 18:31:36,946 INFO L290 TraceCheckUtils]: 3: Hoare triple {15421#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {15421#true} is VALID [2022-02-20 18:31:36,946 INFO L290 TraceCheckUtils]: 4: Hoare triple {15421#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {15421#true} is VALID [2022-02-20 18:31:36,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {15421#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {15421#true} is VALID [2022-02-20 18:31:36,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {15421#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {15421#true} is VALID [2022-02-20 18:31:36,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {15421#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {15421#true} is VALID [2022-02-20 18:31:36,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {15421#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {15421#true} is VALID [2022-02-20 18:31:36,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {15421#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {15421#true} is VALID [2022-02-20 18:31:36,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {15421#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {15421#true} is VALID [2022-02-20 18:31:36,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {15421#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {15421#true} is VALID [2022-02-20 18:31:36,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {15421#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {15421#true} is VALID [2022-02-20 18:31:36,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {15421#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {15421#true} is VALID [2022-02-20 18:31:36,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {15421#true} assume ~id1~0 != ~id2~0; {15421#true} is VALID [2022-02-20 18:31:36,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {15421#true} assume ~id1~0 != ~id3~0; {15421#true} is VALID [2022-02-20 18:31:36,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {15421#true} assume ~id2~0 != ~id3~0; {15421#true} is VALID [2022-02-20 18:31:36,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {15421#true} assume ~id1~0 >= 0; {15421#true} is VALID [2022-02-20 18:31:36,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {15421#true} assume ~id2~0 >= 0; {15421#true} is VALID [2022-02-20 18:31:36,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {15421#true} assume ~id3~0 >= 0; {15421#true} is VALID [2022-02-20 18:31:36,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {15421#true} assume 0 == ~r1~0 % 256; {15421#true} is VALID [2022-02-20 18:31:36,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {15421#true} assume 0 == ~r2~0 % 256; {15421#true} is VALID [2022-02-20 18:31:36,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {15421#true} assume 0 == ~r3~0 % 256; {15421#true} is VALID [2022-02-20 18:31:36,950 INFO L290 TraceCheckUtils]: 23: Hoare triple {15421#true} assume 0 != init_~r122~0#1 % 256; {15421#true} is VALID [2022-02-20 18:31:36,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {15421#true} assume 0 != init_~r132~0#1 % 256; {15421#true} is VALID [2022-02-20 18:31:36,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {15421#true} assume 0 != init_~r212~0#1 % 256; {15421#true} is VALID [2022-02-20 18:31:36,953 INFO L290 TraceCheckUtils]: 26: Hoare triple {15421#true} assume 0 != init_~r232~0#1 % 256; {15421#true} is VALID [2022-02-20 18:31:36,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {15421#true} assume 0 != init_~r312~0#1 % 256; {15421#true} is VALID [2022-02-20 18:31:36,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {15421#true} assume 0 != init_~r322~0#1 % 256; {15421#true} is VALID [2022-02-20 18:31:36,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {15421#true} assume ~max1~0 == ~id1~0; {15421#true} is VALID [2022-02-20 18:31:36,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {15421#true} assume ~max2~0 == ~id2~0; {15421#true} is VALID [2022-02-20 18:31:36,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {15421#true} assume ~max3~0 == ~id3~0; {15421#true} is VALID [2022-02-20 18:31:36,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {15421#true} assume 0 == ~st1~0; {15423#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:36,960 INFO L290 TraceCheckUtils]: 33: Hoare triple {15423#(<= ~st1~0 0)} assume 0 == ~st2~0; {15423#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:36,960 INFO L290 TraceCheckUtils]: 34: Hoare triple {15423#(<= ~st1~0 0)} assume 0 == ~st3~0; {15423#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:36,961 INFO L290 TraceCheckUtils]: 35: Hoare triple {15423#(<= ~st1~0 0)} assume 0 == ~nl1~0; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,961 INFO L290 TraceCheckUtils]: 36: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,961 INFO L290 TraceCheckUtils]: 38: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,962 INFO L290 TraceCheckUtils]: 39: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,962 INFO L290 TraceCheckUtils]: 40: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,962 INFO L290 TraceCheckUtils]: 41: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax1~0 % 256; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,963 INFO L290 TraceCheckUtils]: 42: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax2~0 % 256; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,963 INFO L290 TraceCheckUtils]: 43: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,963 INFO L290 TraceCheckUtils]: 44: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,963 INFO L290 TraceCheckUtils]: 45: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,964 INFO L290 TraceCheckUtils]: 46: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,964 INFO L290 TraceCheckUtils]: 47: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,964 INFO L290 TraceCheckUtils]: 48: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,965 INFO L290 TraceCheckUtils]: 49: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,965 INFO L290 TraceCheckUtils]: 50: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,965 INFO L290 TraceCheckUtils]: 51: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,965 INFO L290 TraceCheckUtils]: 52: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,966 INFO L290 TraceCheckUtils]: 53: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,966 INFO L290 TraceCheckUtils]: 54: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,967 INFO L290 TraceCheckUtils]: 55: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,967 INFO L290 TraceCheckUtils]: 56: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,967 INFO L290 TraceCheckUtils]: 57: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,968 INFO L290 TraceCheckUtils]: 58: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,968 INFO L290 TraceCheckUtils]: 59: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,968 INFO L290 TraceCheckUtils]: 60: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,969 INFO L290 TraceCheckUtils]: 61: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,969 INFO L290 TraceCheckUtils]: 62: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,969 INFO L290 TraceCheckUtils]: 63: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,969 INFO L290 TraceCheckUtils]: 64: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,970 INFO L290 TraceCheckUtils]: 65: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,970 INFO L290 TraceCheckUtils]: 66: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,970 INFO L290 TraceCheckUtils]: 67: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:36,971 INFO L290 TraceCheckUtils]: 68: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);check_~tmp~1#1 := 0; {15422#false} is VALID [2022-02-20 18:31:36,971 INFO L290 TraceCheckUtils]: 69: Hoare triple {15422#false} check_#res#1 := check_~tmp~1#1; {15422#false} is VALID [2022-02-20 18:31:36,971 INFO L290 TraceCheckUtils]: 70: Hoare triple {15422#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {15422#false} is VALID [2022-02-20 18:31:36,971 INFO L290 TraceCheckUtils]: 71: Hoare triple {15422#false} assume 0 == assert_~arg#1 % 256; {15422#false} is VALID [2022-02-20 18:31:36,971 INFO L290 TraceCheckUtils]: 72: Hoare triple {15422#false} assume !false; {15422#false} is VALID [2022-02-20 18:31:36,973 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:31:36,973 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:36,974 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275929208] [2022-02-20 18:31:36,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275929208] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:36,974 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:36,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:31:36,974 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028118607] [2022-02-20 18:31:36,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:36,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2022-02-20 18:31:36,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:36,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:37,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:37,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:31:37,014 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:37,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:31:37,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:31:37,015 INFO L87 Difference]: Start difference. First operand 1092 states and 1754 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:38,090 INFO L93 Difference]: Finished difference Result 3182 states and 5186 transitions. [2022-02-20 18:31:38,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:31:38,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2022-02-20 18:31:38,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:38,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2022-02-20 18:31:38,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2022-02-20 18:31:38,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 646 transitions. [2022-02-20 18:31:38,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 646 edges. 646 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:38,633 INFO L225 Difference]: With dead ends: 3182 [2022-02-20 18:31:38,634 INFO L226 Difference]: Without dead ends: 2150 [2022-02-20 18:31:38,635 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:31:38,635 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 413 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 638 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:31:38,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 638 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:38,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2022-02-20 18:31:38,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1612. [2022-02-20 18:31:38,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:38,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2150 states. Second operand has 1612 states, 1611 states have (on average 1.6157666045934203) internal successors, (2603), 1611 states have internal predecessors, (2603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:38,950 INFO L74 IsIncluded]: Start isIncluded. First operand 2150 states. Second operand has 1612 states, 1611 states have (on average 1.6157666045934203) internal successors, (2603), 1611 states have internal predecessors, (2603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:38,951 INFO L87 Difference]: Start difference. First operand 2150 states. Second operand has 1612 states, 1611 states have (on average 1.6157666045934203) internal successors, (2603), 1611 states have internal predecessors, (2603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:39,078 INFO L93 Difference]: Finished difference Result 2150 states and 3496 transitions. [2022-02-20 18:31:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 3496 transitions. [2022-02-20 18:31:39,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:39,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:39,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 1612 states, 1611 states have (on average 1.6157666045934203) internal successors, (2603), 1611 states have internal predecessors, (2603), 0 states have call successors, (0), 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 2150 states. [2022-02-20 18:31:39,109 INFO L87 Difference]: Start difference. First operand has 1612 states, 1611 states have (on average 1.6157666045934203) internal successors, (2603), 1611 states have internal predecessors, (2603), 0 states have call successors, (0), 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 2150 states. [2022-02-20 18:31:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:39,246 INFO L93 Difference]: Finished difference Result 2150 states and 3496 transitions. [2022-02-20 18:31:39,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 3496 transitions. [2022-02-20 18:31:39,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:39,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:39,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:39,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:39,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1611 states have (on average 1.6157666045934203) internal successors, (2603), 1611 states have internal predecessors, (2603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:39,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2603 transitions. [2022-02-20 18:31:39,336 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2603 transitions. Word has length 73 [2022-02-20 18:31:39,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:39,336 INFO L470 AbstractCegarLoop]: Abstraction has 1612 states and 2603 transitions. [2022-02-20 18:31:39,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:39,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2603 transitions. [2022-02-20 18:31:39,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:31:39,337 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:39,337 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:31:39,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:31:39,338 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:39,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:39,339 INFO L85 PathProgramCache]: Analyzing trace with hash -131454774, now seen corresponding path program 1 times [2022-02-20 18:31:39,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:39,339 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65898510] [2022-02-20 18:31:39,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:39,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:39,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {25027#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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {25027#true} is VALID [2022-02-20 18:31:39,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {25027#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {25027#true} is VALID [2022-02-20 18:31:39,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {25027#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {25027#true} is VALID [2022-02-20 18:31:39,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {25027#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {25027#true} is VALID [2022-02-20 18:31:39,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {25027#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {25027#true} is VALID [2022-02-20 18:31:39,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {25027#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {25027#true} is VALID [2022-02-20 18:31:39,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {25027#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {25027#true} is VALID [2022-02-20 18:31:39,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {25027#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {25027#true} is VALID [2022-02-20 18:31:39,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {25027#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {25027#true} is VALID [2022-02-20 18:31:39,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {25027#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {25027#true} is VALID [2022-02-20 18:31:39,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {25027#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {25027#true} is VALID [2022-02-20 18:31:39,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {25027#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {25027#true} is VALID [2022-02-20 18:31:39,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {25027#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {25027#true} is VALID [2022-02-20 18:31:39,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {25027#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {25027#true} is VALID [2022-02-20 18:31:39,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {25027#true} assume ~id1~0 != ~id2~0; {25027#true} is VALID [2022-02-20 18:31:39,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {25027#true} assume ~id1~0 != ~id3~0; {25027#true} is VALID [2022-02-20 18:31:39,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {25027#true} assume ~id2~0 != ~id3~0; {25027#true} is VALID [2022-02-20 18:31:39,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {25027#true} assume ~id1~0 >= 0; {25027#true} is VALID [2022-02-20 18:31:39,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {25027#true} assume ~id2~0 >= 0; {25027#true} is VALID [2022-02-20 18:31:39,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {25027#true} assume ~id3~0 >= 0; {25027#true} is VALID [2022-02-20 18:31:39,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {25027#true} assume 0 == ~r1~0 % 256; {25027#true} is VALID [2022-02-20 18:31:39,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {25027#true} assume 0 == ~r2~0 % 256; {25027#true} is VALID [2022-02-20 18:31:39,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {25027#true} assume 0 == ~r3~0 % 256; {25027#true} is VALID [2022-02-20 18:31:39,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {25027#true} assume 0 != init_~r122~0#1 % 256; {25027#true} is VALID [2022-02-20 18:31:39,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {25027#true} assume 0 != init_~r132~0#1 % 256; {25027#true} is VALID [2022-02-20 18:31:39,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {25027#true} assume 0 != init_~r212~0#1 % 256; {25027#true} is VALID [2022-02-20 18:31:39,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {25027#true} assume 0 != init_~r232~0#1 % 256; {25027#true} is VALID [2022-02-20 18:31:39,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {25027#true} assume 0 != init_~r312~0#1 % 256; {25027#true} is VALID [2022-02-20 18:31:39,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {25027#true} assume 0 != init_~r322~0#1 % 256; {25027#true} is VALID [2022-02-20 18:31:39,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {25027#true} assume ~max1~0 == ~id1~0; {25027#true} is VALID [2022-02-20 18:31:39,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {25027#true} assume ~max2~0 == ~id2~0; {25027#true} is VALID [2022-02-20 18:31:39,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {25027#true} assume ~max3~0 == ~id3~0; {25027#true} is VALID [2022-02-20 18:31:39,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {25027#true} assume 0 == ~st1~0; {25027#true} is VALID [2022-02-20 18:31:39,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {25027#true} assume 0 == ~st2~0; {25029#(<= ~st2~0 0)} is VALID [2022-02-20 18:31:39,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {25029#(<= ~st2~0 0)} assume 0 == ~st3~0; {25029#(<= ~st2~0 0)} is VALID [2022-02-20 18:31:39,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {25029#(<= ~st2~0 0)} assume 0 == ~nl1~0; {25029#(<= ~st2~0 0)} is VALID [2022-02-20 18:31:39,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {25029#(<= ~st2~0 0)} assume 0 == ~nl2~0; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,417 INFO L290 TraceCheckUtils]: 38: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,418 INFO L290 TraceCheckUtils]: 41: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax1~0 % 256; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax2~0 % 256; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,419 INFO L290 TraceCheckUtils]: 43: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,419 INFO L290 TraceCheckUtils]: 44: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,420 INFO L290 TraceCheckUtils]: 45: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,420 INFO L290 TraceCheckUtils]: 46: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,420 INFO L290 TraceCheckUtils]: 47: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,421 INFO L290 TraceCheckUtils]: 48: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,421 INFO L290 TraceCheckUtils]: 49: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode1~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,421 INFO L290 TraceCheckUtils]: 50: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 % 256 < 2; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,422 INFO L290 TraceCheckUtils]: 51: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep12~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,422 INFO L290 TraceCheckUtils]: 52: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep13~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,422 INFO L290 TraceCheckUtils]: 53: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,423 INFO L290 TraceCheckUtils]: 54: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,423 INFO L290 TraceCheckUtils]: 55: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode2~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,423 INFO L290 TraceCheckUtils]: 56: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 % 256 < 2; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,423 INFO L290 TraceCheckUtils]: 57: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep21~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,424 INFO L290 TraceCheckUtils]: 58: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep23~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,424 INFO L290 TraceCheckUtils]: 59: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,424 INFO L290 TraceCheckUtils]: 60: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,425 INFO L290 TraceCheckUtils]: 61: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode3~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,425 INFO L290 TraceCheckUtils]: 62: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 % 256 < 2; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,425 INFO L290 TraceCheckUtils]: 63: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep31~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,426 INFO L290 TraceCheckUtils]: 64: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep32~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,426 INFO L290 TraceCheckUtils]: 65: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,426 INFO L290 TraceCheckUtils]: 66: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,427 INFO L290 TraceCheckUtils]: 67: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,427 INFO L290 TraceCheckUtils]: 68: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:39,428 INFO L290 TraceCheckUtils]: 69: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);check_~tmp~1#1 := 0; {25028#false} is VALID [2022-02-20 18:31:39,428 INFO L290 TraceCheckUtils]: 70: Hoare triple {25028#false} check_#res#1 := check_~tmp~1#1; {25028#false} is VALID [2022-02-20 18:31:39,428 INFO L290 TraceCheckUtils]: 71: Hoare triple {25028#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {25028#false} is VALID [2022-02-20 18:31:39,428 INFO L290 TraceCheckUtils]: 72: Hoare triple {25028#false} assume 0 == assert_~arg#1 % 256; {25028#false} is VALID [2022-02-20 18:31:39,428 INFO L290 TraceCheckUtils]: 73: Hoare triple {25028#false} assume !false; {25028#false} is VALID [2022-02-20 18:31:39,429 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:31:39,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:39,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65898510] [2022-02-20 18:31:39,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65898510] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:39,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:39,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:31:39,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469705534] [2022-02-20 18:31:39,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:39,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-02-20 18:31:39,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:39,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:39,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:39,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:31:39,468 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:39,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:31:39,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:31:39,469 INFO L87 Difference]: Start difference. First operand 1612 states and 2603 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:41,168 INFO L93 Difference]: Finished difference Result 4676 states and 7610 transitions. [2022-02-20 18:31:41,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:31:41,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-02-20 18:31:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:41,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2022-02-20 18:31:41,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:41,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2022-02-20 18:31:41,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 646 transitions. [2022-02-20 18:31:41,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 646 edges. 646 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:41,818 INFO L225 Difference]: With dead ends: 4676 [2022-02-20 18:31:41,819 INFO L226 Difference]: Without dead ends: 3124 [2022-02-20 18:31:41,820 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:31:41,821 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 411 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:41,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 724 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:41,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2022-02-20 18:31:42,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 2356. [2022-02-20 18:31:42,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:42,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3124 states. Second operand has 2356 states, 2355 states have (on average 1.6148619957537156) internal successors, (3803), 2355 states have internal predecessors, (3803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:42,413 INFO L74 IsIncluded]: Start isIncluded. First operand 3124 states. Second operand has 2356 states, 2355 states have (on average 1.6148619957537156) internal successors, (3803), 2355 states have internal predecessors, (3803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:42,414 INFO L87 Difference]: Start difference. First operand 3124 states. Second operand has 2356 states, 2355 states have (on average 1.6148619957537156) internal successors, (3803), 2355 states have internal predecessors, (3803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:42,716 INFO L93 Difference]: Finished difference Result 3124 states and 5065 transitions. [2022-02-20 18:31:42,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 5065 transitions. [2022-02-20 18:31:42,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:42,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:42,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 2356 states, 2355 states have (on average 1.6148619957537156) internal successors, (3803), 2355 states have internal predecessors, (3803), 0 states have call successors, (0), 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 3124 states. [2022-02-20 18:31:42,726 INFO L87 Difference]: Start difference. First operand has 2356 states, 2355 states have (on average 1.6148619957537156) internal successors, (3803), 2355 states have internal predecessors, (3803), 0 states have call successors, (0), 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 3124 states. [2022-02-20 18:31:43,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:43,009 INFO L93 Difference]: Finished difference Result 3124 states and 5065 transitions. [2022-02-20 18:31:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 5065 transitions. [2022-02-20 18:31:43,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:43,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:43,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:43,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:43,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 2355 states have (on average 1.6148619957537156) internal successors, (3803), 2355 states have internal predecessors, (3803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 3803 transitions. [2022-02-20 18:31:43,195 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 3803 transitions. Word has length 74 [2022-02-20 18:31:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:43,195 INFO L470 AbstractCegarLoop]: Abstraction has 2356 states and 3803 transitions. [2022-02-20 18:31:43,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 3803 transitions. [2022-02-20 18:31:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 18:31:43,197 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:43,197 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:31:43,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:31:43,197 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:43,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:43,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1364954579, now seen corresponding path program 1 times [2022-02-20 18:31:43,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:43,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111212351] [2022-02-20 18:31:43,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:43,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:43,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {39050#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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {39050#true} is VALID [2022-02-20 18:31:43,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {39050#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {39050#true} is VALID [2022-02-20 18:31:43,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {39050#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {39050#true} is VALID [2022-02-20 18:31:43,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {39050#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {39050#true} is VALID [2022-02-20 18:31:43,258 INFO L290 TraceCheckUtils]: 4: Hoare triple {39050#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {39050#true} is VALID [2022-02-20 18:31:43,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {39050#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {39050#true} is VALID [2022-02-20 18:31:43,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {39050#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {39050#true} is VALID [2022-02-20 18:31:43,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {39050#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {39050#true} is VALID [2022-02-20 18:31:43,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {39050#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {39050#true} is VALID [2022-02-20 18:31:43,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {39050#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {39050#true} is VALID [2022-02-20 18:31:43,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {39050#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {39050#true} is VALID [2022-02-20 18:31:43,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {39050#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {39050#true} is VALID [2022-02-20 18:31:43,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {39050#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {39050#true} is VALID [2022-02-20 18:31:43,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {39050#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {39050#true} is VALID [2022-02-20 18:31:43,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {39050#true} assume ~id1~0 != ~id2~0; {39050#true} is VALID [2022-02-20 18:31:43,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {39050#true} assume ~id1~0 != ~id3~0; {39050#true} is VALID [2022-02-20 18:31:43,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {39050#true} assume ~id2~0 != ~id3~0; {39050#true} is VALID [2022-02-20 18:31:43,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {39050#true} assume ~id1~0 >= 0; {39050#true} is VALID [2022-02-20 18:31:43,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {39050#true} assume ~id2~0 >= 0; {39050#true} is VALID [2022-02-20 18:31:43,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {39050#true} assume ~id3~0 >= 0; {39050#true} is VALID [2022-02-20 18:31:43,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {39050#true} assume 0 == ~r1~0 % 256; {39050#true} is VALID [2022-02-20 18:31:43,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {39050#true} assume 0 == ~r2~0 % 256; {39050#true} is VALID [2022-02-20 18:31:43,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {39050#true} assume 0 == ~r3~0 % 256; {39050#true} is VALID [2022-02-20 18:31:43,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {39050#true} assume 0 != init_~r122~0#1 % 256; {39050#true} is VALID [2022-02-20 18:31:43,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {39050#true} assume 0 != init_~r132~0#1 % 256; {39050#true} is VALID [2022-02-20 18:31:43,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {39050#true} assume 0 != init_~r212~0#1 % 256; {39050#true} is VALID [2022-02-20 18:31:43,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {39050#true} assume 0 != init_~r232~0#1 % 256; {39050#true} is VALID [2022-02-20 18:31:43,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {39050#true} assume 0 != init_~r312~0#1 % 256; {39050#true} is VALID [2022-02-20 18:31:43,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {39050#true} assume 0 != init_~r322~0#1 % 256; {39050#true} is VALID [2022-02-20 18:31:43,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {39050#true} assume ~max1~0 == ~id1~0; {39050#true} is VALID [2022-02-20 18:31:43,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {39050#true} assume ~max2~0 == ~id2~0; {39050#true} is VALID [2022-02-20 18:31:43,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {39050#true} assume ~max3~0 == ~id3~0; {39050#true} is VALID [2022-02-20 18:31:43,262 INFO L290 TraceCheckUtils]: 32: Hoare triple {39050#true} assume 0 == ~st1~0; {39050#true} is VALID [2022-02-20 18:31:43,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {39050#true} assume 0 == ~st2~0; {39050#true} is VALID [2022-02-20 18:31:43,263 INFO L290 TraceCheckUtils]: 34: Hoare triple {39050#true} assume 0 == ~st3~0; {39052#(<= ~st3~0 0)} is VALID [2022-02-20 18:31:43,263 INFO L290 TraceCheckUtils]: 35: Hoare triple {39052#(<= ~st3~0 0)} assume 0 == ~nl1~0; {39052#(<= ~st3~0 0)} is VALID [2022-02-20 18:31:43,263 INFO L290 TraceCheckUtils]: 36: Hoare triple {39052#(<= ~st3~0 0)} assume 0 == ~nl2~0; {39052#(<= ~st3~0 0)} is VALID [2022-02-20 18:31:43,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {39052#(<= ~st3~0 0)} assume 0 == ~nl3~0; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax1~0 % 256; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,265 INFO L290 TraceCheckUtils]: 42: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax2~0 % 256; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,266 INFO L290 TraceCheckUtils]: 43: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,266 INFO L290 TraceCheckUtils]: 44: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,266 INFO L290 TraceCheckUtils]: 45: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,266 INFO L290 TraceCheckUtils]: 46: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,267 INFO L290 TraceCheckUtils]: 47: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,267 INFO L290 TraceCheckUtils]: 48: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,267 INFO L290 TraceCheckUtils]: 49: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode1~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,268 INFO L290 TraceCheckUtils]: 50: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 % 256 < 2; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,268 INFO L290 TraceCheckUtils]: 51: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep12~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,268 INFO L290 TraceCheckUtils]: 52: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep13~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,269 INFO L290 TraceCheckUtils]: 53: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,269 INFO L290 TraceCheckUtils]: 54: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,269 INFO L290 TraceCheckUtils]: 55: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode2~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,270 INFO L290 TraceCheckUtils]: 56: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 % 256 < 2; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,270 INFO L290 TraceCheckUtils]: 57: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep21~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,270 INFO L290 TraceCheckUtils]: 58: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep23~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,270 INFO L290 TraceCheckUtils]: 59: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,271 INFO L290 TraceCheckUtils]: 60: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,271 INFO L290 TraceCheckUtils]: 61: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode3~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,271 INFO L290 TraceCheckUtils]: 62: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 % 256 < 2; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,272 INFO L290 TraceCheckUtils]: 63: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep31~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,272 INFO L290 TraceCheckUtils]: 64: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep32~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,272 INFO L290 TraceCheckUtils]: 65: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,273 INFO L290 TraceCheckUtils]: 66: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,273 INFO L290 TraceCheckUtils]: 67: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,273 INFO L290 TraceCheckUtils]: 68: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,274 INFO L290 TraceCheckUtils]: 69: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:43,274 INFO L290 TraceCheckUtils]: 70: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);check_~tmp~1#1 := 0; {39051#false} is VALID [2022-02-20 18:31:43,274 INFO L290 TraceCheckUtils]: 71: Hoare triple {39051#false} check_#res#1 := check_~tmp~1#1; {39051#false} is VALID [2022-02-20 18:31:43,274 INFO L290 TraceCheckUtils]: 72: Hoare triple {39051#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {39051#false} is VALID [2022-02-20 18:31:43,274 INFO L290 TraceCheckUtils]: 73: Hoare triple {39051#false} assume 0 == assert_~arg#1 % 256; {39051#false} is VALID [2022-02-20 18:31:43,275 INFO L290 TraceCheckUtils]: 74: Hoare triple {39051#false} assume !false; {39051#false} is VALID [2022-02-20 18:31:43,275 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:31:43,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:43,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111212351] [2022-02-20 18:31:43,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111212351] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:43,276 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:43,276 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:31:43,276 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544220798] [2022-02-20 18:31:43,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:43,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-02-20 18:31:43,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:43,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:43,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:43,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:31:43,321 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:43,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:31:43,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:31:43,322 INFO L87 Difference]: Start difference. First operand 2356 states and 3803 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:46,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:46,484 INFO L93 Difference]: Finished difference Result 6796 states and 11038 transitions. [2022-02-20 18:31:46,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:31:46,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-02-20 18:31:46,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2022-02-20 18:31:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2022-02-20 18:31:46,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 646 transitions. [2022-02-20 18:31:46,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 646 edges. 646 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:47,394 INFO L225 Difference]: With dead ends: 6796 [2022-02-20 18:31:47,394 INFO L226 Difference]: Without dead ends: 4500 [2022-02-20 18:31:47,396 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:31:47,397 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 409 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:47,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 733 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4500 states. [2022-02-20 18:31:48,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4500 to 3412. [2022-02-20 18:31:48,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:48,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4500 states. Second operand has 3412 states, 3411 states have (on average 1.612723541483436) internal successors, (5501), 3411 states have internal predecessors, (5501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:48,485 INFO L74 IsIncluded]: Start isIncluded. First operand 4500 states. Second operand has 3412 states, 3411 states have (on average 1.612723541483436) internal successors, (5501), 3411 states have internal predecessors, (5501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:48,488 INFO L87 Difference]: Start difference. First operand 4500 states. Second operand has 3412 states, 3411 states have (on average 1.612723541483436) internal successors, (5501), 3411 states have internal predecessors, (5501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:49,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:49,038 INFO L93 Difference]: Finished difference Result 4500 states and 7285 transitions. [2022-02-20 18:31:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4500 states and 7285 transitions. [2022-02-20 18:31:49,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:49,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:49,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 3412 states, 3411 states have (on average 1.612723541483436) internal successors, (5501), 3411 states have internal predecessors, (5501), 0 states have call successors, (0), 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 4500 states. [2022-02-20 18:31:49,049 INFO L87 Difference]: Start difference. First operand has 3412 states, 3411 states have (on average 1.612723541483436) internal successors, (5501), 3411 states have internal predecessors, (5501), 0 states have call successors, (0), 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 4500 states. [2022-02-20 18:31:49,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:49,599 INFO L93 Difference]: Finished difference Result 4500 states and 7285 transitions. [2022-02-20 18:31:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4500 states and 7285 transitions. [2022-02-20 18:31:49,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:49,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:49,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:49,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:49,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3412 states, 3411 states have (on average 1.612723541483436) internal successors, (5501), 3411 states have internal predecessors, (5501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3412 states to 3412 states and 5501 transitions. [2022-02-20 18:31:49,991 INFO L78 Accepts]: Start accepts. Automaton has 3412 states and 5501 transitions. Word has length 75 [2022-02-20 18:31:49,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:49,992 INFO L470 AbstractCegarLoop]: Abstraction has 3412 states and 5501 transitions. [2022-02-20 18:31:49,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:49,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 5501 transitions. [2022-02-20 18:31:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:31:49,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:49,993 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:31:49,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:31:49,993 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:49,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:49,994 INFO L85 PathProgramCache]: Analyzing trace with hash 915332421, now seen corresponding path program 1 times [2022-02-20 18:31:49,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:49,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220872013] [2022-02-20 18:31:49,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:49,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:50,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {59328#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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {59328#true} is VALID [2022-02-20 18:31:50,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {59328#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {59328#true} is VALID [2022-02-20 18:31:50,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {59328#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {59328#true} is VALID [2022-02-20 18:31:50,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {59328#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {59328#true} is VALID [2022-02-20 18:31:50,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {59328#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {59328#true} is VALID [2022-02-20 18:31:50,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {59328#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {59328#true} is VALID [2022-02-20 18:31:50,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {59328#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {59328#true} is VALID [2022-02-20 18:31:50,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {59328#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {59328#true} is VALID [2022-02-20 18:31:50,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {59328#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {59328#true} is VALID [2022-02-20 18:31:50,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {59328#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {59328#true} is VALID [2022-02-20 18:31:50,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {59328#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {59328#true} is VALID [2022-02-20 18:31:50,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {59328#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {59328#true} is VALID [2022-02-20 18:31:50,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {59328#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {59328#true} is VALID [2022-02-20 18:31:50,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {59328#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {59328#true} is VALID [2022-02-20 18:31:50,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {59328#true} assume ~id1~0 != ~id2~0; {59328#true} is VALID [2022-02-20 18:31:50,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {59328#true} assume ~id1~0 != ~id3~0; {59328#true} is VALID [2022-02-20 18:31:50,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {59328#true} assume ~id2~0 != ~id3~0; {59328#true} is VALID [2022-02-20 18:31:50,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {59328#true} assume ~id1~0 >= 0; {59328#true} is VALID [2022-02-20 18:31:50,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {59328#true} assume ~id2~0 >= 0; {59328#true} is VALID [2022-02-20 18:31:50,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {59328#true} assume ~id3~0 >= 0; {59328#true} is VALID [2022-02-20 18:31:50,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {59328#true} assume 0 == ~r1~0 % 256; {59328#true} is VALID [2022-02-20 18:31:50,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {59328#true} assume 0 == ~r2~0 % 256; {59328#true} is VALID [2022-02-20 18:31:50,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {59328#true} assume 0 == ~r3~0 % 256; {59328#true} is VALID [2022-02-20 18:31:50,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {59328#true} assume 0 != init_~r122~0#1 % 256; {59328#true} is VALID [2022-02-20 18:31:50,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {59328#true} assume 0 != init_~r132~0#1 % 256; {59328#true} is VALID [2022-02-20 18:31:50,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {59328#true} assume 0 != init_~r212~0#1 % 256; {59328#true} is VALID [2022-02-20 18:31:50,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {59328#true} assume 0 != init_~r232~0#1 % 256; {59328#true} is VALID [2022-02-20 18:31:50,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {59328#true} assume 0 != init_~r312~0#1 % 256; {59328#true} is VALID [2022-02-20 18:31:50,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {59328#true} assume 0 != init_~r322~0#1 % 256; {59328#true} is VALID [2022-02-20 18:31:50,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {59328#true} assume ~max1~0 == ~id1~0; {59328#true} is VALID [2022-02-20 18:31:50,031 INFO L290 TraceCheckUtils]: 30: Hoare triple {59328#true} assume ~max2~0 == ~id2~0; {59328#true} is VALID [2022-02-20 18:31:50,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {59328#true} assume ~max3~0 == ~id3~0; {59328#true} is VALID [2022-02-20 18:31:50,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {59328#true} assume 0 == ~st1~0; {59328#true} is VALID [2022-02-20 18:31:50,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {59328#true} assume 0 == ~st2~0; {59328#true} is VALID [2022-02-20 18:31:50,031 INFO L290 TraceCheckUtils]: 34: Hoare triple {59328#true} assume 0 == ~st3~0; {59328#true} is VALID [2022-02-20 18:31:50,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {59328#true} assume 0 == ~nl1~0; {59328#true} is VALID [2022-02-20 18:31:50,032 INFO L290 TraceCheckUtils]: 36: Hoare triple {59328#true} assume 0 == ~nl2~0; {59328#true} is VALID [2022-02-20 18:31:50,032 INFO L290 TraceCheckUtils]: 37: Hoare triple {59328#true} assume 0 == ~nl3~0; {59328#true} is VALID [2022-02-20 18:31:50,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {59328#true} assume 0 == ~mode1~0 % 256; {59328#true} is VALID [2022-02-20 18:31:50,032 INFO L290 TraceCheckUtils]: 39: Hoare triple {59328#true} assume 0 == ~mode2~0 % 256; {59328#true} is VALID [2022-02-20 18:31:50,032 INFO L290 TraceCheckUtils]: 40: Hoare triple {59328#true} assume 0 == ~mode3~0 % 256; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,033 INFO L290 TraceCheckUtils]: 41: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax1~0 % 256; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,033 INFO L290 TraceCheckUtils]: 42: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax2~0 % 256; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,033 INFO L290 TraceCheckUtils]: 43: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,034 INFO L290 TraceCheckUtils]: 44: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,034 INFO L290 TraceCheckUtils]: 45: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,034 INFO L290 TraceCheckUtils]: 46: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,035 INFO L290 TraceCheckUtils]: 47: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,035 INFO L290 TraceCheckUtils]: 48: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,036 INFO L290 TraceCheckUtils]: 49: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,036 INFO L290 TraceCheckUtils]: 50: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 % 256 < 2; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,036 INFO L290 TraceCheckUtils]: 51: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep12~0 % 256); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,037 INFO L290 TraceCheckUtils]: 52: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep13~0 % 256); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,037 INFO L290 TraceCheckUtils]: 53: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,037 INFO L290 TraceCheckUtils]: 54: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,038 INFO L290 TraceCheckUtils]: 55: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,038 INFO L290 TraceCheckUtils]: 56: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 % 256 < 2; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,038 INFO L290 TraceCheckUtils]: 57: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep21~0 % 256); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,039 INFO L290 TraceCheckUtils]: 58: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep23~0 % 256); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,039 INFO L290 TraceCheckUtils]: 59: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,039 INFO L290 TraceCheckUtils]: 60: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:50,040 INFO L290 TraceCheckUtils]: 61: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256; {59329#false} is VALID [2022-02-20 18:31:50,040 INFO L290 TraceCheckUtils]: 62: Hoare triple {59329#false} assume !(255 == ~r3~0 % 256); {59329#false} is VALID [2022-02-20 18:31:50,040 INFO L290 TraceCheckUtils]: 63: Hoare triple {59329#false} ~r3~0 := 1 + ~r3~0 % 256; {59329#false} is VALID [2022-02-20 18:31:50,040 INFO L290 TraceCheckUtils]: 64: Hoare triple {59329#false} assume !(0 != ~ep13~0 % 256); {59329#false} is VALID [2022-02-20 18:31:50,040 INFO L290 TraceCheckUtils]: 65: Hoare triple {59329#false} assume !(0 != ~ep23~0 % 256); {59329#false} is VALID [2022-02-20 18:31:50,040 INFO L290 TraceCheckUtils]: 66: Hoare triple {59329#false} ~newmax3~0 := node3_~newmax~2#1; {59329#false} is VALID [2022-02-20 18:31:50,040 INFO L290 TraceCheckUtils]: 67: Hoare triple {59329#false} assume 2 == ~r3~0 % 256; {59329#false} is VALID [2022-02-20 18:31:50,041 INFO L290 TraceCheckUtils]: 68: Hoare triple {59329#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {59329#false} is VALID [2022-02-20 18:31:50,041 INFO L290 TraceCheckUtils]: 69: Hoare triple {59329#false} ~mode3~0 := 0; {59329#false} is VALID [2022-02-20 18:31:50,041 INFO L290 TraceCheckUtils]: 70: Hoare triple {59329#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {59329#false} is VALID [2022-02-20 18:31:50,041 INFO L290 TraceCheckUtils]: 71: Hoare triple {59329#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {59329#false} is VALID [2022-02-20 18:31:50,041 INFO L290 TraceCheckUtils]: 72: Hoare triple {59329#false} check_#res#1 := check_~tmp~1#1; {59329#false} is VALID [2022-02-20 18:31:50,041 INFO L290 TraceCheckUtils]: 73: Hoare triple {59329#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {59329#false} is VALID [2022-02-20 18:31:50,041 INFO L290 TraceCheckUtils]: 74: Hoare triple {59329#false} assume 0 == assert_~arg#1 % 256; {59329#false} is VALID [2022-02-20 18:31:50,041 INFO L290 TraceCheckUtils]: 75: Hoare triple {59329#false} assume !false; {59329#false} is VALID [2022-02-20 18:31:50,042 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:31:50,042 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:50,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220872013] [2022-02-20 18:31:50,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220872013] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:50,042 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:50,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:50,042 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948573122] [2022-02-20 18:31:50,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:50,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:31:50,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:50,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:50,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:50,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:50,090 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:50,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:50,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:50,090 INFO L87 Difference]: Start difference. First operand 3412 states and 5501 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:54,024 INFO L93 Difference]: Finished difference Result 7762 states and 12522 transitions. [2022-02-20 18:31:54,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:54,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:31:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2022-02-20 18:31:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2022-02-20 18:31:54,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 470 transitions. [2022-02-20 18:31:54,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:55,203 INFO L225 Difference]: With dead ends: 7762 [2022-02-20 18:31:55,204 INFO L226 Difference]: Without dead ends: 5340 [2022-02-20 18:31:55,206 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:31:55,206 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 110 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 443 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:31:55,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 443 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5340 states. [2022-02-20 18:31:57,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5340 to 5338. [2022-02-20 18:31:57,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:57,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5340 states. Second operand has 5338 states, 5337 states have (on average 1.6001498969458496) internal successors, (8540), 5337 states have internal predecessors, (8540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:57,262 INFO L74 IsIncluded]: Start isIncluded. First operand 5340 states. Second operand has 5338 states, 5337 states have (on average 1.6001498969458496) internal successors, (8540), 5337 states have internal predecessors, (8540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:57,267 INFO L87 Difference]: Start difference. First operand 5340 states. Second operand has 5338 states, 5337 states have (on average 1.6001498969458496) internal successors, (8540), 5337 states have internal predecessors, (8540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:58,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:58,005 INFO L93 Difference]: Finished difference Result 5340 states and 8541 transitions. [2022-02-20 18:31:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 5340 states and 8541 transitions. [2022-02-20 18:31:58,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:58,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:58,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 5338 states, 5337 states have (on average 1.6001498969458496) internal successors, (8540), 5337 states have internal predecessors, (8540), 0 states have call successors, (0), 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 5340 states. [2022-02-20 18:31:58,019 INFO L87 Difference]: Start difference. First operand has 5338 states, 5337 states have (on average 1.6001498969458496) internal successors, (8540), 5337 states have internal predecessors, (8540), 0 states have call successors, (0), 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 5340 states. [2022-02-20 18:31:58,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:58,784 INFO L93 Difference]: Finished difference Result 5340 states and 8541 transitions. [2022-02-20 18:31:58,784 INFO L276 IsEmpty]: Start isEmpty. Operand 5340 states and 8541 transitions. [2022-02-20 18:31:58,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:58,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:58,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:58,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5338 states, 5337 states have (on average 1.6001498969458496) internal successors, (8540), 5337 states have internal predecessors, (8540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5338 states to 5338 states and 8540 transitions. [2022-02-20 18:31:59,662 INFO L78 Accepts]: Start accepts. Automaton has 5338 states and 8540 transitions. Word has length 76 [2022-02-20 18:31:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:59,662 INFO L470 AbstractCegarLoop]: Abstraction has 5338 states and 8540 transitions. [2022-02-20 18:31:59,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 5338 states and 8540 transitions. [2022-02-20 18:31:59,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:31:59,663 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:59,663 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:31:59,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:31:59,664 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:59,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:59,664 INFO L85 PathProgramCache]: Analyzing trace with hash -318395451, now seen corresponding path program 1 times [2022-02-20 18:31:59,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:59,665 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538578989] [2022-02-20 18:31:59,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:59,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:59,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {84591#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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {84591#true} is VALID [2022-02-20 18:31:59,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {84591#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {84591#true} is VALID [2022-02-20 18:31:59,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {84591#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {84591#true} is VALID [2022-02-20 18:31:59,708 INFO L290 TraceCheckUtils]: 3: Hoare triple {84591#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {84591#true} is VALID [2022-02-20 18:31:59,709 INFO L290 TraceCheckUtils]: 4: Hoare triple {84591#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {84591#true} is VALID [2022-02-20 18:31:59,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {84591#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {84591#true} is VALID [2022-02-20 18:31:59,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {84591#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {84591#true} is VALID [2022-02-20 18:31:59,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {84591#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {84591#true} is VALID [2022-02-20 18:31:59,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {84591#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {84591#true} is VALID [2022-02-20 18:31:59,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {84591#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {84591#true} is VALID [2022-02-20 18:31:59,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {84591#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {84591#true} is VALID [2022-02-20 18:31:59,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {84591#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {84591#true} is VALID [2022-02-20 18:31:59,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {84591#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {84591#true} is VALID [2022-02-20 18:31:59,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {84591#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {84591#true} is VALID [2022-02-20 18:31:59,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {84591#true} assume ~id1~0 != ~id2~0; {84591#true} is VALID [2022-02-20 18:31:59,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {84591#true} assume ~id1~0 != ~id3~0; {84591#true} is VALID [2022-02-20 18:31:59,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {84591#true} assume ~id2~0 != ~id3~0; {84591#true} is VALID [2022-02-20 18:31:59,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {84591#true} assume ~id1~0 >= 0; {84591#true} is VALID [2022-02-20 18:31:59,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {84591#true} assume ~id2~0 >= 0; {84591#true} is VALID [2022-02-20 18:31:59,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {84591#true} assume ~id3~0 >= 0; {84591#true} is VALID [2022-02-20 18:31:59,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {84591#true} assume 0 == ~r1~0 % 256; {84591#true} is VALID [2022-02-20 18:31:59,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {84591#true} assume 0 == ~r2~0 % 256; {84591#true} is VALID [2022-02-20 18:31:59,711 INFO L290 TraceCheckUtils]: 22: Hoare triple {84591#true} assume 0 == ~r3~0 % 256; {84591#true} is VALID [2022-02-20 18:31:59,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {84591#true} assume 0 != init_~r122~0#1 % 256; {84591#true} is VALID [2022-02-20 18:31:59,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {84591#true} assume 0 != init_~r132~0#1 % 256; {84591#true} is VALID [2022-02-20 18:31:59,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {84591#true} assume 0 != init_~r212~0#1 % 256; {84591#true} is VALID [2022-02-20 18:31:59,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {84591#true} assume 0 != init_~r232~0#1 % 256; {84591#true} is VALID [2022-02-20 18:31:59,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {84591#true} assume 0 != init_~r312~0#1 % 256; {84591#true} is VALID [2022-02-20 18:31:59,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {84591#true} assume 0 != init_~r322~0#1 % 256; {84591#true} is VALID [2022-02-20 18:31:59,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {84591#true} assume ~max1~0 == ~id1~0; {84591#true} is VALID [2022-02-20 18:31:59,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {84591#true} assume ~max2~0 == ~id2~0; {84591#true} is VALID [2022-02-20 18:31:59,712 INFO L290 TraceCheckUtils]: 31: Hoare triple {84591#true} assume ~max3~0 == ~id3~0; {84591#true} is VALID [2022-02-20 18:31:59,712 INFO L290 TraceCheckUtils]: 32: Hoare triple {84591#true} assume 0 == ~st1~0; {84591#true} is VALID [2022-02-20 18:31:59,712 INFO L290 TraceCheckUtils]: 33: Hoare triple {84591#true} assume 0 == ~st2~0; {84591#true} is VALID [2022-02-20 18:31:59,712 INFO L290 TraceCheckUtils]: 34: Hoare triple {84591#true} assume 0 == ~st3~0; {84591#true} is VALID [2022-02-20 18:31:59,712 INFO L290 TraceCheckUtils]: 35: Hoare triple {84591#true} assume 0 == ~nl1~0; {84591#true} is VALID [2022-02-20 18:31:59,712 INFO L290 TraceCheckUtils]: 36: Hoare triple {84591#true} assume 0 == ~nl2~0; {84591#true} is VALID [2022-02-20 18:31:59,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {84591#true} assume 0 == ~nl3~0; {84591#true} is VALID [2022-02-20 18:31:59,712 INFO L290 TraceCheckUtils]: 38: Hoare triple {84591#true} assume 0 == ~mode1~0 % 256; {84591#true} is VALID [2022-02-20 18:31:59,713 INFO L290 TraceCheckUtils]: 39: Hoare triple {84591#true} assume 0 == ~mode2~0 % 256; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:59,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:59,714 INFO L290 TraceCheckUtils]: 41: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax1~0 % 256; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:59,714 INFO L290 TraceCheckUtils]: 42: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax2~0 % 256; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:59,714 INFO L290 TraceCheckUtils]: 43: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:59,715 INFO L290 TraceCheckUtils]: 44: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:59,715 INFO L290 TraceCheckUtils]: 45: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:59,715 INFO L290 TraceCheckUtils]: 46: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:59,716 INFO L290 TraceCheckUtils]: 47: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:59,716 INFO L290 TraceCheckUtils]: 48: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:59,716 INFO L290 TraceCheckUtils]: 49: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:59,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 % 256 < 2; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:59,717 INFO L290 TraceCheckUtils]: 51: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep12~0 % 256); {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:59,717 INFO L290 TraceCheckUtils]: 52: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep13~0 % 256); {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:59,718 INFO L290 TraceCheckUtils]: 53: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:59,718 INFO L290 TraceCheckUtils]: 54: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:59,718 INFO L290 TraceCheckUtils]: 55: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256; {84592#false} is VALID [2022-02-20 18:31:59,719 INFO L290 TraceCheckUtils]: 56: Hoare triple {84592#false} assume !(255 == ~r2~0 % 256); {84592#false} is VALID [2022-02-20 18:31:59,719 INFO L290 TraceCheckUtils]: 57: Hoare triple {84592#false} ~r2~0 := 1 + ~r2~0 % 256; {84592#false} is VALID [2022-02-20 18:31:59,719 INFO L290 TraceCheckUtils]: 58: Hoare triple {84592#false} assume !(0 != ~ep12~0 % 256); {84592#false} is VALID [2022-02-20 18:31:59,719 INFO L290 TraceCheckUtils]: 59: Hoare triple {84592#false} assume !(0 != ~ep32~0 % 256); {84592#false} is VALID [2022-02-20 18:31:59,719 INFO L290 TraceCheckUtils]: 60: Hoare triple {84592#false} ~newmax2~0 := node2_~newmax~1#1; {84592#false} is VALID [2022-02-20 18:31:59,719 INFO L290 TraceCheckUtils]: 61: Hoare triple {84592#false} assume 2 == ~r2~0 % 256; {84592#false} is VALID [2022-02-20 18:31:59,719 INFO L290 TraceCheckUtils]: 62: Hoare triple {84592#false} assume ~max2~0 == ~id2~0;~st2~0 := 1; {84592#false} is VALID [2022-02-20 18:31:59,719 INFO L290 TraceCheckUtils]: 63: Hoare triple {84592#false} ~mode2~0 := 0; {84592#false} is VALID [2022-02-20 18:31:59,720 INFO L290 TraceCheckUtils]: 64: Hoare triple {84592#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {84592#false} is VALID [2022-02-20 18:31:59,720 INFO L290 TraceCheckUtils]: 65: Hoare triple {84592#false} assume !(0 != ~mode3~0 % 256); {84592#false} is VALID [2022-02-20 18:31:59,720 INFO L290 TraceCheckUtils]: 66: Hoare triple {84592#false} assume ~r3~0 % 256 < 2; {84592#false} is VALID [2022-02-20 18:31:59,720 INFO L290 TraceCheckUtils]: 67: Hoare triple {84592#false} assume !(0 != ~ep31~0 % 256); {84592#false} is VALID [2022-02-20 18:31:59,720 INFO L290 TraceCheckUtils]: 68: Hoare triple {84592#false} assume !(0 != ~ep32~0 % 256); {84592#false} is VALID [2022-02-20 18:31:59,720 INFO L290 TraceCheckUtils]: 69: Hoare triple {84592#false} ~mode3~0 := 1; {84592#false} is VALID [2022-02-20 18:31:59,720 INFO L290 TraceCheckUtils]: 70: Hoare triple {84592#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {84592#false} is VALID [2022-02-20 18:31:59,720 INFO L290 TraceCheckUtils]: 71: Hoare triple {84592#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {84592#false} is VALID [2022-02-20 18:31:59,720 INFO L290 TraceCheckUtils]: 72: Hoare triple {84592#false} check_#res#1 := check_~tmp~1#1; {84592#false} is VALID [2022-02-20 18:31:59,721 INFO L290 TraceCheckUtils]: 73: Hoare triple {84592#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {84592#false} is VALID [2022-02-20 18:31:59,721 INFO L290 TraceCheckUtils]: 74: Hoare triple {84592#false} assume 0 == assert_~arg#1 % 256; {84592#false} is VALID [2022-02-20 18:31:59,721 INFO L290 TraceCheckUtils]: 75: Hoare triple {84592#false} assume !false; {84592#false} is VALID [2022-02-20 18:31:59,721 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:31:59,721 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:59,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538578989] [2022-02-20 18:31:59,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538578989] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:59,722 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:59,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:59,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566779525] [2022-02-20 18:31:59,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:59,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:31:59,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:59,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:59,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:59,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:59,768 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:59,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:59,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:59,768 INFO L87 Difference]: Start difference. First operand 5338 states and 8540 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:05,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:05,956 INFO L93 Difference]: Finished difference Result 11658 states and 18702 transitions. [2022-02-20 18:32:05,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:05,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:32:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2022-02-20 18:32:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2022-02-20 18:32:05,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 470 transitions. [2022-02-20 18:32:06,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:08,132 INFO L225 Difference]: With dead ends: 11658 [2022-02-20 18:32:08,133 INFO L226 Difference]: Without dead ends: 7904 [2022-02-20 18:32:08,135 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:32:08,136 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 116 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 477 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:32:08,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 477 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:08,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7904 states. [2022-02-20 18:32:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7904 to 7902. [2022-02-20 18:32:09,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:09,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7904 states. Second operand has 7902 states, 7901 states have (on average 1.5919503860270852) internal successors, (12578), 7901 states have internal predecessors, (12578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:10,001 INFO L74 IsIncluded]: Start isIncluded. First operand 7904 states. Second operand has 7902 states, 7901 states have (on average 1.5919503860270852) internal successors, (12578), 7901 states have internal predecessors, (12578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:10,009 INFO L87 Difference]: Start difference. First operand 7904 states. Second operand has 7902 states, 7901 states have (on average 1.5919503860270852) internal successors, (12578), 7901 states have internal predecessors, (12578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:11,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:11,672 INFO L93 Difference]: Finished difference Result 7904 states and 12579 transitions. [2022-02-20 18:32:11,672 INFO L276 IsEmpty]: Start isEmpty. Operand 7904 states and 12579 transitions. [2022-02-20 18:32:11,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:11,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:11,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 7902 states, 7901 states have (on average 1.5919503860270852) internal successors, (12578), 7901 states have internal predecessors, (12578), 0 states have call successors, (0), 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 7904 states. [2022-02-20 18:32:11,701 INFO L87 Difference]: Start difference. First operand has 7902 states, 7901 states have (on average 1.5919503860270852) internal successors, (12578), 7901 states have internal predecessors, (12578), 0 states have call successors, (0), 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 7904 states. [2022-02-20 18:32:13,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:13,600 INFO L93 Difference]: Finished difference Result 7904 states and 12579 transitions. [2022-02-20 18:32:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 7904 states and 12579 transitions. [2022-02-20 18:32:13,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:13,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:13,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:13,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:13,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7902 states, 7901 states have (on average 1.5919503860270852) internal successors, (12578), 7901 states have internal predecessors, (12578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:15,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7902 states to 7902 states and 12578 transitions. [2022-02-20 18:32:15,687 INFO L78 Accepts]: Start accepts. Automaton has 7902 states and 12578 transitions. Word has length 76 [2022-02-20 18:32:15,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:15,688 INFO L470 AbstractCegarLoop]: Abstraction has 7902 states and 12578 transitions. [2022-02-20 18:32:15,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:15,688 INFO L276 IsEmpty]: Start isEmpty. Operand 7902 states and 12578 transitions. [2022-02-20 18:32:15,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:32:15,691 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:15,692 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:15,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:32:15,692 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:15,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:15,692 INFO L85 PathProgramCache]: Analyzing trace with hash 700947013, now seen corresponding path program 1 times [2022-02-20 18:32:15,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:15,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32737984] [2022-02-20 18:32:15,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:15,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:15,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {122421#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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {122421#true} is VALID [2022-02-20 18:32:15,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {122421#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {122421#true} is VALID [2022-02-20 18:32:15,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {122421#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {122421#true} is VALID [2022-02-20 18:32:15,726 INFO L290 TraceCheckUtils]: 3: Hoare triple {122421#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {122421#true} is VALID [2022-02-20 18:32:15,726 INFO L290 TraceCheckUtils]: 4: Hoare triple {122421#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {122421#true} is VALID [2022-02-20 18:32:15,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {122421#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {122421#true} is VALID [2022-02-20 18:32:15,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {122421#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {122421#true} is VALID [2022-02-20 18:32:15,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {122421#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {122421#true} is VALID [2022-02-20 18:32:15,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {122421#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {122421#true} is VALID [2022-02-20 18:32:15,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {122421#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {122421#true} is VALID [2022-02-20 18:32:15,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {122421#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {122421#true} is VALID [2022-02-20 18:32:15,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {122421#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {122421#true} is VALID [2022-02-20 18:32:15,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {122421#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {122421#true} is VALID [2022-02-20 18:32:15,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {122421#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {122421#true} is VALID [2022-02-20 18:32:15,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {122421#true} assume ~id1~0 != ~id2~0; {122421#true} is VALID [2022-02-20 18:32:15,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {122421#true} assume ~id1~0 != ~id3~0; {122421#true} is VALID [2022-02-20 18:32:15,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {122421#true} assume ~id2~0 != ~id3~0; {122421#true} is VALID [2022-02-20 18:32:15,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {122421#true} assume ~id1~0 >= 0; {122421#true} is VALID [2022-02-20 18:32:15,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {122421#true} assume ~id2~0 >= 0; {122421#true} is VALID [2022-02-20 18:32:15,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {122421#true} assume ~id3~0 >= 0; {122421#true} is VALID [2022-02-20 18:32:15,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {122421#true} assume 0 == ~r1~0 % 256; {122421#true} is VALID [2022-02-20 18:32:15,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {122421#true} assume 0 == ~r2~0 % 256; {122421#true} is VALID [2022-02-20 18:32:15,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {122421#true} assume 0 == ~r3~0 % 256; {122421#true} is VALID [2022-02-20 18:32:15,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {122421#true} assume 0 != init_~r122~0#1 % 256; {122421#true} is VALID [2022-02-20 18:32:15,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {122421#true} assume 0 != init_~r132~0#1 % 256; {122421#true} is VALID [2022-02-20 18:32:15,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {122421#true} assume 0 != init_~r212~0#1 % 256; {122421#true} is VALID [2022-02-20 18:32:15,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {122421#true} assume 0 != init_~r232~0#1 % 256; {122421#true} is VALID [2022-02-20 18:32:15,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {122421#true} assume 0 != init_~r312~0#1 % 256; {122421#true} is VALID [2022-02-20 18:32:15,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {122421#true} assume 0 != init_~r322~0#1 % 256; {122421#true} is VALID [2022-02-20 18:32:15,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {122421#true} assume ~max1~0 == ~id1~0; {122421#true} is VALID [2022-02-20 18:32:15,729 INFO L290 TraceCheckUtils]: 30: Hoare triple {122421#true} assume ~max2~0 == ~id2~0; {122421#true} is VALID [2022-02-20 18:32:15,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {122421#true} assume ~max3~0 == ~id3~0; {122421#true} is VALID [2022-02-20 18:32:15,730 INFO L290 TraceCheckUtils]: 32: Hoare triple {122421#true} assume 0 == ~st1~0; {122421#true} is VALID [2022-02-20 18:32:15,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {122421#true} assume 0 == ~st2~0; {122421#true} is VALID [2022-02-20 18:32:15,730 INFO L290 TraceCheckUtils]: 34: Hoare triple {122421#true} assume 0 == ~st3~0; {122421#true} is VALID [2022-02-20 18:32:15,730 INFO L290 TraceCheckUtils]: 35: Hoare triple {122421#true} assume 0 == ~nl1~0; {122421#true} is VALID [2022-02-20 18:32:15,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {122421#true} assume 0 == ~nl2~0; {122421#true} is VALID [2022-02-20 18:32:15,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {122421#true} assume 0 == ~nl3~0; {122421#true} is VALID [2022-02-20 18:32:15,731 INFO L290 TraceCheckUtils]: 38: Hoare triple {122421#true} assume 0 == ~mode1~0 % 256; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:15,731 INFO L290 TraceCheckUtils]: 39: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:15,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:15,732 INFO L290 TraceCheckUtils]: 41: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax1~0 % 256; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:15,732 INFO L290 TraceCheckUtils]: 42: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax2~0 % 256; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:15,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:15,733 INFO L290 TraceCheckUtils]: 44: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:15,733 INFO L290 TraceCheckUtils]: 45: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:15,733 INFO L290 TraceCheckUtils]: 46: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:15,734 INFO L290 TraceCheckUtils]: 47: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:15,734 INFO L290 TraceCheckUtils]: 48: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:15,735 INFO L290 TraceCheckUtils]: 49: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {122422#false} is VALID [2022-02-20 18:32:15,735 INFO L290 TraceCheckUtils]: 50: Hoare triple {122422#false} assume !(255 == ~r1~0 % 256); {122422#false} is VALID [2022-02-20 18:32:15,735 INFO L290 TraceCheckUtils]: 51: Hoare triple {122422#false} ~r1~0 := 1 + ~r1~0 % 256; {122422#false} is VALID [2022-02-20 18:32:15,735 INFO L290 TraceCheckUtils]: 52: Hoare triple {122422#false} assume !(0 != ~ep21~0 % 256); {122422#false} is VALID [2022-02-20 18:32:15,735 INFO L290 TraceCheckUtils]: 53: Hoare triple {122422#false} assume !(0 != ~ep31~0 % 256); {122422#false} is VALID [2022-02-20 18:32:15,735 INFO L290 TraceCheckUtils]: 54: Hoare triple {122422#false} ~newmax1~0 := node1_~newmax~0#1; {122422#false} is VALID [2022-02-20 18:32:15,735 INFO L290 TraceCheckUtils]: 55: Hoare triple {122422#false} assume 1 == ~r1~0 % 256; {122422#false} is VALID [2022-02-20 18:32:15,735 INFO L290 TraceCheckUtils]: 56: Hoare triple {122422#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {122422#false} is VALID [2022-02-20 18:32:15,736 INFO L290 TraceCheckUtils]: 57: Hoare triple {122422#false} ~mode1~0 := 0; {122422#false} is VALID [2022-02-20 18:32:15,736 INFO L290 TraceCheckUtils]: 58: Hoare triple {122422#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {122422#false} is VALID [2022-02-20 18:32:15,736 INFO L290 TraceCheckUtils]: 59: Hoare triple {122422#false} assume !(0 != ~mode2~0 % 256); {122422#false} is VALID [2022-02-20 18:32:15,736 INFO L290 TraceCheckUtils]: 60: Hoare triple {122422#false} assume ~r2~0 % 256 < 2; {122422#false} is VALID [2022-02-20 18:32:15,736 INFO L290 TraceCheckUtils]: 61: Hoare triple {122422#false} assume !(0 != ~ep21~0 % 256); {122422#false} is VALID [2022-02-20 18:32:15,736 INFO L290 TraceCheckUtils]: 62: Hoare triple {122422#false} assume !(0 != ~ep23~0 % 256); {122422#false} is VALID [2022-02-20 18:32:15,736 INFO L290 TraceCheckUtils]: 63: Hoare triple {122422#false} ~mode2~0 := 1; {122422#false} is VALID [2022-02-20 18:32:15,736 INFO L290 TraceCheckUtils]: 64: Hoare triple {122422#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {122422#false} is VALID [2022-02-20 18:32:15,737 INFO L290 TraceCheckUtils]: 65: Hoare triple {122422#false} assume !(0 != ~mode3~0 % 256); {122422#false} is VALID [2022-02-20 18:32:15,737 INFO L290 TraceCheckUtils]: 66: Hoare triple {122422#false} assume ~r3~0 % 256 < 2; {122422#false} is VALID [2022-02-20 18:32:15,737 INFO L290 TraceCheckUtils]: 67: Hoare triple {122422#false} assume !(0 != ~ep31~0 % 256); {122422#false} is VALID [2022-02-20 18:32:15,737 INFO L290 TraceCheckUtils]: 68: Hoare triple {122422#false} assume !(0 != ~ep32~0 % 256); {122422#false} is VALID [2022-02-20 18:32:15,737 INFO L290 TraceCheckUtils]: 69: Hoare triple {122422#false} ~mode3~0 := 1; {122422#false} is VALID [2022-02-20 18:32:15,737 INFO L290 TraceCheckUtils]: 70: Hoare triple {122422#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {122422#false} is VALID [2022-02-20 18:32:15,737 INFO L290 TraceCheckUtils]: 71: Hoare triple {122422#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {122422#false} is VALID [2022-02-20 18:32:15,737 INFO L290 TraceCheckUtils]: 72: Hoare triple {122422#false} check_#res#1 := check_~tmp~1#1; {122422#false} is VALID [2022-02-20 18:32:15,737 INFO L290 TraceCheckUtils]: 73: Hoare triple {122422#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {122422#false} is VALID [2022-02-20 18:32:15,738 INFO L290 TraceCheckUtils]: 74: Hoare triple {122422#false} assume 0 == assert_~arg#1 % 256; {122422#false} is VALID [2022-02-20 18:32:15,738 INFO L290 TraceCheckUtils]: 75: Hoare triple {122422#false} assume !false; {122422#false} is VALID [2022-02-20 18:32:15,738 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:32:15,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:15,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32737984] [2022-02-20 18:32:15,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32737984] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:15,738 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:15,739 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:15,739 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865081099] [2022-02-20 18:32:15,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:15,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:32:15,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:15,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:15,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:15,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:15,787 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:15,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:15,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:15,788 INFO L87 Difference]: Start difference. First operand 7902 states and 12578 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:29,783 INFO L93 Difference]: Finished difference Result 17511 states and 28108 transitions. [2022-02-20 18:32:29,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:29,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:32:29,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:29,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2022-02-20 18:32:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:29,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2022-02-20 18:32:29,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 470 transitions. [2022-02-20 18:32:29,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:33,912 INFO L225 Difference]: With dead ends: 17511 [2022-02-20 18:32:33,913 INFO L226 Difference]: Without dead ends: 11763 [2022-02-20 18:32:33,917 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:32:33,918 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 122 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 503 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:32:33,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 503 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:33,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11763 states. [2022-02-20 18:32:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11763 to 11761. [2022-02-20 18:32:39,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:39,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11763 states. Second operand has 11761 states, 11760 states have (on average 1.5872448979591838) internal successors, (18666), 11760 states have internal predecessors, (18666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:39,258 INFO L74 IsIncluded]: Start isIncluded. First operand 11763 states. Second operand has 11761 states, 11760 states have (on average 1.5872448979591838) internal successors, (18666), 11760 states have internal predecessors, (18666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:39,269 INFO L87 Difference]: Start difference. First operand 11763 states. Second operand has 11761 states, 11760 states have (on average 1.5872448979591838) internal successors, (18666), 11760 states have internal predecessors, (18666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)