./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-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_opt-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 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-03d7b7b
[2022-02-20 18:31:38,135 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-02-20 18:31:38,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-02-20 18:31:38,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-02-20 18:31:38,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-02-20 18:31:38,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-02-20 18:31:38,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-02-20 18:31:38,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-02-20 18:31:38,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-02-20 18:31:38,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-02-20 18:31:38,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-02-20 18:31:38,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-02-20 18:31:38,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-02-20 18:31:38,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-02-20 18:31:38,185 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-02-20 18:31:38,187 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-02-20 18:31:38,188 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-02-20 18:31:38,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-02-20 18:31:38,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-02-20 18:31:38,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-02-20 18:31:38,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-02-20 18:31:38,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-02-20 18:31:38,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-02-20 18:31:38,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-02-20 18:31:38,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-02-20 18:31:38,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-02-20 18:31:38,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-02-20 18:31:38,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-02-20 18:31:38,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-02-20 18:31:38,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-02-20 18:31:38,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-02-20 18:31:38,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-02-20 18:31:38,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-02-20 18:31:38,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-02-20 18:31:38,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-02-20 18:31:38,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-02-20 18:31:38,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-02-20 18:31:38,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-02-20 18:31:38,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-02-20 18:31:38,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-02-20 18:31:38,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-02-20 18:31:38,211 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2022-02-20 18:31:38,234 INFO L113 SettingsManager]: Loading preferences was successful
[2022-02-20 18:31:38,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-02-20 18:31:38,235 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-02-20 18:31:38,235 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-02-20 18:31:38,236 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-02-20 18:31:38,236 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-02-20 18:31:38,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-02-20 18:31:38,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-02-20 18:31:38,237 INFO L138 SettingsManager]: * Use SBE=true
[2022-02-20 18:31:38,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-02-20 18:31:38,238 INFO L138 SettingsManager]: * sizeof long=4
[2022-02-20 18:31:38,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-02-20 18:31:38,238 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-02-20 18:31:38,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-02-20 18:31:38,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-02-20 18:31:38,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-02-20 18:31:38,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-02-20 18:31:38,239 INFO L138 SettingsManager]: * sizeof long double=12
[2022-02-20 18:31:38,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-02-20 18:31:38,239 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-02-20 18:31:38,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-02-20 18:31:38,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-02-20 18:31:38,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-02-20 18:31:38,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-02-20 18:31:38,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-20 18:31:38,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-02-20 18:31:38,241 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-02-20 18:31:38,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-02-20 18:31:38,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-02-20 18:31:38,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-02-20 18:31:38,241 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2022-02-20 18:31:38,242 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2022-02-20 18:31:38,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-02-20 18:31:38,242 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 -> 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823
[2022-02-20 18:31:38,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-02-20 18:31:38,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-02-20 18:31:38,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-02-20 18:31:38,436 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-02-20 18:31:38,437 INFO L275 PluginConnector]: CDTParser initialized
[2022-02-20 18:31:38,438 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c
[2022-02-20 18:31:38,496 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e779cc585/e3668589d04248d69e2ea6aa8da3d9c1/FLAGb944026a0
[2022-02-20 18:31:38,821 INFO L306 CDTParser]: Found 1 translation units.
[2022-02-20 18:31:38,821 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c
[2022-02-20 18:31:38,828 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e779cc585/e3668589d04248d69e2ea6aa8da3d9c1/FLAGb944026a0
[2022-02-20 18:31:39,225 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e779cc585/e3668589d04248d69e2ea6aa8da3d9c1
[2022-02-20 18:31:39,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-02-20 18:31:39,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2022-02-20 18:31:39,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-02-20 18:31:39,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-02-20 18:31:39,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-02-20 18:31:39,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:31:39" (1/1) ...
[2022-02-20 18:31:39,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb3ca95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:39, skipping insertion in model container
[2022-02-20 18:31:39,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:31:39" (1/1) ...
[2022-02-20 18:31:39,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-02-20 18:31:39,284 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-02-20 18:31:39,463 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524]
[2022-02-20 18:31:39,465 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-02-20 18:31:39,473 INFO L203 MainTranslator]: Completed pre-run
[2022-02-20 18:31:39,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524]
[2022-02-20 18:31:39,540 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-02-20 18:31:39,552 INFO L208 MainTranslator]: Completed translation
[2022-02-20 18:31:39,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:39 WrapperNode
[2022-02-20 18:31:39,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-02-20 18:31:39,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-02-20 18:31:39,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-02-20 18:31:39,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-02-20 18:31:39,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:39" (1/1) ...
[2022-02-20 18:31:39,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:39" (1/1) ...
[2022-02-20 18:31:39,620 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 479
[2022-02-20 18:31:39,621 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-02-20 18:31:39,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-02-20 18:31:39,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-02-20 18:31:39,622 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-02-20 18:31:39,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:39" (1/1) ...
[2022-02-20 18:31:39,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:39" (1/1) ...
[2022-02-20 18:31:39,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:39" (1/1) ...
[2022-02-20 18:31:39,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:39" (1/1) ...
[2022-02-20 18:31:39,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:39" (1/1) ...
[2022-02-20 18:31:39,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:39" (1/1) ...
[2022-02-20 18:31:39,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:39" (1/1) ...
[2022-02-20 18:31:39,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-02-20 18:31:39,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-02-20 18:31:39,659 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-02-20 18:31:39,659 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-02-20 18:31:39,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:39" (1/1) ...
[2022-02-20 18:31:39,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-20 18:31:39,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-20 18:31:39,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-02-20 18:31:39,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-02-20 18:31:39,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-02-20 18:31:39,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-02-20 18:31:39,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-02-20 18:31:39,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-02-20 18:31:39,851 INFO L234 CfgBuilder]: Building ICFG
[2022-02-20 18:31:39,852 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-02-20 18:31:40,468 INFO L275 CfgBuilder]: Performing block encoding
[2022-02-20 18:31:40,474 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-02-20 18:31:40,474 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-02-20 18:31:40,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:31:40 BoogieIcfgContainer
[2022-02-20 18:31:40,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-02-20 18:31:40,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-02-20 18:31:40,477 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-02-20 18:31:40,479 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-02-20 18:31:40,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:31:39" (1/3) ...
[2022-02-20 18:31:40,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59408aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:31:40, skipping insertion in model container
[2022-02-20 18:31:40,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:39" (2/3) ...
[2022-02-20 18:31:40,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59408aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:31:40, skipping insertion in model container
[2022-02-20 18:31:40,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:31:40" (3/3) ...
[2022-02-20 18:31:40,481 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c
[2022-02-20 18:31:40,484 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-02-20 18:31:40,484 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-02-20 18:31:40,511 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-02-20 18:31:40,515 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR
[2022-02-20 18:31:40,515 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-02-20 18:31:40,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 147 states have (on average 1.748299319727891) internal successors, (257), 148 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:40,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2022-02-20 18:31:40,533 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:31:40,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:31:40,534 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:31:40,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:31:40,537 INFO L85 PathProgramCache]: Analyzing trace with hash -812713456, now seen corresponding path program 1 times
[2022-02-20 18:31:40,542 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:31:40,543 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764552865]
[2022-02-20 18:31:40,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:31:40,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:31:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:31:40,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {152#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {152#true} is VALID
[2022-02-20 18:31:40,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {152#true} is VALID
[2022-02-20 18:31:40,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {152#true} is VALID
[2022-02-20 18:31:40,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {152#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {152#true} is VALID
[2022-02-20 18:31:40,690 INFO L290 TraceCheckUtils]: 4: Hoare triple {152#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {152#true} is VALID
[2022-02-20 18:31:40,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {152#true} is VALID
[2022-02-20 18:31:40,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {152#true} is VALID
[2022-02-20 18:31:40,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {152#true} is VALID
[2022-02-20 18:31:40,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {152#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {152#true} is VALID
[2022-02-20 18:31:40,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {152#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {152#true} is VALID
[2022-02-20 18:31:40,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {152#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {152#true} is VALID
[2022-02-20 18:31:40,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {152#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {152#true} is VALID
[2022-02-20 18:31:40,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {152#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {152#true} is VALID
[2022-02-20 18:31:40,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {152#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {152#true} is VALID
[2022-02-20 18:31:40,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {152#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {152#true} is VALID
[2022-02-20 18:31:40,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {152#true} init_#res#1 := init_~tmp___5~0#1; {152#true} is VALID
[2022-02-20 18:31:40,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {152#true} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {152#true} is VALID
[2022-02-20 18:31:40,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {152#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {153#false} is VALID
[2022-02-20 18:31:40,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {153#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {153#false} is VALID
[2022-02-20 18:31:40,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {153#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {153#false} is VALID
[2022-02-20 18:31:40,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {153#false} assume !(0 != ~mode1~0 % 256); {153#false} is VALID
[2022-02-20 18:31:40,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {153#false} assume !(~r1~0 % 256 < 2); {153#false} is VALID
[2022-02-20 18:31:40,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {153#false} ~mode1~0 := 1; {153#false} is VALID
[2022-02-20 18:31:40,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {153#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {153#false} is VALID
[2022-02-20 18:31:40,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {153#false} assume !(0 != ~mode2~0 % 256); {153#false} is VALID
[2022-02-20 18:31:40,699 INFO L290 TraceCheckUtils]: 25: Hoare triple {153#false} assume !(~r2~0 % 256 < 2); {153#false} is VALID
[2022-02-20 18:31:40,699 INFO L290 TraceCheckUtils]: 26: Hoare triple {153#false} ~mode2~0 := 1; {153#false} is VALID
[2022-02-20 18:31:40,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {153#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {153#false} is VALID
[2022-02-20 18:31:40,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {153#false} assume !(0 != ~mode3~0 % 256); {153#false} is VALID
[2022-02-20 18:31:40,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {153#false} assume !(~r3~0 % 256 < 2); {153#false} is VALID
[2022-02-20 18:31:40,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {153#false} ~mode3~0 := 1; {153#false} is VALID
[2022-02-20 18:31:40,701 INFO L290 TraceCheckUtils]: 31: Hoare triple {153#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {153#false} is VALID
[2022-02-20 18:31:40,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {153#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {153#false} is VALID
[2022-02-20 18:31:40,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {153#false} check_#res#1 := check_~tmp~1#1; {153#false} is VALID
[2022-02-20 18:31:40,703 INFO L290 TraceCheckUtils]: 34: Hoare triple {153#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {153#false} is VALID
[2022-02-20 18:31:40,703 INFO L290 TraceCheckUtils]: 35: Hoare triple {153#false} assume 0 == assert_~arg#1 % 256; {153#false} is VALID
[2022-02-20 18:31:40,703 INFO L290 TraceCheckUtils]: 36: Hoare triple {153#false} assume !false; {153#false} is VALID
[2022-02-20 18:31:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:31:40,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:31:40,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764552865]
[2022-02-20 18:31:40,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764552865] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:31:40,706 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:31:40,706 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-02-20 18:31:40,708 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776311216]
[2022-02-20 18:31:40,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:31:40,718 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37
[2022-02-20 18:31:40,719 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:31:40,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:40,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:31:40,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-02-20 18:31:40,759 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:31:40,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-02-20 18:31:40,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-02-20 18:31:40,785 INFO L87 Difference]: Start difference. First operand has 149 states, 147 states have (on average 1.748299319727891) internal successors, (257), 148 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:40,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:40,918 INFO L93 Difference]: Finished difference Result 235 states and 403 transitions.
[2022-02-20 18:31:40,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-20 18:31:40,919 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37
[2022-02-20 18:31:40,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:31:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 403 transitions.
[2022-02-20 18:31:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 403 transitions.
[2022-02-20 18:31:40,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 403 transitions.
[2022-02-20 18:31:41,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 403 edges. 403 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:31:41,250 INFO L225 Difference]: With dead ends: 235
[2022-02-20 18:31:41,250 INFO L226 Difference]: Without dead ends: 145
[2022-02-20 18:31:41,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-02-20 18:31:41,257 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 18:31:41,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 18:31:41,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2022-02-20 18:31:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145.
[2022-02-20 18:31:41,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:31:41,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:41,301 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:41,302 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:41,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:41,312 INFO L93 Difference]: Finished difference Result 145 states and 250 transitions.
[2022-02-20 18:31:41,312 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 250 transitions.
[2022-02-20 18:31:41,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:31:41,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:31:41,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 145 states.
[2022-02-20 18:31:41,319 INFO L87 Difference]: Start difference. First operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 145 states.
[2022-02-20 18:31:41,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:41,326 INFO L93 Difference]: Finished difference Result 145 states and 250 transitions.
[2022-02-20 18:31:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 250 transitions.
[2022-02-20 18:31:41,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:31:41,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:31:41,329 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 18:31:41,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 18:31:41,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:41,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 250 transitions.
[2022-02-20 18:31:41,338 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 250 transitions. Word has length 37
[2022-02-20 18:31:41,339 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 18:31:41,339 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 250 transitions.
[2022-02-20 18:31:41,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 250 transitions.
[2022-02-20 18:31:41,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2022-02-20 18:31:41,340 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:31:41,340 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:31:41,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-02-20 18:31:41,341 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:31:41,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:31:41,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1630361906, now seen corresponding path program 1 times
[2022-02-20 18:31:41,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:31:41,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715030130]
[2022-02-20 18:31:41,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:31:41,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:31:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:31:41,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {853#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {853#true} is VALID
[2022-02-20 18:31:41,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {853#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {853#true} is VALID
[2022-02-20 18:31:41,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {853#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {853#true} is VALID
[2022-02-20 18:31:41,476 INFO L290 TraceCheckUtils]: 3: Hoare triple {853#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {853#true} is VALID
[2022-02-20 18:31:41,476 INFO L290 TraceCheckUtils]: 4: Hoare triple {853#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {853#true} is VALID
[2022-02-20 18:31:41,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {853#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {853#true} is VALID
[2022-02-20 18:31:41,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {853#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {853#true} is VALID
[2022-02-20 18:31:41,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {853#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {853#true} is VALID
[2022-02-20 18:31:41,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {853#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {853#true} is VALID
[2022-02-20 18:31:41,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {853#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {853#true} is VALID
[2022-02-20 18:31:41,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {853#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {853#true} is VALID
[2022-02-20 18:31:41,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {853#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {853#true} is VALID
[2022-02-20 18:31:41,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {853#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {853#true} is VALID
[2022-02-20 18:31:41,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {853#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {853#true} is VALID
[2022-02-20 18:31:41,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {853#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {855#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID
[2022-02-20 18:31:41,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {855#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {856#(= |ULTIMATE.start_init_#res#1| 0)} is VALID
[2022-02-20 18:31:41,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {856#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {857#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID
[2022-02-20 18:31:41,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {857#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {854#false} is VALID
[2022-02-20 18:31:41,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {854#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {854#false} is VALID
[2022-02-20 18:31:41,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {854#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {854#false} is VALID
[2022-02-20 18:31:41,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {854#false} assume !(0 != ~mode1~0 % 256); {854#false} is VALID
[2022-02-20 18:31:41,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {854#false} assume !(~r1~0 % 256 < 2); {854#false} is VALID
[2022-02-20 18:31:41,482 INFO L290 TraceCheckUtils]: 22: Hoare triple {854#false} ~mode1~0 := 1; {854#false} is VALID
[2022-02-20 18:31:41,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {854#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {854#false} is VALID
[2022-02-20 18:31:41,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {854#false} assume !(0 != ~mode2~0 % 256); {854#false} is VALID
[2022-02-20 18:31:41,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {854#false} assume !(~r2~0 % 256 < 2); {854#false} is VALID
[2022-02-20 18:31:41,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {854#false} ~mode2~0 := 1; {854#false} is VALID
[2022-02-20 18:31:41,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {854#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {854#false} is VALID
[2022-02-20 18:31:41,483 INFO L290 TraceCheckUtils]: 28: Hoare triple {854#false} assume !(0 != ~mode3~0 % 256); {854#false} is VALID
[2022-02-20 18:31:41,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {854#false} assume !(~r3~0 % 256 < 2); {854#false} is VALID
[2022-02-20 18:31:41,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {854#false} ~mode3~0 := 1; {854#false} is VALID
[2022-02-20 18:31:41,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {854#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {854#false} is VALID
[2022-02-20 18:31:41,483 INFO L290 TraceCheckUtils]: 32: Hoare triple {854#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {854#false} is VALID
[2022-02-20 18:31:41,483 INFO L290 TraceCheckUtils]: 33: Hoare triple {854#false} check_#res#1 := check_~tmp~1#1; {854#false} is VALID
[2022-02-20 18:31:41,483 INFO L290 TraceCheckUtils]: 34: Hoare triple {854#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {854#false} is VALID
[2022-02-20 18:31:41,483 INFO L290 TraceCheckUtils]: 35: Hoare triple {854#false} assume 0 == assert_~arg#1 % 256; {854#false} is VALID
[2022-02-20 18:31:41,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {854#false} assume !false; {854#false} is VALID
[2022-02-20 18:31:41,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:31:41,484 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:31:41,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715030130]
[2022-02-20 18:31:41,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715030130] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:31:41,484 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:31:41,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-20 18:31:41,484 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119984129]
[2022-02-20 18:31:41,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:31:41,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37
[2022-02-20 18:31:41,485 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:31:41,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:41,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:31:41,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-02-20 18:31:41,512 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:31:41,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-02-20 18:31:41,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-02-20 18:31:41,513 INFO L87 Difference]: Start difference. First operand 145 states and 250 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:41,893 INFO L93 Difference]: Finished difference Result 234 states and 396 transitions.
[2022-02-20 18:31:41,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-02-20 18:31:41,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37
[2022-02-20 18:31:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:31:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 396 transitions.
[2022-02-20 18:31:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 396 transitions.
[2022-02-20 18:31:41,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 396 transitions.
[2022-02-20 18:31:42,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:31:42,128 INFO L225 Difference]: With dead ends: 234
[2022-02-20 18:31:42,128 INFO L226 Difference]: Without dead ends: 145
[2022-02-20 18:31:42,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2022-02-20 18:31:42,129 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 3 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 18:31:42,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 959 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 18:31:42,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2022-02-20 18:31:42,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145.
[2022-02-20 18:31:42,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:31:42,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:42,134 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:42,134 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:42,137 INFO L93 Difference]: Finished difference Result 145 states and 220 transitions.
[2022-02-20 18:31:42,138 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions.
[2022-02-20 18:31:42,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:31:42,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:31:42,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 145 states.
[2022-02-20 18:31:42,138 INFO L87 Difference]: Start difference. First operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 145 states.
[2022-02-20 18:31:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:42,141 INFO L93 Difference]: Finished difference Result 145 states and 220 transitions.
[2022-02-20 18:31:42,141 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions.
[2022-02-20 18:31:42,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:31:42,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:31:42,142 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 18:31:42,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 18:31:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:42,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 220 transitions.
[2022-02-20 18:31:42,145 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 220 transitions. Word has length 37
[2022-02-20 18:31:42,145 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 18:31:42,145 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 220 transitions.
[2022-02-20 18:31:42,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:42,145 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions.
[2022-02-20 18:31:42,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2022-02-20 18:31:42,146 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:31:42,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:31:42,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-02-20 18:31:42,146 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:31:42,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:31:42,147 INFO L85 PathProgramCache]: Analyzing trace with hash 190573204, now seen corresponding path program 1 times
[2022-02-20 18:31:42,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:31:42,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293098106]
[2022-02-20 18:31:42,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:31:42,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:31:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:31:42,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {1560#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {1560#true} is VALID
[2022-02-20 18:31:42,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {1560#true} is VALID
[2022-02-20 18:31:42,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1560#true} is VALID
[2022-02-20 18:31:42,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {1560#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1560#true} is VALID
[2022-02-20 18:31:42,244 INFO L290 TraceCheckUtils]: 4: Hoare triple {1560#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1560#true} is VALID
[2022-02-20 18:31:42,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1560#true} is VALID
[2022-02-20 18:31:42,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {1560#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {1560#true} is VALID
[2022-02-20 18:31:42,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {1560#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1560#true} is VALID
[2022-02-20 18:31:42,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {1560#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {1560#true} is VALID
[2022-02-20 18:31:42,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {1560#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1560#true} is VALID
[2022-02-20 18:31:42,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {1560#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {1560#true} is VALID
[2022-02-20 18:31:42,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {1560#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1560#true} is VALID
[2022-02-20 18:31:42,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {1560#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {1560#true} is VALID
[2022-02-20 18:31:42,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {1560#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1560#true} is VALID
[2022-02-20 18:31:42,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {1560#true} assume ~id1~0 != ~id2~0; {1560#true} is VALID
[2022-02-20 18:31:42,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {1560#true} assume ~id1~0 != ~id3~0; {1560#true} is VALID
[2022-02-20 18:31:42,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {1560#true} assume ~id2~0 != ~id3~0; {1560#true} is VALID
[2022-02-20 18:31:42,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {1560#true} assume ~id1~0 >= 0; {1560#true} is VALID
[2022-02-20 18:31:42,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {1560#true} assume ~id2~0 >= 0; {1560#true} is VALID
[2022-02-20 18:31:42,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {1560#true} assume ~id3~0 >= 0; {1560#true} is VALID
[2022-02-20 18:31:42,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {1560#true} assume 0 == ~r1~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r2~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r3~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r122~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r132~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r212~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r232~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r312~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r322~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max1~0 == ~id1~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max2~0 == ~id2~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,250 INFO L290 TraceCheckUtils]: 31: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max3~0 == ~id3~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,252 INFO L290 TraceCheckUtils]: 35: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl1~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl2~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,252 INFO L290 TraceCheckUtils]: 37: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl3~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,253 INFO L290 TraceCheckUtils]: 38: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,253 INFO L290 TraceCheckUtils]: 39: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,253 INFO L290 TraceCheckUtils]: 40: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,254 INFO L290 TraceCheckUtils]: 41: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~newmax1~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,254 INFO L290 TraceCheckUtils]: 42: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~newmax2~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,254 INFO L290 TraceCheckUtils]: 43: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,255 INFO L290 TraceCheckUtils]: 44: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp___5~0#1; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,255 INFO L290 TraceCheckUtils]: 45: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,255 INFO L290 TraceCheckUtils]: 46: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,256 INFO L290 TraceCheckUtils]: 47: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,256 INFO L290 TraceCheckUtils]: 48: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,256 INFO L290 TraceCheckUtils]: 49: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID
[2022-02-20 18:31:42,257 INFO L290 TraceCheckUtils]: 50: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 2); {1561#false} is VALID
[2022-02-20 18:31:42,257 INFO L290 TraceCheckUtils]: 51: Hoare triple {1561#false} ~mode1~0 := 1; {1561#false} is VALID
[2022-02-20 18:31:42,257 INFO L290 TraceCheckUtils]: 52: Hoare triple {1561#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {1561#false} is VALID
[2022-02-20 18:31:42,257 INFO L290 TraceCheckUtils]: 53: Hoare triple {1561#false} assume !(0 != ~mode2~0 % 256); {1561#false} is VALID
[2022-02-20 18:31:42,257 INFO L290 TraceCheckUtils]: 54: Hoare triple {1561#false} assume !(~r2~0 % 256 < 2); {1561#false} is VALID
[2022-02-20 18:31:42,257 INFO L290 TraceCheckUtils]: 55: Hoare triple {1561#false} ~mode2~0 := 1; {1561#false} is VALID
[2022-02-20 18:31:42,258 INFO L290 TraceCheckUtils]: 56: Hoare triple {1561#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {1561#false} is VALID
[2022-02-20 18:31:42,258 INFO L290 TraceCheckUtils]: 57: Hoare triple {1561#false} assume !(0 != ~mode3~0 % 256); {1561#false} is VALID
[2022-02-20 18:31:42,258 INFO L290 TraceCheckUtils]: 58: Hoare triple {1561#false} assume !(~r3~0 % 256 < 2); {1561#false} is VALID
[2022-02-20 18:31:42,258 INFO L290 TraceCheckUtils]: 59: Hoare triple {1561#false} ~mode3~0 := 1; {1561#false} is VALID
[2022-02-20 18:31:42,258 INFO L290 TraceCheckUtils]: 60: Hoare triple {1561#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1561#false} is VALID
[2022-02-20 18:31:42,258 INFO L290 TraceCheckUtils]: 61: Hoare triple {1561#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1561#false} is VALID
[2022-02-20 18:31:42,259 INFO L290 TraceCheckUtils]: 62: Hoare triple {1561#false} check_#res#1 := check_~tmp~1#1; {1561#false} is VALID
[2022-02-20 18:31:42,259 INFO L290 TraceCheckUtils]: 63: Hoare triple {1561#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1561#false} is VALID
[2022-02-20 18:31:42,259 INFO L290 TraceCheckUtils]: 64: Hoare triple {1561#false} assume 0 == assert_~arg#1 % 256; {1561#false} is VALID
[2022-02-20 18:31:42,259 INFO L290 TraceCheckUtils]: 65: Hoare triple {1561#false} assume !false; {1561#false} is VALID
[2022-02-20 18:31:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:31:42,260 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:31:42,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293098106]
[2022-02-20 18:31:42,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293098106] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:31:42,260 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:31:42,260 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 18:31:42,260 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072373031]
[2022-02-20 18:31:42,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:31:42,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66
[2022-02-20 18:31:42,261 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:31:42,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:42,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:31:42,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 18:31:42,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:31:42,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 18:31:42,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:31:42,311 INFO L87 Difference]: Start difference. First operand 145 states and 220 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:42,519 INFO L93 Difference]: Finished difference Result 305 states and 486 transitions.
[2022-02-20 18:31:42,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-20 18:31:42,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66
[2022-02-20 18:31:42,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:31:42,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:42,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions.
[2022-02-20 18:31:42,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions.
[2022-02-20 18:31:42,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 486 transitions.
[2022-02-20 18:31:42,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:31:42,833 INFO L225 Difference]: With dead ends: 305
[2022-02-20 18:31:42,834 INFO L226 Difference]: Without dead ends: 220
[2022-02-20 18:31:42,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:31:42,835 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 115 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 18:31:42,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 388 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 18:31:42,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states.
[2022-02-20 18:31:42,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217.
[2022-02-20 18:31:42,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:31:42,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 220 states. Second operand has 217 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 216 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:42,860 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand has 217 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 216 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:42,860 INFO L87 Difference]: Start difference. First operand 220 states. Second operand has 217 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 216 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:42,865 INFO L93 Difference]: Finished difference Result 220 states and 338 transitions.
[2022-02-20 18:31:42,865 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 338 transitions.
[2022-02-20 18:31:42,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:31:42,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:31:42,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 216 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 220 states.
[2022-02-20 18:31:42,866 INFO L87 Difference]: Start difference. First operand has 217 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 216 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 220 states.
[2022-02-20 18:31:42,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:42,870 INFO L93 Difference]: Finished difference Result 220 states and 338 transitions.
[2022-02-20 18:31:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 338 transitions.
[2022-02-20 18:31:42,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:31:42,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:31:42,871 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 18:31:42,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 18:31:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.5555555555555556) internal successors, (336), 216 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:42,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 336 transitions.
[2022-02-20 18:31:42,876 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 336 transitions. Word has length 66
[2022-02-20 18:31:42,876 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 18:31:42,876 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 336 transitions.
[2022-02-20 18:31:42,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 336 transitions.
[2022-02-20 18:31:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2022-02-20 18:31:42,877 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:31:42,877 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:31:42,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-02-20 18:31:42,877 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:31:42,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:31:42,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1527919177, now seen corresponding path program 1 times
[2022-02-20 18:31:42,878 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:31:42,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726384614]
[2022-02-20 18:31:42,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:31:42,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:31:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:31:42,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {2569#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {2569#true} is VALID
[2022-02-20 18:31:42,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {2569#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {2569#true} is VALID
[2022-02-20 18:31:42,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {2569#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2569#true} is VALID
[2022-02-20 18:31:42,995 INFO L290 TraceCheckUtils]: 3: Hoare triple {2569#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2569#true} is VALID
[2022-02-20 18:31:42,995 INFO L290 TraceCheckUtils]: 4: Hoare triple {2569#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2569#true} is VALID
[2022-02-20 18:31:42,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {2569#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2569#true} is VALID
[2022-02-20 18:31:42,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {2569#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2569#true} is VALID
[2022-02-20 18:31:42,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {2569#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2569#true} is VALID
[2022-02-20 18:31:42,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {2569#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2569#true} is VALID
[2022-02-20 18:31:42,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {2569#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2569#true} is VALID
[2022-02-20 18:31:42,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {2569#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2569#true} is VALID
[2022-02-20 18:31:42,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {2569#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2569#true} is VALID
[2022-02-20 18:31:42,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {2569#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2569#true} is VALID
[2022-02-20 18:31:42,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {2569#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2569#true} is VALID
[2022-02-20 18:31:42,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {2569#true} assume ~id1~0 != ~id2~0; {2569#true} is VALID
[2022-02-20 18:31:42,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {2569#true} assume ~id1~0 != ~id3~0; {2569#true} is VALID
[2022-02-20 18:31:42,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {2569#true} assume ~id2~0 != ~id3~0; {2569#true} is VALID
[2022-02-20 18:31:42,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {2569#true} assume ~id1~0 >= 0; {2569#true} is VALID
[2022-02-20 18:31:42,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {2569#true} assume ~id2~0 >= 0; {2569#true} is VALID
[2022-02-20 18:31:42,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {2569#true} assume ~id3~0 >= 0; {2569#true} is VALID
[2022-02-20 18:31:42,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {2569#true} assume 0 == ~r1~0 % 256; {2569#true} is VALID
[2022-02-20 18:31:42,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {2569#true} assume 0 == ~r2~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:42,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~r3~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:42,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r122~0#1 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:42,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r132~0#1 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:42,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r212~0#1 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r232~0#1 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r312~0#1 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r322~0#1 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max1~0 == ~id1~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max2~0 == ~id2~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max3~0 == ~id3~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,002 INFO L290 TraceCheckUtils]: 32: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st1~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,002 INFO L290 TraceCheckUtils]: 33: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st2~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,002 INFO L290 TraceCheckUtils]: 34: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st3~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,003 INFO L290 TraceCheckUtils]: 35: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl1~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl2~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl3~0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode1~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,011 INFO L290 TraceCheckUtils]: 39: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode2~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode3~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != ~newmax1~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != ~newmax2~0 % 256; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,013 INFO L290 TraceCheckUtils]: 43: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,013 INFO L290 TraceCheckUtils]: 44: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} init_#res#1 := init_~tmp___5~0#1; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,013 INFO L290 TraceCheckUtils]: 45: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,014 INFO L290 TraceCheckUtils]: 46: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,014 INFO L290 TraceCheckUtils]: 47: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,014 INFO L290 TraceCheckUtils]: 48: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,015 INFO L290 TraceCheckUtils]: 49: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode1~0 % 256); {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,015 INFO L290 TraceCheckUtils]: 50: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~r1~0 % 256 < 2; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,015 INFO L290 TraceCheckUtils]: 51: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep12~0 % 256); {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,016 INFO L290 TraceCheckUtils]: 52: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep13~0 % 256); {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,016 INFO L290 TraceCheckUtils]: 53: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} ~mode1~0 := 1; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,016 INFO L290 TraceCheckUtils]: 54: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,016 INFO L290 TraceCheckUtils]: 55: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode2~0 % 256); {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID
[2022-02-20 18:31:43,017 INFO L290 TraceCheckUtils]: 56: Hoare triple {2571#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(~r2~0 % 256 < 2); {2570#false} is VALID
[2022-02-20 18:31:43,017 INFO L290 TraceCheckUtils]: 57: Hoare triple {2570#false} ~mode2~0 := 1; {2570#false} is VALID
[2022-02-20 18:31:43,017 INFO L290 TraceCheckUtils]: 58: Hoare triple {2570#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {2570#false} is VALID
[2022-02-20 18:31:43,017 INFO L290 TraceCheckUtils]: 59: Hoare triple {2570#false} assume !(0 != ~mode3~0 % 256); {2570#false} is VALID
[2022-02-20 18:31:43,017 INFO L290 TraceCheckUtils]: 60: Hoare triple {2570#false} assume !(~r3~0 % 256 < 2); {2570#false} is VALID
[2022-02-20 18:31:43,018 INFO L290 TraceCheckUtils]: 61: Hoare triple {2570#false} ~mode3~0 := 1; {2570#false} is VALID
[2022-02-20 18:31:43,018 INFO L290 TraceCheckUtils]: 62: Hoare triple {2570#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2570#false} is VALID
[2022-02-20 18:31:43,018 INFO L290 TraceCheckUtils]: 63: Hoare triple {2570#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {2570#false} is VALID
[2022-02-20 18:31:43,018 INFO L290 TraceCheckUtils]: 64: Hoare triple {2570#false} check_#res#1 := check_~tmp~1#1; {2570#false} is VALID
[2022-02-20 18:31:43,018 INFO L290 TraceCheckUtils]: 65: Hoare triple {2570#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2570#false} is VALID
[2022-02-20 18:31:43,018 INFO L290 TraceCheckUtils]: 66: Hoare triple {2570#false} assume 0 == assert_~arg#1 % 256; {2570#false} is VALID
[2022-02-20 18:31:43,018 INFO L290 TraceCheckUtils]: 67: Hoare triple {2570#false} assume !false; {2570#false} is VALID
[2022-02-20 18:31:43,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:31:43,019 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:31:43,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726384614]
[2022-02-20 18:31:43,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726384614] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:31:43,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:31:43,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 18:31:43,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620869984]
[2022-02-20 18:31:43,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:31:43,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68
[2022-02-20 18:31:43,021 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:31:43,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:43,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:31:43,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 18:31:43,071 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:31:43,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 18:31:43,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:31:43,072 INFO L87 Difference]: Start difference. First operand 217 states and 336 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:43,306 INFO L93 Difference]: Finished difference Result 515 states and 824 transitions.
[2022-02-20 18:31:43,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-20 18:31:43,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68
[2022-02-20 18:31:43,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:31:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions.
[2022-02-20 18:31:43,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:43,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions.
[2022-02-20 18:31:43,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 490 transitions.
[2022-02-20 18:31:43,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:31:43,634 INFO L225 Difference]: With dead ends: 515
[2022-02-20 18:31:43,634 INFO L226 Difference]: Without dead ends: 358
[2022-02-20 18:31:43,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:31:43,636 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 117 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 18:31:43,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 401 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 18:31:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states.
[2022-02-20 18:31:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 354.
[2022-02-20 18:31:43,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:31:43,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 358 states. Second operand has 354 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 353 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:43,667 INFO L74 IsIncluded]: Start isIncluded. First operand 358 states. Second operand has 354 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 353 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:43,667 INFO L87 Difference]: Start difference. First operand 358 states. Second operand has 354 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 353 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:43,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:43,674 INFO L93 Difference]: Finished difference Result 358 states and 562 transitions.
[2022-02-20 18:31:43,674 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 562 transitions.
[2022-02-20 18:31:43,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:31:43,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:31:43,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 354 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 353 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 358 states.
[2022-02-20 18:31:43,675 INFO L87 Difference]: Start difference. First operand has 354 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 353 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 358 states.
[2022-02-20 18:31:43,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:43,682 INFO L93 Difference]: Finished difference Result 358 states and 562 transitions.
[2022-02-20 18:31:43,682 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 562 transitions.
[2022-02-20 18:31:43,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:31:43,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:31:43,683 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 18:31:43,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 18:31:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 353 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 559 transitions.
[2022-02-20 18:31:43,689 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 559 transitions. Word has length 68
[2022-02-20 18:31:43,689 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 18:31:43,689 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 559 transitions.
[2022-02-20 18:31:43,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 559 transitions.
[2022-02-20 18:31:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2022-02-20 18:31:43,690 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:31:43,690 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:31:43,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-02-20 18:31:43,691 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:31:43,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:31:43,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1063335298, now seen corresponding path program 1 times
[2022-02-20 18:31:43,691 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:31:43,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250091083]
[2022-02-20 18:31:43,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:31:43,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:31:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:31:43,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {4241#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {4241#true} is VALID
[2022-02-20 18:31:43,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {4241#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {4241#true} is VALID
[2022-02-20 18:31:43,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {4241#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {4241#true} is VALID
[2022-02-20 18:31:43,746 INFO L290 TraceCheckUtils]: 3: Hoare triple {4241#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {4241#true} is VALID
[2022-02-20 18:31:43,746 INFO L290 TraceCheckUtils]: 4: Hoare triple {4241#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {4241#true} is VALID
[2022-02-20 18:31:43,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {4241#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {4241#true} is VALID
[2022-02-20 18:31:43,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {4241#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {4241#true} is VALID
[2022-02-20 18:31:43,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {4241#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {4241#true} is VALID
[2022-02-20 18:31:43,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {4241#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {4241#true} is VALID
[2022-02-20 18:31:43,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {4241#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {4241#true} is VALID
[2022-02-20 18:31:43,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {4241#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {4241#true} is VALID
[2022-02-20 18:31:43,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {4241#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {4241#true} is VALID
[2022-02-20 18:31:43,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {4241#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {4241#true} is VALID
[2022-02-20 18:31:43,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {4241#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {4241#true} is VALID
[2022-02-20 18:31:43,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {4241#true} assume ~id1~0 != ~id2~0; {4241#true} is VALID
[2022-02-20 18:31:43,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {4241#true} assume ~id1~0 != ~id3~0; {4241#true} is VALID
[2022-02-20 18:31:43,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {4241#true} assume ~id2~0 != ~id3~0; {4241#true} is VALID
[2022-02-20 18:31:43,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {4241#true} assume ~id1~0 >= 0; {4241#true} is VALID
[2022-02-20 18:31:43,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {4241#true} assume ~id2~0 >= 0; {4241#true} is VALID
[2022-02-20 18:31:43,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {4241#true} assume ~id3~0 >= 0; {4241#true} is VALID
[2022-02-20 18:31:43,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {4241#true} assume 0 == ~r1~0 % 256; {4241#true} is VALID
[2022-02-20 18:31:43,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {4241#true} assume 0 == ~r2~0 % 256; {4241#true} is VALID
[2022-02-20 18:31:43,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {4241#true} assume 0 == ~r3~0 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r122~0#1 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r132~0#1 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r212~0#1 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r232~0#1 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,750 INFO L290 TraceCheckUtils]: 27: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r312~0#1 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r322~0#1 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max1~0 == ~id1~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max2~0 == ~id2~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max3~0 == ~id3~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,752 INFO L290 TraceCheckUtils]: 32: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st1~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,752 INFO L290 TraceCheckUtils]: 33: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st2~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,753 INFO L290 TraceCheckUtils]: 34: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st3~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,753 INFO L290 TraceCheckUtils]: 35: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl1~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,753 INFO L290 TraceCheckUtils]: 36: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl2~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,753 INFO L290 TraceCheckUtils]: 37: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl3~0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,754 INFO L290 TraceCheckUtils]: 38: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode1~0 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,754 INFO L290 TraceCheckUtils]: 39: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode2~0 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,754 INFO L290 TraceCheckUtils]: 40: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode3~0 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,755 INFO L290 TraceCheckUtils]: 41: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != ~newmax1~0 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,755 INFO L290 TraceCheckUtils]: 42: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != ~newmax2~0 % 256; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,755 INFO L290 TraceCheckUtils]: 43: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,756 INFO L290 TraceCheckUtils]: 44: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} init_#res#1 := init_~tmp___5~0#1; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,756 INFO L290 TraceCheckUtils]: 45: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,756 INFO L290 TraceCheckUtils]: 46: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,757 INFO L290 TraceCheckUtils]: 47: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,757 INFO L290 TraceCheckUtils]: 48: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,757 INFO L290 TraceCheckUtils]: 49: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode1~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,758 INFO L290 TraceCheckUtils]: 50: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r1~0 % 256 < 2; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,758 INFO L290 TraceCheckUtils]: 51: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep12~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,758 INFO L290 TraceCheckUtils]: 52: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep13~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,758 INFO L290 TraceCheckUtils]: 53: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode1~0 := 1; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,759 INFO L290 TraceCheckUtils]: 54: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,759 INFO L290 TraceCheckUtils]: 55: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode2~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,759 INFO L290 TraceCheckUtils]: 56: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r2~0 % 256 < 2; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,760 INFO L290 TraceCheckUtils]: 57: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep21~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,760 INFO L290 TraceCheckUtils]: 58: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep23~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,760 INFO L290 TraceCheckUtils]: 59: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode2~0 := 1; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,760 INFO L290 TraceCheckUtils]: 60: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,761 INFO L290 TraceCheckUtils]: 61: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode3~0 % 256); {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID
[2022-02-20 18:31:43,761 INFO L290 TraceCheckUtils]: 62: Hoare triple {4243#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(~r3~0 % 256 < 2); {4242#false} is VALID
[2022-02-20 18:31:43,761 INFO L290 TraceCheckUtils]: 63: Hoare triple {4242#false} ~mode3~0 := 1; {4242#false} is VALID
[2022-02-20 18:31:43,761 INFO L290 TraceCheckUtils]: 64: Hoare triple {4242#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {4242#false} is VALID
[2022-02-20 18:31:43,762 INFO L290 TraceCheckUtils]: 65: Hoare triple {4242#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {4242#false} is VALID
[2022-02-20 18:31:43,762 INFO L290 TraceCheckUtils]: 66: Hoare triple {4242#false} check_#res#1 := check_~tmp~1#1; {4242#false} is VALID
[2022-02-20 18:31:43,762 INFO L290 TraceCheckUtils]: 67: Hoare triple {4242#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {4242#false} is VALID
[2022-02-20 18:31:43,762 INFO L290 TraceCheckUtils]: 68: Hoare triple {4242#false} assume 0 == assert_~arg#1 % 256; {4242#false} is VALID
[2022-02-20 18:31:43,762 INFO L290 TraceCheckUtils]: 69: Hoare triple {4242#false} assume !false; {4242#false} is VALID
[2022-02-20 18:31:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:31:43,763 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:31:43,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250091083]
[2022-02-20 18:31:43,763 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250091083] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:31:43,763 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:31:43,763 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 18:31:43,763 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412034915]
[2022-02-20 18:31:43,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:31:43,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70
[2022-02-20 18:31:43,764 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:31:43,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:43,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:31:43,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 18:31:43,810 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:31:43,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 18:31:43,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:31:43,811 INFO L87 Difference]: Start difference. First operand 354 states and 559 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:44,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:44,090 INFO L93 Difference]: Finished difference Result 910 states and 1465 transitions.
[2022-02-20 18:31:44,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-20 18:31:44,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70
[2022-02-20 18:31:44,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:31:44,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions.
[2022-02-20 18:31:44,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:44,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions.
[2022-02-20 18:31:44,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 490 transitions.
[2022-02-20 18:31:44,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:31:44,418 INFO L225 Difference]: With dead ends: 910
[2022-02-20 18:31:44,418 INFO L226 Difference]: Without dead ends: 616
[2022-02-20 18:31:44,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:31:44,419 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 111 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 18:31:44,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 402 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 18:31:44,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states.
[2022-02-20 18:31:44,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 610.
[2022-02-20 18:31:44,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:31:44,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 616 states. Second operand has 610 states, 609 states have (on average 1.5944170771756978) internal successors, (971), 609 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:44,475 INFO L74 IsIncluded]: Start isIncluded. First operand 616 states. Second operand has 610 states, 609 states have (on average 1.5944170771756978) internal successors, (971), 609 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:44,476 INFO L87 Difference]: Start difference. First operand 616 states. Second operand has 610 states, 609 states have (on average 1.5944170771756978) internal successors, (971), 609 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:44,488 INFO L93 Difference]: Finished difference Result 616 states and 976 transitions.
[2022-02-20 18:31:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 976 transitions.
[2022-02-20 18:31:44,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:31:44,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:31:44,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 610 states, 609 states have (on average 1.5944170771756978) internal successors, (971), 609 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 616 states.
[2022-02-20 18:31:44,490 INFO L87 Difference]: Start difference. First operand has 610 states, 609 states have (on average 1.5944170771756978) internal successors, (971), 609 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 616 states.
[2022-02-20 18:31:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:44,502 INFO L93 Difference]: Finished difference Result 616 states and 976 transitions.
[2022-02-20 18:31:44,502 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 976 transitions.
[2022-02-20 18:31:44,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:31:44,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:31:44,503 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 18:31:44,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 18:31:44,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 609 states have (on average 1.5944170771756978) internal successors, (971), 609 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:44,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 971 transitions.
[2022-02-20 18:31:44,517 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 971 transitions. Word has length 70
[2022-02-20 18:31:44,517 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 18:31:44,517 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 971 transitions.
[2022-02-20 18:31:44,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:44,517 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 971 transitions.
[2022-02-20 18:31:44,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2022-02-20 18:31:44,518 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:31:44,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:31:44,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-02-20 18:31:44,518 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:31:44,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:31:44,519 INFO L85 PathProgramCache]: Analyzing trace with hash 845837107, now seen corresponding path program 1 times
[2022-02-20 18:31:44,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:31:44,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508248750]
[2022-02-20 18:31:44,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:31:44,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:31:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:31:44,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {7160#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {7160#true} is VALID
[2022-02-20 18:31:44,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {7160#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {7160#true} is VALID
[2022-02-20 18:31:44,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {7160#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {7160#true} is VALID
[2022-02-20 18:31:44,589 INFO L290 TraceCheckUtils]: 3: Hoare triple {7160#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {7160#true} is VALID
[2022-02-20 18:31:44,589 INFO L290 TraceCheckUtils]: 4: Hoare triple {7160#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {7160#true} is VALID
[2022-02-20 18:31:44,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {7160#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {7160#true} is VALID
[2022-02-20 18:31:44,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {7160#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {7160#true} is VALID
[2022-02-20 18:31:44,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {7160#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {7160#true} is VALID
[2022-02-20 18:31:44,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {7160#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {7160#true} is VALID
[2022-02-20 18:31:44,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {7160#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {7160#true} is VALID
[2022-02-20 18:31:44,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {7160#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {7160#true} is VALID
[2022-02-20 18:31:44,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {7160#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {7160#true} is VALID
[2022-02-20 18:31:44,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {7160#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {7160#true} is VALID
[2022-02-20 18:31:44,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {7160#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {7160#true} is VALID
[2022-02-20 18:31:44,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {7160#true} assume ~id1~0 != ~id2~0; {7160#true} is VALID
[2022-02-20 18:31:44,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {7160#true} assume ~id1~0 != ~id3~0; {7160#true} is VALID
[2022-02-20 18:31:44,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {7160#true} assume ~id2~0 != ~id3~0; {7160#true} is VALID
[2022-02-20 18:31:44,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {7160#true} assume ~id1~0 >= 0; {7160#true} is VALID
[2022-02-20 18:31:44,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {7160#true} assume ~id2~0 >= 0; {7160#true} is VALID
[2022-02-20 18:31:44,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {7160#true} assume ~id3~0 >= 0; {7160#true} is VALID
[2022-02-20 18:31:44,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {7160#true} assume 0 == ~r1~0 % 256; {7160#true} is VALID
[2022-02-20 18:31:44,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {7160#true} assume 0 == ~r2~0 % 256; {7160#true} is VALID
[2022-02-20 18:31:44,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {7160#true} assume 0 == ~r3~0 % 256; {7160#true} is VALID
[2022-02-20 18:31:44,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {7160#true} assume 0 != init_~r122~0#1 % 256; {7160#true} is VALID
[2022-02-20 18:31:44,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {7160#true} assume 0 != init_~r132~0#1 % 256; {7160#true} is VALID
[2022-02-20 18:31:44,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {7160#true} assume 0 != init_~r212~0#1 % 256; {7160#true} is VALID
[2022-02-20 18:31:44,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {7160#true} assume 0 != init_~r232~0#1 % 256; {7160#true} is VALID
[2022-02-20 18:31:44,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {7160#true} assume 0 != init_~r312~0#1 % 256; {7160#true} is VALID
[2022-02-20 18:31:44,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {7160#true} assume 0 != init_~r322~0#1 % 256; {7160#true} is VALID
[2022-02-20 18:31:44,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {7160#true} assume ~max1~0 == ~id1~0; {7160#true} is VALID
[2022-02-20 18:31:44,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {7160#true} assume ~max2~0 == ~id2~0; {7160#true} is VALID
[2022-02-20 18:31:44,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {7160#true} assume ~max3~0 == ~id3~0; {7160#true} is VALID
[2022-02-20 18:31:44,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {7160#true} assume 0 == ~st1~0; {7162#(<= ~st1~0 0)} is VALID
[2022-02-20 18:31:44,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {7162#(<= ~st1~0 0)} assume 0 == ~st2~0; {7163#(<= (+ ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {7163#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,594 INFO L290 TraceCheckUtils]: 35: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,594 INFO L290 TraceCheckUtils]: 36: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,594 INFO L290 TraceCheckUtils]: 37: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,595 INFO L290 TraceCheckUtils]: 38: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,595 INFO L290 TraceCheckUtils]: 39: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,595 INFO L290 TraceCheckUtils]: 40: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax1~0 % 256; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax2~0 % 256; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,597 INFO L290 TraceCheckUtils]: 43: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,598 INFO L290 TraceCheckUtils]: 45: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,598 INFO L290 TraceCheckUtils]: 46: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,599 INFO L290 TraceCheckUtils]: 47: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,599 INFO L290 TraceCheckUtils]: 48: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,599 INFO L290 TraceCheckUtils]: 49: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,599 INFO L290 TraceCheckUtils]: 50: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,600 INFO L290 TraceCheckUtils]: 51: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,600 INFO L290 TraceCheckUtils]: 52: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,600 INFO L290 TraceCheckUtils]: 53: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,601 INFO L290 TraceCheckUtils]: 54: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,601 INFO L290 TraceCheckUtils]: 55: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,601 INFO L290 TraceCheckUtils]: 56: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,601 INFO L290 TraceCheckUtils]: 57: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,602 INFO L290 TraceCheckUtils]: 58: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,602 INFO L290 TraceCheckUtils]: 59: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,602 INFO L290 TraceCheckUtils]: 60: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,603 INFO L290 TraceCheckUtils]: 61: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,603 INFO L290 TraceCheckUtils]: 62: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,603 INFO L290 TraceCheckUtils]: 63: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,604 INFO L290 TraceCheckUtils]: 64: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,604 INFO L290 TraceCheckUtils]: 65: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,604 INFO L290 TraceCheckUtils]: 66: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:44,605 INFO L290 TraceCheckUtils]: 67: Hoare triple {7164#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {7161#false} is VALID
[2022-02-20 18:31:44,605 INFO L290 TraceCheckUtils]: 68: Hoare triple {7161#false} check_#res#1 := check_~tmp~1#1; {7161#false} is VALID
[2022-02-20 18:31:44,605 INFO L290 TraceCheckUtils]: 69: Hoare triple {7161#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {7161#false} is VALID
[2022-02-20 18:31:44,605 INFO L290 TraceCheckUtils]: 70: Hoare triple {7161#false} assume 0 == assert_~arg#1 % 256; {7161#false} is VALID
[2022-02-20 18:31:44,605 INFO L290 TraceCheckUtils]: 71: Hoare triple {7161#false} assume !false; {7161#false} is VALID
[2022-02-20 18:31:44,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:31:44,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:31:44,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508248750]
[2022-02-20 18:31:44,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508248750] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:31:44,606 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:31:44,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-20 18:31:44,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418574600]
[2022-02-20 18:31:44,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:31:44,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72
[2022-02-20 18:31:44,607 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:31:44,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:44,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:31:44,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-02-20 18:31:44,652 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:31:44,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-02-20 18:31:44,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-02-20 18:31:44,653 INFO L87 Difference]: Start difference. First operand 610 states and 971 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:46,422 INFO L93 Difference]: Finished difference Result 2622 states and 4281 transitions.
[2022-02-20 18:31:46,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-02-20 18:31:46,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72
[2022-02-20 18:31:46,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:31:46,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:46,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1072 transitions.
[2022-02-20 18:31:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1072 transitions.
[2022-02-20 18:31:46,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1072 transitions.
[2022-02-20 18:31:47,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1072 edges. 1072 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:31:47,553 INFO L225 Difference]: With dead ends: 2622
[2022-02-20 18:31:47,560 INFO L226 Difference]: Without dead ends: 2072
[2022-02-20 18:31:47,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2022-02-20 18:31:47,579 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 936 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-20 18:31:47,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [936 Valid, 1286 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-20 18:31:47,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states.
[2022-02-20 18:31:47,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1092.
[2022-02-20 18:31:47,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:31:47,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2072 states. Second operand has 1092 states, 1091 states have (on average 1.6076993583868011) internal successors, (1754), 1091 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:47,847 INFO L74 IsIncluded]: Start isIncluded. First operand 2072 states. Second operand has 1092 states, 1091 states have (on average 1.6076993583868011) internal successors, (1754), 1091 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:47,848 INFO L87 Difference]: Start difference. First operand 2072 states. Second operand has 1092 states, 1091 states have (on average 1.6076993583868011) internal successors, (1754), 1091 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:47,958 INFO L93 Difference]: Finished difference Result 2072 states and 3362 transitions.
[2022-02-20 18:31:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3362 transitions.
[2022-02-20 18:31:47,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:31:47,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:31:47,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 1092 states, 1091 states have (on average 1.6076993583868011) internal successors, (1754), 1091 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2072 states.
[2022-02-20 18:31:47,965 INFO L87 Difference]: Start difference. First operand has 1092 states, 1091 states have (on average 1.6076993583868011) internal successors, (1754), 1091 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2072 states.
[2022-02-20 18:31:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:48,071 INFO L93 Difference]: Finished difference Result 2072 states and 3362 transitions.
[2022-02-20 18:31:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3362 transitions.
[2022-02-20 18:31:48,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:31:48,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:31:48,074 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 18:31:48,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 18:31:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1091 states have (on average 1.6076993583868011) internal successors, (1754), 1091 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:48,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1754 transitions.
[2022-02-20 18:31:48,110 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1754 transitions. Word has length 72
[2022-02-20 18:31:48,110 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 18:31:48,111 INFO L470 AbstractCegarLoop]: Abstraction has 1092 states and 1754 transitions.
[2022-02-20 18:31:48,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:48,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1754 transitions.
[2022-02-20 18:31:48,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2022-02-20 18:31:48,113 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:31:48,113 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:31:48,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-02-20 18:31:48,113 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:31:48,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:31:48,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1471686026, now seen corresponding path program 1 times
[2022-02-20 18:31:48,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:31:48,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506668218]
[2022-02-20 18:31:48,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:31:48,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:31:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:31:48,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {15421#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {15421#true} is VALID
[2022-02-20 18:31:48,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {15421#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {15421#true} is VALID
[2022-02-20 18:31:48,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {15421#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {15421#true} is VALID
[2022-02-20 18:31:48,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {15421#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {15421#true} is VALID
[2022-02-20 18:31:48,214 INFO L290 TraceCheckUtils]: 4: Hoare triple {15421#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {15421#true} is VALID
[2022-02-20 18:31:48,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {15421#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {15421#true} is VALID
[2022-02-20 18:31:48,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {15421#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {15421#true} is VALID
[2022-02-20 18:31:48,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {15421#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {15421#true} is VALID
[2022-02-20 18:31:48,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {15421#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {15421#true} is VALID
[2022-02-20 18:31:48,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {15421#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {15421#true} is VALID
[2022-02-20 18:31:48,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {15421#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {15421#true} is VALID
[2022-02-20 18:31:48,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {15421#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {15421#true} is VALID
[2022-02-20 18:31:48,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {15421#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {15421#true} is VALID
[2022-02-20 18:31:48,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {15421#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {15421#true} is VALID
[2022-02-20 18:31:48,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {15421#true} assume ~id1~0 != ~id2~0; {15421#true} is VALID
[2022-02-20 18:31:48,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {15421#true} assume ~id1~0 != ~id3~0; {15421#true} is VALID
[2022-02-20 18:31:48,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {15421#true} assume ~id2~0 != ~id3~0; {15421#true} is VALID
[2022-02-20 18:31:48,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {15421#true} assume ~id1~0 >= 0; {15421#true} is VALID
[2022-02-20 18:31:48,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {15421#true} assume ~id2~0 >= 0; {15421#true} is VALID
[2022-02-20 18:31:48,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {15421#true} assume ~id3~0 >= 0; {15421#true} is VALID
[2022-02-20 18:31:48,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {15421#true} assume 0 == ~r1~0 % 256; {15421#true} is VALID
[2022-02-20 18:31:48,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {15421#true} assume 0 == ~r2~0 % 256; {15421#true} is VALID
[2022-02-20 18:31:48,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {15421#true} assume 0 == ~r3~0 % 256; {15421#true} is VALID
[2022-02-20 18:31:48,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {15421#true} assume 0 != init_~r122~0#1 % 256; {15421#true} is VALID
[2022-02-20 18:31:48,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {15421#true} assume 0 != init_~r132~0#1 % 256; {15421#true} is VALID
[2022-02-20 18:31:48,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {15421#true} assume 0 != init_~r212~0#1 % 256; {15421#true} is VALID
[2022-02-20 18:31:48,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {15421#true} assume 0 != init_~r232~0#1 % 256; {15421#true} is VALID
[2022-02-20 18:31:48,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {15421#true} assume 0 != init_~r312~0#1 % 256; {15421#true} is VALID
[2022-02-20 18:31:48,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {15421#true} assume 0 != init_~r322~0#1 % 256; {15421#true} is VALID
[2022-02-20 18:31:48,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {15421#true} assume ~max1~0 == ~id1~0; {15421#true} is VALID
[2022-02-20 18:31:48,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {15421#true} assume ~max2~0 == ~id2~0; {15421#true} is VALID
[2022-02-20 18:31:48,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {15421#true} assume ~max3~0 == ~id3~0; {15421#true} is VALID
[2022-02-20 18:31:48,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {15421#true} assume 0 == ~st1~0; {15423#(<= ~st1~0 0)} is VALID
[2022-02-20 18:31:48,229 INFO L290 TraceCheckUtils]: 33: Hoare triple {15423#(<= ~st1~0 0)} assume 0 == ~st2~0; {15423#(<= ~st1~0 0)} is VALID
[2022-02-20 18:31:48,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {15423#(<= ~st1~0 0)} assume 0 == ~st3~0; {15423#(<= ~st1~0 0)} is VALID
[2022-02-20 18:31:48,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {15423#(<= ~st1~0 0)} assume 0 == ~nl1~0; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,231 INFO L290 TraceCheckUtils]: 36: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax1~0 % 256; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax2~0 % 256; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,233 INFO L290 TraceCheckUtils]: 43: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,234 INFO L290 TraceCheckUtils]: 44: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,234 INFO L290 TraceCheckUtils]: 45: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,234 INFO L290 TraceCheckUtils]: 46: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,234 INFO L290 TraceCheckUtils]: 47: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,235 INFO L290 TraceCheckUtils]: 48: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,235 INFO L290 TraceCheckUtils]: 49: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,235 INFO L290 TraceCheckUtils]: 50: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,236 INFO L290 TraceCheckUtils]: 51: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,236 INFO L290 TraceCheckUtils]: 52: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,237 INFO L290 TraceCheckUtils]: 54: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,237 INFO L290 TraceCheckUtils]: 55: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,237 INFO L290 TraceCheckUtils]: 56: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,238 INFO L290 TraceCheckUtils]: 57: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,238 INFO L290 TraceCheckUtils]: 58: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,238 INFO L290 TraceCheckUtils]: 59: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,238 INFO L290 TraceCheckUtils]: 60: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,240 INFO L290 TraceCheckUtils]: 61: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,240 INFO L290 TraceCheckUtils]: 62: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,240 INFO L290 TraceCheckUtils]: 63: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,241 INFO L290 TraceCheckUtils]: 64: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,241 INFO L290 TraceCheckUtils]: 65: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,241 INFO L290 TraceCheckUtils]: 66: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,242 INFO L290 TraceCheckUtils]: 67: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15424#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID
[2022-02-20 18:31:48,242 INFO L290 TraceCheckUtils]: 68: Hoare triple {15424#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);check_~tmp~1#1 := 0; {15422#false} is VALID
[2022-02-20 18:31:48,242 INFO L290 TraceCheckUtils]: 69: Hoare triple {15422#false} check_#res#1 := check_~tmp~1#1; {15422#false} is VALID
[2022-02-20 18:31:48,242 INFO L290 TraceCheckUtils]: 70: Hoare triple {15422#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {15422#false} is VALID
[2022-02-20 18:31:48,243 INFO L290 TraceCheckUtils]: 71: Hoare triple {15422#false} assume 0 == assert_~arg#1 % 256; {15422#false} is VALID
[2022-02-20 18:31:48,243 INFO L290 TraceCheckUtils]: 72: Hoare triple {15422#false} assume !false; {15422#false} is VALID
[2022-02-20 18:31:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:31:48,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:31:48,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506668218]
[2022-02-20 18:31:48,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506668218] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:31:48,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:31:48,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-02-20 18:31:48,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387332998]
[2022-02-20 18:31:48,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:31:48,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73
[2022-02-20 18:31:48,248 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:31:48,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:48,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:31:48,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-02-20 18:31:48,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:31:48,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-02-20 18:31:48,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-02-20 18:31:48,306 INFO L87 Difference]: Start difference. First operand 1092 states and 1754 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:49,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:49,436 INFO L93 Difference]: Finished difference Result 3182 states and 5186 transitions.
[2022-02-20 18:31:49,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-20 18:31:49,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73
[2022-02-20 18:31:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:31:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions.
[2022-02-20 18:31:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions.
[2022-02-20 18:31:49,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 646 transitions.
[2022-02-20 18:31:49,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 646 edges. 646 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:31:49,998 INFO L225 Difference]: With dead ends: 3182
[2022-02-20 18:31:49,998 INFO L226 Difference]: Without dead ends: 2150
[2022-02-20 18:31:49,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-02-20 18:31:50,000 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 413 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 18:31:50,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 723 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 18:31:50,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states.
[2022-02-20 18:31:50,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1612.
[2022-02-20 18:31:50,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:31:50,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2150 states. Second operand has 1612 states, 1611 states have (on average 1.6157666045934203) internal successors, (2603), 1611 states have internal predecessors, (2603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:50,278 INFO L74 IsIncluded]: Start isIncluded. First operand 2150 states. Second operand has 1612 states, 1611 states have (on average 1.6157666045934203) internal successors, (2603), 1611 states have internal predecessors, (2603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:50,280 INFO L87 Difference]: Start difference. First operand 2150 states. Second operand has 1612 states, 1611 states have (on average 1.6157666045934203) internal successors, (2603), 1611 states have internal predecessors, (2603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:50,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:50,391 INFO L93 Difference]: Finished difference Result 2150 states and 3496 transitions.
[2022-02-20 18:31:50,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 3496 transitions.
[2022-02-20 18:31:50,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:31:50,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:31:50,396 INFO L74 IsIncluded]: Start isIncluded. First operand has 1612 states, 1611 states have (on average 1.6157666045934203) internal successors, (2603), 1611 states have internal predecessors, (2603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2150 states.
[2022-02-20 18:31:50,409 INFO L87 Difference]: Start difference. First operand has 1612 states, 1611 states have (on average 1.6157666045934203) internal successors, (2603), 1611 states have internal predecessors, (2603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2150 states.
[2022-02-20 18:31:50,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:50,521 INFO L93 Difference]: Finished difference Result 2150 states and 3496 transitions.
[2022-02-20 18:31:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 3496 transitions.
[2022-02-20 18:31:50,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:31:50,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:31:50,524 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 18:31:50,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 18:31:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1611 states have (on average 1.6157666045934203) internal successors, (2603), 1611 states have internal predecessors, (2603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2603 transitions.
[2022-02-20 18:31:50,600 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2603 transitions. Word has length 73
[2022-02-20 18:31:50,600 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 18:31:50,601 INFO L470 AbstractCegarLoop]: Abstraction has 1612 states and 2603 transitions.
[2022-02-20 18:31:50,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2603 transitions.
[2022-02-20 18:31:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2022-02-20 18:31:50,602 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:31:50,602 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:31:50,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-02-20 18:31:50,603 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:31:50,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:31:50,604 INFO L85 PathProgramCache]: Analyzing trace with hash -131454774, now seen corresponding path program 1 times
[2022-02-20 18:31:50,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:31:50,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910046770]
[2022-02-20 18:31:50,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:31:50,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:31:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:31:50,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {25027#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {25027#true} is VALID
[2022-02-20 18:31:50,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {25027#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {25027#true} is VALID
[2022-02-20 18:31:50,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {25027#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {25027#true} is VALID
[2022-02-20 18:31:50,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {25027#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {25027#true} is VALID
[2022-02-20 18:31:50,673 INFO L290 TraceCheckUtils]: 4: Hoare triple {25027#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {25027#true} is VALID
[2022-02-20 18:31:50,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {25027#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {25027#true} is VALID
[2022-02-20 18:31:50,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {25027#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {25027#true} is VALID
[2022-02-20 18:31:50,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {25027#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {25027#true} is VALID
[2022-02-20 18:31:50,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {25027#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {25027#true} is VALID
[2022-02-20 18:31:50,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {25027#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {25027#true} is VALID
[2022-02-20 18:31:50,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {25027#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {25027#true} is VALID
[2022-02-20 18:31:50,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {25027#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {25027#true} is VALID
[2022-02-20 18:31:50,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {25027#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {25027#true} is VALID
[2022-02-20 18:31:50,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {25027#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {25027#true} is VALID
[2022-02-20 18:31:50,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {25027#true} assume ~id1~0 != ~id2~0; {25027#true} is VALID
[2022-02-20 18:31:50,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {25027#true} assume ~id1~0 != ~id3~0; {25027#true} is VALID
[2022-02-20 18:31:50,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {25027#true} assume ~id2~0 != ~id3~0; {25027#true} is VALID
[2022-02-20 18:31:50,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {25027#true} assume ~id1~0 >= 0; {25027#true} is VALID
[2022-02-20 18:31:50,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {25027#true} assume ~id2~0 >= 0; {25027#true} is VALID
[2022-02-20 18:31:50,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {25027#true} assume ~id3~0 >= 0; {25027#true} is VALID
[2022-02-20 18:31:50,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {25027#true} assume 0 == ~r1~0 % 256; {25027#true} is VALID
[2022-02-20 18:31:50,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {25027#true} assume 0 == ~r2~0 % 256; {25027#true} is VALID
[2022-02-20 18:31:50,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {25027#true} assume 0 == ~r3~0 % 256; {25027#true} is VALID
[2022-02-20 18:31:50,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {25027#true} assume 0 != init_~r122~0#1 % 256; {25027#true} is VALID
[2022-02-20 18:31:50,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {25027#true} assume 0 != init_~r132~0#1 % 256; {25027#true} is VALID
[2022-02-20 18:31:50,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {25027#true} assume 0 != init_~r212~0#1 % 256; {25027#true} is VALID
[2022-02-20 18:31:50,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {25027#true} assume 0 != init_~r232~0#1 % 256; {25027#true} is VALID
[2022-02-20 18:31:50,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {25027#true} assume 0 != init_~r312~0#1 % 256; {25027#true} is VALID
[2022-02-20 18:31:50,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {25027#true} assume 0 != init_~r322~0#1 % 256; {25027#true} is VALID
[2022-02-20 18:31:50,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {25027#true} assume ~max1~0 == ~id1~0; {25027#true} is VALID
[2022-02-20 18:31:50,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {25027#true} assume ~max2~0 == ~id2~0; {25027#true} is VALID
[2022-02-20 18:31:50,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {25027#true} assume ~max3~0 == ~id3~0; {25027#true} is VALID
[2022-02-20 18:31:50,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {25027#true} assume 0 == ~st1~0; {25027#true} is VALID
[2022-02-20 18:31:50,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {25027#true} assume 0 == ~st2~0; {25029#(<= ~st2~0 0)} is VALID
[2022-02-20 18:31:50,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {25029#(<= ~st2~0 0)} assume 0 == ~st3~0; {25029#(<= ~st2~0 0)} is VALID
[2022-02-20 18:31:50,678 INFO L290 TraceCheckUtils]: 35: Hoare triple {25029#(<= ~st2~0 0)} assume 0 == ~nl1~0; {25029#(<= ~st2~0 0)} is VALID
[2022-02-20 18:31:50,678 INFO L290 TraceCheckUtils]: 36: Hoare triple {25029#(<= ~st2~0 0)} assume 0 == ~nl2~0; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,678 INFO L290 TraceCheckUtils]: 37: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax1~0 % 256; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,680 INFO L290 TraceCheckUtils]: 42: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax2~0 % 256; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,680 INFO L290 TraceCheckUtils]: 43: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,680 INFO L290 TraceCheckUtils]: 44: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,681 INFO L290 TraceCheckUtils]: 45: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,681 INFO L290 TraceCheckUtils]: 46: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,681 INFO L290 TraceCheckUtils]: 47: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,682 INFO L290 TraceCheckUtils]: 48: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,682 INFO L290 TraceCheckUtils]: 49: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode1~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,682 INFO L290 TraceCheckUtils]: 50: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 % 256 < 2; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,682 INFO L290 TraceCheckUtils]: 51: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep12~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,683 INFO L290 TraceCheckUtils]: 52: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep13~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,683 INFO L290 TraceCheckUtils]: 53: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,683 INFO L290 TraceCheckUtils]: 54: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,684 INFO L290 TraceCheckUtils]: 55: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode2~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,684 INFO L290 TraceCheckUtils]: 56: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 % 256 < 2; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,684 INFO L290 TraceCheckUtils]: 57: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep21~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,685 INFO L290 TraceCheckUtils]: 58: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep23~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,685 INFO L290 TraceCheckUtils]: 59: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,685 INFO L290 TraceCheckUtils]: 60: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,685 INFO L290 TraceCheckUtils]: 61: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode3~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,686 INFO L290 TraceCheckUtils]: 62: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 % 256 < 2; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,686 INFO L290 TraceCheckUtils]: 63: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep31~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,686 INFO L290 TraceCheckUtils]: 64: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep32~0 % 256); {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,687 INFO L290 TraceCheckUtils]: 65: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,687 INFO L290 TraceCheckUtils]: 66: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,687 INFO L290 TraceCheckUtils]: 67: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,688 INFO L290 TraceCheckUtils]: 68: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {25030#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID
[2022-02-20 18:31:50,688 INFO L290 TraceCheckUtils]: 69: Hoare triple {25030#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);check_~tmp~1#1 := 0; {25028#false} is VALID
[2022-02-20 18:31:50,688 INFO L290 TraceCheckUtils]: 70: Hoare triple {25028#false} check_#res#1 := check_~tmp~1#1; {25028#false} is VALID
[2022-02-20 18:31:50,688 INFO L290 TraceCheckUtils]: 71: Hoare triple {25028#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {25028#false} is VALID
[2022-02-20 18:31:50,688 INFO L290 TraceCheckUtils]: 72: Hoare triple {25028#false} assume 0 == assert_~arg#1 % 256; {25028#false} is VALID
[2022-02-20 18:31:50,689 INFO L290 TraceCheckUtils]: 73: Hoare triple {25028#false} assume !false; {25028#false} is VALID
[2022-02-20 18:31:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:31:50,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:31:50,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910046770]
[2022-02-20 18:31:50,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910046770] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:31:50,689 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:31:50,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-02-20 18:31:50,690 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91209784]
[2022-02-20 18:31:50,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:31:50,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74
[2022-02-20 18:31:50,690 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:31:50,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:50,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:31:50,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-02-20 18:31:50,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:31:50,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-02-20 18:31:50,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-02-20 18:31:50,737 INFO L87 Difference]: Start difference. First operand 1612 states and 2603 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:52,534 INFO L93 Difference]: Finished difference Result 4676 states and 7610 transitions.
[2022-02-20 18:31:52,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-20 18:31:52,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74
[2022-02-20 18:31:52,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:31:52,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions.
[2022-02-20 18:31:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions.
[2022-02-20 18:31:52,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 646 transitions.
[2022-02-20 18:31:52,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 646 edges. 646 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:31:53,141 INFO L225 Difference]: With dead ends: 4676
[2022-02-20 18:31:53,141 INFO L226 Difference]: Without dead ends: 3124
[2022-02-20 18:31:53,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-02-20 18:31:53,143 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 411 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 18:31:53,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 724 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 18:31:53,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states.
[2022-02-20 18:31:53,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 2356.
[2022-02-20 18:31:53,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:31:53,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3124 states. Second operand has 2356 states, 2355 states have (on average 1.6148619957537156) internal successors, (3803), 2355 states have internal predecessors, (3803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:53,659 INFO L74 IsIncluded]: Start isIncluded. First operand 3124 states. Second operand has 2356 states, 2355 states have (on average 1.6148619957537156) internal successors, (3803), 2355 states have internal predecessors, (3803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:53,682 INFO L87 Difference]: Start difference. First operand 3124 states. Second operand has 2356 states, 2355 states have (on average 1.6148619957537156) internal successors, (3803), 2355 states have internal predecessors, (3803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:53,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:53,938 INFO L93 Difference]: Finished difference Result 3124 states and 5065 transitions.
[2022-02-20 18:31:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 5065 transitions.
[2022-02-20 18:31:53,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:31:53,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:31:53,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 2356 states, 2355 states have (on average 1.6148619957537156) internal successors, (3803), 2355 states have internal predecessors, (3803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 3124 states.
[2022-02-20 18:31:53,947 INFO L87 Difference]: Start difference. First operand has 2356 states, 2355 states have (on average 1.6148619957537156) internal successors, (3803), 2355 states have internal predecessors, (3803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 3124 states.
[2022-02-20 18:31:54,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:54,208 INFO L93 Difference]: Finished difference Result 3124 states and 5065 transitions.
[2022-02-20 18:31:54,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 5065 transitions.
[2022-02-20 18:31:54,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:31:54,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:31:54,212 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 18:31:54,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 18:31:54,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 2355 states have (on average 1.6148619957537156) internal successors, (3803), 2355 states have internal predecessors, (3803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:54,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 3803 transitions.
[2022-02-20 18:31:54,365 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 3803 transitions. Word has length 74
[2022-02-20 18:31:54,366 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 18:31:54,366 INFO L470 AbstractCegarLoop]: Abstraction has 2356 states and 3803 transitions.
[2022-02-20 18:31:54,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:54,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 3803 transitions.
[2022-02-20 18:31:54,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2022-02-20 18:31:54,367 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:31:54,367 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:31:54,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-02-20 18:31:54,368 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:31:54,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:31:54,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1364954579, now seen corresponding path program 1 times
[2022-02-20 18:31:54,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:31:54,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599766383]
[2022-02-20 18:31:54,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:31:54,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:31:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:31:54,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {39050#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {39050#true} is VALID
[2022-02-20 18:31:54,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {39050#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {39050#true} is VALID
[2022-02-20 18:31:54,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {39050#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {39050#true} is VALID
[2022-02-20 18:31:54,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {39050#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {39050#true} is VALID
[2022-02-20 18:31:54,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {39050#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {39050#true} is VALID
[2022-02-20 18:31:54,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {39050#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {39050#true} is VALID
[2022-02-20 18:31:54,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {39050#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {39050#true} is VALID
[2022-02-20 18:31:54,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {39050#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {39050#true} is VALID
[2022-02-20 18:31:54,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {39050#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {39050#true} is VALID
[2022-02-20 18:31:54,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {39050#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {39050#true} is VALID
[2022-02-20 18:31:54,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {39050#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {39050#true} is VALID
[2022-02-20 18:31:54,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {39050#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {39050#true} is VALID
[2022-02-20 18:31:54,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {39050#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {39050#true} is VALID
[2022-02-20 18:31:54,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {39050#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {39050#true} is VALID
[2022-02-20 18:31:54,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {39050#true} assume ~id1~0 != ~id2~0; {39050#true} is VALID
[2022-02-20 18:31:54,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {39050#true} assume ~id1~0 != ~id3~0; {39050#true} is VALID
[2022-02-20 18:31:54,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {39050#true} assume ~id2~0 != ~id3~0; {39050#true} is VALID
[2022-02-20 18:31:54,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {39050#true} assume ~id1~0 >= 0; {39050#true} is VALID
[2022-02-20 18:31:54,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {39050#true} assume ~id2~0 >= 0; {39050#true} is VALID
[2022-02-20 18:31:54,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {39050#true} assume ~id3~0 >= 0; {39050#true} is VALID
[2022-02-20 18:31:54,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {39050#true} assume 0 == ~r1~0 % 256; {39050#true} is VALID
[2022-02-20 18:31:54,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {39050#true} assume 0 == ~r2~0 % 256; {39050#true} is VALID
[2022-02-20 18:31:54,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {39050#true} assume 0 == ~r3~0 % 256; {39050#true} is VALID
[2022-02-20 18:31:54,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {39050#true} assume 0 != init_~r122~0#1 % 256; {39050#true} is VALID
[2022-02-20 18:31:54,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {39050#true} assume 0 != init_~r132~0#1 % 256; {39050#true} is VALID
[2022-02-20 18:31:54,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {39050#true} assume 0 != init_~r212~0#1 % 256; {39050#true} is VALID
[2022-02-20 18:31:54,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {39050#true} assume 0 != init_~r232~0#1 % 256; {39050#true} is VALID
[2022-02-20 18:31:54,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {39050#true} assume 0 != init_~r312~0#1 % 256; {39050#true} is VALID
[2022-02-20 18:31:54,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {39050#true} assume 0 != init_~r322~0#1 % 256; {39050#true} is VALID
[2022-02-20 18:31:54,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {39050#true} assume ~max1~0 == ~id1~0; {39050#true} is VALID
[2022-02-20 18:31:54,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {39050#true} assume ~max2~0 == ~id2~0; {39050#true} is VALID
[2022-02-20 18:31:54,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {39050#true} assume ~max3~0 == ~id3~0; {39050#true} is VALID
[2022-02-20 18:31:54,413 INFO L290 TraceCheckUtils]: 32: Hoare triple {39050#true} assume 0 == ~st1~0; {39050#true} is VALID
[2022-02-20 18:31:54,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {39050#true} assume 0 == ~st2~0; {39050#true} is VALID
[2022-02-20 18:31:54,414 INFO L290 TraceCheckUtils]: 34: Hoare triple {39050#true} assume 0 == ~st3~0; {39052#(<= ~st3~0 0)} is VALID
[2022-02-20 18:31:54,414 INFO L290 TraceCheckUtils]: 35: Hoare triple {39052#(<= ~st3~0 0)} assume 0 == ~nl1~0; {39052#(<= ~st3~0 0)} is VALID
[2022-02-20 18:31:54,414 INFO L290 TraceCheckUtils]: 36: Hoare triple {39052#(<= ~st3~0 0)} assume 0 == ~nl2~0; {39052#(<= ~st3~0 0)} is VALID
[2022-02-20 18:31:54,415 INFO L290 TraceCheckUtils]: 37: Hoare triple {39052#(<= ~st3~0 0)} assume 0 == ~nl3~0; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,415 INFO L290 TraceCheckUtils]: 38: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,415 INFO L290 TraceCheckUtils]: 39: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,416 INFO L290 TraceCheckUtils]: 40: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,416 INFO L290 TraceCheckUtils]: 41: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax1~0 % 256; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,416 INFO L290 TraceCheckUtils]: 42: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax2~0 % 256; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,416 INFO L290 TraceCheckUtils]: 43: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,417 INFO L290 TraceCheckUtils]: 45: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,417 INFO L290 TraceCheckUtils]: 46: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,418 INFO L290 TraceCheckUtils]: 47: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,418 INFO L290 TraceCheckUtils]: 48: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,418 INFO L290 TraceCheckUtils]: 49: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode1~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,419 INFO L290 TraceCheckUtils]: 50: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 % 256 < 2; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,419 INFO L290 TraceCheckUtils]: 51: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep12~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,419 INFO L290 TraceCheckUtils]: 52: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep13~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,419 INFO L290 TraceCheckUtils]: 53: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,420 INFO L290 TraceCheckUtils]: 54: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,420 INFO L290 TraceCheckUtils]: 55: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode2~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,420 INFO L290 TraceCheckUtils]: 56: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 % 256 < 2; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,421 INFO L290 TraceCheckUtils]: 57: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep21~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,421 INFO L290 TraceCheckUtils]: 58: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep23~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,421 INFO L290 TraceCheckUtils]: 59: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,421 INFO L290 TraceCheckUtils]: 60: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,422 INFO L290 TraceCheckUtils]: 61: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode3~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,422 INFO L290 TraceCheckUtils]: 62: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 % 256 < 2; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,422 INFO L290 TraceCheckUtils]: 63: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep31~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,422 INFO L290 TraceCheckUtils]: 64: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep32~0 % 256); {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,423 INFO L290 TraceCheckUtils]: 65: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,423 INFO L290 TraceCheckUtils]: 66: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,423 INFO L290 TraceCheckUtils]: 67: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,424 INFO L290 TraceCheckUtils]: 68: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,424 INFO L290 TraceCheckUtils]: 69: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {39053#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID
[2022-02-20 18:31:54,424 INFO L290 TraceCheckUtils]: 70: Hoare triple {39053#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);check_~tmp~1#1 := 0; {39051#false} is VALID
[2022-02-20 18:31:54,424 INFO L290 TraceCheckUtils]: 71: Hoare triple {39051#false} check_#res#1 := check_~tmp~1#1; {39051#false} is VALID
[2022-02-20 18:31:54,425 INFO L290 TraceCheckUtils]: 72: Hoare triple {39051#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {39051#false} is VALID
[2022-02-20 18:31:54,425 INFO L290 TraceCheckUtils]: 73: Hoare triple {39051#false} assume 0 == assert_~arg#1 % 256; {39051#false} is VALID
[2022-02-20 18:31:54,425 INFO L290 TraceCheckUtils]: 74: Hoare triple {39051#false} assume !false; {39051#false} is VALID
[2022-02-20 18:31:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:31:54,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:31:54,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599766383]
[2022-02-20 18:31:54,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599766383] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:31:54,426 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:31:54,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-02-20 18:31:54,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136846057]
[2022-02-20 18:31:54,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:31:54,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75
[2022-02-20 18:31:54,428 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:31:54,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:54,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:31:54,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-02-20 18:31:54,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:31:54,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-02-20 18:31:54,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-02-20 18:31:54,472 INFO L87 Difference]: Start difference. First operand 2356 states and 3803 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:57,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:31:57,411 INFO L93 Difference]: Finished difference Result 6796 states and 11038 transitions.
[2022-02-20 18:31:57,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-02-20 18:31:57,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75
[2022-02-20 18:31:57,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:31:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions.
[2022-02-20 18:31:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions.
[2022-02-20 18:31:57,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 646 transitions.
[2022-02-20 18:31:57,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 646 edges. 646 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:31:58,385 INFO L225 Difference]: With dead ends: 6796
[2022-02-20 18:31:58,385 INFO L226 Difference]: Without dead ends: 4500
[2022-02-20 18:31:58,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-02-20 18:31:58,388 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 409 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 18:31:58,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 733 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 18:31:58,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4500 states.
[2022-02-20 18:31:59,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4500 to 3412.
[2022-02-20 18:31:59,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:31:59,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4500 states. Second operand has 3412 states, 3411 states have (on average 1.612723541483436) internal successors, (5501), 3411 states have internal predecessors, (5501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:59,589 INFO L74 IsIncluded]: Start isIncluded. First operand 4500 states. Second operand has 3412 states, 3411 states have (on average 1.612723541483436) internal successors, (5501), 3411 states have internal predecessors, (5501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:31:59,592 INFO L87 Difference]: Start difference. First operand 4500 states. Second operand has 3412 states, 3411 states have (on average 1.612723541483436) internal successors, (5501), 3411 states have internal predecessors, (5501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:00,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:32:00,096 INFO L93 Difference]: Finished difference Result 4500 states and 7285 transitions.
[2022-02-20 18:32:00,096 INFO L276 IsEmpty]: Start isEmpty. Operand 4500 states and 7285 transitions.
[2022-02-20 18:32:00,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:32:00,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:32:00,104 INFO L74 IsIncluded]: Start isIncluded. First operand has 3412 states, 3411 states have (on average 1.612723541483436) internal successors, (5501), 3411 states have internal predecessors, (5501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 4500 states.
[2022-02-20 18:32:00,107 INFO L87 Difference]: Start difference. First operand has 3412 states, 3411 states have (on average 1.612723541483436) internal successors, (5501), 3411 states have internal predecessors, (5501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 4500 states.
[2022-02-20 18:32:00,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:32:00,611 INFO L93 Difference]: Finished difference Result 4500 states and 7285 transitions.
[2022-02-20 18:32:00,611 INFO L276 IsEmpty]: Start isEmpty. Operand 4500 states and 7285 transitions.
[2022-02-20 18:32:00,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:32:00,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:32:00,616 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 18:32:00,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 18:32:00,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3412 states, 3411 states have (on average 1.612723541483436) internal successors, (5501), 3411 states have internal predecessors, (5501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3412 states to 3412 states and 5501 transitions.
[2022-02-20 18:32:00,979 INFO L78 Accepts]: Start accepts. Automaton has 3412 states and 5501 transitions. Word has length 75
[2022-02-20 18:32:00,979 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 18:32:00,979 INFO L470 AbstractCegarLoop]: Abstraction has 3412 states and 5501 transitions.
[2022-02-20 18:32:00,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:00,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 5501 transitions.
[2022-02-20 18:32:00,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2022-02-20 18:32:00,981 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:32:00,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:32:00,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-02-20 18:32:00,981 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:32:00,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:32:00,982 INFO L85 PathProgramCache]: Analyzing trace with hash 915332421, now seen corresponding path program 1 times
[2022-02-20 18:32:00,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:32:00,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730157339]
[2022-02-20 18:32:00,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:32:00,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:32:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:32:01,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {59328#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {59328#true} is VALID
[2022-02-20 18:32:01,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {59328#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {59328#true} is VALID
[2022-02-20 18:32:01,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {59328#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {59328#true} is VALID
[2022-02-20 18:32:01,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {59328#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {59328#true} is VALID
[2022-02-20 18:32:01,027 INFO L290 TraceCheckUtils]: 4: Hoare triple {59328#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {59328#true} is VALID
[2022-02-20 18:32:01,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {59328#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {59328#true} is VALID
[2022-02-20 18:32:01,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {59328#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {59328#true} is VALID
[2022-02-20 18:32:01,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {59328#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {59328#true} is VALID
[2022-02-20 18:32:01,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {59328#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {59328#true} is VALID
[2022-02-20 18:32:01,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {59328#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {59328#true} is VALID
[2022-02-20 18:32:01,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {59328#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {59328#true} is VALID
[2022-02-20 18:32:01,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {59328#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {59328#true} is VALID
[2022-02-20 18:32:01,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {59328#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {59328#true} is VALID
[2022-02-20 18:32:01,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {59328#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {59328#true} is VALID
[2022-02-20 18:32:01,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {59328#true} assume ~id1~0 != ~id2~0; {59328#true} is VALID
[2022-02-20 18:32:01,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {59328#true} assume ~id1~0 != ~id3~0; {59328#true} is VALID
[2022-02-20 18:32:01,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {59328#true} assume ~id2~0 != ~id3~0; {59328#true} is VALID
[2022-02-20 18:32:01,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {59328#true} assume ~id1~0 >= 0; {59328#true} is VALID
[2022-02-20 18:32:01,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {59328#true} assume ~id2~0 >= 0; {59328#true} is VALID
[2022-02-20 18:32:01,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {59328#true} assume ~id3~0 >= 0; {59328#true} is VALID
[2022-02-20 18:32:01,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {59328#true} assume 0 == ~r1~0 % 256; {59328#true} is VALID
[2022-02-20 18:32:01,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {59328#true} assume 0 == ~r2~0 % 256; {59328#true} is VALID
[2022-02-20 18:32:01,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {59328#true} assume 0 == ~r3~0 % 256; {59328#true} is VALID
[2022-02-20 18:32:01,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {59328#true} assume 0 != init_~r122~0#1 % 256; {59328#true} is VALID
[2022-02-20 18:32:01,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {59328#true} assume 0 != init_~r132~0#1 % 256; {59328#true} is VALID
[2022-02-20 18:32:01,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {59328#true} assume 0 != init_~r212~0#1 % 256; {59328#true} is VALID
[2022-02-20 18:32:01,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {59328#true} assume 0 != init_~r232~0#1 % 256; {59328#true} is VALID
[2022-02-20 18:32:01,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {59328#true} assume 0 != init_~r312~0#1 % 256; {59328#true} is VALID
[2022-02-20 18:32:01,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {59328#true} assume 0 != init_~r322~0#1 % 256; {59328#true} is VALID
[2022-02-20 18:32:01,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {59328#true} assume ~max1~0 == ~id1~0; {59328#true} is VALID
[2022-02-20 18:32:01,031 INFO L290 TraceCheckUtils]: 30: Hoare triple {59328#true} assume ~max2~0 == ~id2~0; {59328#true} is VALID
[2022-02-20 18:32:01,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {59328#true} assume ~max3~0 == ~id3~0; {59328#true} is VALID
[2022-02-20 18:32:01,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {59328#true} assume 0 == ~st1~0; {59328#true} is VALID
[2022-02-20 18:32:01,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {59328#true} assume 0 == ~st2~0; {59328#true} is VALID
[2022-02-20 18:32:01,031 INFO L290 TraceCheckUtils]: 34: Hoare triple {59328#true} assume 0 == ~st3~0; {59328#true} is VALID
[2022-02-20 18:32:01,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {59328#true} assume 0 == ~nl1~0; {59328#true} is VALID
[2022-02-20 18:32:01,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {59328#true} assume 0 == ~nl2~0; {59328#true} is VALID
[2022-02-20 18:32:01,031 INFO L290 TraceCheckUtils]: 37: Hoare triple {59328#true} assume 0 == ~nl3~0; {59328#true} is VALID
[2022-02-20 18:32:01,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {59328#true} assume 0 == ~mode1~0 % 256; {59328#true} is VALID
[2022-02-20 18:32:01,032 INFO L290 TraceCheckUtils]: 39: Hoare triple {59328#true} assume 0 == ~mode2~0 % 256; {59328#true} is VALID
[2022-02-20 18:32:01,032 INFO L290 TraceCheckUtils]: 40: Hoare triple {59328#true} assume 0 == ~mode3~0 % 256; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,033 INFO L290 TraceCheckUtils]: 41: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax1~0 % 256; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,033 INFO L290 TraceCheckUtils]: 42: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax2~0 % 256; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,033 INFO L290 TraceCheckUtils]: 43: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,034 INFO L290 TraceCheckUtils]: 44: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,034 INFO L290 TraceCheckUtils]: 45: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,035 INFO L290 TraceCheckUtils]: 46: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,035 INFO L290 TraceCheckUtils]: 47: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,035 INFO L290 TraceCheckUtils]: 48: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,036 INFO L290 TraceCheckUtils]: 49: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,036 INFO L290 TraceCheckUtils]: 50: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 % 256 < 2; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,036 INFO L290 TraceCheckUtils]: 51: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep12~0 % 256); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,037 INFO L290 TraceCheckUtils]: 52: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep13~0 % 256); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,037 INFO L290 TraceCheckUtils]: 53: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,038 INFO L290 TraceCheckUtils]: 54: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,038 INFO L290 TraceCheckUtils]: 55: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,038 INFO L290 TraceCheckUtils]: 56: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 % 256 < 2; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,039 INFO L290 TraceCheckUtils]: 57: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep21~0 % 256); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,039 INFO L290 TraceCheckUtils]: 58: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep23~0 % 256); {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,039 INFO L290 TraceCheckUtils]: 59: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,040 INFO L290 TraceCheckUtils]: 60: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:32:01,040 INFO L290 TraceCheckUtils]: 61: Hoare triple {59330#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256; {59329#false} is VALID
[2022-02-20 18:32:01,040 INFO L290 TraceCheckUtils]: 62: Hoare triple {59329#false} assume !(255 == ~r3~0 % 256); {59329#false} is VALID
[2022-02-20 18:32:01,040 INFO L290 TraceCheckUtils]: 63: Hoare triple {59329#false} ~r3~0 := 1 + ~r3~0 % 256; {59329#false} is VALID
[2022-02-20 18:32:01,041 INFO L290 TraceCheckUtils]: 64: Hoare triple {59329#false} assume !(0 != ~ep13~0 % 256); {59329#false} is VALID
[2022-02-20 18:32:01,041 INFO L290 TraceCheckUtils]: 65: Hoare triple {59329#false} assume !(0 != ~ep23~0 % 256); {59329#false} is VALID
[2022-02-20 18:32:01,041 INFO L290 TraceCheckUtils]: 66: Hoare triple {59329#false} ~newmax3~0 := node3_~newmax~2#1; {59329#false} is VALID
[2022-02-20 18:32:01,041 INFO L290 TraceCheckUtils]: 67: Hoare triple {59329#false} assume 2 == ~r3~0 % 256; {59329#false} is VALID
[2022-02-20 18:32:01,041 INFO L290 TraceCheckUtils]: 68: Hoare triple {59329#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {59329#false} is VALID
[2022-02-20 18:32:01,041 INFO L290 TraceCheckUtils]: 69: Hoare triple {59329#false} ~mode3~0 := 0; {59329#false} is VALID
[2022-02-20 18:32:01,041 INFO L290 TraceCheckUtils]: 70: Hoare triple {59329#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {59329#false} is VALID
[2022-02-20 18:32:01,041 INFO L290 TraceCheckUtils]: 71: Hoare triple {59329#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {59329#false} is VALID
[2022-02-20 18:32:01,041 INFO L290 TraceCheckUtils]: 72: Hoare triple {59329#false} check_#res#1 := check_~tmp~1#1; {59329#false} is VALID
[2022-02-20 18:32:01,042 INFO L290 TraceCheckUtils]: 73: Hoare triple {59329#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {59329#false} is VALID
[2022-02-20 18:32:01,042 INFO L290 TraceCheckUtils]: 74: Hoare triple {59329#false} assume 0 == assert_~arg#1 % 256; {59329#false} is VALID
[2022-02-20 18:32:01,042 INFO L290 TraceCheckUtils]: 75: Hoare triple {59329#false} assume !false; {59329#false} is VALID
[2022-02-20 18:32:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:32:01,042 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:32:01,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730157339]
[2022-02-20 18:32:01,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730157339] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:32:01,043 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:32:01,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 18:32:01,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749834000]
[2022-02-20 18:32:01,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:32:01,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76
[2022-02-20 18:32:01,044 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:32:01,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:01,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:32:01,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 18:32:01,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:32:01,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 18:32:01,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:32:01,098 INFO L87 Difference]: Start difference. First operand 3412 states and 5501 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:05,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:32:05,121 INFO L93 Difference]: Finished difference Result 7762 states and 12522 transitions.
[2022-02-20 18:32:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-20 18:32:05,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76
[2022-02-20 18:32:05,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:32:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions.
[2022-02-20 18:32:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions.
[2022-02-20 18:32:05,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 470 transitions.
[2022-02-20 18:32:05,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:32:06,326 INFO L225 Difference]: With dead ends: 7762
[2022-02-20 18:32:06,326 INFO L226 Difference]: Without dead ends: 5340
[2022-02-20 18:32:06,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:32:06,330 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 110 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 18:32:06,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 443 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 18:32:06,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5340 states.
[2022-02-20 18:32:08,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5340 to 5338.
[2022-02-20 18:32:08,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:32:08,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5340 states. Second operand has 5338 states, 5337 states have (on average 1.6001498969458496) internal successors, (8540), 5337 states have internal predecessors, (8540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:08,029 INFO L74 IsIncluded]: Start isIncluded. First operand 5340 states. Second operand has 5338 states, 5337 states have (on average 1.6001498969458496) internal successors, (8540), 5337 states have internal predecessors, (8540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:08,034 INFO L87 Difference]: Start difference. First operand 5340 states. Second operand has 5338 states, 5337 states have (on average 1.6001498969458496) internal successors, (8540), 5337 states have internal predecessors, (8540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:32:08,730 INFO L93 Difference]: Finished difference Result 5340 states and 8541 transitions.
[2022-02-20 18:32:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 5340 states and 8541 transitions.
[2022-02-20 18:32:08,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:32:08,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:32:08,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 5338 states, 5337 states have (on average 1.6001498969458496) internal successors, (8540), 5337 states have internal predecessors, (8540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 5340 states.
[2022-02-20 18:32:08,769 INFO L87 Difference]: Start difference. First operand has 5338 states, 5337 states have (on average 1.6001498969458496) internal successors, (8540), 5337 states have internal predecessors, (8540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 5340 states.
[2022-02-20 18:32:09,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:32:09,484 INFO L93 Difference]: Finished difference Result 5340 states and 8541 transitions.
[2022-02-20 18:32:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 5340 states and 8541 transitions.
[2022-02-20 18:32:09,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:32:09,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:32:09,490 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 18:32:09,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 18:32:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5338 states, 5337 states have (on average 1.6001498969458496) internal successors, (8540), 5337 states have internal predecessors, (8540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:10,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5338 states to 5338 states and 8540 transitions.
[2022-02-20 18:32:10,325 INFO L78 Accepts]: Start accepts. Automaton has 5338 states and 8540 transitions. Word has length 76
[2022-02-20 18:32:10,325 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 18:32:10,325 INFO L470 AbstractCegarLoop]: Abstraction has 5338 states and 8540 transitions.
[2022-02-20 18:32:10,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 5338 states and 8540 transitions.
[2022-02-20 18:32:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2022-02-20 18:32:10,326 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:32:10,327 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:32:10,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-02-20 18:32:10,327 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:32:10,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:32:10,327 INFO L85 PathProgramCache]: Analyzing trace with hash -318395451, now seen corresponding path program 1 times
[2022-02-20 18:32:10,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:32:10,328 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029740918]
[2022-02-20 18:32:10,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:32:10,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:32:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:32:10,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {84591#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {84591#true} is VALID
[2022-02-20 18:32:10,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {84591#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {84591#true} is VALID
[2022-02-20 18:32:10,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {84591#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {84591#true} is VALID
[2022-02-20 18:32:10,359 INFO L290 TraceCheckUtils]: 3: Hoare triple {84591#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {84591#true} is VALID
[2022-02-20 18:32:10,359 INFO L290 TraceCheckUtils]: 4: Hoare triple {84591#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {84591#true} is VALID
[2022-02-20 18:32:10,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {84591#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {84591#true} is VALID
[2022-02-20 18:32:10,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {84591#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {84591#true} is VALID
[2022-02-20 18:32:10,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {84591#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {84591#true} is VALID
[2022-02-20 18:32:10,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {84591#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {84591#true} is VALID
[2022-02-20 18:32:10,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {84591#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {84591#true} is VALID
[2022-02-20 18:32:10,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {84591#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {84591#true} is VALID
[2022-02-20 18:32:10,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {84591#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {84591#true} is VALID
[2022-02-20 18:32:10,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {84591#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {84591#true} is VALID
[2022-02-20 18:32:10,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {84591#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {84591#true} is VALID
[2022-02-20 18:32:10,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {84591#true} assume ~id1~0 != ~id2~0; {84591#true} is VALID
[2022-02-20 18:32:10,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {84591#true} assume ~id1~0 != ~id3~0; {84591#true} is VALID
[2022-02-20 18:32:10,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {84591#true} assume ~id2~0 != ~id3~0; {84591#true} is VALID
[2022-02-20 18:32:10,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {84591#true} assume ~id1~0 >= 0; {84591#true} is VALID
[2022-02-20 18:32:10,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {84591#true} assume ~id2~0 >= 0; {84591#true} is VALID
[2022-02-20 18:32:10,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {84591#true} assume ~id3~0 >= 0; {84591#true} is VALID
[2022-02-20 18:32:10,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {84591#true} assume 0 == ~r1~0 % 256; {84591#true} is VALID
[2022-02-20 18:32:10,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {84591#true} assume 0 == ~r2~0 % 256; {84591#true} is VALID
[2022-02-20 18:32:10,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {84591#true} assume 0 == ~r3~0 % 256; {84591#true} is VALID
[2022-02-20 18:32:10,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {84591#true} assume 0 != init_~r122~0#1 % 256; {84591#true} is VALID
[2022-02-20 18:32:10,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {84591#true} assume 0 != init_~r132~0#1 % 256; {84591#true} is VALID
[2022-02-20 18:32:10,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {84591#true} assume 0 != init_~r212~0#1 % 256; {84591#true} is VALID
[2022-02-20 18:32:10,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {84591#true} assume 0 != init_~r232~0#1 % 256; {84591#true} is VALID
[2022-02-20 18:32:10,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {84591#true} assume 0 != init_~r312~0#1 % 256; {84591#true} is VALID
[2022-02-20 18:32:10,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {84591#true} assume 0 != init_~r322~0#1 % 256; {84591#true} is VALID
[2022-02-20 18:32:10,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {84591#true} assume ~max1~0 == ~id1~0; {84591#true} is VALID
[2022-02-20 18:32:10,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {84591#true} assume ~max2~0 == ~id2~0; {84591#true} is VALID
[2022-02-20 18:32:10,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {84591#true} assume ~max3~0 == ~id3~0; {84591#true} is VALID
[2022-02-20 18:32:10,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {84591#true} assume 0 == ~st1~0; {84591#true} is VALID
[2022-02-20 18:32:10,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {84591#true} assume 0 == ~st2~0; {84591#true} is VALID
[2022-02-20 18:32:10,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {84591#true} assume 0 == ~st3~0; {84591#true} is VALID
[2022-02-20 18:32:10,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {84591#true} assume 0 == ~nl1~0; {84591#true} is VALID
[2022-02-20 18:32:10,363 INFO L290 TraceCheckUtils]: 36: Hoare triple {84591#true} assume 0 == ~nl2~0; {84591#true} is VALID
[2022-02-20 18:32:10,363 INFO L290 TraceCheckUtils]: 37: Hoare triple {84591#true} assume 0 == ~nl3~0; {84591#true} is VALID
[2022-02-20 18:32:10,363 INFO L290 TraceCheckUtils]: 38: Hoare triple {84591#true} assume 0 == ~mode1~0 % 256; {84591#true} is VALID
[2022-02-20 18:32:10,363 INFO L290 TraceCheckUtils]: 39: Hoare triple {84591#true} assume 0 == ~mode2~0 % 256; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:32:10,364 INFO L290 TraceCheckUtils]: 40: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:32:10,364 INFO L290 TraceCheckUtils]: 41: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax1~0 % 256; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:32:10,364 INFO L290 TraceCheckUtils]: 42: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax2~0 % 256; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:32:10,365 INFO L290 TraceCheckUtils]: 43: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:32:10,365 INFO L290 TraceCheckUtils]: 44: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:32:10,365 INFO L290 TraceCheckUtils]: 45: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:32:10,366 INFO L290 TraceCheckUtils]: 46: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:32:10,366 INFO L290 TraceCheckUtils]: 47: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:32:10,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:32:10,367 INFO L290 TraceCheckUtils]: 49: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:32:10,367 INFO L290 TraceCheckUtils]: 50: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 % 256 < 2; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:32:10,367 INFO L290 TraceCheckUtils]: 51: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep12~0 % 256); {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:32:10,368 INFO L290 TraceCheckUtils]: 52: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep13~0 % 256); {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:32:10,368 INFO L290 TraceCheckUtils]: 53: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:32:10,368 INFO L290 TraceCheckUtils]: 54: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:32:10,369 INFO L290 TraceCheckUtils]: 55: Hoare triple {84593#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256; {84592#false} is VALID
[2022-02-20 18:32:10,369 INFO L290 TraceCheckUtils]: 56: Hoare triple {84592#false} assume !(255 == ~r2~0 % 256); {84592#false} is VALID
[2022-02-20 18:32:10,369 INFO L290 TraceCheckUtils]: 57: Hoare triple {84592#false} ~r2~0 := 1 + ~r2~0 % 256; {84592#false} is VALID
[2022-02-20 18:32:10,369 INFO L290 TraceCheckUtils]: 58: Hoare triple {84592#false} assume !(0 != ~ep12~0 % 256); {84592#false} is VALID
[2022-02-20 18:32:10,369 INFO L290 TraceCheckUtils]: 59: Hoare triple {84592#false} assume !(0 != ~ep32~0 % 256); {84592#false} is VALID
[2022-02-20 18:32:10,369 INFO L290 TraceCheckUtils]: 60: Hoare triple {84592#false} ~newmax2~0 := node2_~newmax~1#1; {84592#false} is VALID
[2022-02-20 18:32:10,369 INFO L290 TraceCheckUtils]: 61: Hoare triple {84592#false} assume 2 == ~r2~0 % 256; {84592#false} is VALID
[2022-02-20 18:32:10,369 INFO L290 TraceCheckUtils]: 62: Hoare triple {84592#false} assume ~max2~0 == ~id2~0;~st2~0 := 1; {84592#false} is VALID
[2022-02-20 18:32:10,370 INFO L290 TraceCheckUtils]: 63: Hoare triple {84592#false} ~mode2~0 := 0; {84592#false} is VALID
[2022-02-20 18:32:10,370 INFO L290 TraceCheckUtils]: 64: Hoare triple {84592#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {84592#false} is VALID
[2022-02-20 18:32:10,370 INFO L290 TraceCheckUtils]: 65: Hoare triple {84592#false} assume !(0 != ~mode3~0 % 256); {84592#false} is VALID
[2022-02-20 18:32:10,370 INFO L290 TraceCheckUtils]: 66: Hoare triple {84592#false} assume ~r3~0 % 256 < 2; {84592#false} is VALID
[2022-02-20 18:32:10,370 INFO L290 TraceCheckUtils]: 67: Hoare triple {84592#false} assume !(0 != ~ep31~0 % 256); {84592#false} is VALID
[2022-02-20 18:32:10,370 INFO L290 TraceCheckUtils]: 68: Hoare triple {84592#false} assume !(0 != ~ep32~0 % 256); {84592#false} is VALID
[2022-02-20 18:32:10,370 INFO L290 TraceCheckUtils]: 69: Hoare triple {84592#false} ~mode3~0 := 1; {84592#false} is VALID
[2022-02-20 18:32:10,370 INFO L290 TraceCheckUtils]: 70: Hoare triple {84592#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {84592#false} is VALID
[2022-02-20 18:32:10,370 INFO L290 TraceCheckUtils]: 71: Hoare triple {84592#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {84592#false} is VALID
[2022-02-20 18:32:10,370 INFO L290 TraceCheckUtils]: 72: Hoare triple {84592#false} check_#res#1 := check_~tmp~1#1; {84592#false} is VALID
[2022-02-20 18:32:10,371 INFO L290 TraceCheckUtils]: 73: Hoare triple {84592#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {84592#false} is VALID
[2022-02-20 18:32:10,371 INFO L290 TraceCheckUtils]: 74: Hoare triple {84592#false} assume 0 == assert_~arg#1 % 256; {84592#false} is VALID
[2022-02-20 18:32:10,371 INFO L290 TraceCheckUtils]: 75: Hoare triple {84592#false} assume !false; {84592#false} is VALID
[2022-02-20 18:32:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:32:10,371 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:32:10,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029740918]
[2022-02-20 18:32:10,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029740918] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:32:10,371 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:32:10,372 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 18:32:10,372 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189073161]
[2022-02-20 18:32:10,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:32:10,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76
[2022-02-20 18:32:10,372 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:32:10,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:10,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:32:10,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 18:32:10,425 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:32:10,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 18:32:10,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:32:10,426 INFO L87 Difference]: Start difference. First operand 5338 states and 8540 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:16,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:32:16,623 INFO L93 Difference]: Finished difference Result 11658 states and 18702 transitions.
[2022-02-20 18:32:16,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-20 18:32:16,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76
[2022-02-20 18:32:16,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:32:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions.
[2022-02-20 18:32:16,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions.
[2022-02-20 18:32:16,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 470 transitions.
[2022-02-20 18:32:16,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:32:18,829 INFO L225 Difference]: With dead ends: 11658
[2022-02-20 18:32:18,855 INFO L226 Difference]: Without dead ends: 7904
[2022-02-20 18:32:18,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:32:18,859 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 116 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 18:32:18,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 477 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 18:32:18,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7904 states.
[2022-02-20 18:32:21,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7904 to 7902.
[2022-02-20 18:32:21,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:32:21,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7904 states. Second operand has 7902 states, 7901 states have (on average 1.5919503860270852) internal successors, (12578), 7901 states have internal predecessors, (12578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:21,504 INFO L74 IsIncluded]: Start isIncluded. First operand 7904 states. Second operand has 7902 states, 7901 states have (on average 1.5919503860270852) internal successors, (12578), 7901 states have internal predecessors, (12578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:21,512 INFO L87 Difference]: Start difference. First operand 7904 states. Second operand has 7902 states, 7901 states have (on average 1.5919503860270852) internal successors, (12578), 7901 states have internal predecessors, (12578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:32:23,420 INFO L93 Difference]: Finished difference Result 7904 states and 12579 transitions.
[2022-02-20 18:32:23,420 INFO L276 IsEmpty]: Start isEmpty. Operand 7904 states and 12579 transitions.
[2022-02-20 18:32:23,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:32:23,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:32:23,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 7902 states, 7901 states have (on average 1.5919503860270852) internal successors, (12578), 7901 states have internal predecessors, (12578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 7904 states.
[2022-02-20 18:32:23,441 INFO L87 Difference]: Start difference. First operand has 7902 states, 7901 states have (on average 1.5919503860270852) internal successors, (12578), 7901 states have internal predecessors, (12578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 7904 states.
[2022-02-20 18:32:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:32:25,119 INFO L93 Difference]: Finished difference Result 7904 states and 12579 transitions.
[2022-02-20 18:32:25,119 INFO L276 IsEmpty]: Start isEmpty. Operand 7904 states and 12579 transitions.
[2022-02-20 18:32:25,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:32:25,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:32:25,127 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 18:32:25,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 18:32:25,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7902 states, 7901 states have (on average 1.5919503860270852) internal successors, (12578), 7901 states have internal predecessors, (12578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7902 states to 7902 states and 12578 transitions.
[2022-02-20 18:32:26,972 INFO L78 Accepts]: Start accepts. Automaton has 7902 states and 12578 transitions. Word has length 76
[2022-02-20 18:32:26,973 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 18:32:26,973 INFO L470 AbstractCegarLoop]: Abstraction has 7902 states and 12578 transitions.
[2022-02-20 18:32:26,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 7902 states and 12578 transitions.
[2022-02-20 18:32:26,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2022-02-20 18:32:26,973 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:32:26,974 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:32:26,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2022-02-20 18:32:26,974 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:32:26,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:32:26,974 INFO L85 PathProgramCache]: Analyzing trace with hash -116701437, now seen corresponding path program 1 times
[2022-02-20 18:32:26,974 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:32:26,975 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391624131]
[2022-02-20 18:32:26,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:32:26,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:32:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:32:27,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {122421#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {122421#true} is VALID
[2022-02-20 18:32:27,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {122421#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {122421#true} is VALID
[2022-02-20 18:32:27,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {122421#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {122421#true} is VALID
[2022-02-20 18:32:27,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {122421#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {122421#true} is VALID
[2022-02-20 18:32:27,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {122421#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {122421#true} is VALID
[2022-02-20 18:32:27,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {122421#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {122421#true} is VALID
[2022-02-20 18:32:27,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {122421#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {122421#true} is VALID
[2022-02-20 18:32:27,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {122421#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {122421#true} is VALID
[2022-02-20 18:32:27,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {122421#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {122421#true} is VALID
[2022-02-20 18:32:27,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {122421#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {122421#true} is VALID
[2022-02-20 18:32:27,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {122421#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {122421#true} is VALID
[2022-02-20 18:32:27,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {122421#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {122421#true} is VALID
[2022-02-20 18:32:27,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {122421#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {122421#true} is VALID
[2022-02-20 18:32:27,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {122421#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {122421#true} is VALID
[2022-02-20 18:32:27,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {122421#true} assume ~id1~0 != ~id2~0; {122421#true} is VALID
[2022-02-20 18:32:27,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {122421#true} assume ~id1~0 != ~id3~0; {122421#true} is VALID
[2022-02-20 18:32:27,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {122421#true} assume ~id2~0 != ~id3~0; {122421#true} is VALID
[2022-02-20 18:32:27,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {122421#true} assume ~id1~0 >= 0; {122421#true} is VALID
[2022-02-20 18:32:27,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {122421#true} assume ~id2~0 >= 0; {122421#true} is VALID
[2022-02-20 18:32:27,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {122421#true} assume ~id3~0 >= 0; {122421#true} is VALID
[2022-02-20 18:32:27,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {122421#true} assume 0 == ~r1~0 % 256; {122421#true} is VALID
[2022-02-20 18:32:27,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {122421#true} assume 0 == ~r2~0 % 256; {122421#true} is VALID
[2022-02-20 18:32:27,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {122421#true} assume 0 == ~r3~0 % 256; {122421#true} is VALID
[2022-02-20 18:32:27,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {122421#true} assume 0 != init_~r122~0#1 % 256; {122421#true} is VALID
[2022-02-20 18:32:27,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {122421#true} assume 0 != init_~r132~0#1 % 256; {122421#true} is VALID
[2022-02-20 18:32:27,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {122421#true} assume 0 != init_~r212~0#1 % 256; {122421#true} is VALID
[2022-02-20 18:32:27,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {122421#true} assume 0 != init_~r232~0#1 % 256; {122421#true} is VALID
[2022-02-20 18:32:27,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {122421#true} assume 0 != init_~r312~0#1 % 256; {122421#true} is VALID
[2022-02-20 18:32:27,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {122421#true} assume 0 != init_~r322~0#1 % 256; {122421#true} is VALID
[2022-02-20 18:32:27,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {122421#true} assume ~max1~0 == ~id1~0; {122421#true} is VALID
[2022-02-20 18:32:27,030 INFO L290 TraceCheckUtils]: 30: Hoare triple {122421#true} assume ~max2~0 == ~id2~0; {122421#true} is VALID
[2022-02-20 18:32:27,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {122421#true} assume ~max3~0 == ~id3~0; {122421#true} is VALID
[2022-02-20 18:32:27,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {122421#true} assume 0 == ~st1~0; {122421#true} is VALID
[2022-02-20 18:32:27,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {122421#true} assume 0 == ~st2~0; {122421#true} is VALID
[2022-02-20 18:32:27,031 INFO L290 TraceCheckUtils]: 34: Hoare triple {122421#true} assume 0 == ~st3~0; {122421#true} is VALID
[2022-02-20 18:32:27,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {122421#true} assume 0 == ~nl1~0; {122421#true} is VALID
[2022-02-20 18:32:27,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {122421#true} assume 0 == ~nl2~0; {122421#true} is VALID
[2022-02-20 18:32:27,031 INFO L290 TraceCheckUtils]: 37: Hoare triple {122421#true} assume 0 == ~nl3~0; {122421#true} is VALID
[2022-02-20 18:32:27,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {122421#true} assume 0 == ~mode1~0 % 256; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 18:32:27,032 INFO L290 TraceCheckUtils]: 39: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 18:32:27,032 INFO L290 TraceCheckUtils]: 40: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 18:32:27,033 INFO L290 TraceCheckUtils]: 41: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax1~0 % 256; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 18:32:27,033 INFO L290 TraceCheckUtils]: 42: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax2~0 % 256; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 18:32:27,033 INFO L290 TraceCheckUtils]: 43: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 18:32:27,034 INFO L290 TraceCheckUtils]: 44: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 18:32:27,034 INFO L290 TraceCheckUtils]: 45: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 18:32:27,034 INFO L290 TraceCheckUtils]: 46: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 18:32:27,035 INFO L290 TraceCheckUtils]: 47: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 18:32:27,035 INFO L290 TraceCheckUtils]: 48: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 18:32:27,036 INFO L290 TraceCheckUtils]: 49: Hoare triple {122423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {122422#false} is VALID
[2022-02-20 18:32:27,036 INFO L290 TraceCheckUtils]: 50: Hoare triple {122422#false} assume !(255 == ~r1~0 % 256); {122422#false} is VALID
[2022-02-20 18:32:27,036 INFO L290 TraceCheckUtils]: 51: Hoare triple {122422#false} ~r1~0 := 1 + ~r1~0 % 256; {122422#false} is VALID
[2022-02-20 18:32:27,036 INFO L290 TraceCheckUtils]: 52: Hoare triple {122422#false} assume !(0 != ~ep21~0 % 256); {122422#false} is VALID
[2022-02-20 18:32:27,036 INFO L290 TraceCheckUtils]: 53: Hoare triple {122422#false} assume !(0 != ~ep31~0 % 256); {122422#false} is VALID
[2022-02-20 18:32:27,036 INFO L290 TraceCheckUtils]: 54: Hoare triple {122422#false} ~newmax1~0 := node1_~newmax~0#1; {122422#false} is VALID
[2022-02-20 18:32:27,036 INFO L290 TraceCheckUtils]: 55: Hoare triple {122422#false} assume 2 == ~r1~0 % 256; {122422#false} is VALID
[2022-02-20 18:32:27,036 INFO L290 TraceCheckUtils]: 56: Hoare triple {122422#false} assume !(~max1~0 == ~id1~0);~st1~0 := 1; {122422#false} is VALID
[2022-02-20 18:32:27,037 INFO L290 TraceCheckUtils]: 57: Hoare triple {122422#false} ~mode1~0 := 0; {122422#false} is VALID
[2022-02-20 18:32:27,037 INFO L290 TraceCheckUtils]: 58: Hoare triple {122422#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {122422#false} is VALID
[2022-02-20 18:32:27,037 INFO L290 TraceCheckUtils]: 59: Hoare triple {122422#false} assume !(0 != ~mode2~0 % 256); {122422#false} is VALID
[2022-02-20 18:32:27,037 INFO L290 TraceCheckUtils]: 60: Hoare triple {122422#false} assume ~r2~0 % 256 < 2; {122422#false} is VALID
[2022-02-20 18:32:27,037 INFO L290 TraceCheckUtils]: 61: Hoare triple {122422#false} assume !(0 != ~ep21~0 % 256); {122422#false} is VALID
[2022-02-20 18:32:27,037 INFO L290 TraceCheckUtils]: 62: Hoare triple {122422#false} assume !(0 != ~ep23~0 % 256); {122422#false} is VALID
[2022-02-20 18:32:27,037 INFO L290 TraceCheckUtils]: 63: Hoare triple {122422#false} ~mode2~0 := 1; {122422#false} is VALID
[2022-02-20 18:32:27,037 INFO L290 TraceCheckUtils]: 64: Hoare triple {122422#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {122422#false} is VALID
[2022-02-20 18:32:27,037 INFO L290 TraceCheckUtils]: 65: Hoare triple {122422#false} assume !(0 != ~mode3~0 % 256); {122422#false} is VALID
[2022-02-20 18:32:27,037 INFO L290 TraceCheckUtils]: 66: Hoare triple {122422#false} assume ~r3~0 % 256 < 2; {122422#false} is VALID
[2022-02-20 18:32:27,038 INFO L290 TraceCheckUtils]: 67: Hoare triple {122422#false} assume !(0 != ~ep31~0 % 256); {122422#false} is VALID
[2022-02-20 18:32:27,038 INFO L290 TraceCheckUtils]: 68: Hoare triple {122422#false} assume !(0 != ~ep32~0 % 256); {122422#false} is VALID
[2022-02-20 18:32:27,038 INFO L290 TraceCheckUtils]: 69: Hoare triple {122422#false} ~mode3~0 := 1; {122422#false} is VALID
[2022-02-20 18:32:27,038 INFO L290 TraceCheckUtils]: 70: Hoare triple {122422#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {122422#false} is VALID
[2022-02-20 18:32:27,038 INFO L290 TraceCheckUtils]: 71: Hoare triple {122422#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {122422#false} is VALID
[2022-02-20 18:32:27,038 INFO L290 TraceCheckUtils]: 72: Hoare triple {122422#false} check_#res#1 := check_~tmp~1#1; {122422#false} is VALID
[2022-02-20 18:32:27,038 INFO L290 TraceCheckUtils]: 73: Hoare triple {122422#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {122422#false} is VALID
[2022-02-20 18:32:27,038 INFO L290 TraceCheckUtils]: 74: Hoare triple {122422#false} assume 0 == assert_~arg#1 % 256; {122422#false} is VALID
[2022-02-20 18:32:27,038 INFO L290 TraceCheckUtils]: 75: Hoare triple {122422#false} assume !false; {122422#false} is VALID
[2022-02-20 18:32:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:32:27,039 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:32:27,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391624131]
[2022-02-20 18:32:27,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391624131] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:32:27,039 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:32:27,039 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 18:32:27,039 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792054028]
[2022-02-20 18:32:27,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:32:27,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76
[2022-02-20 18:32:27,040 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:32:27,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:27,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:32:27,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 18:32:27,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:32:27,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 18:32:27,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:32:27,085 INFO L87 Difference]: Start difference. First operand 7902 states and 12578 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:39,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:32:39,290 INFO L93 Difference]: Finished difference Result 17511 states and 28108 transitions.
[2022-02-20 18:32:39,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-20 18:32:39,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76
[2022-02-20 18:32:39,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:32:39,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:39,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions.
[2022-02-20 18:32:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions.
[2022-02-20 18:32:39,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 470 transitions.
[2022-02-20 18:32:39,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:32:43,568 INFO L225 Difference]: With dead ends: 17511
[2022-02-20 18:32:43,568 INFO L226 Difference]: Without dead ends: 11763
[2022-02-20 18:32:43,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:32:43,573 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 122 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 18:32:43,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 503 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 18:32:43,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11763 states.
[2022-02-20 18:32:48,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11763 to 11761.
[2022-02-20 18:32:48,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:32:48,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11763 states. Second operand has 11761 states, 11760 states have (on average 1.5872448979591838) internal successors, (18666), 11760 states have internal predecessors, (18666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:48,643 INFO L74 IsIncluded]: Start isIncluded. First operand 11763 states. Second operand has 11761 states, 11760 states have (on average 1.5872448979591838) internal successors, (18666), 11760 states have internal predecessors, (18666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:48,656 INFO L87 Difference]: Start difference. First operand 11763 states. Second operand has 11761 states, 11760 states have (on average 1.5872448979591838) internal successors, (18666), 11760 states have internal predecessors, (18666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:32:52,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:32:52,309 INFO L93 Difference]: Finished difference Result 11763 states and 18667 transitions.
[2022-02-20 18:32:52,309 INFO L276 IsEmpty]: Start isEmpty. Operand 11763 states and 18667 transitions.
[2022-02-20 18:32:52,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:32:52,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:32:52,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 11761 states, 11760 states have (on average 1.5872448979591838) internal successors, (18666), 11760 states have internal predecessors, (18666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11763 states.
[2022-02-20 18:32:52,343 INFO L87 Difference]: Start difference. First operand has 11761 states, 11760 states have (on average 1.5872448979591838) internal successors, (18666), 11760 states have internal predecessors, (18666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11763 states.