./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label05.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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label05.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 724229db6d9b6e3f76c3763f8c47245763087e9314340a5d35172f234ffee2c5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:42:28,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:42:28,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:42:28,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:42:28,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:42:28,814 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:42:28,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:42:28,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:42:28,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:42:28,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:42:28,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:42:28,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:42:28,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:42:28,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:42:28,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:42:28,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:42:28,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:42:28,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:42:28,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:42:28,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:42:28,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:42:28,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:42:28,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:42:28,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:42:28,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:42:28,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:42:28,853 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:42:28,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:42:28,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:42:28,855 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:42:28,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:42:28,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:42:28,858 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:42:28,859 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:42:28,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:42:28,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:42:28,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:42:28,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:42:28,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:42:28,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:42:28,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:42:28,865 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:42:28,904 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:42:28,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:42:28,905 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:42:28,905 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:42:28,906 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:42:28,906 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:42:28,906 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:42:28,907 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:42:28,907 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:42:28,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:42:28,908 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:42:28,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:42:28,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:42:28,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:42:28,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:42:28,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:42:28,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:42:28,909 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:42:28,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:42:28,910 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:42:28,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:42:28,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:42:28,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:42:28,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:42:28,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:42:28,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:42:28,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:42:28,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:42:28,912 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:42:28,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:42:28,913 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:42:28,913 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:42:28,913 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:42:28,913 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 -> 724229db6d9b6e3f76c3763f8c47245763087e9314340a5d35172f234ffee2c5 [2022-02-20 19:42:29,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:42:29,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:42:29,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:42:29,193 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:42:29,194 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:42:29,195 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label05.c [2022-02-20 19:42:29,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93ee5abc5/c5b452498c0a4da78c78808b5eae863f/FLAGac73f09dc [2022-02-20 19:42:29,898 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:42:29,899 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label05.c [2022-02-20 19:42:29,930 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93ee5abc5/c5b452498c0a4da78c78808b5eae863f/FLAGac73f09dc [2022-02-20 19:42:30,228 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93ee5abc5/c5b452498c0a4da78c78808b5eae863f [2022-02-20 19:42:30,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:42:30,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:42:30,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:42:30,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:42:30,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:42:30,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:42:30" (1/1) ... [2022-02-20 19:42:30,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dbf25fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:30, skipping insertion in model container [2022-02-20 19:42:30,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:42:30" (1/1) ... [2022-02-20 19:42:30,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:42:30,342 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:42:30,609 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label05.c[8712,8725] [2022-02-20 19:42:30,662 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label05.c[15648,15661] [2022-02-20 19:42:31,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:42:31,508 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:42:31,550 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label05.c[8712,8725] [2022-02-20 19:42:31,561 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label05.c[15648,15661] [2022-02-20 19:42:31,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:42:32,017 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:42:32,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:32 WrapperNode [2022-02-20 19:42:32,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:42:32,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:42:32,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:42:32,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:42:32,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:32" (1/1) ... [2022-02-20 19:42:32,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:32" (1/1) ... [2022-02-20 19:42:32,487 INFO L137 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5031 [2022-02-20 19:42:32,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:42:32,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:42:32,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:42:32,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:42:32,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:32" (1/1) ... [2022-02-20 19:42:32,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:32" (1/1) ... [2022-02-20 19:42:32,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:32" (1/1) ... [2022-02-20 19:42:32,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:32" (1/1) ... [2022-02-20 19:42:32,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:32" (1/1) ... [2022-02-20 19:42:32,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:32" (1/1) ... [2022-02-20 19:42:32,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:32" (1/1) ... [2022-02-20 19:42:32,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:42:32,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:42:32,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:42:32,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:42:32,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:32" (1/1) ... [2022-02-20 19:42:32,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:42:32,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:42:33,017 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 19:42:33,041 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 19:42:33,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:42:33,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:42:33,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:42:33,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:42:33,182 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:42:33,183 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:42:41,154 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:42:41,176 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:42:41,177 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:42:41,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:42:41 BoogieIcfgContainer [2022-02-20 19:42:41,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:42:41,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:42:41,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:42:41,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:42:41,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:42:30" (1/3) ... [2022-02-20 19:42:41,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df53268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:42:41, skipping insertion in model container [2022-02-20 19:42:41,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:42:32" (2/3) ... [2022-02-20 19:42:41,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df53268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:42:41, skipping insertion in model container [2022-02-20 19:42:41,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:42:41" (3/3) ... [2022-02-20 19:42:41,187 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label05.c [2022-02-20 19:42:41,191 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:42:41,191 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:42:41,242 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:42:41,249 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 19:42:41,249 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:42:41,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 895 states, 892 states have (on average 1.9013452914798206) internal successors, (1696), 894 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:41,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:42:41,290 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:41,291 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] [2022-02-20 19:42:41,292 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:41,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:41,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2085104645, now seen corresponding path program 1 times [2022-02-20 19:42:41,303 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:41,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776200457] [2022-02-20 19:42:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:41,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:41,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {898#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {898#true} is VALID [2022-02-20 19:42:41,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {898#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {898#true} is VALID [2022-02-20 19:42:41,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {898#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {898#true} is VALID [2022-02-20 19:42:41,534 INFO L290 TraceCheckUtils]: 3: Hoare triple {898#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {898#true} is VALID [2022-02-20 19:42:41,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {898#true} init_#res#1 := init_~tmp~0#1; {898#true} is VALID [2022-02-20 19:42:41,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {898#true} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {898#true} is VALID [2022-02-20 19:42:41,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {898#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {899#false} is VALID [2022-02-20 19:42:41,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {899#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {899#false} is VALID [2022-02-20 19:42:41,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {899#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {899#false} is VALID [2022-02-20 19:42:41,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {899#false} assume !(0 != ~mode1~0 % 256); {899#false} is VALID [2022-02-20 19:42:41,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {899#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {899#false} is VALID [2022-02-20 19:42:41,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {899#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {899#false} is VALID [2022-02-20 19:42:41,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {899#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {899#false} is VALID [2022-02-20 19:42:41,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {899#false} assume !(0 != ~mode2~0 % 256); {899#false} is VALID [2022-02-20 19:42:41,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {899#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {899#false} is VALID [2022-02-20 19:42:41,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {899#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {899#false} is VALID [2022-02-20 19:42:41,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {899#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {899#false} is VALID [2022-02-20 19:42:41,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {899#false} assume !(0 != ~mode3~0 % 256); {899#false} is VALID [2022-02-20 19:42:41,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {899#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {899#false} is VALID [2022-02-20 19:42:41,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {899#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {899#false} is VALID [2022-02-20 19:42:41,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {899#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {899#false} is VALID [2022-02-20 19:42:41,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {899#false} assume !(0 != ~mode4~0 % 256); {899#false} is VALID [2022-02-20 19:42:41,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {899#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {899#false} is VALID [2022-02-20 19:42:41,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {899#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {899#false} is VALID [2022-02-20 19:42:41,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {899#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {899#false} is VALID [2022-02-20 19:42:41,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {899#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {899#false} is VALID [2022-02-20 19:42:41,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {899#false} check_#res#1 := check_~tmp~1#1; {899#false} is VALID [2022-02-20 19:42:41,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {899#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {899#false} is VALID [2022-02-20 19:42:41,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {899#false} assume 0 == assert_~arg#1 % 256; {899#false} is VALID [2022-02-20 19:42:41,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {899#false} assume !false; {899#false} is VALID [2022-02-20 19:42:41,550 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 19:42:41,551 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:41,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776200457] [2022-02-20 19:42:41,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776200457] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:41,552 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:41,552 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:42:41,555 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223312269] [2022-02-20 19:42:41,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:41,560 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:42:41,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:41,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:41,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:41,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:42:41,601 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:41,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:42:41,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:42:41,629 INFO L87 Difference]: Start difference. First operand has 895 states, 892 states have (on average 1.9013452914798206) internal successors, (1696), 894 states have internal predecessors, (1696), 0 states have call successors, (0), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:43,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:43,185 INFO L93 Difference]: Finished difference Result 1759 states and 3336 transitions. [2022-02-20 19:42:43,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:42:43,186 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:42:43,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:43,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3336 transitions. [2022-02-20 19:42:43,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3336 transitions. [2022-02-20 19:42:43,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3336 transitions. [2022-02-20 19:42:45,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3336 edges. 3336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:46,046 INFO L225 Difference]: With dead ends: 1759 [2022-02-20 19:42:46,046 INFO L226 Difference]: Without dead ends: 829 [2022-02-20 19:42:46,055 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 19:42:46,058 INFO L933 BasicCegarLoop]: 1627 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, 1627 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 19:42:46,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:46,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2022-02-20 19:42:46,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2022-02-20 19:42:46,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:46,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 829 states. Second operand has 829 states, 827 states have (on average 1.8899637243047158) internal successors, (1563), 828 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:46,140 INFO L74 IsIncluded]: Start isIncluded. First operand 829 states. Second operand has 829 states, 827 states have (on average 1.8899637243047158) internal successors, (1563), 828 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:46,142 INFO L87 Difference]: Start difference. First operand 829 states. Second operand has 829 states, 827 states have (on average 1.8899637243047158) internal successors, (1563), 828 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:46,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:46,182 INFO L93 Difference]: Finished difference Result 829 states and 1563 transitions. [2022-02-20 19:42:46,182 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1563 transitions. [2022-02-20 19:42:46,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:46,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:46,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 829 states, 827 states have (on average 1.8899637243047158) internal successors, (1563), 828 states have internal predecessors, (1563), 0 states have call successors, (0), 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 829 states. [2022-02-20 19:42:46,193 INFO L87 Difference]: Start difference. First operand has 829 states, 827 states have (on average 1.8899637243047158) internal successors, (1563), 828 states have internal predecessors, (1563), 0 states have call successors, (0), 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 829 states. [2022-02-20 19:42:46,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:46,233 INFO L93 Difference]: Finished difference Result 829 states and 1563 transitions. [2022-02-20 19:42:46,235 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1563 transitions. [2022-02-20 19:42:46,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:46,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:46,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:46,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:46,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 827 states have (on average 1.8899637243047158) internal successors, (1563), 828 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1563 transitions. [2022-02-20 19:42:46,283 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1563 transitions. Word has length 30 [2022-02-20 19:42:46,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:46,284 INFO L470 AbstractCegarLoop]: Abstraction has 829 states and 1563 transitions. [2022-02-20 19:42:46,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1563 transitions. [2022-02-20 19:42:46,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:42:46,285 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:46,285 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] [2022-02-20 19:42:46,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:42:46,286 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:46,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:46,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1951091139, now seen corresponding path program 1 times [2022-02-20 19:42:46,286 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:46,287 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070150313] [2022-02-20 19:42:46,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:46,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:46,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {5189#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {5189#true} is VALID [2022-02-20 19:42:46,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {5189#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {5189#true} is VALID [2022-02-20 19:42:46,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {5189#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5189#true} is VALID [2022-02-20 19:42:46,416 INFO L290 TraceCheckUtils]: 3: Hoare triple {5189#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5191#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:42:46,416 INFO L290 TraceCheckUtils]: 4: Hoare triple {5191#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5192#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:42:46,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {5192#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:42:46,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {5193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5190#false} is VALID [2022-02-20 19:42:46,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {5190#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5190#false} is VALID [2022-02-20 19:42:46,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {5190#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5190#false} is VALID [2022-02-20 19:42:46,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {5190#false} assume !(0 != ~mode1~0 % 256); {5190#false} is VALID [2022-02-20 19:42:46,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {5190#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {5190#false} is VALID [2022-02-20 19:42:46,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {5190#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {5190#false} is VALID [2022-02-20 19:42:46,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {5190#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5190#false} is VALID [2022-02-20 19:42:46,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {5190#false} assume !(0 != ~mode2~0 % 256); {5190#false} is VALID [2022-02-20 19:42:46,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {5190#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {5190#false} is VALID [2022-02-20 19:42:46,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {5190#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {5190#false} is VALID [2022-02-20 19:42:46,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {5190#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5190#false} is VALID [2022-02-20 19:42:46,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {5190#false} assume !(0 != ~mode3~0 % 256); {5190#false} is VALID [2022-02-20 19:42:46,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {5190#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {5190#false} is VALID [2022-02-20 19:42:46,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {5190#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {5190#false} is VALID [2022-02-20 19:42:46,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {5190#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5190#false} is VALID [2022-02-20 19:42:46,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {5190#false} assume !(0 != ~mode4~0 % 256); {5190#false} is VALID [2022-02-20 19:42:46,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {5190#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {5190#false} is VALID [2022-02-20 19:42:46,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {5190#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {5190#false} is VALID [2022-02-20 19:42:46,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {5190#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5190#false} is VALID [2022-02-20 19:42:46,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {5190#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {5190#false} is VALID [2022-02-20 19:42:46,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {5190#false} check_#res#1 := check_~tmp~1#1; {5190#false} is VALID [2022-02-20 19:42:46,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {5190#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5190#false} is VALID [2022-02-20 19:42:46,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {5190#false} assume 0 == assert_~arg#1 % 256; {5190#false} is VALID [2022-02-20 19:42:46,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {5190#false} assume !false; {5190#false} is VALID [2022-02-20 19:42:46,428 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 19:42:46,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:46,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070150313] [2022-02-20 19:42:46,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070150313] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:46,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:46,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:42:46,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483305479] [2022-02-20 19:42:46,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:46,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:42:46,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:46,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:46,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:46,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:42:46,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:46,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:42:46,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:42:46,456 INFO L87 Difference]: Start difference. First operand 829 states and 1563 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:50,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:50,458 INFO L93 Difference]: Finished difference Result 879 states and 1639 transitions. [2022-02-20 19:42:50,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:42:50,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:42:50,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:50,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1639 transitions. [2022-02-20 19:42:50,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1639 transitions. [2022-02-20 19:42:50,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1639 transitions. [2022-02-20 19:42:51,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1639 edges. 1639 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:51,856 INFO L225 Difference]: With dead ends: 879 [2022-02-20 19:42:51,856 INFO L226 Difference]: Without dead ends: 829 [2022-02-20 19:42:51,857 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 19:42:51,858 INFO L933 BasicCegarLoop]: 1561 mSDtfsCounter, 3 mSDsluCounter, 4657 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6218 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:42:51,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6218 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:51,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2022-02-20 19:42:51,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2022-02-20 19:42:51,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:51,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 829 states. Second operand has 829 states, 827 states have (on average 1.8621523579201935) internal successors, (1540), 828 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:51,877 INFO L74 IsIncluded]: Start isIncluded. First operand 829 states. Second operand has 829 states, 827 states have (on average 1.8621523579201935) internal successors, (1540), 828 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:51,879 INFO L87 Difference]: Start difference. First operand 829 states. Second operand has 829 states, 827 states have (on average 1.8621523579201935) internal successors, (1540), 828 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:51,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:51,913 INFO L93 Difference]: Finished difference Result 829 states and 1540 transitions. [2022-02-20 19:42:51,914 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1540 transitions. [2022-02-20 19:42:51,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:51,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:51,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 829 states, 827 states have (on average 1.8621523579201935) internal successors, (1540), 828 states have internal predecessors, (1540), 0 states have call successors, (0), 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 829 states. [2022-02-20 19:42:51,919 INFO L87 Difference]: Start difference. First operand has 829 states, 827 states have (on average 1.8621523579201935) internal successors, (1540), 828 states have internal predecessors, (1540), 0 states have call successors, (0), 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 829 states. [2022-02-20 19:42:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:51,958 INFO L93 Difference]: Finished difference Result 829 states and 1540 transitions. [2022-02-20 19:42:51,958 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1540 transitions. [2022-02-20 19:42:51,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:51,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:51,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:51,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:51,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 827 states have (on average 1.8621523579201935) internal successors, (1540), 828 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:52,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1540 transitions. [2022-02-20 19:42:52,001 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1540 transitions. Word has length 30 [2022-02-20 19:42:52,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:52,002 INFO L470 AbstractCegarLoop]: Abstraction has 829 states and 1540 transitions. [2022-02-20 19:42:52,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:52,002 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1540 transitions. [2022-02-20 19:42:52,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:42:52,003 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:52,004 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:42:52,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:42:52,004 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:52,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:52,005 INFO L85 PathProgramCache]: Analyzing trace with hash 568524862, now seen corresponding path program 1 times [2022-02-20 19:42:52,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:52,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813341656] [2022-02-20 19:42:52,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:52,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:52,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {8600#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8600#true} is VALID [2022-02-20 19:42:52,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {8600#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {8600#true} is VALID [2022-02-20 19:42:52,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {8600#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8600#true} is VALID [2022-02-20 19:42:52,177 INFO L290 TraceCheckUtils]: 3: Hoare triple {8600#true} assume 0 == ~r1~0 % 256; {8600#true} is VALID [2022-02-20 19:42:52,178 INFO L290 TraceCheckUtils]: 4: Hoare triple {8600#true} assume ~id1~0 >= 0; {8600#true} is VALID [2022-02-20 19:42:52,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {8600#true} assume 0 == ~st1~0; {8602#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:52,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {8602#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {8602#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:52,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {8602#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {8602#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:52,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {8602#(<= ~st1~0 0)} assume ~id2~0 >= 0; {8602#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:52,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {8602#(<= ~st1~0 0)} assume 0 == ~st2~0; {8603#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {8603#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {8603#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {8603#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {8603#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {8603#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {8603#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {8603#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {8604#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {8604#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {8604#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {8604#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {8604#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {8604#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {8604#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {8604#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,195 INFO L290 TraceCheckUtils]: 35: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,195 INFO L290 TraceCheckUtils]: 36: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,196 INFO L290 TraceCheckUtils]: 38: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,196 INFO L290 TraceCheckUtils]: 39: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,198 INFO L290 TraceCheckUtils]: 41: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,198 INFO L290 TraceCheckUtils]: 42: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,198 INFO L290 TraceCheckUtils]: 43: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,201 INFO L290 TraceCheckUtils]: 44: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,201 INFO L290 TraceCheckUtils]: 45: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,202 INFO L290 TraceCheckUtils]: 46: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:52,202 INFO L290 TraceCheckUtils]: 47: Hoare triple {8605#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {8601#false} is VALID [2022-02-20 19:42:52,204 INFO L290 TraceCheckUtils]: 48: Hoare triple {8601#false} check_#res#1 := check_~tmp~1#1; {8601#false} is VALID [2022-02-20 19:42:52,204 INFO L290 TraceCheckUtils]: 49: Hoare triple {8601#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {8601#false} is VALID [2022-02-20 19:42:52,204 INFO L290 TraceCheckUtils]: 50: Hoare triple {8601#false} assume 0 == assert_~arg#1 % 256; {8601#false} is VALID [2022-02-20 19:42:52,205 INFO L290 TraceCheckUtils]: 51: Hoare triple {8601#false} assume !false; {8601#false} is VALID [2022-02-20 19:42:52,206 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 19:42:52,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:52,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813341656] [2022-02-20 19:42:52,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813341656] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:52,208 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:52,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:42:52,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942315049] [2022-02-20 19:42:52,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:52,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:42:52,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:52,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:52,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:52,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:42:52,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:52,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:42:52,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:42:52,244 INFO L87 Difference]: Start difference. First operand 829 states and 1540 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:55,844 INFO L93 Difference]: Finished difference Result 1197 states and 2116 transitions. [2022-02-20 19:42:55,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 19:42:55,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:42:55,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:55,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:55,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2116 transitions. [2022-02-20 19:42:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2116 transitions. [2022-02-20 19:42:55,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 2116 transitions. [2022-02-20 19:42:57,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2116 edges. 2116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:57,780 INFO L225 Difference]: With dead ends: 1197 [2022-02-20 19:42:57,780 INFO L226 Difference]: Without dead ends: 1151 [2022-02-20 19:42:57,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:42:57,782 INFO L933 BasicCegarLoop]: 1534 mSDtfsCounter, 6574 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6574 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:42:57,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6574 Valid, 2078 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:42:57,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2022-02-20 19:42:57,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 873. [2022-02-20 19:42:57,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:57,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1151 states. Second operand has 873 states, 871 states have (on average 1.8473019517795637) internal successors, (1609), 872 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:57,825 INFO L74 IsIncluded]: Start isIncluded. First operand 1151 states. Second operand has 873 states, 871 states have (on average 1.8473019517795637) internal successors, (1609), 872 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:57,827 INFO L87 Difference]: Start difference. First operand 1151 states. Second operand has 873 states, 871 states have (on average 1.8473019517795637) internal successors, (1609), 872 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:57,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:57,891 INFO L93 Difference]: Finished difference Result 1151 states and 2036 transitions. [2022-02-20 19:42:57,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2036 transitions. [2022-02-20 19:42:57,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:57,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:57,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 873 states, 871 states have (on average 1.8473019517795637) internal successors, (1609), 872 states have internal predecessors, (1609), 0 states have call successors, (0), 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 1151 states. [2022-02-20 19:42:57,897 INFO L87 Difference]: Start difference. First operand has 873 states, 871 states have (on average 1.8473019517795637) internal successors, (1609), 872 states have internal predecessors, (1609), 0 states have call successors, (0), 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 1151 states. [2022-02-20 19:42:57,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:57,958 INFO L93 Difference]: Finished difference Result 1151 states and 2036 transitions. [2022-02-20 19:42:57,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2036 transitions. [2022-02-20 19:42:57,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:57,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:57,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:57,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 871 states have (on average 1.8473019517795637) internal successors, (1609), 872 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1609 transitions. [2022-02-20 19:42:58,003 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1609 transitions. Word has length 52 [2022-02-20 19:42:58,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:58,004 INFO L470 AbstractCegarLoop]: Abstraction has 873 states and 1609 transitions. [2022-02-20 19:42:58,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:58,005 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1609 transitions. [2022-02-20 19:42:58,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:42:58,007 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:58,007 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:42:58,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:42:58,007 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:58,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:58,008 INFO L85 PathProgramCache]: Analyzing trace with hash -524152242, now seen corresponding path program 1 times [2022-02-20 19:42:58,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:58,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338066681] [2022-02-20 19:42:58,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:58,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:58,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {13080#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {13080#true} is VALID [2022-02-20 19:42:58,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {13080#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {13080#true} is VALID [2022-02-20 19:42:58,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {13080#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {13080#true} is VALID [2022-02-20 19:42:58,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {13080#true} assume 0 == ~r1~0 % 256; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,117 INFO L290 TraceCheckUtils]: 4: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,131 INFO L290 TraceCheckUtils]: 34: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,131 INFO L290 TraceCheckUtils]: 35: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,132 INFO L290 TraceCheckUtils]: 36: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,132 INFO L290 TraceCheckUtils]: 37: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,132 INFO L290 TraceCheckUtils]: 38: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,133 INFO L290 TraceCheckUtils]: 39: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,133 INFO L290 TraceCheckUtils]: 40: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,133 INFO L290 TraceCheckUtils]: 41: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,134 INFO L290 TraceCheckUtils]: 42: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,134 INFO L290 TraceCheckUtils]: 43: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode4~0 % 256); {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,135 INFO L290 TraceCheckUtils]: 46: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,136 INFO L290 TraceCheckUtils]: 47: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:42:58,136 INFO L290 TraceCheckUtils]: 48: Hoare triple {13082#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 4; {13081#false} is VALID [2022-02-20 19:42:58,137 INFO L290 TraceCheckUtils]: 49: Hoare triple {13081#false} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {13081#false} is VALID [2022-02-20 19:42:58,137 INFO L290 TraceCheckUtils]: 50: Hoare triple {13081#false} check_#res#1 := check_~tmp~1#1; {13081#false} is VALID [2022-02-20 19:42:58,137 INFO L290 TraceCheckUtils]: 51: Hoare triple {13081#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {13081#false} is VALID [2022-02-20 19:42:58,137 INFO L290 TraceCheckUtils]: 52: Hoare triple {13081#false} assume 0 == assert_~arg#1 % 256; {13081#false} is VALID [2022-02-20 19:42:58,137 INFO L290 TraceCheckUtils]: 53: Hoare triple {13081#false} assume !false; {13081#false} is VALID [2022-02-20 19:42:58,138 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 19:42:58,139 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:58,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338066681] [2022-02-20 19:42:58,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338066681] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:58,139 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:58,140 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:42:58,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466224431] [2022-02-20 19:42:58,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:58,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 19:42:58,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:58,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:58,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:58,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:42:58,183 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:58,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:42:58,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:58,184 INFO L87 Difference]: Start difference. First operand 873 states and 1609 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:59,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:59,747 INFO L93 Difference]: Finished difference Result 1042 states and 1872 transitions. [2022-02-20 19:42:59,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:42:59,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 19:42:59,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2022-02-20 19:42:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2022-02-20 19:42:59,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1675 transitions. [2022-02-20 19:43:01,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1675 edges. 1675 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:01,290 INFO L225 Difference]: With dead ends: 1042 [2022-02-20 19:43:01,290 INFO L226 Difference]: Without dead ends: 952 [2022-02-20 19:43:01,291 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 19:43:01,292 INFO L933 BasicCegarLoop]: 1536 mSDtfsCounter, 1480 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:01,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1480 Valid, 1601 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:01,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2022-02-20 19:43:01,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 948. [2022-02-20 19:43:01,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:01,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 952 states. Second operand has 948 states, 946 states have (on average 1.8213530655391121) internal successors, (1723), 947 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:01,358 INFO L74 IsIncluded]: Start isIncluded. First operand 952 states. Second operand has 948 states, 946 states have (on average 1.8213530655391121) internal successors, (1723), 947 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:01,360 INFO L87 Difference]: Start difference. First operand 952 states. Second operand has 948 states, 946 states have (on average 1.8213530655391121) internal successors, (1723), 947 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:01,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:01,399 INFO L93 Difference]: Finished difference Result 952 states and 1726 transitions. [2022-02-20 19:43:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1726 transitions. [2022-02-20 19:43:01,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:01,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:01,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 948 states, 946 states have (on average 1.8213530655391121) internal successors, (1723), 947 states have internal predecessors, (1723), 0 states have call successors, (0), 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 952 states. [2022-02-20 19:43:01,405 INFO L87 Difference]: Start difference. First operand has 948 states, 946 states have (on average 1.8213530655391121) internal successors, (1723), 947 states have internal predecessors, (1723), 0 states have call successors, (0), 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 952 states. [2022-02-20 19:43:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:01,442 INFO L93 Difference]: Finished difference Result 952 states and 1726 transitions. [2022-02-20 19:43:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1726 transitions. [2022-02-20 19:43:01,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:01,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:01,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:01,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 946 states have (on average 1.8213530655391121) internal successors, (1723), 947 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:01,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1723 transitions. [2022-02-20 19:43:01,479 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1723 transitions. Word has length 54 [2022-02-20 19:43:01,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:01,479 INFO L470 AbstractCegarLoop]: Abstraction has 948 states and 1723 transitions. [2022-02-20 19:43:01,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:01,480 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1723 transitions. [2022-02-20 19:43:01,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:43:01,481 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:01,481 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:01,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:43:01,481 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:01,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:01,482 INFO L85 PathProgramCache]: Analyzing trace with hash -457658730, now seen corresponding path program 1 times [2022-02-20 19:43:01,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:01,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281346691] [2022-02-20 19:43:01,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:01,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:01,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {17059#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {17059#true} is VALID [2022-02-20 19:43:01,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {17059#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {17059#true} is VALID [2022-02-20 19:43:01,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {17059#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {17059#true} is VALID [2022-02-20 19:43:01,645 INFO L290 TraceCheckUtils]: 3: Hoare triple {17059#true} assume 0 == ~r1~0 % 256; {17059#true} is VALID [2022-02-20 19:43:01,645 INFO L290 TraceCheckUtils]: 4: Hoare triple {17059#true} assume ~id1~0 >= 0; {17059#true} is VALID [2022-02-20 19:43:01,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {17059#true} assume 0 == ~st1~0; {17061#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:43:01,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {17061#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~send1~0 == ~id1~0; {17061#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:43:01,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {17061#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~mode1~0 % 256; {17061#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:43:01,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {17061#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~id2~0 >= 0; {17061#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 19:43:01,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {17061#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~st2~0; {17062#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:43:01,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {17062#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {17062#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:43:01,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {17062#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {17062#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:43:01,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {17062#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {17062#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:43:01,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {17062#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {17063#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:43:01,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {17063#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {17063#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:43:01,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {17063#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {17063#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:43:01,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {17063#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {17063#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:43:01,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {17063#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 == ~id4~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 == ~mode4~0 % 256; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id2~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id3~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id4~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id3~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id4~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} init_#res#1 := init_~tmp~0#1; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == assume_abort_if_not_~cond#1); {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,664 INFO L290 TraceCheckUtils]: 30: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode1~0 % 256); {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,665 INFO L290 TraceCheckUtils]: 32: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,666 INFO L290 TraceCheckUtils]: 33: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,667 INFO L290 TraceCheckUtils]: 35: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode2~0 % 256); {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,667 INFO L290 TraceCheckUtils]: 36: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,671 INFO L290 TraceCheckUtils]: 37: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,672 INFO L290 TraceCheckUtils]: 39: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode3~0 % 256); {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,672 INFO L290 TraceCheckUtils]: 40: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,673 INFO L290 TraceCheckUtils]: 42: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,674 INFO L290 TraceCheckUtils]: 43: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode4~0 % 256); {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,674 INFO L290 TraceCheckUtils]: 44: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,675 INFO L290 TraceCheckUtils]: 45: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,675 INFO L290 TraceCheckUtils]: 46: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,676 INFO L290 TraceCheckUtils]: 47: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,676 INFO L290 TraceCheckUtils]: 48: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 % 256 >= 4); {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 19:43:01,677 INFO L290 TraceCheckUtils]: 49: Hoare triple {17064#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {17060#false} is VALID [2022-02-20 19:43:01,677 INFO L290 TraceCheckUtils]: 50: Hoare triple {17060#false} check_#res#1 := check_~tmp~1#1; {17060#false} is VALID [2022-02-20 19:43:01,677 INFO L290 TraceCheckUtils]: 51: Hoare triple {17060#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {17060#false} is VALID [2022-02-20 19:43:01,678 INFO L290 TraceCheckUtils]: 52: Hoare triple {17060#false} assume 0 == assert_~arg#1 % 256; {17060#false} is VALID [2022-02-20 19:43:01,678 INFO L290 TraceCheckUtils]: 53: Hoare triple {17060#false} assume !false; {17060#false} is VALID [2022-02-20 19:43:01,678 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 19:43:01,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:01,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281346691] [2022-02-20 19:43:01,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281346691] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:01,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:01,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:43:01,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490799566] [2022-02-20 19:43:01,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:01,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 19:43:01,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:01,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:01,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:01,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:43:01,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:01,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:43:01,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:43:01,730 INFO L87 Difference]: Start difference. First operand 948 states and 1723 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:05,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:05,099 INFO L93 Difference]: Finished difference Result 1115 states and 1979 transitions. [2022-02-20 19:43:05,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:43:05,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 19:43:05,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:05,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1682 transitions. [2022-02-20 19:43:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:05,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1682 transitions. [2022-02-20 19:43:05,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1682 transitions. [2022-02-20 19:43:06,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1682 edges. 1682 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:06,602 INFO L225 Difference]: With dead ends: 1115 [2022-02-20 19:43:06,602 INFO L226 Difference]: Without dead ends: 950 [2022-02-20 19:43:06,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:43:06,603 INFO L933 BasicCegarLoop]: 1540 mSDtfsCounter, 4563 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4563 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:43:06,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4563 Valid, 1747 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-02-20 19:43:06,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 948. [2022-02-20 19:43:06,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:06,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 950 states. Second operand has 948 states, 946 states have (on average 1.8192389006342495) internal successors, (1721), 947 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:06,678 INFO L74 IsIncluded]: Start isIncluded. First operand 950 states. Second operand has 948 states, 946 states have (on average 1.8192389006342495) internal successors, (1721), 947 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:06,679 INFO L87 Difference]: Start difference. First operand 950 states. Second operand has 948 states, 946 states have (on average 1.8192389006342495) internal successors, (1721), 947 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:06,718 INFO L93 Difference]: Finished difference Result 950 states and 1722 transitions. [2022-02-20 19:43:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1722 transitions. [2022-02-20 19:43:06,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:06,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:06,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 948 states, 946 states have (on average 1.8192389006342495) internal successors, (1721), 947 states have internal predecessors, (1721), 0 states have call successors, (0), 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 950 states. [2022-02-20 19:43:06,723 INFO L87 Difference]: Start difference. First operand has 948 states, 946 states have (on average 1.8192389006342495) internal successors, (1721), 947 states have internal predecessors, (1721), 0 states have call successors, (0), 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 950 states. [2022-02-20 19:43:06,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:06,764 INFO L93 Difference]: Finished difference Result 950 states and 1722 transitions. [2022-02-20 19:43:06,764 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1722 transitions. [2022-02-20 19:43:06,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:06,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:06,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:06,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 946 states have (on average 1.8192389006342495) internal successors, (1721), 947 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1721 transitions. [2022-02-20 19:43:06,803 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1721 transitions. Word has length 54 [2022-02-20 19:43:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:06,804 INFO L470 AbstractCegarLoop]: Abstraction has 948 states and 1721 transitions. [2022-02-20 19:43:06,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1721 transitions. [2022-02-20 19:43:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:43:06,805 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:06,805 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:06,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:43:06,805 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:06,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:06,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1331255346, now seen corresponding path program 1 times [2022-02-20 19:43:06,806 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:06,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339369344] [2022-02-20 19:43:06,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:06,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:06,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {21127#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {21127#true} is VALID [2022-02-20 19:43:06,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {21127#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {21127#true} is VALID [2022-02-20 19:43:06,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {21127#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {21127#true} is VALID [2022-02-20 19:43:06,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {21127#true} assume 0 == ~r1~0 % 256; {21127#true} is VALID [2022-02-20 19:43:06,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {21127#true} assume ~id1~0 >= 0; {21127#true} is VALID [2022-02-20 19:43:06,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {21127#true} assume 0 == ~st1~0; {21127#true} is VALID [2022-02-20 19:43:06,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {21127#true} assume ~send1~0 == ~id1~0; {21127#true} is VALID [2022-02-20 19:43:06,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {21127#true} assume 0 == ~mode1~0 % 256; {21127#true} is VALID [2022-02-20 19:43:06,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {21127#true} assume ~id2~0 >= 0; {21127#true} is VALID [2022-02-20 19:43:06,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {21127#true} assume 0 == ~st2~0; {21127#true} is VALID [2022-02-20 19:43:06,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {21127#true} assume ~send2~0 == ~id2~0; {21127#true} is VALID [2022-02-20 19:43:06,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {21127#true} assume 0 == ~mode2~0 % 256; {21127#true} is VALID [2022-02-20 19:43:06,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {21127#true} assume ~id3~0 >= 0; {21127#true} is VALID [2022-02-20 19:43:06,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {21127#true} assume 0 == ~st3~0; {21127#true} is VALID [2022-02-20 19:43:06,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {21127#true} assume ~send3~0 == ~id3~0; {21127#true} is VALID [2022-02-20 19:43:06,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {21127#true} assume 0 == ~mode3~0 % 256; {21127#true} is VALID [2022-02-20 19:43:06,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {21127#true} assume ~id4~0 >= 0; {21127#true} is VALID [2022-02-20 19:43:06,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {21127#true} assume 0 == ~st4~0; {21127#true} is VALID [2022-02-20 19:43:06,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {21127#true} assume ~send4~0 == ~id4~0; {21127#true} is VALID [2022-02-20 19:43:06,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {21127#true} assume 0 == ~mode4~0 % 256; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,908 INFO L290 TraceCheckUtils]: 32: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,913 INFO L290 TraceCheckUtils]: 37: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,914 INFO L290 TraceCheckUtils]: 38: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:43:06,916 INFO L290 TraceCheckUtils]: 43: Hoare triple {21129#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {21128#false} is VALID [2022-02-20 19:43:06,917 INFO L290 TraceCheckUtils]: 44: Hoare triple {21128#false} assume node4_~m4~0#1 != ~nomsg~0; {21128#false} is VALID [2022-02-20 19:43:06,917 INFO L290 TraceCheckUtils]: 45: Hoare triple {21128#false} assume !(node4_~m4~0#1 > ~id4~0); {21128#false} is VALID [2022-02-20 19:43:06,917 INFO L290 TraceCheckUtils]: 46: Hoare triple {21128#false} assume node4_~m4~0#1 == ~id4~0;~st4~0 := 1; {21128#false} is VALID [2022-02-20 19:43:06,917 INFO L290 TraceCheckUtils]: 47: Hoare triple {21128#false} ~mode4~0 := 0; {21128#false} is VALID [2022-02-20 19:43:06,917 INFO L290 TraceCheckUtils]: 48: Hoare triple {21128#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {21128#false} is VALID [2022-02-20 19:43:06,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {21128#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {21128#false} is VALID [2022-02-20 19:43:06,918 INFO L290 TraceCheckUtils]: 50: Hoare triple {21128#false} check_#res#1 := check_~tmp~1#1; {21128#false} is VALID [2022-02-20 19:43:06,918 INFO L290 TraceCheckUtils]: 51: Hoare triple {21128#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {21128#false} is VALID [2022-02-20 19:43:06,918 INFO L290 TraceCheckUtils]: 52: Hoare triple {21128#false} assume 0 == assert_~arg#1 % 256; {21128#false} is VALID [2022-02-20 19:43:06,919 INFO L290 TraceCheckUtils]: 53: Hoare triple {21128#false} assume !false; {21128#false} is VALID [2022-02-20 19:43:06,921 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 19:43:06,921 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:06,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339369344] [2022-02-20 19:43:06,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339369344] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:06,921 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:06,922 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:06,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103890955] [2022-02-20 19:43:06,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:06,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 19:43:06,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:06,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:06,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:06,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:06,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:06,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:06,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:06,967 INFO L87 Difference]: Start difference. First operand 948 states and 1721 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:08,730 INFO L93 Difference]: Finished difference Result 1254 states and 2187 transitions. [2022-02-20 19:43:08,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:08,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 19:43:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:08,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:08,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1674 transitions. [2022-02-20 19:43:10,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1674 edges. 1674 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:10,239 INFO L225 Difference]: With dead ends: 1254 [2022-02-20 19:43:10,240 INFO L226 Difference]: Without dead ends: 1089 [2022-02-20 19:43:10,240 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 19:43:10,241 INFO L933 BasicCegarLoop]: 1557 mSDtfsCounter, 1489 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 1639 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 19:43:10,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1489 Valid, 1639 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2022-02-20 19:43:10,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1087. [2022-02-20 19:43:10,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:10,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1089 states. Second operand has 1087 states, 1085 states have (on average 1.7778801843317973) internal successors, (1929), 1086 states have internal predecessors, (1929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:10,356 INFO L74 IsIncluded]: Start isIncluded. First operand 1089 states. Second operand has 1087 states, 1085 states have (on average 1.7778801843317973) internal successors, (1929), 1086 states have internal predecessors, (1929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:10,357 INFO L87 Difference]: Start difference. First operand 1089 states. Second operand has 1087 states, 1085 states have (on average 1.7778801843317973) internal successors, (1929), 1086 states have internal predecessors, (1929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:10,407 INFO L93 Difference]: Finished difference Result 1089 states and 1930 transitions. [2022-02-20 19:43:10,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1930 transitions. [2022-02-20 19:43:10,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:10,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:10,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 1087 states, 1085 states have (on average 1.7778801843317973) internal successors, (1929), 1086 states have internal predecessors, (1929), 0 states have call successors, (0), 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 1089 states. [2022-02-20 19:43:10,413 INFO L87 Difference]: Start difference. First operand has 1087 states, 1085 states have (on average 1.7778801843317973) internal successors, (1929), 1086 states have internal predecessors, (1929), 0 states have call successors, (0), 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 1089 states. [2022-02-20 19:43:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:10,465 INFO L93 Difference]: Finished difference Result 1089 states and 1930 transitions. [2022-02-20 19:43:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1930 transitions. [2022-02-20 19:43:10,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:10,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:10,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:10,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:10,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1085 states have (on average 1.7778801843317973) internal successors, (1929), 1086 states have internal predecessors, (1929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1929 transitions. [2022-02-20 19:43:10,526 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1929 transitions. Word has length 54 [2022-02-20 19:43:10,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:10,526 INFO L470 AbstractCegarLoop]: Abstraction has 1087 states and 1929 transitions. [2022-02-20 19:43:10,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:10,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1929 transitions. [2022-02-20 19:43:10,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:43:10,528 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:10,528 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:10,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:43:10,528 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:10,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:10,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1716204334, now seen corresponding path program 1 times [2022-02-20 19:43:10,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:10,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314460250] [2022-02-20 19:43:10,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:10,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:10,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {25798#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {25798#true} is VALID [2022-02-20 19:43:10,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {25798#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {25798#true} is VALID [2022-02-20 19:43:10,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {25798#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {25798#true} is VALID [2022-02-20 19:43:10,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {25798#true} assume 0 == ~r1~0 % 256; {25798#true} is VALID [2022-02-20 19:43:10,585 INFO L290 TraceCheckUtils]: 4: Hoare triple {25798#true} assume ~id1~0 >= 0; {25798#true} is VALID [2022-02-20 19:43:10,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {25798#true} assume 0 == ~st1~0; {25798#true} is VALID [2022-02-20 19:43:10,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {25798#true} assume ~send1~0 == ~id1~0; {25798#true} is VALID [2022-02-20 19:43:10,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {25798#true} assume 0 == ~mode1~0 % 256; {25798#true} is VALID [2022-02-20 19:43:10,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {25798#true} assume ~id2~0 >= 0; {25798#true} is VALID [2022-02-20 19:43:10,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {25798#true} assume 0 == ~st2~0; {25798#true} is VALID [2022-02-20 19:43:10,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {25798#true} assume ~send2~0 == ~id2~0; {25798#true} is VALID [2022-02-20 19:43:10,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {25798#true} assume 0 == ~mode2~0 % 256; {25798#true} is VALID [2022-02-20 19:43:10,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {25798#true} assume ~id3~0 >= 0; {25798#true} is VALID [2022-02-20 19:43:10,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {25798#true} assume 0 == ~st3~0; {25798#true} is VALID [2022-02-20 19:43:10,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {25798#true} assume ~send3~0 == ~id3~0; {25798#true} is VALID [2022-02-20 19:43:10,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {25798#true} assume 0 == ~mode3~0 % 256; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:43:10,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {25800#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {25799#false} is VALID [2022-02-20 19:43:10,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {25799#false} assume node3_~m3~0#1 != ~nomsg~0; {25799#false} is VALID [2022-02-20 19:43:10,601 INFO L290 TraceCheckUtils]: 41: Hoare triple {25799#false} assume !(node3_~m3~0#1 > ~id3~0); {25799#false} is VALID [2022-02-20 19:43:10,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {25799#false} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {25799#false} is VALID [2022-02-20 19:43:10,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {25799#false} ~mode3~0 := 0; {25799#false} is VALID [2022-02-20 19:43:10,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {25799#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {25799#false} is VALID [2022-02-20 19:43:10,602 INFO L290 TraceCheckUtils]: 45: Hoare triple {25799#false} assume !(0 != ~mode4~0 % 256); {25799#false} is VALID [2022-02-20 19:43:10,602 INFO L290 TraceCheckUtils]: 46: Hoare triple {25799#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {25799#false} is VALID [2022-02-20 19:43:10,602 INFO L290 TraceCheckUtils]: 47: Hoare triple {25799#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {25799#false} is VALID [2022-02-20 19:43:10,603 INFO L290 TraceCheckUtils]: 48: Hoare triple {25799#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {25799#false} is VALID [2022-02-20 19:43:10,603 INFO L290 TraceCheckUtils]: 49: Hoare triple {25799#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {25799#false} is VALID [2022-02-20 19:43:10,603 INFO L290 TraceCheckUtils]: 50: Hoare triple {25799#false} check_#res#1 := check_~tmp~1#1; {25799#false} is VALID [2022-02-20 19:43:10,603 INFO L290 TraceCheckUtils]: 51: Hoare triple {25799#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {25799#false} is VALID [2022-02-20 19:43:10,603 INFO L290 TraceCheckUtils]: 52: Hoare triple {25799#false} assume 0 == assert_~arg#1 % 256; {25799#false} is VALID [2022-02-20 19:43:10,603 INFO L290 TraceCheckUtils]: 53: Hoare triple {25799#false} assume !false; {25799#false} is VALID [2022-02-20 19:43:10,604 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 19:43:10,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:10,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314460250] [2022-02-20 19:43:10,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314460250] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:10,604 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:10,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:10,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442605098] [2022-02-20 19:43:10,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:10,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 19:43:10,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:10,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:10,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:10,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:10,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:10,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:10,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:10,645 INFO L87 Difference]: Start difference. First operand 1087 states and 1929 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:12,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:12,566 INFO L93 Difference]: Finished difference Result 1647 states and 2771 transitions. [2022-02-20 19:43:12,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:12,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 19:43:12,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:12,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:12,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1674 transitions. [2022-02-20 19:43:13,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1674 edges. 1674 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:14,028 INFO L225 Difference]: With dead ends: 1647 [2022-02-20 19:43:14,028 INFO L226 Difference]: Without dead ends: 1343 [2022-02-20 19:43:14,029 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 19:43:14,029 INFO L933 BasicCegarLoop]: 1570 mSDtfsCounter, 1493 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1648 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 19:43:14,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1493 Valid, 1648 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:14,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-02-20 19:43:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1341. [2022-02-20 19:43:14,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:14,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1343 states. Second operand has 1341 states, 1339 states have (on average 1.7184466019417475) internal successors, (2301), 1340 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:14,237 INFO L74 IsIncluded]: Start isIncluded. First operand 1343 states. Second operand has 1341 states, 1339 states have (on average 1.7184466019417475) internal successors, (2301), 1340 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:14,239 INFO L87 Difference]: Start difference. First operand 1343 states. Second operand has 1341 states, 1339 states have (on average 1.7184466019417475) internal successors, (2301), 1340 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:14,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:14,311 INFO L93 Difference]: Finished difference Result 1343 states and 2302 transitions. [2022-02-20 19:43:14,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 2302 transitions. [2022-02-20 19:43:14,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:14,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:14,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 1341 states, 1339 states have (on average 1.7184466019417475) internal successors, (2301), 1340 states have internal predecessors, (2301), 0 states have call successors, (0), 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 1343 states. [2022-02-20 19:43:14,317 INFO L87 Difference]: Start difference. First operand has 1341 states, 1339 states have (on average 1.7184466019417475) internal successors, (2301), 1340 states have internal predecessors, (2301), 0 states have call successors, (0), 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 1343 states. [2022-02-20 19:43:14,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:14,380 INFO L93 Difference]: Finished difference Result 1343 states and 2302 transitions. [2022-02-20 19:43:14,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 2302 transitions. [2022-02-20 19:43:14,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:14,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:14,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:14,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1339 states have (on average 1.7184466019417475) internal successors, (2301), 1340 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 2301 transitions. [2022-02-20 19:43:14,445 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 2301 transitions. Word has length 54 [2022-02-20 19:43:14,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:14,445 INFO L470 AbstractCegarLoop]: Abstraction has 1341 states and 2301 transitions. [2022-02-20 19:43:14,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 2301 transitions. [2022-02-20 19:43:14,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:43:14,445 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:14,446 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:43:14,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:43:14,446 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:14,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:14,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1442516622, now seen corresponding path program 1 times [2022-02-20 19:43:14,447 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:14,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214503388] [2022-02-20 19:43:14,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:14,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:14,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {31759#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {31759#true} is VALID [2022-02-20 19:43:14,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {31759#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {31759#true} is VALID [2022-02-20 19:43:14,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {31759#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {31759#true} is VALID [2022-02-20 19:43:14,494 INFO L290 TraceCheckUtils]: 3: Hoare triple {31759#true} assume 0 == ~r1~0 % 256; {31759#true} is VALID [2022-02-20 19:43:14,495 INFO L290 TraceCheckUtils]: 4: Hoare triple {31759#true} assume ~id1~0 >= 0; {31759#true} is VALID [2022-02-20 19:43:14,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {31759#true} assume 0 == ~st1~0; {31759#true} is VALID [2022-02-20 19:43:14,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {31759#true} assume ~send1~0 == ~id1~0; {31759#true} is VALID [2022-02-20 19:43:14,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {31759#true} assume 0 == ~mode1~0 % 256; {31759#true} is VALID [2022-02-20 19:43:14,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {31759#true} assume ~id2~0 >= 0; {31759#true} is VALID [2022-02-20 19:43:14,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {31759#true} assume 0 == ~st2~0; {31759#true} is VALID [2022-02-20 19:43:14,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {31759#true} assume ~send2~0 == ~id2~0; {31759#true} is VALID [2022-02-20 19:43:14,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {31759#true} assume 0 == ~mode2~0 % 256; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,505 INFO L290 TraceCheckUtils]: 26: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,505 INFO L290 TraceCheckUtils]: 27: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,506 INFO L290 TraceCheckUtils]: 28: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,508 INFO L290 TraceCheckUtils]: 34: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:43:14,509 INFO L290 TraceCheckUtils]: 35: Hoare triple {31761#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {31760#false} is VALID [2022-02-20 19:43:14,509 INFO L290 TraceCheckUtils]: 36: Hoare triple {31760#false} assume node2_~m2~0#1 != ~nomsg~0; {31760#false} is VALID [2022-02-20 19:43:14,509 INFO L290 TraceCheckUtils]: 37: Hoare triple {31760#false} assume !(node2_~m2~0#1 > ~id2~0); {31760#false} is VALID [2022-02-20 19:43:14,510 INFO L290 TraceCheckUtils]: 38: Hoare triple {31760#false} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {31760#false} is VALID [2022-02-20 19:43:14,510 INFO L290 TraceCheckUtils]: 39: Hoare triple {31760#false} ~mode2~0 := 0; {31760#false} is VALID [2022-02-20 19:43:14,510 INFO L290 TraceCheckUtils]: 40: Hoare triple {31760#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {31760#false} is VALID [2022-02-20 19:43:14,510 INFO L290 TraceCheckUtils]: 41: Hoare triple {31760#false} assume !(0 != ~mode3~0 % 256); {31760#false} is VALID [2022-02-20 19:43:14,510 INFO L290 TraceCheckUtils]: 42: Hoare triple {31760#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {31760#false} is VALID [2022-02-20 19:43:14,510 INFO L290 TraceCheckUtils]: 43: Hoare triple {31760#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {31760#false} is VALID [2022-02-20 19:43:14,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {31760#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {31760#false} is VALID [2022-02-20 19:43:14,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {31760#false} assume !(0 != ~mode4~0 % 256); {31760#false} is VALID [2022-02-20 19:43:14,511 INFO L290 TraceCheckUtils]: 46: Hoare triple {31760#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {31760#false} is VALID [2022-02-20 19:43:14,511 INFO L290 TraceCheckUtils]: 47: Hoare triple {31760#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {31760#false} is VALID [2022-02-20 19:43:14,511 INFO L290 TraceCheckUtils]: 48: Hoare triple {31760#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {31760#false} is VALID [2022-02-20 19:43:14,511 INFO L290 TraceCheckUtils]: 49: Hoare triple {31760#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {31760#false} is VALID [2022-02-20 19:43:14,511 INFO L290 TraceCheckUtils]: 50: Hoare triple {31760#false} check_#res#1 := check_~tmp~1#1; {31760#false} is VALID [2022-02-20 19:43:14,512 INFO L290 TraceCheckUtils]: 51: Hoare triple {31760#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {31760#false} is VALID [2022-02-20 19:43:14,512 INFO L290 TraceCheckUtils]: 52: Hoare triple {31760#false} assume 0 == assert_~arg#1 % 256; {31760#false} is VALID [2022-02-20 19:43:14,512 INFO L290 TraceCheckUtils]: 53: Hoare triple {31760#false} assume !false; {31760#false} is VALID [2022-02-20 19:43:14,512 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 19:43:14,512 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:14,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214503388] [2022-02-20 19:43:14,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214503388] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:14,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:14,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:43:14,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898254985] [2022-02-20 19:43:14,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:14,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 19:43:14,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:14,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:14,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:14,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:43:14,552 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:14,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:43:14,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:43:14,553 INFO L87 Difference]: Start difference. First operand 1341 states and 2301 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:16,727 INFO L93 Difference]: Finished difference Result 2361 states and 3807 transitions. [2022-02-20 19:43:16,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:43:16,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 19:43:16,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:43:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:16,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2022-02-20 19:43:16,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1674 transitions. [2022-02-20 19:43:18,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1674 edges. 1674 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:18,246 INFO L225 Difference]: With dead ends: 2361 [2022-02-20 19:43:18,247 INFO L226 Difference]: Without dead ends: 1803 [2022-02-20 19:43:18,248 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 19:43:18,248 INFO L933 BasicCegarLoop]: 1583 mSDtfsCounter, 1497 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1657 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 19:43:18,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1497 Valid, 1657 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:43:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2022-02-20 19:43:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1801. [2022-02-20 19:43:18,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:43:18,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1803 states. Second operand has 1801 states, 1799 states have (on average 1.6436909394107837) internal successors, (2957), 1800 states have internal predecessors, (2957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:18,643 INFO L74 IsIncluded]: Start isIncluded. First operand 1803 states. Second operand has 1801 states, 1799 states have (on average 1.6436909394107837) internal successors, (2957), 1800 states have internal predecessors, (2957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:18,647 INFO L87 Difference]: Start difference. First operand 1803 states. Second operand has 1801 states, 1799 states have (on average 1.6436909394107837) internal successors, (2957), 1800 states have internal predecessors, (2957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:18,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:18,782 INFO L93 Difference]: Finished difference Result 1803 states and 2958 transitions. [2022-02-20 19:43:18,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2958 transitions. [2022-02-20 19:43:18,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:18,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:18,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 1801 states, 1799 states have (on average 1.6436909394107837) internal successors, (2957), 1800 states have internal predecessors, (2957), 0 states have call successors, (0), 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 1803 states. [2022-02-20 19:43:18,788 INFO L87 Difference]: Start difference. First operand has 1801 states, 1799 states have (on average 1.6436909394107837) internal successors, (2957), 1800 states have internal predecessors, (2957), 0 states have call successors, (0), 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 1803 states. [2022-02-20 19:43:18,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:43:18,880 INFO L93 Difference]: Finished difference Result 1803 states and 2958 transitions. [2022-02-20 19:43:18,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2958 transitions. [2022-02-20 19:43:18,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:43:18,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:43:18,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:43:18,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:43:18,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1799 states have (on average 1.6436909394107837) internal successors, (2957), 1800 states have internal predecessors, (2957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2957 transitions. [2022-02-20 19:43:19,014 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2957 transitions. Word has length 54 [2022-02-20 19:43:19,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:43:19,014 INFO L470 AbstractCegarLoop]: Abstraction has 1801 states and 2957 transitions. [2022-02-20 19:43:19,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2957 transitions. [2022-02-20 19:43:19,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 19:43:19,015 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:43:19,015 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] [2022-02-20 19:43:19,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:43:19,015 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:43:19,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:43:19,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1717241860, now seen corresponding path program 1 times [2022-02-20 19:43:19,015 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:43:19,015 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504212489] [2022-02-20 19:43:19,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:43:19,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:43:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:43:19,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {40084#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {40084#true} is VALID [2022-02-20 19:43:19,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {40084#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {40084#true} is VALID [2022-02-20 19:43:19,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {40084#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {40084#true} is VALID [2022-02-20 19:43:19,109 INFO L290 TraceCheckUtils]: 3: Hoare triple {40084#true} assume 0 == ~r1~0 % 256; {40084#true} is VALID [2022-02-20 19:43:19,109 INFO L290 TraceCheckUtils]: 4: Hoare triple {40084#true} assume ~id1~0 >= 0; {40084#true} is VALID [2022-02-20 19:43:19,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {40084#true} assume 0 == ~st1~0; {40084#true} is VALID [2022-02-20 19:43:19,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {40084#true} assume ~send1~0 == ~id1~0; {40084#true} is VALID [2022-02-20 19:43:19,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {40084#true} assume 0 == ~mode1~0 % 256; {40084#true} is VALID [2022-02-20 19:43:19,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {40084#true} assume ~id2~0 >= 0; {40084#true} is VALID [2022-02-20 19:43:19,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {40084#true} assume 0 == ~st2~0; {40084#true} is VALID [2022-02-20 19:43:19,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {40084#true} assume ~send2~0 == ~id2~0; {40084#true} is VALID [2022-02-20 19:43:19,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {40084#true} assume 0 == ~mode2~0 % 256; {40084#true} is VALID [2022-02-20 19:43:19,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {40084#true} assume ~id3~0 >= 0; {40084#true} is VALID [2022-02-20 19:43:19,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {40084#true} assume 0 == ~st3~0; {40084#true} is VALID [2022-02-20 19:43:19,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {40084#true} assume ~send3~0 == ~id3~0; {40084#true} is VALID [2022-02-20 19:43:19,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {40084#true} assume 0 == ~mode3~0 % 256; {40084#true} is VALID [2022-02-20 19:43:19,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {40084#true} assume ~id4~0 >= 0; {40084#true} is VALID [2022-02-20 19:43:19,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {40084#true} assume 0 == ~st4~0; {40084#true} is VALID [2022-02-20 19:43:19,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {40084#true} assume ~send4~0 == ~id4~0; {40084#true} is VALID [2022-02-20 19:43:19,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {40084#true} assume 0 == ~mode4~0 % 256; {40084#true} is VALID [2022-02-20 19:43:19,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {40084#true} assume ~id1~0 != ~id2~0; {40084#true} is VALID [2022-02-20 19:43:19,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {40084#true} assume ~id1~0 != ~id3~0; {40084#true} is VALID [2022-02-20 19:43:19,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {40084#true} assume ~id1~0 != ~id4~0; {40084#true} is VALID [2022-02-20 19:43:19,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {40084#true} assume ~id2~0 != ~id3~0; {40084#true} is VALID [2022-02-20 19:43:19,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {40084#true} assume ~id2~0 != ~id4~0; {40084#true} is VALID [2022-02-20 19:43:19,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {40084#true} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {40086#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 19:43:19,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {40086#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {40087#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 19:43:19,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {40087#(= |ULTIMATE.start_init_#res#1| 1)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {40088#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} is VALID [2022-02-20 19:43:19,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {40088#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} assume !(0 == assume_abort_if_not_~cond#1); {40084#true} is VALID [2022-02-20 19:43:19,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {40084#true} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {40084#true} is VALID [2022-02-20 19:43:19,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {40084#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {40084#true} is VALID [2022-02-20 19:43:19,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {40084#true} assume !(0 != ~mode1~0 % 256); {40084#true} is VALID [2022-02-20 19:43:19,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {40084#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {40084#true} is VALID [2022-02-20 19:43:19,115 INFO L290 TraceCheckUtils]: 33: Hoare triple {40084#true} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {40084#true} is VALID [2022-02-20 19:43:19,115 INFO L290 TraceCheckUtils]: 34: Hoare triple {40084#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {40084#true} is VALID [2022-02-20 19:43:19,115 INFO L290 TraceCheckUtils]: 35: Hoare triple {40084#true} assume !(0 != ~mode2~0 % 256); {40084#true} is VALID [2022-02-20 19:43:19,115 INFO L290 TraceCheckUtils]: 36: Hoare triple {40084#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {40084#true} is VALID [2022-02-20 19:43:19,115 INFO L290 TraceCheckUtils]: 37: Hoare triple {40084#true} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {40084#true} is VALID [2022-02-20 19:43:19,115 INFO L290 TraceCheckUtils]: 38: Hoare triple {40084#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {40084#true} is VALID [2022-02-20 19:43:19,116 INFO L290 TraceCheckUtils]: 39: Hoare triple {40084#true} assume !(0 != ~mode3~0 % 256); {40084#true} is VALID [2022-02-20 19:43:19,116 INFO L290 TraceCheckUtils]: 40: Hoare triple {40084#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {40084#true} is VALID [2022-02-20 19:43:19,116 INFO L290 TraceCheckUtils]: 41: Hoare triple {40084#true} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {40084#true} is VALID [2022-02-20 19:43:19,116 INFO L290 TraceCheckUtils]: 42: Hoare triple {40084#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {40084#true} is VALID [2022-02-20 19:43:19,116 INFO L290 TraceCheckUtils]: 43: Hoare triple {40084#true} assume !(0 != ~mode4~0 % 256); {40084#true} is VALID [2022-02-20 19:43:19,116 INFO L290 TraceCheckUtils]: 44: Hoare triple {40084#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {40084#true} is VALID [2022-02-20 19:43:19,117 INFO L290 TraceCheckUtils]: 45: Hoare triple {40084#true} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {40084#true} is VALID [2022-02-20 19:43:19,117 INFO L290 TraceCheckUtils]: 46: Hoare triple {40084#true} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {40084#true} is VALID [2022-02-20 19:43:19,117 INFO L290 TraceCheckUtils]: 47: Hoare triple {40084#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {40084#true} is VALID [2022-02-20 19:43:19,117 INFO L290 TraceCheckUtils]: 48: Hoare triple {40084#true} assume !(~r1~0 % 256 >= 4); {40084#true} is VALID [2022-02-20 19:43:19,117 INFO L290 TraceCheckUtils]: 49: Hoare triple {40084#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {40084#true} is VALID [2022-02-20 19:43:19,118 INFO L290 TraceCheckUtils]: 50: Hoare triple {40084#true} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {40089#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 19:43:19,118 INFO L290 TraceCheckUtils]: 51: Hoare triple {40089#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {40090#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 19:43:19,119 INFO L290 TraceCheckUtils]: 52: Hoare triple {40090#(not (= 0 |ULTIMATE.start_check_#res#1|))} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {40091#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 19:43:19,119 INFO L290 TraceCheckUtils]: 53: Hoare triple {40091#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {40085#false} is VALID [2022-02-20 19:43:19,120 INFO L290 TraceCheckUtils]: 54: Hoare triple {40085#false} assume !false; {40085#false} is VALID [2022-02-20 19:43:19,120 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 19:43:19,120 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:43:19,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504212489] [2022-02-20 19:43:19,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504212489] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:43:19,121 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:43:19,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:43:19,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73877465] [2022-02-20 19:43:19,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:43:19,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 19:43:19,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:43:19,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:43:19,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:43:19,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:43:19,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:43:19,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:43:19,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:43:19,156 INFO L87 Difference]: Start difference. First operand 1801 states and 2957 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)