./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.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 b7a355896b8b65b5a2cb80c69f28000f566073d33b0003da7d28a637c6d5db6a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:24:25,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:24:25,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:24:25,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:24:25,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:24:25,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:24:25,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:24:25,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:24:25,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:24:25,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:24:25,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:24:25,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:24:25,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:24:25,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:24:25,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:24:25,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:24:25,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:24:25,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:24:25,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:24:25,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:24:25,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:24:25,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:24:25,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:24:25,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:24:25,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:24:25,527 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:24:25,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:24:25,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:24:25,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:24:25,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:24:25,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:24:25,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:24:25,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:24:25,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:24:25,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:24:25,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:24:25,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:24:25,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:24:25,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:24:25,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:24:25,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:24:25,538 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:24:25,558 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:24:25,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:24:25,558 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:24:25,559 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:24:25,559 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:24:25,560 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:24:25,560 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:24:25,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:24:25,561 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:24:25,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:24:25,561 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:24:25,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:24:25,562 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:24:25,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:24:25,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:24:25,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:24:25,563 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:24:25,563 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:24:25,563 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:24:25,563 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:24:25,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:24:25,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:24:25,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:24:25,564 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:24:25,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:24:25,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:24:25,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:24:25,565 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:24:25,566 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:24:25,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:24:25,566 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:24:25,566 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:24:25,567 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:24:25,567 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 -> b7a355896b8b65b5a2cb80c69f28000f566073d33b0003da7d28a637c6d5db6a [2022-02-20 18:24:25,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:24:25,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:24:25,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:24:25,808 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:24:25,808 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:24:25,810 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2022-02-20 18:24:25,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a60afcbd/78c34157f96e41ebba7b703fdf25d8bb/FLAG76887c046 [2022-02-20 18:24:26,261 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:24:26,262 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2022-02-20 18:24:26,279 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a60afcbd/78c34157f96e41ebba7b703fdf25d8bb/FLAG76887c046 [2022-02-20 18:24:26,292 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a60afcbd/78c34157f96e41ebba7b703fdf25d8bb [2022-02-20 18:24:26,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:24:26,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:24:26,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:24:26,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:24:26,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:24:26,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:24:26" (1/1) ... [2022-02-20 18:24:26,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2933a073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:26, skipping insertion in model container [2022-02-20 18:24:26,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:24:26" (1/1) ... [2022-02-20 18:24:26,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:24:26,339 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:24:26,579 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c[12968,12981] [2022-02-20 18:24:26,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:24:26,593 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:24:26,651 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c[12968,12981] [2022-02-20 18:24:26,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:24:26,664 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:24:26,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:26 WrapperNode [2022-02-20 18:24:26,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:24:26,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:24:26,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:24:26,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:24:26,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:26" (1/1) ... [2022-02-20 18:24:26,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:26" (1/1) ... [2022-02-20 18:24:26,724 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 443 [2022-02-20 18:24:26,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:24:26,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:24:26,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:24:26,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:24:26,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:26" (1/1) ... [2022-02-20 18:24:26,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:26" (1/1) ... [2022-02-20 18:24:26,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:26" (1/1) ... [2022-02-20 18:24:26,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:26" (1/1) ... [2022-02-20 18:24:26,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:26" (1/1) ... [2022-02-20 18:24:26,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:26" (1/1) ... [2022-02-20 18:24:26,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:26" (1/1) ... [2022-02-20 18:24:26,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:24:26,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:24:26,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:24:26,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:24:26,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:26" (1/1) ... [2022-02-20 18:24:26,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:24:26,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:24:26,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:24:26,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:24:26,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:24:26,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:24:26,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:24:26,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:24:26,934 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:24:26,935 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:24:27,587 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:24:27,599 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:24:27,601 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:24:27,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:24:27 BoogieIcfgContainer [2022-02-20 18:24:27,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:24:27,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:24:27,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:24:27,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:24:27,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:24:26" (1/3) ... [2022-02-20 18:24:27,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6806209e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:24:27, skipping insertion in model container [2022-02-20 18:24:27,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:26" (2/3) ... [2022-02-20 18:24:27,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6806209e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:24:27, skipping insertion in model container [2022-02-20 18:24:27,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:24:27" (3/3) ... [2022-02-20 18:24:27,613 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2022-02-20 18:24:27,621 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:24:27,621 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:24:27,677 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:24:27,689 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:24:27,690 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:24:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 135 states have (on average 1.7481481481481482) internal successors, (236), 136 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:27,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:24:27,727 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:27,728 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:27,729 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:27,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:27,734 INFO L85 PathProgramCache]: Analyzing trace with hash 298975739, now seen corresponding path program 1 times [2022-02-20 18:24:27,747 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:27,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971059453] [2022-02-20 18:24:27,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:27,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:28,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {140#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {140#true} is VALID [2022-02-20 18:24:28,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {140#true} is VALID [2022-02-20 18:24:28,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {140#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {140#true} is VALID [2022-02-20 18:24:28,006 INFO L290 TraceCheckUtils]: 3: Hoare triple {140#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {140#true} is VALID [2022-02-20 18:24:28,006 INFO L290 TraceCheckUtils]: 4: Hoare triple {140#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {140#true} is VALID [2022-02-20 18:24:28,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {140#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {140#true} is VALID [2022-02-20 18:24:28,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {140#true} is VALID [2022-02-20 18:24:28,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {140#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {140#true} is VALID [2022-02-20 18:24:28,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {140#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {140#true} is VALID [2022-02-20 18:24:28,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {140#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {140#true} is VALID [2022-02-20 18:24:28,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {140#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {140#true} is VALID [2022-02-20 18:24:28,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {140#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {140#true} is VALID [2022-02-20 18:24:28,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {140#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {140#true} is VALID [2022-02-20 18:24:28,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {140#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {140#true} is VALID [2022-02-20 18:24:28,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {140#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {140#true} is VALID [2022-02-20 18:24:28,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {140#true} init_#res#1 := init_~tmp___5~0#1; {140#true} is VALID [2022-02-20 18:24:28,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {140#true} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {140#true} is VALID [2022-02-20 18:24:28,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {140#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {141#false} is VALID [2022-02-20 18:24:28,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {141#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; {141#false} is VALID [2022-02-20 18:24:28,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {141#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {141#false} is VALID [2022-02-20 18:24:28,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {141#false} assume !(0 != ~mode1~0 % 256); {141#false} is VALID [2022-02-20 18:24:28,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {141#false} assume !(~r1~0 % 256 < 2); {141#false} is VALID [2022-02-20 18:24:28,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {141#false} ~mode1~0 := 1; {141#false} is VALID [2022-02-20 18:24:28,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {141#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {141#false} is VALID [2022-02-20 18:24:28,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {141#false} assume !(0 != ~mode2~0 % 256); {141#false} is VALID [2022-02-20 18:24:28,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {141#false} assume !(~r2~0 % 256 < 2); {141#false} is VALID [2022-02-20 18:24:28,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {141#false} ~mode2~0 := 1; {141#false} is VALID [2022-02-20 18:24:28,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {141#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {141#false} is VALID [2022-02-20 18:24:28,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {141#false} assume !(0 != ~mode3~0 % 256); {141#false} is VALID [2022-02-20 18:24:28,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {141#false} assume !(~r3~0 % 256 < 2); {141#false} is VALID [2022-02-20 18:24:28,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {141#false} ~mode3~0 := 1; {141#false} is VALID [2022-02-20 18:24:28,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {141#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; {141#false} is VALID [2022-02-20 18:24:28,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {141#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {141#false} is VALID [2022-02-20 18:24:28,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {141#false} check_#res#1 := check_~tmp~1#1; {141#false} is VALID [2022-02-20 18:24:28,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {141#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {141#false} is VALID [2022-02-20 18:24:28,025 INFO L290 TraceCheckUtils]: 35: Hoare triple {141#false} assume 0 == assert_~arg#1 % 256; {141#false} is VALID [2022-02-20 18:24:28,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {141#false} assume !false; {141#false} is VALID [2022-02-20 18:24:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:28,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:28,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971059453] [2022-02-20 18:24:28,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971059453] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:28,028 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:28,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:24:28,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146316354] [2022-02-20 18:24:28,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:28,038 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 18:24:28,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:28,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:28,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:28,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:24:28,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:28,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:24:28,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:24:28,103 INFO L87 Difference]: Start difference. First operand has 137 states, 135 states have (on average 1.7481481481481482) internal successors, (236), 136 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:28,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:28,287 INFO L93 Difference]: Finished difference Result 214 states and 367 transitions. [2022-02-20 18:24:28,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:24:28,288 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 18:24:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:28,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 367 transitions. [2022-02-20 18:24:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 367 transitions. [2022-02-20 18:24:28,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 367 transitions. [2022-02-20 18:24:28,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:28,645 INFO L225 Difference]: With dead ends: 214 [2022-02-20 18:24:28,645 INFO L226 Difference]: Without dead ends: 133 [2022-02-20 18:24:28,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:24:28,651 INFO L933 BasicCegarLoop]: 229 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, 229 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:28,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:28,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-02-20 18:24:28,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-02-20 18:24:28,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:28,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 133 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 132 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:28,685 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 133 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 132 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:28,685 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 133 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 132 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:28,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:28,692 INFO L93 Difference]: Finished difference Result 133 states and 229 transitions. [2022-02-20 18:24:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 229 transitions. [2022-02-20 18:24:28,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:28,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:28,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 132 states have internal predecessors, (229), 0 states have call successors, (0), 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 133 states. [2022-02-20 18:24:28,695 INFO L87 Difference]: Start difference. First operand has 133 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 132 states have internal predecessors, (229), 0 states have call successors, (0), 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 133 states. [2022-02-20 18:24:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:28,702 INFO L93 Difference]: Finished difference Result 133 states and 229 transitions. [2022-02-20 18:24:28,702 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 229 transitions. [2022-02-20 18:24:28,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:28,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:28,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:28,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 132 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 229 transitions. [2022-02-20 18:24:28,710 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 229 transitions. Word has length 37 [2022-02-20 18:24:28,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:28,711 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 229 transitions. [2022-02-20 18:24:28,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:28,711 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 229 transitions. [2022-02-20 18:24:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:24:28,713 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:28,713 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:28,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:24:28,714 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:28,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:28,714 INFO L85 PathProgramCache]: Analyzing trace with hash -518672711, now seen corresponding path program 1 times [2022-02-20 18:24:28,715 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:28,715 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452059399] [2022-02-20 18:24:28,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:28,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:28,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {784#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {784#true} is VALID [2022-02-20 18:24:28,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {784#true} is VALID [2022-02-20 18:24:28,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {784#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {784#true} is VALID [2022-02-20 18:24:28,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {784#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {784#true} is VALID [2022-02-20 18:24:28,842 INFO L290 TraceCheckUtils]: 4: Hoare triple {784#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {784#true} is VALID [2022-02-20 18:24:28,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {784#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {784#true} is VALID [2022-02-20 18:24:28,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {784#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {784#true} is VALID [2022-02-20 18:24:28,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {784#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {784#true} is VALID [2022-02-20 18:24:28,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {784#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {784#true} is VALID [2022-02-20 18:24:28,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {784#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {784#true} is VALID [2022-02-20 18:24:28,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {784#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {784#true} is VALID [2022-02-20 18:24:28,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {784#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {784#true} is VALID [2022-02-20 18:24:28,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {784#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {784#true} is VALID [2022-02-20 18:24:28,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {784#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {784#true} is VALID [2022-02-20 18:24:28,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {786#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-20 18:24:28,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {786#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {787#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:24:28,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {787#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {788#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:24:28,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {788#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {785#false} is VALID [2022-02-20 18:24:28,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {785#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; {785#false} is VALID [2022-02-20 18:24:28,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {785#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {785#false} is VALID [2022-02-20 18:24:28,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {785#false} assume !(0 != ~mode1~0 % 256); {785#false} is VALID [2022-02-20 18:24:28,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {785#false} assume !(~r1~0 % 256 < 2); {785#false} is VALID [2022-02-20 18:24:28,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {785#false} ~mode1~0 := 1; {785#false} is VALID [2022-02-20 18:24:28,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {785#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {785#false} is VALID [2022-02-20 18:24:28,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {785#false} assume !(0 != ~mode2~0 % 256); {785#false} is VALID [2022-02-20 18:24:28,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {785#false} assume !(~r2~0 % 256 < 2); {785#false} is VALID [2022-02-20 18:24:28,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {785#false} ~mode2~0 := 1; {785#false} is VALID [2022-02-20 18:24:28,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {785#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {785#false} is VALID [2022-02-20 18:24:28,854 INFO L290 TraceCheckUtils]: 28: Hoare triple {785#false} assume !(0 != ~mode3~0 % 256); {785#false} is VALID [2022-02-20 18:24:28,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {785#false} assume !(~r3~0 % 256 < 2); {785#false} is VALID [2022-02-20 18:24:28,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {785#false} ~mode3~0 := 1; {785#false} is VALID [2022-02-20 18:24:28,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {785#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; {785#false} is VALID [2022-02-20 18:24:28,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {785#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {785#false} is VALID [2022-02-20 18:24:28,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {785#false} check_#res#1 := check_~tmp~1#1; {785#false} is VALID [2022-02-20 18:24:28,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {785#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {785#false} is VALID [2022-02-20 18:24:28,856 INFO L290 TraceCheckUtils]: 35: Hoare triple {785#false} assume 0 == assert_~arg#1 % 256; {785#false} is VALID [2022-02-20 18:24:28,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {785#false} assume !false; {785#false} is VALID [2022-02-20 18:24:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:28,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:28,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452059399] [2022-02-20 18:24:28,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452059399] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:28,859 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:28,859 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:24:28,859 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865595462] [2022-02-20 18:24:28,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:28,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 18:24:28,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:28,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:28,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:28,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:24:28,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:28,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:24:28,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:24:28,891 INFO L87 Difference]: Start difference. First operand 133 states and 229 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:29,342 INFO L93 Difference]: Finished difference Result 213 states and 360 transitions. [2022-02-20 18:24:29,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:24:29,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 18:24:29,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 360 transitions. [2022-02-20 18:24:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 360 transitions. [2022-02-20 18:24:29,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 360 transitions. [2022-02-20 18:24:29,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 360 edges. 360 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:29,618 INFO L225 Difference]: With dead ends: 213 [2022-02-20 18:24:29,618 INFO L226 Difference]: Without dead ends: 133 [2022-02-20 18:24:29,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:24:29,620 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 3 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:29,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 878 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:29,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-02-20 18:24:29,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-02-20 18:24:29,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:29,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:29,628 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:29,629 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:29,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:29,633 INFO L93 Difference]: Finished difference Result 133 states and 202 transitions. [2022-02-20 18:24:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions. [2022-02-20 18:24:29,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:29,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:29,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 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 133 states. [2022-02-20 18:24:29,635 INFO L87 Difference]: Start difference. First operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 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 133 states. [2022-02-20 18:24:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:29,640 INFO L93 Difference]: Finished difference Result 133 states and 202 transitions. [2022-02-20 18:24:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions. [2022-02-20 18:24:29,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:29,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:29,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:29,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 202 transitions. [2022-02-20 18:24:29,646 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 202 transitions. Word has length 37 [2022-02-20 18:24:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:29,646 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 202 transitions. [2022-02-20 18:24:29,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:29,647 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions. [2022-02-20 18:24:29,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:24:29,648 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:29,648 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:29,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:24:29,649 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:29,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:29,650 INFO L85 PathProgramCache]: Analyzing trace with hash -707453694, now seen corresponding path program 1 times [2022-02-20 18:24:29,650 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:29,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006372550] [2022-02-20 18:24:29,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:29,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:29,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {1434#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {1434#true} is VALID [2022-02-20 18:24:29,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {1434#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {1434#true} is VALID [2022-02-20 18:24:29,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {1434#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1434#true} is VALID [2022-02-20 18:24:29,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {1434#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1434#true} is VALID [2022-02-20 18:24:29,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {1434#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1434#true} is VALID [2022-02-20 18:24:29,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {1434#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1434#true} is VALID [2022-02-20 18:24:29,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {1434#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {1434#true} is VALID [2022-02-20 18:24:29,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {1434#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1434#true} is VALID [2022-02-20 18:24:29,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {1434#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {1434#true} is VALID [2022-02-20 18:24:29,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {1434#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1434#true} is VALID [2022-02-20 18:24:29,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {1434#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {1434#true} is VALID [2022-02-20 18:24:29,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {1434#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1434#true} is VALID [2022-02-20 18:24:29,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {1434#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {1434#true} is VALID [2022-02-20 18:24:29,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {1434#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1434#true} is VALID [2022-02-20 18:24:29,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {1434#true} assume ~id1~0 != ~id2~0; {1434#true} is VALID [2022-02-20 18:24:29,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {1434#true} assume ~id1~0 != ~id3~0; {1434#true} is VALID [2022-02-20 18:24:29,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {1434#true} assume ~id2~0 != ~id3~0; {1434#true} is VALID [2022-02-20 18:24:29,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {1434#true} assume ~id1~0 >= 0; {1434#true} is VALID [2022-02-20 18:24:29,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {1434#true} assume ~id2~0 >= 0; {1434#true} is VALID [2022-02-20 18:24:29,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {1434#true} assume ~id3~0 >= 0; {1434#true} is VALID [2022-02-20 18:24:29,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {1434#true} assume 0 == ~r1~0 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r2~0 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r3~0 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r122~0#1 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r132~0#1 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r212~0#1 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r232~0#1 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r312~0#1 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r322~0#1 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max1~0 == ~id1~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max2~0 == ~id2~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max3~0 == ~id3~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl1~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl2~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,757 INFO L290 TraceCheckUtils]: 37: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl3~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,758 INFO L290 TraceCheckUtils]: 39: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,759 INFO L290 TraceCheckUtils]: 40: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,759 INFO L290 TraceCheckUtils]: 41: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp___5~0#1; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,760 INFO L290 TraceCheckUtils]: 42: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,760 INFO L290 TraceCheckUtils]: 43: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,760 INFO L290 TraceCheckUtils]: 44: Hoare triple {1436#(<= ~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; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,761 INFO L290 TraceCheckUtils]: 45: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,761 INFO L290 TraceCheckUtils]: 46: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:29,762 INFO L290 TraceCheckUtils]: 47: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 2); {1435#false} is VALID [2022-02-20 18:24:29,762 INFO L290 TraceCheckUtils]: 48: Hoare triple {1435#false} ~mode1~0 := 1; {1435#false} is VALID [2022-02-20 18:24:29,762 INFO L290 TraceCheckUtils]: 49: Hoare triple {1435#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {1435#false} is VALID [2022-02-20 18:24:29,763 INFO L290 TraceCheckUtils]: 50: Hoare triple {1435#false} assume !(0 != ~mode2~0 % 256); {1435#false} is VALID [2022-02-20 18:24:29,763 INFO L290 TraceCheckUtils]: 51: Hoare triple {1435#false} assume !(~r2~0 % 256 < 2); {1435#false} is VALID [2022-02-20 18:24:29,763 INFO L290 TraceCheckUtils]: 52: Hoare triple {1435#false} ~mode2~0 := 1; {1435#false} is VALID [2022-02-20 18:24:29,763 INFO L290 TraceCheckUtils]: 53: Hoare triple {1435#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {1435#false} is VALID [2022-02-20 18:24:29,764 INFO L290 TraceCheckUtils]: 54: Hoare triple {1435#false} assume !(0 != ~mode3~0 % 256); {1435#false} is VALID [2022-02-20 18:24:29,764 INFO L290 TraceCheckUtils]: 55: Hoare triple {1435#false} assume !(~r3~0 % 256 < 2); {1435#false} is VALID [2022-02-20 18:24:29,764 INFO L290 TraceCheckUtils]: 56: Hoare triple {1435#false} ~mode3~0 := 1; {1435#false} is VALID [2022-02-20 18:24:29,764 INFO L290 TraceCheckUtils]: 57: Hoare triple {1435#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; {1435#false} is VALID [2022-02-20 18:24:29,764 INFO L290 TraceCheckUtils]: 58: Hoare triple {1435#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1435#false} is VALID [2022-02-20 18:24:29,765 INFO L290 TraceCheckUtils]: 59: Hoare triple {1435#false} check_#res#1 := check_~tmp~1#1; {1435#false} is VALID [2022-02-20 18:24:29,765 INFO L290 TraceCheckUtils]: 60: Hoare triple {1435#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1435#false} is VALID [2022-02-20 18:24:29,765 INFO L290 TraceCheckUtils]: 61: Hoare triple {1435#false} assume 0 == assert_~arg#1 % 256; {1435#false} is VALID [2022-02-20 18:24:29,765 INFO L290 TraceCheckUtils]: 62: Hoare triple {1435#false} assume !false; {1435#false} is VALID [2022-02-20 18:24:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:29,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:29,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006372550] [2022-02-20 18:24:29,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006372550] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:29,767 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:29,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:29,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12911468] [2022-02-20 18:24:29,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:29,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:24:29,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:29,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:29,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:29,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:29,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:29,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:29,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:29,814 INFO L87 Difference]: Start difference. First operand 133 states and 202 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:30,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:30,072 INFO L93 Difference]: Finished difference Result 276 states and 439 transitions. [2022-02-20 18:24:30,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:30,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:24:30,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:30,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2022-02-20 18:24:30,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2022-02-20 18:24:30,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 439 transitions. [2022-02-20 18:24:30,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:30,414 INFO L225 Difference]: With dead ends: 276 [2022-02-20 18:24:30,414 INFO L226 Difference]: Without dead ends: 200 [2022-02-20 18:24:30,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:30,416 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 101 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 355 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:24:30,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 355 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:30,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-02-20 18:24:30,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2022-02-20 18:24:30,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:30,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 197 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 196 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:30,439 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 197 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 196 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:30,440 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 197 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 196 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:30,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:30,446 INFO L93 Difference]: Finished difference Result 200 states and 306 transitions. [2022-02-20 18:24:30,446 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 306 transitions. [2022-02-20 18:24:30,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:30,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:30,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 197 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 196 states have internal predecessors, (304), 0 states have call successors, (0), 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 200 states. [2022-02-20 18:24:30,447 INFO L87 Difference]: Start difference. First operand has 197 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 196 states have internal predecessors, (304), 0 states have call successors, (0), 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 200 states. [2022-02-20 18:24:30,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:30,453 INFO L93 Difference]: Finished difference Result 200 states and 306 transitions. [2022-02-20 18:24:30,453 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 306 transitions. [2022-02-20 18:24:30,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:30,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:30,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:30,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 196 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:30,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 304 transitions. [2022-02-20 18:24:30,461 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 304 transitions. Word has length 63 [2022-02-20 18:24:30,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:30,461 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 304 transitions. [2022-02-20 18:24:30,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:30,461 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 304 transitions. [2022-02-20 18:24:30,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:24:30,462 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:30,462 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:30,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:24:30,463 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:30,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:30,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1995563601, now seen corresponding path program 1 times [2022-02-20 18:24:30,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:30,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153180741] [2022-02-20 18:24:30,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:30,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:30,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {2354#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {2354#true} is VALID [2022-02-20 18:24:30,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {2354#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {2354#true} is VALID [2022-02-20 18:24:30,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {2354#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2354#true} is VALID [2022-02-20 18:24:30,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {2354#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2354#true} is VALID [2022-02-20 18:24:30,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {2354#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2354#true} is VALID [2022-02-20 18:24:30,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {2354#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2354#true} is VALID [2022-02-20 18:24:30,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {2354#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2354#true} is VALID [2022-02-20 18:24:30,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {2354#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2354#true} is VALID [2022-02-20 18:24:30,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {2354#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2354#true} is VALID [2022-02-20 18:24:30,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {2354#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2354#true} is VALID [2022-02-20 18:24:30,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {2354#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2354#true} is VALID [2022-02-20 18:24:30,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {2354#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2354#true} is VALID [2022-02-20 18:24:30,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {2354#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2354#true} is VALID [2022-02-20 18:24:30,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {2354#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2354#true} is VALID [2022-02-20 18:24:30,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {2354#true} assume ~id1~0 != ~id2~0; {2354#true} is VALID [2022-02-20 18:24:30,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {2354#true} assume ~id1~0 != ~id3~0; {2354#true} is VALID [2022-02-20 18:24:30,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {2354#true} assume ~id2~0 != ~id3~0; {2354#true} is VALID [2022-02-20 18:24:30,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {2354#true} assume ~id1~0 >= 0; {2354#true} is VALID [2022-02-20 18:24:30,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {2354#true} assume ~id2~0 >= 0; {2354#true} is VALID [2022-02-20 18:24:30,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {2354#true} assume ~id3~0 >= 0; {2354#true} is VALID [2022-02-20 18:24:30,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {2354#true} assume 0 == ~r1~0 % 256; {2354#true} is VALID [2022-02-20 18:24:30,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {2354#true} assume 0 == ~r2~0 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~r3~0 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r122~0#1 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r132~0#1 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r212~0#1 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r232~0#1 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r312~0#1 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r322~0#1 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max1~0 == ~id1~0; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max2~0 == ~id2~0; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,560 INFO L290 TraceCheckUtils]: 31: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max3~0 == ~id3~0; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,560 INFO L290 TraceCheckUtils]: 32: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st1~0; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,560 INFO L290 TraceCheckUtils]: 33: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st2~0; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,561 INFO L290 TraceCheckUtils]: 34: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st3~0; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,561 INFO L290 TraceCheckUtils]: 35: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl1~0; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,561 INFO L290 TraceCheckUtils]: 36: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl2~0; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,562 INFO L290 TraceCheckUtils]: 37: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl3~0; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode1~0 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,563 INFO L290 TraceCheckUtils]: 39: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode2~0 % 256; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,563 INFO L290 TraceCheckUtils]: 40: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,564 INFO L290 TraceCheckUtils]: 41: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} init_#res#1 := init_~tmp___5~0#1; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,564 INFO L290 TraceCheckUtils]: 42: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,565 INFO L290 TraceCheckUtils]: 43: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,565 INFO L290 TraceCheckUtils]: 44: Hoare triple {2356#(<= ~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; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,565 INFO L290 TraceCheckUtils]: 45: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,566 INFO L290 TraceCheckUtils]: 46: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode1~0 % 256); {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,566 INFO L290 TraceCheckUtils]: 47: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~r1~0 % 256 < 2; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep12~0 % 256); {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep13~0 % 256); {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,567 INFO L290 TraceCheckUtils]: 50: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} ~mode1~0 := 1; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,568 INFO L290 TraceCheckUtils]: 51: Hoare triple {2356#(<= ~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; {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,568 INFO L290 TraceCheckUtils]: 52: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode2~0 % 256); {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:30,569 INFO L290 TraceCheckUtils]: 53: Hoare triple {2356#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(~r2~0 % 256 < 2); {2355#false} is VALID [2022-02-20 18:24:30,570 INFO L290 TraceCheckUtils]: 54: Hoare triple {2355#false} ~mode2~0 := 1; {2355#false} is VALID [2022-02-20 18:24:30,570 INFO L290 TraceCheckUtils]: 55: Hoare triple {2355#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {2355#false} is VALID [2022-02-20 18:24:30,570 INFO L290 TraceCheckUtils]: 56: Hoare triple {2355#false} assume !(0 != ~mode3~0 % 256); {2355#false} is VALID [2022-02-20 18:24:30,570 INFO L290 TraceCheckUtils]: 57: Hoare triple {2355#false} assume !(~r3~0 % 256 < 2); {2355#false} is VALID [2022-02-20 18:24:30,570 INFO L290 TraceCheckUtils]: 58: Hoare triple {2355#false} ~mode3~0 := 1; {2355#false} is VALID [2022-02-20 18:24:30,571 INFO L290 TraceCheckUtils]: 59: Hoare triple {2355#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; {2355#false} is VALID [2022-02-20 18:24:30,571 INFO L290 TraceCheckUtils]: 60: Hoare triple {2355#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {2355#false} is VALID [2022-02-20 18:24:30,571 INFO L290 TraceCheckUtils]: 61: Hoare triple {2355#false} check_#res#1 := check_~tmp~1#1; {2355#false} is VALID [2022-02-20 18:24:30,571 INFO L290 TraceCheckUtils]: 62: Hoare triple {2355#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2355#false} is VALID [2022-02-20 18:24:30,571 INFO L290 TraceCheckUtils]: 63: Hoare triple {2355#false} assume 0 == assert_~arg#1 % 256; {2355#false} is VALID [2022-02-20 18:24:30,572 INFO L290 TraceCheckUtils]: 64: Hoare triple {2355#false} assume !false; {2355#false} is VALID [2022-02-20 18:24:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:30,575 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:30,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153180741] [2022-02-20 18:24:30,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153180741] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:30,576 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:30,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:30,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340610892] [2022-02-20 18:24:30,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:30,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:24:30,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:30,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:30,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:30,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:30,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:30,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:30,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:30,621 INFO L87 Difference]: Start difference. First operand 197 states and 304 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:30,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:30,892 INFO L93 Difference]: Finished difference Result 463 states and 736 transitions. [2022-02-20 18:24:30,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:30,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:24:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2022-02-20 18:24:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2022-02-20 18:24:30,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 443 transitions. [2022-02-20 18:24:31,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 443 edges. 443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:31,222 INFO L225 Difference]: With dead ends: 463 [2022-02-20 18:24:31,222 INFO L226 Difference]: Without dead ends: 323 [2022-02-20 18:24:31,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:31,230 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 103 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 368 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:24:31,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 368 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:31,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-02-20 18:24:31,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2022-02-20 18:24:31,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:31,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 323 states. Second operand has 319 states, 318 states have (on average 1.5723270440251573) internal successors, (500), 318 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:31,286 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand has 319 states, 318 states have (on average 1.5723270440251573) internal successors, (500), 318 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:31,287 INFO L87 Difference]: Start difference. First operand 323 states. Second operand has 319 states, 318 states have (on average 1.5723270440251573) internal successors, (500), 318 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:31,297 INFO L93 Difference]: Finished difference Result 323 states and 503 transitions. [2022-02-20 18:24:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 503 transitions. [2022-02-20 18:24:31,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:31,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:31,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 319 states, 318 states have (on average 1.5723270440251573) internal successors, (500), 318 states have internal predecessors, (500), 0 states have call successors, (0), 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 323 states. [2022-02-20 18:24:31,300 INFO L87 Difference]: Start difference. First operand has 319 states, 318 states have (on average 1.5723270440251573) internal successors, (500), 318 states have internal predecessors, (500), 0 states have call successors, (0), 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 323 states. [2022-02-20 18:24:31,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:31,309 INFO L93 Difference]: Finished difference Result 323 states and 503 transitions. [2022-02-20 18:24:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 503 transitions. [2022-02-20 18:24:31,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:31,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:31,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:31,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.5723270440251573) internal successors, (500), 318 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 500 transitions. [2022-02-20 18:24:31,319 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 500 transitions. Word has length 65 [2022-02-20 18:24:31,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:31,320 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 500 transitions. [2022-02-20 18:24:31,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 500 transitions. [2022-02-20 18:24:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:24:31,321 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:31,321 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:31,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:24:31,322 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:31,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:31,322 INFO L85 PathProgramCache]: Analyzing trace with hash -2137075392, now seen corresponding path program 1 times [2022-02-20 18:24:31,322 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:31,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082970741] [2022-02-20 18:24:31,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:31,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:31,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {3869#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {3869#true} is VALID [2022-02-20 18:24:31,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {3869#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {3869#true} is VALID [2022-02-20 18:24:31,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {3869#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3869#true} is VALID [2022-02-20 18:24:31,398 INFO L290 TraceCheckUtils]: 3: Hoare triple {3869#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3869#true} is VALID [2022-02-20 18:24:31,398 INFO L290 TraceCheckUtils]: 4: Hoare triple {3869#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3869#true} is VALID [2022-02-20 18:24:31,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {3869#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3869#true} is VALID [2022-02-20 18:24:31,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {3869#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {3869#true} is VALID [2022-02-20 18:24:31,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {3869#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3869#true} is VALID [2022-02-20 18:24:31,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {3869#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {3869#true} is VALID [2022-02-20 18:24:31,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {3869#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3869#true} is VALID [2022-02-20 18:24:31,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {3869#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {3869#true} is VALID [2022-02-20 18:24:31,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {3869#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3869#true} is VALID [2022-02-20 18:24:31,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {3869#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {3869#true} is VALID [2022-02-20 18:24:31,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {3869#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3869#true} is VALID [2022-02-20 18:24:31,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {3869#true} assume ~id1~0 != ~id2~0; {3869#true} is VALID [2022-02-20 18:24:31,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {3869#true} assume ~id1~0 != ~id3~0; {3869#true} is VALID [2022-02-20 18:24:31,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {3869#true} assume ~id2~0 != ~id3~0; {3869#true} is VALID [2022-02-20 18:24:31,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {3869#true} assume ~id1~0 >= 0; {3869#true} is VALID [2022-02-20 18:24:31,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {3869#true} assume ~id2~0 >= 0; {3869#true} is VALID [2022-02-20 18:24:31,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {3869#true} assume ~id3~0 >= 0; {3869#true} is VALID [2022-02-20 18:24:31,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {3869#true} assume 0 == ~r1~0 % 256; {3869#true} is VALID [2022-02-20 18:24:31,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {3869#true} assume 0 == ~r2~0 % 256; {3869#true} is VALID [2022-02-20 18:24:31,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {3869#true} assume 0 == ~r3~0 % 256; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r122~0#1 % 256; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r132~0#1 % 256; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r212~0#1 % 256; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r232~0#1 % 256; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r312~0#1 % 256; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r322~0#1 % 256; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max1~0 == ~id1~0; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max2~0 == ~id2~0; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max3~0 == ~id3~0; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,414 INFO L290 TraceCheckUtils]: 32: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st1~0; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st2~0; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,415 INFO L290 TraceCheckUtils]: 34: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st3~0; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,415 INFO L290 TraceCheckUtils]: 35: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl1~0; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,416 INFO L290 TraceCheckUtils]: 36: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl2~0; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl3~0; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,416 INFO L290 TraceCheckUtils]: 38: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode1~0 % 256; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,417 INFO L290 TraceCheckUtils]: 39: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode2~0 % 256; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,417 INFO L290 TraceCheckUtils]: 40: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,417 INFO L290 TraceCheckUtils]: 41: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} init_#res#1 := init_~tmp___5~0#1; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,418 INFO L290 TraceCheckUtils]: 42: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,418 INFO L290 TraceCheckUtils]: 43: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,419 INFO L290 TraceCheckUtils]: 44: Hoare triple {3871#(<= ~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; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode1~0 % 256); {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,420 INFO L290 TraceCheckUtils]: 47: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r1~0 % 256 < 2; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,420 INFO L290 TraceCheckUtils]: 48: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep12~0 % 256); {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,420 INFO L290 TraceCheckUtils]: 49: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep13~0 % 256); {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,421 INFO L290 TraceCheckUtils]: 50: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode1~0 := 1; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,421 INFO L290 TraceCheckUtils]: 51: Hoare triple {3871#(<= ~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; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,421 INFO L290 TraceCheckUtils]: 52: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode2~0 % 256); {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,422 INFO L290 TraceCheckUtils]: 53: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r2~0 % 256 < 2; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,422 INFO L290 TraceCheckUtils]: 54: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep21~0 % 256); {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,422 INFO L290 TraceCheckUtils]: 55: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep23~0 % 256); {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,423 INFO L290 TraceCheckUtils]: 56: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode2~0 := 1; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,423 INFO L290 TraceCheckUtils]: 57: Hoare triple {3871#(<= ~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; {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,423 INFO L290 TraceCheckUtils]: 58: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode3~0 % 256); {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:31,424 INFO L290 TraceCheckUtils]: 59: Hoare triple {3871#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(~r3~0 % 256 < 2); {3870#false} is VALID [2022-02-20 18:24:31,424 INFO L290 TraceCheckUtils]: 60: Hoare triple {3870#false} ~mode3~0 := 1; {3870#false} is VALID [2022-02-20 18:24:31,424 INFO L290 TraceCheckUtils]: 61: Hoare triple {3870#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; {3870#false} is VALID [2022-02-20 18:24:31,424 INFO L290 TraceCheckUtils]: 62: Hoare triple {3870#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {3870#false} is VALID [2022-02-20 18:24:31,425 INFO L290 TraceCheckUtils]: 63: Hoare triple {3870#false} check_#res#1 := check_~tmp~1#1; {3870#false} is VALID [2022-02-20 18:24:31,425 INFO L290 TraceCheckUtils]: 64: Hoare triple {3870#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3870#false} is VALID [2022-02-20 18:24:31,425 INFO L290 TraceCheckUtils]: 65: Hoare triple {3870#false} assume 0 == assert_~arg#1 % 256; {3870#false} is VALID [2022-02-20 18:24:31,425 INFO L290 TraceCheckUtils]: 66: Hoare triple {3870#false} assume !false; {3870#false} is VALID [2022-02-20 18:24:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:31,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:31,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082970741] [2022-02-20 18:24:31,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082970741] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:31,426 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:31,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:31,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391245091] [2022-02-20 18:24:31,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:31,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-02-20 18:24:31,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:31,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:31,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:31,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:31,470 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:31,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:31,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:31,471 INFO L87 Difference]: Start difference. First operand 319 states and 500 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:31,813 INFO L93 Difference]: Finished difference Result 815 states and 1298 transitions. [2022-02-20 18:24:31,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:31,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-02-20 18:24:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:31,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2022-02-20 18:24:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2022-02-20 18:24:31,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 443 transitions. [2022-02-20 18:24:32,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 443 edges. 443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:32,127 INFO L225 Difference]: With dead ends: 815 [2022-02-20 18:24:32,127 INFO L226 Difference]: Without dead ends: 553 [2022-02-20 18:24:32,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:32,129 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 97 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 369 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:24:32,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 369 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:32,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-02-20 18:24:32,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 547. [2022-02-20 18:24:32,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:32,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 553 states. Second operand has 547 states, 546 states have (on average 1.575091575091575) internal successors, (860), 546 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:32,209 INFO L74 IsIncluded]: Start isIncluded. First operand 553 states. Second operand has 547 states, 546 states have (on average 1.575091575091575) internal successors, (860), 546 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:32,210 INFO L87 Difference]: Start difference. First operand 553 states. Second operand has 547 states, 546 states have (on average 1.575091575091575) internal successors, (860), 546 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:32,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:32,228 INFO L93 Difference]: Finished difference Result 553 states and 865 transitions. [2022-02-20 18:24:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 865 transitions. [2022-02-20 18:24:32,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:32,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:32,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 547 states, 546 states have (on average 1.575091575091575) internal successors, (860), 546 states have internal predecessors, (860), 0 states have call successors, (0), 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 553 states. [2022-02-20 18:24:32,231 INFO L87 Difference]: Start difference. First operand has 547 states, 546 states have (on average 1.575091575091575) internal successors, (860), 546 states have internal predecessors, (860), 0 states have call successors, (0), 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 553 states. [2022-02-20 18:24:32,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:32,250 INFO L93 Difference]: Finished difference Result 553 states and 865 transitions. [2022-02-20 18:24:32,250 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 865 transitions. [2022-02-20 18:24:32,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:32,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:32,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:32,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:32,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.575091575091575) internal successors, (860), 546 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:32,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 860 transitions. [2022-02-20 18:24:32,272 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 860 transitions. Word has length 67 [2022-02-20 18:24:32,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:32,272 INFO L470 AbstractCegarLoop]: Abstraction has 547 states and 860 transitions. [2022-02-20 18:24:32,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:32,273 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 860 transitions. [2022-02-20 18:24:32,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:24:32,273 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:32,274 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:32,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:24:32,274 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:32,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:32,275 INFO L85 PathProgramCache]: Analyzing trace with hash -544230961, now seen corresponding path program 1 times [2022-02-20 18:24:32,275 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:32,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063017403] [2022-02-20 18:24:32,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:32,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:32,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {6504#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {6504#true} is VALID [2022-02-20 18:24:32,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {6504#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {6504#true} is VALID [2022-02-20 18:24:32,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {6504#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {6504#true} is VALID [2022-02-20 18:24:32,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {6504#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {6504#true} is VALID [2022-02-20 18:24:32,364 INFO L290 TraceCheckUtils]: 4: Hoare triple {6504#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {6504#true} is VALID [2022-02-20 18:24:32,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {6504#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {6504#true} is VALID [2022-02-20 18:24:32,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {6504#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {6504#true} is VALID [2022-02-20 18:24:32,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {6504#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {6504#true} is VALID [2022-02-20 18:24:32,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {6504#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {6504#true} is VALID [2022-02-20 18:24:32,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {6504#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {6504#true} is VALID [2022-02-20 18:24:32,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {6504#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {6504#true} is VALID [2022-02-20 18:24:32,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {6504#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {6504#true} is VALID [2022-02-20 18:24:32,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {6504#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {6504#true} is VALID [2022-02-20 18:24:32,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {6504#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {6504#true} is VALID [2022-02-20 18:24:32,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {6504#true} assume ~id1~0 != ~id2~0; {6504#true} is VALID [2022-02-20 18:24:32,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {6504#true} assume ~id1~0 != ~id3~0; {6504#true} is VALID [2022-02-20 18:24:32,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {6504#true} assume ~id2~0 != ~id3~0; {6504#true} is VALID [2022-02-20 18:24:32,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {6504#true} assume ~id1~0 >= 0; {6504#true} is VALID [2022-02-20 18:24:32,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {6504#true} assume ~id2~0 >= 0; {6504#true} is VALID [2022-02-20 18:24:32,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {6504#true} assume ~id3~0 >= 0; {6504#true} is VALID [2022-02-20 18:24:32,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {6504#true} assume 0 == ~r1~0 % 256; {6504#true} is VALID [2022-02-20 18:24:32,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {6504#true} assume 0 == ~r2~0 % 256; {6504#true} is VALID [2022-02-20 18:24:32,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {6504#true} assume 0 == ~r3~0 % 256; {6504#true} is VALID [2022-02-20 18:24:32,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {6504#true} assume 0 != init_~r122~0#1 % 256; {6504#true} is VALID [2022-02-20 18:24:32,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {6504#true} assume 0 != init_~r132~0#1 % 256; {6504#true} is VALID [2022-02-20 18:24:32,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {6504#true} assume 0 != init_~r212~0#1 % 256; {6504#true} is VALID [2022-02-20 18:24:32,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {6504#true} assume 0 != init_~r232~0#1 % 256; {6504#true} is VALID [2022-02-20 18:24:32,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {6504#true} assume 0 != init_~r312~0#1 % 256; {6504#true} is VALID [2022-02-20 18:24:32,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {6504#true} assume 0 != init_~r322~0#1 % 256; {6504#true} is VALID [2022-02-20 18:24:32,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {6504#true} assume ~max1~0 == ~id1~0; {6504#true} is VALID [2022-02-20 18:24:32,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {6504#true} assume ~max2~0 == ~id2~0; {6504#true} is VALID [2022-02-20 18:24:32,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {6504#true} assume ~max3~0 == ~id3~0; {6504#true} is VALID [2022-02-20 18:24:32,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {6504#true} assume 0 == ~st1~0; {6506#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:32,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {6506#(<= ~st1~0 0)} assume 0 == ~st2~0; {6507#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {6507#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,373 INFO L290 TraceCheckUtils]: 43: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,374 INFO L290 TraceCheckUtils]: 44: Hoare triple {6508#(<= (+ ~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; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,374 INFO L290 TraceCheckUtils]: 45: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,375 INFO L290 TraceCheckUtils]: 47: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,377 INFO L290 TraceCheckUtils]: 51: Hoare triple {6508#(<= (+ ~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; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,377 INFO L290 TraceCheckUtils]: 52: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,377 INFO L290 TraceCheckUtils]: 53: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,378 INFO L290 TraceCheckUtils]: 54: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,378 INFO L290 TraceCheckUtils]: 55: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,378 INFO L290 TraceCheckUtils]: 56: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,379 INFO L290 TraceCheckUtils]: 57: Hoare triple {6508#(<= (+ ~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; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,379 INFO L290 TraceCheckUtils]: 58: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,380 INFO L290 TraceCheckUtils]: 59: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,380 INFO L290 TraceCheckUtils]: 60: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,380 INFO L290 TraceCheckUtils]: 61: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,381 INFO L290 TraceCheckUtils]: 62: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,381 INFO L290 TraceCheckUtils]: 63: Hoare triple {6508#(<= (+ ~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; {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:32,382 INFO L290 TraceCheckUtils]: 64: Hoare triple {6508#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {6505#false} is VALID [2022-02-20 18:24:32,382 INFO L290 TraceCheckUtils]: 65: Hoare triple {6505#false} check_#res#1 := check_~tmp~1#1; {6505#false} is VALID [2022-02-20 18:24:32,382 INFO L290 TraceCheckUtils]: 66: Hoare triple {6505#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {6505#false} is VALID [2022-02-20 18:24:32,382 INFO L290 TraceCheckUtils]: 67: Hoare triple {6505#false} assume 0 == assert_~arg#1 % 256; {6505#false} is VALID [2022-02-20 18:24:32,382 INFO L290 TraceCheckUtils]: 68: Hoare triple {6505#false} assume !false; {6505#false} is VALID [2022-02-20 18:24:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:32,383 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:32,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063017403] [2022-02-20 18:24:32,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063017403] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:32,384 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:32,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:24:32,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51360005] [2022-02-20 18:24:32,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:32,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-02-20 18:24:32,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:32,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:32,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:32,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:24:32,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:32,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:24:32,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:24:32,433 INFO L87 Difference]: Start difference. First operand 547 states and 860 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:33,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:33,912 INFO L93 Difference]: Finished difference Result 2339 states and 3782 transitions. [2022-02-20 18:24:33,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:24:33,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-02-20 18:24:33,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:33,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 964 transitions. [2022-02-20 18:24:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 964 transitions. [2022-02-20 18:24:33,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 964 transitions. [2022-02-20 18:24:34,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 964 edges. 964 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:34,723 INFO L225 Difference]: With dead ends: 2339 [2022-02-20 18:24:34,724 INFO L226 Difference]: Without dead ends: 1849 [2022-02-20 18:24:34,725 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:24:34,726 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 861 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:34,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [861 Valid, 1129 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:24:34,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2022-02-20 18:24:34,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 975. [2022-02-20 18:24:34,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:34,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1849 states. Second operand has 975 states, 974 states have (on average 1.5882956878850103) internal successors, (1547), 974 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:34,968 INFO L74 IsIncluded]: Start isIncluded. First operand 1849 states. Second operand has 975 states, 974 states have (on average 1.5882956878850103) internal successors, (1547), 974 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:34,970 INFO L87 Difference]: Start difference. First operand 1849 states. Second operand has 975 states, 974 states have (on average 1.5882956878850103) internal successors, (1547), 974 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:35,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:35,092 INFO L93 Difference]: Finished difference Result 1849 states and 2971 transitions. [2022-02-20 18:24:35,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2971 transitions. [2022-02-20 18:24:35,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:35,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:35,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 975 states, 974 states have (on average 1.5882956878850103) internal successors, (1547), 974 states have internal predecessors, (1547), 0 states have call successors, (0), 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 1849 states. [2022-02-20 18:24:35,098 INFO L87 Difference]: Start difference. First operand has 975 states, 974 states have (on average 1.5882956878850103) internal successors, (1547), 974 states have internal predecessors, (1547), 0 states have call successors, (0), 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 1849 states. [2022-02-20 18:24:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:35,254 INFO L93 Difference]: Finished difference Result 1849 states and 2971 transitions. [2022-02-20 18:24:35,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2971 transitions. [2022-02-20 18:24:35,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:35,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:35,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:35,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 974 states have (on average 1.5882956878850103) internal successors, (1547), 974 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1547 transitions. [2022-02-20 18:24:35,310 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1547 transitions. Word has length 69 [2022-02-20 18:24:35,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:35,310 INFO L470 AbstractCegarLoop]: Abstraction has 975 states and 1547 transitions. [2022-02-20 18:24:35,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:35,311 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1547 transitions. [2022-02-20 18:24:35,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:24:35,312 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:35,312 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:24:35,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:24:35,312 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:35,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:35,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1614123231, now seen corresponding path program 1 times [2022-02-20 18:24:35,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:35,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197802313] [2022-02-20 18:24:35,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:35,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:35,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {13919#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {13919#true} is VALID [2022-02-20 18:24:35,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {13919#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {13919#true} is VALID [2022-02-20 18:24:35,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {13919#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {13919#true} is VALID [2022-02-20 18:24:35,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {13919#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {13919#true} is VALID [2022-02-20 18:24:35,391 INFO L290 TraceCheckUtils]: 4: Hoare triple {13919#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {13919#true} is VALID [2022-02-20 18:24:35,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {13919#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {13919#true} is VALID [2022-02-20 18:24:35,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {13919#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {13919#true} is VALID [2022-02-20 18:24:35,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {13919#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {13919#true} is VALID [2022-02-20 18:24:35,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {13919#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {13919#true} is VALID [2022-02-20 18:24:35,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {13919#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {13919#true} is VALID [2022-02-20 18:24:35,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {13919#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {13919#true} is VALID [2022-02-20 18:24:35,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {13919#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {13919#true} is VALID [2022-02-20 18:24:35,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {13919#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {13919#true} is VALID [2022-02-20 18:24:35,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {13919#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {13919#true} is VALID [2022-02-20 18:24:35,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {13919#true} assume ~id1~0 != ~id2~0; {13919#true} is VALID [2022-02-20 18:24:35,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {13919#true} assume ~id1~0 != ~id3~0; {13919#true} is VALID [2022-02-20 18:24:35,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {13919#true} assume ~id2~0 != ~id3~0; {13919#true} is VALID [2022-02-20 18:24:35,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {13919#true} assume ~id1~0 >= 0; {13919#true} is VALID [2022-02-20 18:24:35,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {13919#true} assume ~id2~0 >= 0; {13919#true} is VALID [2022-02-20 18:24:35,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {13919#true} assume ~id3~0 >= 0; {13919#true} is VALID [2022-02-20 18:24:35,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {13919#true} assume 0 == ~r1~0 % 256; {13919#true} is VALID [2022-02-20 18:24:35,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {13919#true} assume 0 == ~r2~0 % 256; {13919#true} is VALID [2022-02-20 18:24:35,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {13919#true} assume 0 == ~r3~0 % 256; {13919#true} is VALID [2022-02-20 18:24:35,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {13919#true} assume 0 != init_~r122~0#1 % 256; {13919#true} is VALID [2022-02-20 18:24:35,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {13919#true} assume 0 != init_~r132~0#1 % 256; {13919#true} is VALID [2022-02-20 18:24:35,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {13919#true} assume 0 != init_~r212~0#1 % 256; {13919#true} is VALID [2022-02-20 18:24:35,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {13919#true} assume 0 != init_~r232~0#1 % 256; {13919#true} is VALID [2022-02-20 18:24:35,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {13919#true} assume 0 != init_~r312~0#1 % 256; {13919#true} is VALID [2022-02-20 18:24:35,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {13919#true} assume 0 != init_~r322~0#1 % 256; {13919#true} is VALID [2022-02-20 18:24:35,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {13919#true} assume ~max1~0 == ~id1~0; {13919#true} is VALID [2022-02-20 18:24:35,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {13919#true} assume ~max2~0 == ~id2~0; {13919#true} is VALID [2022-02-20 18:24:35,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {13919#true} assume ~max3~0 == ~id3~0; {13919#true} is VALID [2022-02-20 18:24:35,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {13919#true} assume 0 == ~st1~0; {13921#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:35,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {13921#(<= ~st1~0 0)} assume 0 == ~st2~0; {13921#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:35,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {13921#(<= ~st1~0 0)} assume 0 == ~st3~0; {13921#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:35,398 INFO L290 TraceCheckUtils]: 35: Hoare triple {13921#(<= ~st1~0 0)} assume 0 == ~nl1~0; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,400 INFO L290 TraceCheckUtils]: 39: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,400 INFO L290 TraceCheckUtils]: 40: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,401 INFO L290 TraceCheckUtils]: 43: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,401 INFO L290 TraceCheckUtils]: 44: Hoare triple {13922#(<= (+ ~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; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,402 INFO L290 TraceCheckUtils]: 45: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,402 INFO L290 TraceCheckUtils]: 46: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,403 INFO L290 TraceCheckUtils]: 47: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,403 INFO L290 TraceCheckUtils]: 48: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,404 INFO L290 TraceCheckUtils]: 50: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,405 INFO L290 TraceCheckUtils]: 51: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,405 INFO L290 TraceCheckUtils]: 52: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,406 INFO L290 TraceCheckUtils]: 53: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,406 INFO L290 TraceCheckUtils]: 54: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,406 INFO L290 TraceCheckUtils]: 55: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,407 INFO L290 TraceCheckUtils]: 56: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,407 INFO L290 TraceCheckUtils]: 57: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,408 INFO L290 TraceCheckUtils]: 58: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,408 INFO L290 TraceCheckUtils]: 59: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,408 INFO L290 TraceCheckUtils]: 60: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,409 INFO L290 TraceCheckUtils]: 61: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,409 INFO L290 TraceCheckUtils]: 62: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,409 INFO L290 TraceCheckUtils]: 63: Hoare triple {13922#(<= (+ ~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; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,410 INFO L290 TraceCheckUtils]: 64: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {13922#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:35,410 INFO L290 TraceCheckUtils]: 65: Hoare triple {13922#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);check_~tmp~1#1 := 0; {13920#false} is VALID [2022-02-20 18:24:35,411 INFO L290 TraceCheckUtils]: 66: Hoare triple {13920#false} check_#res#1 := check_~tmp~1#1; {13920#false} is VALID [2022-02-20 18:24:35,411 INFO L290 TraceCheckUtils]: 67: Hoare triple {13920#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {13920#false} is VALID [2022-02-20 18:24:35,411 INFO L290 TraceCheckUtils]: 68: Hoare triple {13920#false} assume 0 == assert_~arg#1 % 256; {13920#false} is VALID [2022-02-20 18:24:35,411 INFO L290 TraceCheckUtils]: 69: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2022-02-20 18:24:35,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:35,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:35,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197802313] [2022-02-20 18:24:35,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197802313] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:35,412 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:35,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:24:35,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624563854] [2022-02-20 18:24:35,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:35,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-20 18:24:35,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:35,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:35,468 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:24:35,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:24:35,468 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:35,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:24:35,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:24:35,469 INFO L87 Difference]: Start difference. First operand 975 states and 1547 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:36,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:36,707 INFO L93 Difference]: Finished difference Result 2837 states and 4577 transitions. [2022-02-20 18:24:36,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:24:36,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-20 18:24:36,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-02-20 18:24:36,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:36,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-02-20 18:24:36,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 583 transitions. [2022-02-20 18:24:37,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:37,185 INFO L225 Difference]: With dead ends: 2837 [2022-02-20 18:24:37,185 INFO L226 Difference]: Without dead ends: 1919 [2022-02-20 18:24:37,186 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:24:37,187 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 365 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 585 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:24:37,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 585 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:37,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2022-02-20 18:24:37,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1438. [2022-02-20 18:24:37,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:37,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1919 states. Second operand has 1438 states, 1437 states have (on average 1.5984690327070286) internal successors, (2297), 1437 states have internal predecessors, (2297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:37,614 INFO L74 IsIncluded]: Start isIncluded. First operand 1919 states. Second operand has 1438 states, 1437 states have (on average 1.5984690327070286) internal successors, (2297), 1437 states have internal predecessors, (2297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:37,616 INFO L87 Difference]: Start difference. First operand 1919 states. Second operand has 1438 states, 1437 states have (on average 1.5984690327070286) internal successors, (2297), 1437 states have internal predecessors, (2297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:37,740 INFO L93 Difference]: Finished difference Result 1919 states and 3091 transitions. [2022-02-20 18:24:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 3091 transitions. [2022-02-20 18:24:37,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:37,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:37,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 1438 states, 1437 states have (on average 1.5984690327070286) internal successors, (2297), 1437 states have internal predecessors, (2297), 0 states have call successors, (0), 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 1919 states. [2022-02-20 18:24:37,747 INFO L87 Difference]: Start difference. First operand has 1438 states, 1437 states have (on average 1.5984690327070286) internal successors, (2297), 1437 states have internal predecessors, (2297), 0 states have call successors, (0), 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 1919 states. [2022-02-20 18:24:37,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:37,865 INFO L93 Difference]: Finished difference Result 1919 states and 3091 transitions. [2022-02-20 18:24:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 3091 transitions. [2022-02-20 18:24:37,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:37,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:37,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:37,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1437 states have (on average 1.5984690327070286) internal successors, (2297), 1437 states have internal predecessors, (2297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 2297 transitions. [2022-02-20 18:24:37,933 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 2297 transitions. Word has length 70 [2022-02-20 18:24:37,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:37,934 INFO L470 AbstractCegarLoop]: Abstraction has 1438 states and 2297 transitions. [2022-02-20 18:24:37,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:37,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 2297 transitions. [2022-02-20 18:24:37,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 18:24:37,935 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:37,935 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:37,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:24:37,936 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:37,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:37,936 INFO L85 PathProgramCache]: Analyzing trace with hash -252040890, now seen corresponding path program 1 times [2022-02-20 18:24:37,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:37,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859818766] [2022-02-20 18:24:37,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:37,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:38,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {22544#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {22544#true} is VALID [2022-02-20 18:24:38,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {22544#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {22544#true} is VALID [2022-02-20 18:24:38,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {22544#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {22544#true} is VALID [2022-02-20 18:24:38,003 INFO L290 TraceCheckUtils]: 3: Hoare triple {22544#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {22544#true} is VALID [2022-02-20 18:24:38,004 INFO L290 TraceCheckUtils]: 4: Hoare triple {22544#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {22544#true} is VALID [2022-02-20 18:24:38,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {22544#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {22544#true} is VALID [2022-02-20 18:24:38,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {22544#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {22544#true} is VALID [2022-02-20 18:24:38,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {22544#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {22544#true} is VALID [2022-02-20 18:24:38,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {22544#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {22544#true} is VALID [2022-02-20 18:24:38,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {22544#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {22544#true} is VALID [2022-02-20 18:24:38,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {22544#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {22544#true} is VALID [2022-02-20 18:24:38,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {22544#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {22544#true} is VALID [2022-02-20 18:24:38,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {22544#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {22544#true} is VALID [2022-02-20 18:24:38,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {22544#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {22544#true} is VALID [2022-02-20 18:24:38,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {22544#true} assume ~id1~0 != ~id2~0; {22544#true} is VALID [2022-02-20 18:24:38,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {22544#true} assume ~id1~0 != ~id3~0; {22544#true} is VALID [2022-02-20 18:24:38,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {22544#true} assume ~id2~0 != ~id3~0; {22544#true} is VALID [2022-02-20 18:24:38,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {22544#true} assume ~id1~0 >= 0; {22544#true} is VALID [2022-02-20 18:24:38,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {22544#true} assume ~id2~0 >= 0; {22544#true} is VALID [2022-02-20 18:24:38,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {22544#true} assume ~id3~0 >= 0; {22544#true} is VALID [2022-02-20 18:24:38,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {22544#true} assume 0 == ~r1~0 % 256; {22544#true} is VALID [2022-02-20 18:24:38,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {22544#true} assume 0 == ~r2~0 % 256; {22544#true} is VALID [2022-02-20 18:24:38,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {22544#true} assume 0 == ~r3~0 % 256; {22544#true} is VALID [2022-02-20 18:24:38,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {22544#true} assume 0 != init_~r122~0#1 % 256; {22544#true} is VALID [2022-02-20 18:24:38,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {22544#true} assume 0 != init_~r132~0#1 % 256; {22544#true} is VALID [2022-02-20 18:24:38,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {22544#true} assume 0 != init_~r212~0#1 % 256; {22544#true} is VALID [2022-02-20 18:24:38,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {22544#true} assume 0 != init_~r232~0#1 % 256; {22544#true} is VALID [2022-02-20 18:24:38,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {22544#true} assume 0 != init_~r312~0#1 % 256; {22544#true} is VALID [2022-02-20 18:24:38,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {22544#true} assume 0 != init_~r322~0#1 % 256; {22544#true} is VALID [2022-02-20 18:24:38,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {22544#true} assume ~max1~0 == ~id1~0; {22544#true} is VALID [2022-02-20 18:24:38,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {22544#true} assume ~max2~0 == ~id2~0; {22544#true} is VALID [2022-02-20 18:24:38,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {22544#true} assume ~max3~0 == ~id3~0; {22544#true} is VALID [2022-02-20 18:24:38,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {22544#true} assume 0 == ~st1~0; {22544#true} is VALID [2022-02-20 18:24:38,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {22544#true} assume 0 == ~st2~0; {22546#(<= ~st2~0 0)} is VALID [2022-02-20 18:24:38,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {22546#(<= ~st2~0 0)} assume 0 == ~st3~0; {22546#(<= ~st2~0 0)} is VALID [2022-02-20 18:24:38,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {22546#(<= ~st2~0 0)} assume 0 == ~nl1~0; {22546#(<= ~st2~0 0)} is VALID [2022-02-20 18:24:38,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {22546#(<= ~st2~0 0)} assume 0 == ~nl2~0; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,010 INFO L290 TraceCheckUtils]: 38: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,011 INFO L290 TraceCheckUtils]: 39: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,013 INFO L290 TraceCheckUtils]: 43: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,013 INFO L290 TraceCheckUtils]: 44: Hoare triple {22547#(<= (+ ~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; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,013 INFO L290 TraceCheckUtils]: 45: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,014 INFO L290 TraceCheckUtils]: 46: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode1~0 % 256); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,014 INFO L290 TraceCheckUtils]: 47: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 % 256 < 2; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep12~0 % 256); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,015 INFO L290 TraceCheckUtils]: 49: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep13~0 % 256); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,016 INFO L290 TraceCheckUtils]: 50: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,016 INFO L290 TraceCheckUtils]: 51: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,016 INFO L290 TraceCheckUtils]: 52: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode2~0 % 256); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,017 INFO L290 TraceCheckUtils]: 53: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 % 256 < 2; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,017 INFO L290 TraceCheckUtils]: 54: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep21~0 % 256); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,018 INFO L290 TraceCheckUtils]: 55: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep23~0 % 256); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,018 INFO L290 TraceCheckUtils]: 56: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,018 INFO L290 TraceCheckUtils]: 57: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,019 INFO L290 TraceCheckUtils]: 58: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode3~0 % 256); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,019 INFO L290 TraceCheckUtils]: 59: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 % 256 < 2; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,020 INFO L290 TraceCheckUtils]: 60: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep31~0 % 256); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,020 INFO L290 TraceCheckUtils]: 61: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep32~0 % 256); {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,020 INFO L290 TraceCheckUtils]: 62: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,021 INFO L290 TraceCheckUtils]: 63: Hoare triple {22547#(<= (+ ~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; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,021 INFO L290 TraceCheckUtils]: 64: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,022 INFO L290 TraceCheckUtils]: 65: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {22547#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:38,022 INFO L290 TraceCheckUtils]: 66: Hoare triple {22547#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);check_~tmp~1#1 := 0; {22545#false} is VALID [2022-02-20 18:24:38,022 INFO L290 TraceCheckUtils]: 67: Hoare triple {22545#false} check_#res#1 := check_~tmp~1#1; {22545#false} is VALID [2022-02-20 18:24:38,023 INFO L290 TraceCheckUtils]: 68: Hoare triple {22545#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {22545#false} is VALID [2022-02-20 18:24:38,023 INFO L290 TraceCheckUtils]: 69: Hoare triple {22545#false} assume 0 == assert_~arg#1 % 256; {22545#false} is VALID [2022-02-20 18:24:38,023 INFO L290 TraceCheckUtils]: 70: Hoare triple {22545#false} assume !false; {22545#false} is VALID [2022-02-20 18:24:38,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:38,024 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:38,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859818766] [2022-02-20 18:24:38,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859818766] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:38,024 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:38,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:24:38,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5627224] [2022-02-20 18:24:38,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:38,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-02-20 18:24:38,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:38,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:38,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:38,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:24:38,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:38,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:24:38,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:24:38,072 INFO L87 Difference]: Start difference. First operand 1438 states and 2297 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:40,052 INFO L93 Difference]: Finished difference Result 4165 states and 6715 transitions. [2022-02-20 18:24:40,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:24:40,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-02-20 18:24:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:40,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-02-20 18:24:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-02-20 18:24:40,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 583 transitions. [2022-02-20 18:24:40,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:40,634 INFO L225 Difference]: With dead ends: 4165 [2022-02-20 18:24:40,634 INFO L226 Difference]: Without dead ends: 2784 [2022-02-20 18:24:40,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:24:40,636 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 363 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 661 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:24:40,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 661 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:40,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2022-02-20 18:24:41,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2099. [2022-02-20 18:24:41,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:41,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2784 states. Second operand has 2099 states, 2098 states have (on average 1.5986653956148713) internal successors, (3354), 2098 states have internal predecessors, (3354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:41,343 INFO L74 IsIncluded]: Start isIncluded. First operand 2784 states. Second operand has 2099 states, 2098 states have (on average 1.5986653956148713) internal successors, (3354), 2098 states have internal predecessors, (3354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:41,345 INFO L87 Difference]: Start difference. First operand 2784 states. Second operand has 2099 states, 2098 states have (on average 1.5986653956148713) internal successors, (3354), 2098 states have internal predecessors, (3354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:41,568 INFO L93 Difference]: Finished difference Result 2784 states and 4473 transitions. [2022-02-20 18:24:41,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4473 transitions. [2022-02-20 18:24:41,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:41,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:41,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 2099 states, 2098 states have (on average 1.5986653956148713) internal successors, (3354), 2098 states have internal predecessors, (3354), 0 states have call successors, (0), 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 2784 states. [2022-02-20 18:24:41,579 INFO L87 Difference]: Start difference. First operand has 2099 states, 2098 states have (on average 1.5986653956148713) internal successors, (3354), 2098 states have internal predecessors, (3354), 0 states have call successors, (0), 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 2784 states. [2022-02-20 18:24:41,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:41,820 INFO L93 Difference]: Finished difference Result 2784 states and 4473 transitions. [2022-02-20 18:24:41,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4473 transitions. [2022-02-20 18:24:41,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:41,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:41,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:41,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2099 states, 2098 states have (on average 1.5986653956148713) internal successors, (3354), 2098 states have internal predecessors, (3354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:41,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 3354 transitions. [2022-02-20 18:24:41,966 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 3354 transitions. Word has length 71 [2022-02-20 18:24:41,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:41,966 INFO L470 AbstractCegarLoop]: Abstraction has 2099 states and 3354 transitions. [2022-02-20 18:24:41,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:41,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 3354 transitions. [2022-02-20 18:24:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:24:41,968 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:41,968 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:24:41,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:24:41,968 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:41,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:41,969 INFO L85 PathProgramCache]: Analyzing trace with hash -630566449, now seen corresponding path program 1 times [2022-02-20 18:24:41,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:41,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022927625] [2022-02-20 18:24:41,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:41,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:42,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {35119#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {35119#true} is VALID [2022-02-20 18:24:42,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {35119#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {35119#true} is VALID [2022-02-20 18:24:42,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {35119#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {35119#true} is VALID [2022-02-20 18:24:42,024 INFO L290 TraceCheckUtils]: 3: Hoare triple {35119#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {35119#true} is VALID [2022-02-20 18:24:42,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {35119#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {35119#true} is VALID [2022-02-20 18:24:42,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {35119#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {35119#true} is VALID [2022-02-20 18:24:42,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {35119#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {35119#true} is VALID [2022-02-20 18:24:42,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {35119#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {35119#true} is VALID [2022-02-20 18:24:42,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {35119#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {35119#true} is VALID [2022-02-20 18:24:42,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {35119#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {35119#true} is VALID [2022-02-20 18:24:42,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {35119#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {35119#true} is VALID [2022-02-20 18:24:42,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {35119#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {35119#true} is VALID [2022-02-20 18:24:42,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {35119#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {35119#true} is VALID [2022-02-20 18:24:42,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {35119#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {35119#true} is VALID [2022-02-20 18:24:42,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {35119#true} assume ~id1~0 != ~id2~0; {35119#true} is VALID [2022-02-20 18:24:42,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {35119#true} assume ~id1~0 != ~id3~0; {35119#true} is VALID [2022-02-20 18:24:42,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {35119#true} assume ~id2~0 != ~id3~0; {35119#true} is VALID [2022-02-20 18:24:42,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {35119#true} assume ~id1~0 >= 0; {35119#true} is VALID [2022-02-20 18:24:42,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {35119#true} assume ~id2~0 >= 0; {35119#true} is VALID [2022-02-20 18:24:42,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {35119#true} assume ~id3~0 >= 0; {35119#true} is VALID [2022-02-20 18:24:42,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {35119#true} assume 0 == ~r1~0 % 256; {35119#true} is VALID [2022-02-20 18:24:42,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {35119#true} assume 0 == ~r2~0 % 256; {35119#true} is VALID [2022-02-20 18:24:42,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {35119#true} assume 0 == ~r3~0 % 256; {35119#true} is VALID [2022-02-20 18:24:42,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {35119#true} assume 0 != init_~r122~0#1 % 256; {35119#true} is VALID [2022-02-20 18:24:42,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {35119#true} assume 0 != init_~r132~0#1 % 256; {35119#true} is VALID [2022-02-20 18:24:42,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {35119#true} assume 0 != init_~r212~0#1 % 256; {35119#true} is VALID [2022-02-20 18:24:42,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {35119#true} assume 0 != init_~r232~0#1 % 256; {35119#true} is VALID [2022-02-20 18:24:42,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {35119#true} assume 0 != init_~r312~0#1 % 256; {35119#true} is VALID [2022-02-20 18:24:42,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {35119#true} assume 0 != init_~r322~0#1 % 256; {35119#true} is VALID [2022-02-20 18:24:42,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {35119#true} assume ~max1~0 == ~id1~0; {35119#true} is VALID [2022-02-20 18:24:42,029 INFO L290 TraceCheckUtils]: 30: Hoare triple {35119#true} assume ~max2~0 == ~id2~0; {35119#true} is VALID [2022-02-20 18:24:42,029 INFO L290 TraceCheckUtils]: 31: Hoare triple {35119#true} assume ~max3~0 == ~id3~0; {35119#true} is VALID [2022-02-20 18:24:42,029 INFO L290 TraceCheckUtils]: 32: Hoare triple {35119#true} assume 0 == ~st1~0; {35119#true} is VALID [2022-02-20 18:24:42,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {35119#true} assume 0 == ~st2~0; {35119#true} is VALID [2022-02-20 18:24:42,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {35119#true} assume 0 == ~st3~0; {35119#true} is VALID [2022-02-20 18:24:42,029 INFO L290 TraceCheckUtils]: 35: Hoare triple {35119#true} assume 0 == ~nl1~0; {35119#true} is VALID [2022-02-20 18:24:42,030 INFO L290 TraceCheckUtils]: 36: Hoare triple {35119#true} assume 0 == ~nl2~0; {35119#true} is VALID [2022-02-20 18:24:42,030 INFO L290 TraceCheckUtils]: 37: Hoare triple {35119#true} assume 0 == ~nl3~0; {35119#true} is VALID [2022-02-20 18:24:42,030 INFO L290 TraceCheckUtils]: 38: Hoare triple {35119#true} assume 0 == ~mode1~0 % 256; {35119#true} is VALID [2022-02-20 18:24:42,030 INFO L290 TraceCheckUtils]: 39: Hoare triple {35119#true} assume 0 == ~mode2~0 % 256; {35119#true} is VALID [2022-02-20 18:24:42,031 INFO L290 TraceCheckUtils]: 40: Hoare triple {35119#true} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:42,031 INFO L290 TraceCheckUtils]: 41: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:42,032 INFO L290 TraceCheckUtils]: 42: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:42,032 INFO L290 TraceCheckUtils]: 43: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:42,033 INFO L290 TraceCheckUtils]: 44: Hoare triple {35121#(= (+ (* (- 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; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:42,033 INFO L290 TraceCheckUtils]: 45: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:42,033 INFO L290 TraceCheckUtils]: 46: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:42,034 INFO L290 TraceCheckUtils]: 47: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 % 256 < 2; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:42,034 INFO L290 TraceCheckUtils]: 48: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep12~0 % 256); {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:42,035 INFO L290 TraceCheckUtils]: 49: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep13~0 % 256); {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:42,035 INFO L290 TraceCheckUtils]: 50: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:42,036 INFO L290 TraceCheckUtils]: 51: Hoare triple {35121#(= (+ (* (- 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; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:42,036 INFO L290 TraceCheckUtils]: 52: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:42,036 INFO L290 TraceCheckUtils]: 53: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 % 256 < 2; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:42,037 INFO L290 TraceCheckUtils]: 54: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep21~0 % 256); {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:42,037 INFO L290 TraceCheckUtils]: 55: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep23~0 % 256); {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:42,038 INFO L290 TraceCheckUtils]: 56: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:42,038 INFO L290 TraceCheckUtils]: 57: Hoare triple {35121#(= (+ (* (- 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; {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:42,039 INFO L290 TraceCheckUtils]: 58: Hoare triple {35121#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256; {35120#false} is VALID [2022-02-20 18:24:42,039 INFO L290 TraceCheckUtils]: 59: Hoare triple {35120#false} assume !(255 == ~r3~0 % 256); {35120#false} is VALID [2022-02-20 18:24:42,039 INFO L290 TraceCheckUtils]: 60: Hoare triple {35120#false} ~r3~0 := 1 + ~r3~0 % 256; {35120#false} is VALID [2022-02-20 18:24:42,039 INFO L290 TraceCheckUtils]: 61: Hoare triple {35120#false} assume !(0 != ~ep13~0 % 256); {35120#false} is VALID [2022-02-20 18:24:42,039 INFO L290 TraceCheckUtils]: 62: Hoare triple {35120#false} assume !(0 != ~ep23~0 % 256); {35120#false} is VALID [2022-02-20 18:24:42,040 INFO L290 TraceCheckUtils]: 63: Hoare triple {35120#false} assume 2 == ~r3~0 % 256; {35120#false} is VALID [2022-02-20 18:24:42,040 INFO L290 TraceCheckUtils]: 64: Hoare triple {35120#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {35120#false} is VALID [2022-02-20 18:24:42,040 INFO L290 TraceCheckUtils]: 65: Hoare triple {35120#false} ~mode3~0 := 0; {35120#false} is VALID [2022-02-20 18:24:42,040 INFO L290 TraceCheckUtils]: 66: Hoare triple {35120#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; {35120#false} is VALID [2022-02-20 18:24:42,040 INFO L290 TraceCheckUtils]: 67: Hoare triple {35120#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {35120#false} is VALID [2022-02-20 18:24:42,040 INFO L290 TraceCheckUtils]: 68: Hoare triple {35120#false} check_#res#1 := check_~tmp~1#1; {35120#false} is VALID [2022-02-20 18:24:42,041 INFO L290 TraceCheckUtils]: 69: Hoare triple {35120#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {35120#false} is VALID [2022-02-20 18:24:42,041 INFO L290 TraceCheckUtils]: 70: Hoare triple {35120#false} assume 0 == assert_~arg#1 % 256; {35120#false} is VALID [2022-02-20 18:24:42,041 INFO L290 TraceCheckUtils]: 71: Hoare triple {35120#false} assume !false; {35120#false} is VALID [2022-02-20 18:24:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:42,041 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:42,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022927625] [2022-02-20 18:24:42,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022927625] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:42,042 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:42,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:42,042 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502362573] [2022-02-20 18:24:42,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:42,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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:24:42,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:42,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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:24:42,091 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:24:42,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:42,091 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:42,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:42,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:42,092 INFO L87 Difference]: Start difference. First operand 2099 states and 3354 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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:24:43,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:43,986 INFO L93 Difference]: Finished difference Result 4342 states and 6948 transitions. [2022-02-20 18:24:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:43,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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:24:43,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:43,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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:24:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2022-02-20 18:24:43,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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:24:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2022-02-20 18:24:43,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 427 transitions. [2022-02-20 18:24:44,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:44,624 INFO L225 Difference]: With dead ends: 4342 [2022-02-20 18:24:44,624 INFO L226 Difference]: Without dead ends: 3126 [2022-02-20 18:24:44,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:44,626 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 96 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:44,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 415 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2022-02-20 18:24:45,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 3124. [2022-02-20 18:24:45,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:45,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3126 states. Second operand has 3124 states, 3123 states have (on average 1.585014409221902) internal successors, (4950), 3123 states have internal predecessors, (4950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:45,655 INFO L74 IsIncluded]: Start isIncluded. First operand 3126 states. Second operand has 3124 states, 3123 states have (on average 1.585014409221902) internal successors, (4950), 3123 states have internal predecessors, (4950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:45,659 INFO L87 Difference]: Start difference. First operand 3126 states. Second operand has 3124 states, 3123 states have (on average 1.585014409221902) internal successors, (4950), 3123 states have internal predecessors, (4950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:45,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:45,990 INFO L93 Difference]: Finished difference Result 3126 states and 4951 transitions. [2022-02-20 18:24:45,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 4951 transitions. [2022-02-20 18:24:45,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:45,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:45,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 3124 states, 3123 states have (on average 1.585014409221902) internal successors, (4950), 3123 states have internal predecessors, (4950), 0 states have call successors, (0), 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 3126 states. [2022-02-20 18:24:46,001 INFO L87 Difference]: Start difference. First operand has 3124 states, 3123 states have (on average 1.585014409221902) internal successors, (4950), 3123 states have internal predecessors, (4950), 0 states have call successors, (0), 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 3126 states. [2022-02-20 18:24:46,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:46,352 INFO L93 Difference]: Finished difference Result 3126 states and 4951 transitions. [2022-02-20 18:24:46,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 4951 transitions. [2022-02-20 18:24:46,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:46,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:46,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:46,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:46,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 3123 states have (on average 1.585014409221902) internal successors, (4950), 3123 states have internal predecessors, (4950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4950 transitions. [2022-02-20 18:24:46,761 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4950 transitions. Word has length 72 [2022-02-20 18:24:46,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:46,762 INFO L470 AbstractCegarLoop]: Abstraction has 3124 states and 4950 transitions. [2022-02-20 18:24:46,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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:24:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4950 transitions. [2022-02-20 18:24:46,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:24:46,763 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:46,764 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:24:46,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:24:46,764 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:46,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:46,765 INFO L85 PathProgramCache]: Analyzing trace with hash -808156936, now seen corresponding path program 1 times [2022-02-20 18:24:46,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:46,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886916926] [2022-02-20 18:24:46,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:46,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:46,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {49775#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {49775#true} is VALID [2022-02-20 18:24:46,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {49775#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {49775#true} is VALID [2022-02-20 18:24:46,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {49775#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {49775#true} is VALID [2022-02-20 18:24:46,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {49775#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {49775#true} is VALID [2022-02-20 18:24:46,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {49775#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {49775#true} is VALID [2022-02-20 18:24:46,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {49775#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {49775#true} is VALID [2022-02-20 18:24:46,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {49775#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {49775#true} is VALID [2022-02-20 18:24:46,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {49775#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {49775#true} is VALID [2022-02-20 18:24:46,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {49775#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {49775#true} is VALID [2022-02-20 18:24:46,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {49775#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {49775#true} is VALID [2022-02-20 18:24:46,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {49775#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {49775#true} is VALID [2022-02-20 18:24:46,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {49775#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {49775#true} is VALID [2022-02-20 18:24:46,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {49775#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {49775#true} is VALID [2022-02-20 18:24:46,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {49775#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {49775#true} is VALID [2022-02-20 18:24:46,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {49775#true} assume ~id1~0 != ~id2~0; {49775#true} is VALID [2022-02-20 18:24:46,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {49775#true} assume ~id1~0 != ~id3~0; {49775#true} is VALID [2022-02-20 18:24:46,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {49775#true} assume ~id2~0 != ~id3~0; {49775#true} is VALID [2022-02-20 18:24:46,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {49775#true} assume ~id1~0 >= 0; {49775#true} is VALID [2022-02-20 18:24:46,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {49775#true} assume ~id2~0 >= 0; {49775#true} is VALID [2022-02-20 18:24:46,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {49775#true} assume ~id3~0 >= 0; {49775#true} is VALID [2022-02-20 18:24:46,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {49775#true} assume 0 == ~r1~0 % 256; {49775#true} is VALID [2022-02-20 18:24:46,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {49775#true} assume 0 == ~r2~0 % 256; {49775#true} is VALID [2022-02-20 18:24:46,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {49775#true} assume 0 == ~r3~0 % 256; {49775#true} is VALID [2022-02-20 18:24:46,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {49775#true} assume 0 != init_~r122~0#1 % 256; {49775#true} is VALID [2022-02-20 18:24:46,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {49775#true} assume 0 != init_~r132~0#1 % 256; {49775#true} is VALID [2022-02-20 18:24:46,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {49775#true} assume 0 != init_~r212~0#1 % 256; {49775#true} is VALID [2022-02-20 18:24:46,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {49775#true} assume 0 != init_~r232~0#1 % 256; {49775#true} is VALID [2022-02-20 18:24:46,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {49775#true} assume 0 != init_~r312~0#1 % 256; {49775#true} is VALID [2022-02-20 18:24:46,825 INFO L290 TraceCheckUtils]: 28: Hoare triple {49775#true} assume 0 != init_~r322~0#1 % 256; {49775#true} is VALID [2022-02-20 18:24:46,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {49775#true} assume ~max1~0 == ~id1~0; {49775#true} is VALID [2022-02-20 18:24:46,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {49775#true} assume ~max2~0 == ~id2~0; {49775#true} is VALID [2022-02-20 18:24:46,825 INFO L290 TraceCheckUtils]: 31: Hoare triple {49775#true} assume ~max3~0 == ~id3~0; {49775#true} is VALID [2022-02-20 18:24:46,825 INFO L290 TraceCheckUtils]: 32: Hoare triple {49775#true} assume 0 == ~st1~0; {49775#true} is VALID [2022-02-20 18:24:46,826 INFO L290 TraceCheckUtils]: 33: Hoare triple {49775#true} assume 0 == ~st2~0; {49775#true} is VALID [2022-02-20 18:24:46,826 INFO L290 TraceCheckUtils]: 34: Hoare triple {49775#true} assume 0 == ~st3~0; {49777#(<= ~st3~0 0)} is VALID [2022-02-20 18:24:46,826 INFO L290 TraceCheckUtils]: 35: Hoare triple {49777#(<= ~st3~0 0)} assume 0 == ~nl1~0; {49777#(<= ~st3~0 0)} is VALID [2022-02-20 18:24:46,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {49777#(<= ~st3~0 0)} assume 0 == ~nl2~0; {49777#(<= ~st3~0 0)} is VALID [2022-02-20 18:24:46,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {49777#(<= ~st3~0 0)} assume 0 == ~nl3~0; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,828 INFO L290 TraceCheckUtils]: 38: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,828 INFO L290 TraceCheckUtils]: 39: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,829 INFO L290 TraceCheckUtils]: 40: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,829 INFO L290 TraceCheckUtils]: 41: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,829 INFO L290 TraceCheckUtils]: 42: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,830 INFO L290 TraceCheckUtils]: 43: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,830 INFO L290 TraceCheckUtils]: 44: Hoare triple {49778#(<= (+ ~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; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,831 INFO L290 TraceCheckUtils]: 45: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,831 INFO L290 TraceCheckUtils]: 46: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode1~0 % 256); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,832 INFO L290 TraceCheckUtils]: 47: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 % 256 < 2; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,832 INFO L290 TraceCheckUtils]: 48: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep12~0 % 256); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,832 INFO L290 TraceCheckUtils]: 49: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep13~0 % 256); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,833 INFO L290 TraceCheckUtils]: 50: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,833 INFO L290 TraceCheckUtils]: 51: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,834 INFO L290 TraceCheckUtils]: 52: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode2~0 % 256); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,834 INFO L290 TraceCheckUtils]: 53: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 % 256 < 2; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,835 INFO L290 TraceCheckUtils]: 54: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep21~0 % 256); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,835 INFO L290 TraceCheckUtils]: 55: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep23~0 % 256); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,835 INFO L290 TraceCheckUtils]: 56: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,836 INFO L290 TraceCheckUtils]: 57: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,836 INFO L290 TraceCheckUtils]: 58: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode3~0 % 256); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,837 INFO L290 TraceCheckUtils]: 59: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 % 256 < 2; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,837 INFO L290 TraceCheckUtils]: 60: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep31~0 % 256); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,838 INFO L290 TraceCheckUtils]: 61: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep32~0 % 256); {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,838 INFO L290 TraceCheckUtils]: 62: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,838 INFO L290 TraceCheckUtils]: 63: Hoare triple {49778#(<= (+ ~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; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,839 INFO L290 TraceCheckUtils]: 64: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,839 INFO L290 TraceCheckUtils]: 65: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,840 INFO L290 TraceCheckUtils]: 66: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {49778#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:46,840 INFO L290 TraceCheckUtils]: 67: Hoare triple {49778#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);check_~tmp~1#1 := 0; {49776#false} is VALID [2022-02-20 18:24:46,840 INFO L290 TraceCheckUtils]: 68: Hoare triple {49776#false} check_#res#1 := check_~tmp~1#1; {49776#false} is VALID [2022-02-20 18:24:46,841 INFO L290 TraceCheckUtils]: 69: Hoare triple {49776#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {49776#false} is VALID [2022-02-20 18:24:46,841 INFO L290 TraceCheckUtils]: 70: Hoare triple {49776#false} assume 0 == assert_~arg#1 % 256; {49776#false} is VALID [2022-02-20 18:24:46,841 INFO L290 TraceCheckUtils]: 71: Hoare triple {49776#false} assume !false; {49776#false} is VALID [2022-02-20 18:24:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:46,842 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:46,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886916926] [2022-02-20 18:24:46,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886916926] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:46,842 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:46,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:24:46,842 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588273221] [2022-02-20 18:24:46,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:46,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-02-20 18:24:46,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:46,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:46,893 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:24:46,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:24:46,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:46,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:24:46,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:24:46,894 INFO L87 Difference]: Start difference. First operand 3124 states and 4950 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:52,275 INFO L93 Difference]: Finished difference Result 9396 states and 15009 transitions. [2022-02-20 18:24:52,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:24:52,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-02-20 18:24:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:52,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-02-20 18:24:52,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-02-20 18:24:52,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 583 transitions. [2022-02-20 18:24:52,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:54,176 INFO L225 Difference]: With dead ends: 9396 [2022-02-20 18:24:54,176 INFO L226 Difference]: Without dead ends: 6460 [2022-02-20 18:24:54,180 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:24:54,180 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 361 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 661 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:24:54,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 661 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:54,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2022-02-20 18:24:56,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 4776. [2022-02-20 18:24:56,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:56,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6460 states. Second operand has 4776 states, 4775 states have (on average 1.584083769633508) internal successors, (7564), 4775 states have internal predecessors, (7564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:56,128 INFO L74 IsIncluded]: Start isIncluded. First operand 6460 states. Second operand has 4776 states, 4775 states have (on average 1.584083769633508) internal successors, (7564), 4775 states have internal predecessors, (7564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:56,132 INFO L87 Difference]: Start difference. First operand 6460 states. Second operand has 4776 states, 4775 states have (on average 1.584083769633508) internal successors, (7564), 4775 states have internal predecessors, (7564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:57,362 INFO L93 Difference]: Finished difference Result 6460 states and 10278 transitions. [2022-02-20 18:24:57,362 INFO L276 IsEmpty]: Start isEmpty. Operand 6460 states and 10278 transitions. [2022-02-20 18:24:57,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:57,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:57,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 4776 states, 4775 states have (on average 1.584083769633508) internal successors, (7564), 4775 states have internal predecessors, (7564), 0 states have call successors, (0), 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 6460 states. [2022-02-20 18:24:57,378 INFO L87 Difference]: Start difference. First operand has 4776 states, 4775 states have (on average 1.584083769633508) internal successors, (7564), 4775 states have internal predecessors, (7564), 0 states have call successors, (0), 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 6460 states. [2022-02-20 18:24:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:58,585 INFO L93 Difference]: Finished difference Result 6460 states and 10278 transitions. [2022-02-20 18:24:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 6460 states and 10278 transitions. [2022-02-20 18:24:58,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:58,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:58,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:58,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:58,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4776 states, 4775 states have (on average 1.584083769633508) internal successors, (7564), 4775 states have internal predecessors, (7564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4776 states to 4776 states and 7564 transitions. [2022-02-20 18:24:59,293 INFO L78 Accepts]: Start accepts. Automaton has 4776 states and 7564 transitions. Word has length 72 [2022-02-20 18:24:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:59,293 INFO L470 AbstractCegarLoop]: Abstraction has 4776 states and 7564 transitions. [2022-02-20 18:24:59,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4776 states and 7564 transitions. [2022-02-20 18:24:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:24:59,294 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:59,294 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:24:59,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:24:59,294 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:59,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:59,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1968035874, now seen corresponding path program 1 times [2022-02-20 18:24:59,295 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:59,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270454391] [2022-02-20 18:24:59,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:59,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:59,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {78707#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {78707#true} is VALID [2022-02-20 18:24:59,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {78707#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {78707#true} is VALID [2022-02-20 18:24:59,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {78707#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {78707#true} is VALID [2022-02-20 18:24:59,358 INFO L290 TraceCheckUtils]: 3: Hoare triple {78707#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {78707#true} is VALID [2022-02-20 18:24:59,358 INFO L290 TraceCheckUtils]: 4: Hoare triple {78707#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {78707#true} is VALID [2022-02-20 18:24:59,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {78707#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {78707#true} is VALID [2022-02-20 18:24:59,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {78707#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {78707#true} is VALID [2022-02-20 18:24:59,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {78707#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {78707#true} is VALID [2022-02-20 18:24:59,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {78707#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {78707#true} is VALID [2022-02-20 18:24:59,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {78707#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {78707#true} is VALID [2022-02-20 18:24:59,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {78707#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {78707#true} is VALID [2022-02-20 18:24:59,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {78707#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {78707#true} is VALID [2022-02-20 18:24:59,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {78707#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {78707#true} is VALID [2022-02-20 18:24:59,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {78707#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {78707#true} is VALID [2022-02-20 18:24:59,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {78707#true} assume ~id1~0 != ~id2~0; {78707#true} is VALID [2022-02-20 18:24:59,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {78707#true} assume ~id1~0 != ~id3~0; {78707#true} is VALID [2022-02-20 18:24:59,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {78707#true} assume ~id2~0 != ~id3~0; {78707#true} is VALID [2022-02-20 18:24:59,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {78707#true} assume ~id1~0 >= 0; {78707#true} is VALID [2022-02-20 18:24:59,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {78707#true} assume ~id2~0 >= 0; {78707#true} is VALID [2022-02-20 18:24:59,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {78707#true} assume ~id3~0 >= 0; {78707#true} is VALID [2022-02-20 18:24:59,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {78707#true} assume 0 == ~r1~0 % 256; {78707#true} is VALID [2022-02-20 18:24:59,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {78707#true} assume 0 == ~r2~0 % 256; {78707#true} is VALID [2022-02-20 18:24:59,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {78707#true} assume 0 == ~r3~0 % 256; {78707#true} is VALID [2022-02-20 18:24:59,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {78707#true} assume 0 != init_~r122~0#1 % 256; {78707#true} is VALID [2022-02-20 18:24:59,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {78707#true} assume 0 != init_~r132~0#1 % 256; {78707#true} is VALID [2022-02-20 18:24:59,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {78707#true} assume 0 != init_~r212~0#1 % 256; {78707#true} is VALID [2022-02-20 18:24:59,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {78707#true} assume 0 != init_~r232~0#1 % 256; {78707#true} is VALID [2022-02-20 18:24:59,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {78707#true} assume 0 != init_~r312~0#1 % 256; {78707#true} is VALID [2022-02-20 18:24:59,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {78707#true} assume 0 != init_~r322~0#1 % 256; {78707#true} is VALID [2022-02-20 18:24:59,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {78707#true} assume ~max1~0 == ~id1~0; {78707#true} is VALID [2022-02-20 18:24:59,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {78707#true} assume ~max2~0 == ~id2~0; {78707#true} is VALID [2022-02-20 18:24:59,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {78707#true} assume ~max3~0 == ~id3~0; {78707#true} is VALID [2022-02-20 18:24:59,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {78707#true} assume 0 == ~st1~0; {78707#true} is VALID [2022-02-20 18:24:59,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {78707#true} assume 0 == ~st2~0; {78707#true} is VALID [2022-02-20 18:24:59,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {78707#true} assume 0 == ~st3~0; {78707#true} is VALID [2022-02-20 18:24:59,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {78707#true} assume 0 == ~nl1~0; {78707#true} is VALID [2022-02-20 18:24:59,363 INFO L290 TraceCheckUtils]: 36: Hoare triple {78707#true} assume 0 == ~nl2~0; {78707#true} is VALID [2022-02-20 18:24:59,364 INFO L290 TraceCheckUtils]: 37: Hoare triple {78707#true} assume 0 == ~nl3~0; {78707#true} is VALID [2022-02-20 18:24:59,364 INFO L290 TraceCheckUtils]: 38: Hoare triple {78707#true} assume 0 == ~mode1~0 % 256; {78707#true} is VALID [2022-02-20 18:24:59,364 INFO L290 TraceCheckUtils]: 39: Hoare triple {78707#true} assume 0 == ~mode2~0 % 256; {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:59,365 INFO L290 TraceCheckUtils]: 40: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:59,365 INFO L290 TraceCheckUtils]: 41: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:59,366 INFO L290 TraceCheckUtils]: 42: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:59,366 INFO L290 TraceCheckUtils]: 43: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:59,367 INFO L290 TraceCheckUtils]: 44: Hoare triple {78709#(= (+ (* (- 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; {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:59,367 INFO L290 TraceCheckUtils]: 45: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:59,368 INFO L290 TraceCheckUtils]: 46: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:59,368 INFO L290 TraceCheckUtils]: 47: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 % 256 < 2; {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:59,368 INFO L290 TraceCheckUtils]: 48: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep12~0 % 256); {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:59,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep13~0 % 256); {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:59,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:59,370 INFO L290 TraceCheckUtils]: 51: Hoare triple {78709#(= (+ (* (- 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; {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:59,370 INFO L290 TraceCheckUtils]: 52: Hoare triple {78709#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256; {78708#false} is VALID [2022-02-20 18:24:59,370 INFO L290 TraceCheckUtils]: 53: Hoare triple {78708#false} assume !(255 == ~r2~0 % 256); {78708#false} is VALID [2022-02-20 18:24:59,371 INFO L290 TraceCheckUtils]: 54: Hoare triple {78708#false} ~r2~0 := 1 + ~r2~0 % 256; {78708#false} is VALID [2022-02-20 18:24:59,371 INFO L290 TraceCheckUtils]: 55: Hoare triple {78708#false} assume !(0 != ~ep12~0 % 256); {78708#false} is VALID [2022-02-20 18:24:59,371 INFO L290 TraceCheckUtils]: 56: Hoare triple {78708#false} assume !(0 != ~ep32~0 % 256); {78708#false} is VALID [2022-02-20 18:24:59,371 INFO L290 TraceCheckUtils]: 57: Hoare triple {78708#false} assume 2 == ~r2~0 % 256; {78708#false} is VALID [2022-02-20 18:24:59,371 INFO L290 TraceCheckUtils]: 58: Hoare triple {78708#false} assume ~max2~0 == ~id2~0;~st2~0 := 1; {78708#false} is VALID [2022-02-20 18:24:59,371 INFO L290 TraceCheckUtils]: 59: Hoare triple {78708#false} ~mode2~0 := 0; {78708#false} is VALID [2022-02-20 18:24:59,372 INFO L290 TraceCheckUtils]: 60: Hoare triple {78708#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {78708#false} is VALID [2022-02-20 18:24:59,372 INFO L290 TraceCheckUtils]: 61: Hoare triple {78708#false} assume !(0 != ~mode3~0 % 256); {78708#false} is VALID [2022-02-20 18:24:59,372 INFO L290 TraceCheckUtils]: 62: Hoare triple {78708#false} assume ~r3~0 % 256 < 2; {78708#false} is VALID [2022-02-20 18:24:59,372 INFO L290 TraceCheckUtils]: 63: Hoare triple {78708#false} assume !(0 != ~ep31~0 % 256); {78708#false} is VALID [2022-02-20 18:24:59,372 INFO L290 TraceCheckUtils]: 64: Hoare triple {78708#false} assume !(0 != ~ep32~0 % 256); {78708#false} is VALID [2022-02-20 18:24:59,372 INFO L290 TraceCheckUtils]: 65: Hoare triple {78708#false} ~mode3~0 := 1; {78708#false} is VALID [2022-02-20 18:24:59,372 INFO L290 TraceCheckUtils]: 66: Hoare triple {78708#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; {78708#false} is VALID [2022-02-20 18:24:59,373 INFO L290 TraceCheckUtils]: 67: Hoare triple {78708#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {78708#false} is VALID [2022-02-20 18:24:59,373 INFO L290 TraceCheckUtils]: 68: Hoare triple {78708#false} check_#res#1 := check_~tmp~1#1; {78708#false} is VALID [2022-02-20 18:24:59,373 INFO L290 TraceCheckUtils]: 69: Hoare triple {78708#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {78708#false} is VALID [2022-02-20 18:24:59,373 INFO L290 TraceCheckUtils]: 70: Hoare triple {78708#false} assume 0 == assert_~arg#1 % 256; {78708#false} is VALID [2022-02-20 18:24:59,373 INFO L290 TraceCheckUtils]: 71: Hoare triple {78708#false} assume !false; {78708#false} is VALID [2022-02-20 18:24:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:59,374 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:59,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270454391] [2022-02-20 18:24:59,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270454391] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:59,374 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:59,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:59,374 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980684675] [2022-02-20 18:24:59,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:59,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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:24:59,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:59,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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:24:59,427 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:24:59,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:59,427 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:59,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:59,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:59,428 INFO L87 Difference]: Start difference. First operand 4776 states and 7564 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:25:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:05,789 INFO L93 Difference]: Finished difference Result 10472 states and 16650 transitions. [2022-02-20 18:25:05,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:25:05,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-02-20 18:25:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:25:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:25:05,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2022-02-20 18:25:05,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:25:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2022-02-20 18:25:05,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 427 transitions. [2022-02-20 18:25:06,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:07,889 INFO L225 Difference]: With dead ends: 10472 [2022-02-20 18:25:07,889 INFO L226 Difference]: Without dead ends: 7115 [2022-02-20 18:25:07,893 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:25:07,894 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 102 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 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:25:07,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 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:25:07,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2022-02-20 18:25:10,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 7113. [2022-02-20 18:25:10,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:25:10,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7115 states. Second operand has 7113 states, 7112 states have (on average 1.5752249718785152) internal successors, (11203), 7112 states have internal predecessors, (11203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:25:10,891 INFO L74 IsIncluded]: Start isIncluded. First operand 7115 states. Second operand has 7113 states, 7112 states have (on average 1.5752249718785152) internal successors, (11203), 7112 states have internal predecessors, (11203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:25:10,897 INFO L87 Difference]: Start difference. First operand 7115 states. Second operand has 7113 states, 7112 states have (on average 1.5752249718785152) internal successors, (11203), 7112 states have internal predecessors, (11203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:25:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:12,365 INFO L93 Difference]: Finished difference Result 7115 states and 11204 transitions. [2022-02-20 18:25:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 7115 states and 11204 transitions. [2022-02-20 18:25:12,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:12,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:12,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 7113 states, 7112 states have (on average 1.5752249718785152) internal successors, (11203), 7112 states have internal predecessors, (11203), 0 states have call successors, (0), 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 7115 states. [2022-02-20 18:25:12,385 INFO L87 Difference]: Start difference. First operand has 7113 states, 7112 states have (on average 1.5752249718785152) internal successors, (11203), 7112 states have internal predecessors, (11203), 0 states have call successors, (0), 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 7115 states. [2022-02-20 18:25:13,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:13,804 INFO L93 Difference]: Finished difference Result 7115 states and 11204 transitions. [2022-02-20 18:25:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 7115 states and 11204 transitions. [2022-02-20 18:25:13,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:13,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:13,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:25:13,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:25:13,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7113 states, 7112 states have (on average 1.5752249718785152) internal successors, (11203), 7112 states have internal predecessors, (11203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:25:15,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7113 states to 7113 states and 11203 transitions. [2022-02-20 18:25:15,452 INFO L78 Accepts]: Start accepts. Automaton has 7113 states and 11203 transitions. Word has length 72 [2022-02-20 18:25:15,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:25:15,452 INFO L470 AbstractCegarLoop]: Abstraction has 7113 states and 11203 transitions. [2022-02-20 18:25:15,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:25:15,452 INFO L276 IsEmpty]: Start isEmpty. Operand 7113 states and 11203 transitions. [2022-02-20 18:25:15,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:25:15,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:25:15,453 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:25:15,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:25:15,453 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:25:15,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:25:15,453 INFO L85 PathProgramCache]: Analyzing trace with hash 134390635, now seen corresponding path program 1 times [2022-02-20 18:25:15,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:25:15,454 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879036574] [2022-02-20 18:25:15,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:25:15,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:25:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:25:15,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {112984#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {112984#true} is VALID [2022-02-20 18:25:15,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {112984#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {112984#true} is VALID [2022-02-20 18:25:15,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {112984#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {112984#true} is VALID [2022-02-20 18:25:15,493 INFO L290 TraceCheckUtils]: 3: Hoare triple {112984#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {112984#true} is VALID [2022-02-20 18:25:15,494 INFO L290 TraceCheckUtils]: 4: Hoare triple {112984#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {112984#true} is VALID [2022-02-20 18:25:15,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {112984#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {112984#true} is VALID [2022-02-20 18:25:15,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {112984#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {112984#true} is VALID [2022-02-20 18:25:15,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {112984#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {112984#true} is VALID [2022-02-20 18:25:15,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {112984#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {112984#true} is VALID [2022-02-20 18:25:15,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {112984#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {112984#true} is VALID [2022-02-20 18:25:15,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {112984#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {112984#true} is VALID [2022-02-20 18:25:15,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {112984#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {112984#true} is VALID [2022-02-20 18:25:15,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {112984#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {112984#true} is VALID [2022-02-20 18:25:15,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {112984#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {112984#true} is VALID [2022-02-20 18:25:15,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {112984#true} assume ~id1~0 != ~id2~0; {112984#true} is VALID [2022-02-20 18:25:15,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {112984#true} assume ~id1~0 != ~id3~0; {112984#true} is VALID [2022-02-20 18:25:15,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {112984#true} assume ~id2~0 != ~id3~0; {112984#true} is VALID [2022-02-20 18:25:15,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {112984#true} assume ~id1~0 >= 0; {112984#true} is VALID [2022-02-20 18:25:15,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {112984#true} assume ~id2~0 >= 0; {112984#true} is VALID [2022-02-20 18:25:15,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {112984#true} assume ~id3~0 >= 0; {112984#true} is VALID [2022-02-20 18:25:15,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {112984#true} assume 0 == ~r1~0 % 256; {112984#true} is VALID [2022-02-20 18:25:15,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {112984#true} assume 0 == ~r2~0 % 256; {112984#true} is VALID [2022-02-20 18:25:15,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {112984#true} assume 0 == ~r3~0 % 256; {112984#true} is VALID [2022-02-20 18:25:15,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {112984#true} assume 0 != init_~r122~0#1 % 256; {112984#true} is VALID [2022-02-20 18:25:15,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {112984#true} assume 0 != init_~r132~0#1 % 256; {112984#true} is VALID [2022-02-20 18:25:15,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {112984#true} assume 0 != init_~r212~0#1 % 256; {112984#true} is VALID [2022-02-20 18:25:15,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {112984#true} assume 0 != init_~r232~0#1 % 256; {112984#true} is VALID [2022-02-20 18:25:15,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {112984#true} assume 0 != init_~r312~0#1 % 256; {112984#true} is VALID [2022-02-20 18:25:15,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {112984#true} assume 0 != init_~r322~0#1 % 256; {112984#true} is VALID [2022-02-20 18:25:15,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {112984#true} assume ~max1~0 == ~id1~0; {112984#true} is VALID [2022-02-20 18:25:15,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {112984#true} assume ~max2~0 == ~id2~0; {112984#true} is VALID [2022-02-20 18:25:15,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {112984#true} assume ~max3~0 == ~id3~0; {112984#true} is VALID [2022-02-20 18:25:15,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {112984#true} assume 0 == ~st1~0; {112984#true} is VALID [2022-02-20 18:25:15,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {112984#true} assume 0 == ~st2~0; {112984#true} is VALID [2022-02-20 18:25:15,498 INFO L290 TraceCheckUtils]: 34: Hoare triple {112984#true} assume 0 == ~st3~0; {112984#true} is VALID [2022-02-20 18:25:15,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {112984#true} assume 0 == ~nl1~0; {112984#true} is VALID [2022-02-20 18:25:15,498 INFO L290 TraceCheckUtils]: 36: Hoare triple {112984#true} assume 0 == ~nl2~0; {112984#true} is VALID [2022-02-20 18:25:15,498 INFO L290 TraceCheckUtils]: 37: Hoare triple {112984#true} assume 0 == ~nl3~0; {112984#true} is VALID [2022-02-20 18:25:15,499 INFO L290 TraceCheckUtils]: 38: Hoare triple {112984#true} assume 0 == ~mode1~0 % 256; {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:15,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:15,500 INFO L290 TraceCheckUtils]: 40: Hoare triple {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:15,500 INFO L290 TraceCheckUtils]: 41: Hoare triple {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:15,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:15,501 INFO L290 TraceCheckUtils]: 43: Hoare triple {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:15,502 INFO L290 TraceCheckUtils]: 44: Hoare triple {112986#(= (+ (* (- 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; {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:15,502 INFO L290 TraceCheckUtils]: 45: Hoare triple {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:15,503 INFO L290 TraceCheckUtils]: 46: Hoare triple {112986#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {112985#false} is VALID [2022-02-20 18:25:15,503 INFO L290 TraceCheckUtils]: 47: Hoare triple {112985#false} assume !(255 == ~r1~0 % 256); {112985#false} is VALID [2022-02-20 18:25:15,503 INFO L290 TraceCheckUtils]: 48: Hoare triple {112985#false} ~r1~0 := 1 + ~r1~0 % 256; {112985#false} is VALID [2022-02-20 18:25:15,503 INFO L290 TraceCheckUtils]: 49: Hoare triple {112985#false} assume !(0 != ~ep21~0 % 256); {112985#false} is VALID [2022-02-20 18:25:15,503 INFO L290 TraceCheckUtils]: 50: Hoare triple {112985#false} assume !(0 != ~ep31~0 % 256); {112985#false} is VALID [2022-02-20 18:25:15,504 INFO L290 TraceCheckUtils]: 51: Hoare triple {112985#false} assume 2 == ~r1~0 % 256; {112985#false} is VALID [2022-02-20 18:25:15,504 INFO L290 TraceCheckUtils]: 52: Hoare triple {112985#false} assume !(~max1~0 == ~id1~0);~st1~0 := 1; {112985#false} is VALID [2022-02-20 18:25:15,504 INFO L290 TraceCheckUtils]: 53: Hoare triple {112985#false} ~mode1~0 := 0; {112985#false} is VALID [2022-02-20 18:25:15,504 INFO L290 TraceCheckUtils]: 54: Hoare triple {112985#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {112985#false} is VALID [2022-02-20 18:25:15,504 INFO L290 TraceCheckUtils]: 55: Hoare triple {112985#false} assume !(0 != ~mode2~0 % 256); {112985#false} is VALID [2022-02-20 18:25:15,504 INFO L290 TraceCheckUtils]: 56: Hoare triple {112985#false} assume ~r2~0 % 256 < 2; {112985#false} is VALID [2022-02-20 18:25:15,505 INFO L290 TraceCheckUtils]: 57: Hoare triple {112985#false} assume !(0 != ~ep21~0 % 256); {112985#false} is VALID [2022-02-20 18:25:15,505 INFO L290 TraceCheckUtils]: 58: Hoare triple {112985#false} assume !(0 != ~ep23~0 % 256); {112985#false} is VALID [2022-02-20 18:25:15,505 INFO L290 TraceCheckUtils]: 59: Hoare triple {112985#false} ~mode2~0 := 1; {112985#false} is VALID [2022-02-20 18:25:15,505 INFO L290 TraceCheckUtils]: 60: Hoare triple {112985#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {112985#false} is VALID [2022-02-20 18:25:15,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {112985#false} assume !(0 != ~mode3~0 % 256); {112985#false} is VALID [2022-02-20 18:25:15,505 INFO L290 TraceCheckUtils]: 62: Hoare triple {112985#false} assume ~r3~0 % 256 < 2; {112985#false} is VALID [2022-02-20 18:25:15,505 INFO L290 TraceCheckUtils]: 63: Hoare triple {112985#false} assume !(0 != ~ep31~0 % 256); {112985#false} is VALID [2022-02-20 18:25:15,506 INFO L290 TraceCheckUtils]: 64: Hoare triple {112985#false} assume !(0 != ~ep32~0 % 256); {112985#false} is VALID [2022-02-20 18:25:15,506 INFO L290 TraceCheckUtils]: 65: Hoare triple {112985#false} ~mode3~0 := 1; {112985#false} is VALID [2022-02-20 18:25:15,506 INFO L290 TraceCheckUtils]: 66: Hoare triple {112985#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; {112985#false} is VALID [2022-02-20 18:25:15,506 INFO L290 TraceCheckUtils]: 67: Hoare triple {112985#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {112985#false} is VALID [2022-02-20 18:25:15,506 INFO L290 TraceCheckUtils]: 68: Hoare triple {112985#false} check_#res#1 := check_~tmp~1#1; {112985#false} is VALID [2022-02-20 18:25:15,506 INFO L290 TraceCheckUtils]: 69: Hoare triple {112985#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {112985#false} is VALID [2022-02-20 18:25:15,506 INFO L290 TraceCheckUtils]: 70: Hoare triple {112985#false} assume 0 == assert_~arg#1 % 256; {112985#false} is VALID [2022-02-20 18:25:15,507 INFO L290 TraceCheckUtils]: 71: Hoare triple {112985#false} assume !false; {112985#false} is VALID [2022-02-20 18:25:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:25:15,507 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:25:15,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879036574] [2022-02-20 18:25:15,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879036574] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:25:15,508 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:25:15,508 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:25:15,508 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664152031] [2022-02-20 18:25:15,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:25:15,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-02-20 18:25:15,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:25:15,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:25:15,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:15,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:25:15,555 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:25:15,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:25:15,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:25:15,555 INFO L87 Difference]: Start difference. First operand 7113 states and 11203 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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)