./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.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.3.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 f28b91143467a6885de009814531d324420ecf879f456eaa915411039fe43e58 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:39:42,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:39:42,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:39:42,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:39:42,896 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:39:42,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:39:42,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:39:42,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:39:42,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:39:42,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:39:42,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:39:42,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:39:42,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:39:42,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:39:42,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:39:42,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:39:42,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:39:42,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:39:42,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:39:42,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:39:42,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:39:42,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:39:42,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:39:42,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:39:42,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:39:42,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:39:42,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:39:42,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:39:42,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:39:42,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:39:42,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:39:42,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:39:42,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:39:42,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:39:42,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:39:42,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:39:42,945 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:39:42,945 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:39:42,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:39:42,946 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:39:42,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:39:42,948 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:39:42,981 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:39:42,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:39:42,982 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:39:42,982 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:39:42,983 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:39:42,983 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:39:42,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:39:42,984 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:39:42,984 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:39:42,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:39:42,985 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:39:42,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:39:42,985 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:39:42,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:39:42,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:39:42,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:39:42,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:39:42,986 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:39:42,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:39:42,986 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:39:42,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:39:42,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:39:42,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:39:42,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:39:42,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:39:42,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:39:42,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:39:42,989 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:39:42,989 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:39:42,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:39:42,989 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:39:42,990 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:39:42,990 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:39:42,990 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 -> f28b91143467a6885de009814531d324420ecf879f456eaa915411039fe43e58 [2022-02-20 19:39:43,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:39:43,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:39:43,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:39:43,249 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:39:43,249 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:39:43,250 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c [2022-02-20 19:39:43,314 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ca3c895/f9f61f200e0a45c098afa437ba2dea37/FLAG670e3c637 [2022-02-20 19:39:43,996 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:39:43,997 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c [2022-02-20 19:39:44,034 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ca3c895/f9f61f200e0a45c098afa437ba2dea37/FLAG670e3c637 [2022-02-20 19:39:44,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ca3c895/f9f61f200e0a45c098afa437ba2dea37 [2022-02-20 19:39:44,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:39:44,133 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:39:44,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:39:44,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:39:44,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:39:44,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:39:44" (1/1) ... [2022-02-20 19:39:44,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7035551b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:44, skipping insertion in model container [2022-02-20 19:39:44,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:39:44" (1/1) ... [2022-02-20 19:39:44,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:39:44,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:39:44,603 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.3.ufo.UNBOUNDED.pals+Problem12_label05.c[6450,6463] [2022-02-20 19:39:44,675 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.3.ufo.UNBOUNDED.pals+Problem12_label05.c[13386,13399] [2022-02-20 19:39:45,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:39:45,385 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:39:45,427 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.3.ufo.UNBOUNDED.pals+Problem12_label05.c[6450,6463] [2022-02-20 19:39:45,451 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.3.ufo.UNBOUNDED.pals+Problem12_label05.c[13386,13399] [2022-02-20 19:39:45,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:39:45,860 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:39:45,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:45 WrapperNode [2022-02-20 19:39:45,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:39:45,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:39:45,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:39:45,862 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:39:45,879 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:39:45" (1/1) ... [2022-02-20 19:39:45,933 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:39:45" (1/1) ... [2022-02-20 19:39:46,292 INFO L137 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4976 [2022-02-20 19:39:46,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:39:46,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:39:46,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:39:46,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:39:46,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:45" (1/1) ... [2022-02-20 19:39:46,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:45" (1/1) ... [2022-02-20 19:39:46,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:45" (1/1) ... [2022-02-20 19:39:46,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:45" (1/1) ... [2022-02-20 19:39:46,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:45" (1/1) ... [2022-02-20 19:39:46,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:45" (1/1) ... [2022-02-20 19:39:46,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:45" (1/1) ... [2022-02-20 19:39:46,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:39:46,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:39:46,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:39:46,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:39:46,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:45" (1/1) ... [2022-02-20 19:39:46,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:39:46,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:39:46,676 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:39:46,692 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:39:46,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:39:46,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:39:46,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:39:46,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:39:46,847 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:39:46,849 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:39:54,906 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:39:54,929 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:39:54,929 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:39:54,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:39:54 BoogieIcfgContainer [2022-02-20 19:39:54,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:39:54,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:39:54,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:39:54,938 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:39:54,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:39:44" (1/3) ... [2022-02-20 19:39:54,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ce0790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:39:54, skipping insertion in model container [2022-02-20 19:39:54,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:45" (2/3) ... [2022-02-20 19:39:54,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ce0790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:39:54, skipping insertion in model container [2022-02-20 19:39:54,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:39:54" (3/3) ... [2022-02-20 19:39:54,940 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c [2022-02-20 19:39:54,945 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:39:54,946 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:39:55,000 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:39:55,007 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:39:55,007 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:39:55,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 880 states, 877 states have (on average 1.903078677309008) internal successors, (1669), 879 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have 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:39:55,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 19:39:55,060 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:55,061 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] [2022-02-20 19:39:55,061 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:55,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:55,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1601385972, now seen corresponding path program 1 times [2022-02-20 19:39:55,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:55,074 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279825588] [2022-02-20 19:39:55,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:55,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:55,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {883#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;~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; {883#true} is VALID [2022-02-20 19:39:55,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {883#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {883#true} is VALID [2022-02-20 19:39:55,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {883#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {883#true} is VALID [2022-02-20 19:39:55,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {883#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {883#true} is VALID [2022-02-20 19:39:55,303 INFO L290 TraceCheckUtils]: 4: Hoare triple {883#true} init_#res#1 := init_~tmp~0#1; {883#true} is VALID [2022-02-20 19:39:55,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {883#true} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {883#true} is VALID [2022-02-20 19:39:55,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {883#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {884#false} is VALID [2022-02-20 19:39:55,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {884#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;main1_~i2~0#1 := 0; {884#false} is VALID [2022-02-20 19:39:55,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {884#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; {884#false} is VALID [2022-02-20 19:39:55,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#false} assume !(0 != ~mode1~0 % 256); {884#false} is VALID [2022-02-20 19:39:55,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {884#false} is VALID [2022-02-20 19:39:55,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#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; {884#false} is VALID [2022-02-20 19:39:55,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {884#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; {884#false} is VALID [2022-02-20 19:39:55,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {884#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {884#false} is VALID [2022-02-20 19:39:55,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {884#false} assume !(node2_~m2~0#1 != ~nomsg~0); {884#false} is VALID [2022-02-20 19:39:55,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {884#false} ~mode2~0 := 0; {884#false} is VALID [2022-02-20 19:39:55,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {884#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; {884#false} is VALID [2022-02-20 19:39:55,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {884#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {884#false} is VALID [2022-02-20 19:39:55,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {884#false} assume !(node3_~m3~0#1 != ~nomsg~0); {884#false} is VALID [2022-02-20 19:39:55,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {884#false} ~mode3~0 := 0; {884#false} is VALID [2022-02-20 19:39:55,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {884#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {884#false} is VALID [2022-02-20 19:39:55,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {884#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {884#false} is VALID [2022-02-20 19:39:55,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {884#false} check_#res#1 := check_~tmp~1#1; {884#false} is VALID [2022-02-20 19:39:55,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {884#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {884#false} is VALID [2022-02-20 19:39:55,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {884#false} assume 0 == assert_~arg#1 % 256; {884#false} is VALID [2022-02-20 19:39:55,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {884#false} assume !false; {884#false} is VALID [2022-02-20 19:39:55,316 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:39:55,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:55,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279825588] [2022-02-20 19:39:55,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279825588] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:55,318 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:55,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:39:55,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696639026] [2022-02-20 19:39:55,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:55,324 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-20 19:39:55,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:55,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:39:55,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:55,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:39:55,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:55,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:39:55,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:39:55,392 INFO L87 Difference]: Start difference. First operand has 880 states, 877 states have (on average 1.903078677309008) internal successors, (1669), 879 states have internal predecessors, (1669), 0 states have call successors, (0), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:39:56,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:56,761 INFO L93 Difference]: Finished difference Result 1736 states and 3296 transitions. [2022-02-20 19:39:56,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:39:56,761 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-20 19:39:56,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:39:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3296 transitions. [2022-02-20 19:39:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:39:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3296 transitions. [2022-02-20 19:39:56,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3296 transitions. [2022-02-20 19:39:59,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3296 edges. 3296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:59,622 INFO L225 Difference]: With dead ends: 1736 [2022-02-20 19:39:59,623 INFO L226 Difference]: Without dead ends: 814 [2022-02-20 19:39:59,628 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:39:59,631 INFO L933 BasicCegarLoop]: 1600 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, 1600 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:39:59,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:59,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2022-02-20 19:39:59,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 814. [2022-02-20 19:39:59,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:59,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 814 states. Second operand has 814 states, 812 states have (on average 1.8916256157635467) internal successors, (1536), 813 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have 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:39:59,719 INFO L74 IsIncluded]: Start isIncluded. First operand 814 states. Second operand has 814 states, 812 states have (on average 1.8916256157635467) internal successors, (1536), 813 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have 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:39:59,721 INFO L87 Difference]: Start difference. First operand 814 states. Second operand has 814 states, 812 states have (on average 1.8916256157635467) internal successors, (1536), 813 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have 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:39:59,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:59,760 INFO L93 Difference]: Finished difference Result 814 states and 1536 transitions. [2022-02-20 19:39:59,760 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1536 transitions. [2022-02-20 19:39:59,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:59,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:59,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 814 states, 812 states have (on average 1.8916256157635467) internal successors, (1536), 813 states have internal predecessors, (1536), 0 states have call successors, (0), 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 814 states. [2022-02-20 19:39:59,774 INFO L87 Difference]: Start difference. First operand has 814 states, 812 states have (on average 1.8916256157635467) internal successors, (1536), 813 states have internal predecessors, (1536), 0 states have call successors, (0), 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 814 states. [2022-02-20 19:39:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:59,809 INFO L93 Difference]: Finished difference Result 814 states and 1536 transitions. [2022-02-20 19:39:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1536 transitions. [2022-02-20 19:39:59,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:59,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:59,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:59,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:59,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 812 states have (on average 1.8916256157635467) internal successors, (1536), 813 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have 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:39:59,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1536 transitions. [2022-02-20 19:39:59,857 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1536 transitions. Word has length 26 [2022-02-20 19:39:59,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:59,857 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1536 transitions. [2022-02-20 19:39:59,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:39:59,857 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1536 transitions. [2022-02-20 19:39:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 19:39:59,863 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:59,863 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] [2022-02-20 19:39:59,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:39:59,864 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:59,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:59,865 INFO L85 PathProgramCache]: Analyzing trace with hash 783737522, now seen corresponding path program 1 times [2022-02-20 19:39:59,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:59,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606556205] [2022-02-20 19:39:59,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:59,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:59,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {5103#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;~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; {5103#true} is VALID [2022-02-20 19:39:59,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {5103#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {5103#true} is VALID [2022-02-20 19:39:59,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {5103#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5103#true} is VALID [2022-02-20 19:39:59,987 INFO L290 TraceCheckUtils]: 3: Hoare triple {5103#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5105#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:39:59,987 INFO L290 TraceCheckUtils]: 4: Hoare triple {5105#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5106#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:39:59,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {5106#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {5107#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:39:59,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {5107#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5104#false} is VALID [2022-02-20 19:39:59,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {5104#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;main1_~i2~0#1 := 0; {5104#false} is VALID [2022-02-20 19:39:59,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {5104#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; {5104#false} is VALID [2022-02-20 19:39:59,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {5104#false} assume !(0 != ~mode1~0 % 256); {5104#false} is VALID [2022-02-20 19:39:59,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {5104#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {5104#false} is VALID [2022-02-20 19:39:59,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {5104#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; {5104#false} is VALID [2022-02-20 19:39:59,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {5104#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; {5104#false} is VALID [2022-02-20 19:39:59,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {5104#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5104#false} is VALID [2022-02-20 19:39:59,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {5104#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5104#false} is VALID [2022-02-20 19:39:59,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {5104#false} ~mode2~0 := 0; {5104#false} is VALID [2022-02-20 19:39:59,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {5104#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; {5104#false} is VALID [2022-02-20 19:39:59,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {5104#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5104#false} is VALID [2022-02-20 19:39:59,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {5104#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5104#false} is VALID [2022-02-20 19:39:59,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {5104#false} ~mode3~0 := 0; {5104#false} is VALID [2022-02-20 19:39:59,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {5104#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5104#false} is VALID [2022-02-20 19:39:59,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {5104#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {5104#false} is VALID [2022-02-20 19:39:59,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {5104#false} check_#res#1 := check_~tmp~1#1; {5104#false} is VALID [2022-02-20 19:39:59,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {5104#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {5104#false} is VALID [2022-02-20 19:39:59,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {5104#false} assume 0 == assert_~arg#1 % 256; {5104#false} is VALID [2022-02-20 19:39:59,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {5104#false} assume !false; {5104#false} is VALID [2022-02-20 19:39:59,994 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:39:59,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:59,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606556205] [2022-02-20 19:39:59,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606556205] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:59,995 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:59,995 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:39:59,995 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239777594] [2022-02-20 19:39:59,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:59,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-20 19:39:59,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:59,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:00,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:00,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:00,014 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:00,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:00,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:00,015 INFO L87 Difference]: Start difference. First operand 814 states and 1536 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:03,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:03,965 INFO L93 Difference]: Finished difference Result 856 states and 1599 transitions. [2022-02-20 19:40:03,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:40:03,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-20 19:40:03,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:03,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1599 transitions. [2022-02-20 19:40:03,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1599 transitions. [2022-02-20 19:40:03,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1599 transitions. [2022-02-20 19:40:05,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1599 edges. 1599 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:05,298 INFO L225 Difference]: With dead ends: 856 [2022-02-20 19:40:05,298 INFO L226 Difference]: Without dead ends: 814 [2022-02-20 19:40:05,299 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:40:05,300 INFO L933 BasicCegarLoop]: 1534 mSDtfsCounter, 3 mSDsluCounter, 4583 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6117 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:05,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6117 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:05,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2022-02-20 19:40:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 814. [2022-02-20 19:40:05,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:05,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 814 states. Second operand has 814 states, 812 states have (on average 1.8719211822660098) internal successors, (1520), 813 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have 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:40:05,319 INFO L74 IsIncluded]: Start isIncluded. First operand 814 states. Second operand has 814 states, 812 states have (on average 1.8719211822660098) internal successors, (1520), 813 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have 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:40:05,321 INFO L87 Difference]: Start difference. First operand 814 states. Second operand has 814 states, 812 states have (on average 1.8719211822660098) internal successors, (1520), 813 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have 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:40:05,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:05,354 INFO L93 Difference]: Finished difference Result 814 states and 1520 transitions. [2022-02-20 19:40:05,354 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1520 transitions. [2022-02-20 19:40:05,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:05,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:05,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 814 states, 812 states have (on average 1.8719211822660098) internal successors, (1520), 813 states have internal predecessors, (1520), 0 states have call successors, (0), 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 814 states. [2022-02-20 19:40:05,360 INFO L87 Difference]: Start difference. First operand has 814 states, 812 states have (on average 1.8719211822660098) internal successors, (1520), 813 states have internal predecessors, (1520), 0 states have call successors, (0), 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 814 states. [2022-02-20 19:40:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:05,394 INFO L93 Difference]: Finished difference Result 814 states and 1520 transitions. [2022-02-20 19:40:05,394 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1520 transitions. [2022-02-20 19:40:05,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:05,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:05,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:05,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:05,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 812 states have (on average 1.8719211822660098) internal successors, (1520), 813 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have 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:40:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1520 transitions. [2022-02-20 19:40:05,432 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1520 transitions. Word has length 26 [2022-02-20 19:40:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:05,432 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1520 transitions. [2022-02-20 19:40:05,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:05,433 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1520 transitions. [2022-02-20 19:40:05,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:40:05,434 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:05,434 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] [2022-02-20 19:40:05,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:40:05,434 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:05,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:05,435 INFO L85 PathProgramCache]: Analyzing trace with hash -698732182, now seen corresponding path program 1 times [2022-02-20 19:40:05,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:05,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356180413] [2022-02-20 19:40:05,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:05,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:05,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {8443#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;~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; {8443#true} is VALID [2022-02-20 19:40:05,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {8443#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {8443#true} is VALID [2022-02-20 19:40:05,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {8443#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8443#true} is VALID [2022-02-20 19:40:05,548 INFO L290 TraceCheckUtils]: 3: Hoare triple {8443#true} assume 0 == ~r1~0 % 256; {8443#true} is VALID [2022-02-20 19:40:05,550 INFO L290 TraceCheckUtils]: 4: Hoare triple {8443#true} assume ~id1~0 >= 0; {8443#true} is VALID [2022-02-20 19:40:05,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {8443#true} assume 0 == ~st1~0; {8443#true} is VALID [2022-02-20 19:40:05,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {8443#true} assume ~send1~0 == ~id1~0; {8443#true} is VALID [2022-02-20 19:40:05,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {8443#true} assume 0 == ~mode1~0 % 256; {8443#true} is VALID [2022-02-20 19:40:05,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {8443#true} assume ~id2~0 >= 0; {8443#true} is VALID [2022-02-20 19:40:05,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {8443#true} assume 0 == ~st2~0; {8443#true} is VALID [2022-02-20 19:40:05,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {8443#true} assume ~send2~0 == ~id2~0; {8443#true} is VALID [2022-02-20 19:40:05,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {8443#true} assume 0 == ~mode2~0 % 256; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:05,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:05,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:05,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:05,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:05,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:05,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:05,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:05,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:05,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:05,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:05,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {8445#(= (+ (* (- 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;main1_~i2~0#1 := 0; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:05,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {8445#(= (+ (* (- 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; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:05,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:05,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:05,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {8445#(= (+ (* (- 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; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:05,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {8445#(= (+ (* (- 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; {8445#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:05,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {8445#(= (+ (* (- 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; {8444#false} is VALID [2022-02-20 19:40:05,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {8444#false} assume !(node2_~m2~0#1 != ~nomsg~0); {8444#false} is VALID [2022-02-20 19:40:05,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {8444#false} ~mode2~0 := 0; {8444#false} is VALID [2022-02-20 19:40:05,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {8444#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; {8444#false} is VALID [2022-02-20 19:40:05,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {8444#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8444#false} is VALID [2022-02-20 19:40:05,567 INFO L290 TraceCheckUtils]: 33: Hoare triple {8444#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8444#false} is VALID [2022-02-20 19:40:05,567 INFO L290 TraceCheckUtils]: 34: Hoare triple {8444#false} ~mode3~0 := 0; {8444#false} is VALID [2022-02-20 19:40:05,567 INFO L290 TraceCheckUtils]: 35: Hoare triple {8444#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8444#false} is VALID [2022-02-20 19:40:05,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {8444#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {8444#false} is VALID [2022-02-20 19:40:05,568 INFO L290 TraceCheckUtils]: 37: Hoare triple {8444#false} check_#res#1 := check_~tmp~1#1; {8444#false} is VALID [2022-02-20 19:40:05,568 INFO L290 TraceCheckUtils]: 38: Hoare triple {8444#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {8444#false} is VALID [2022-02-20 19:40:05,568 INFO L290 TraceCheckUtils]: 39: Hoare triple {8444#false} assume 0 == assert_~arg#1 % 256; {8444#false} is VALID [2022-02-20 19:40:05,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {8444#false} assume !false; {8444#false} is VALID [2022-02-20 19:40:05,569 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:40:05,570 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:05,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356180413] [2022-02-20 19:40:05,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356180413] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:05,571 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:05,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:05,571 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756774008] [2022-02-20 19:40:05,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:05,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:40:05,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:05,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:05,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:05,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:05,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:05,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:05,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:05,604 INFO L87 Difference]: Start difference. First operand 814 states and 1520 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:07,587 INFO L93 Difference]: Finished difference Result 884 states and 1628 transitions. [2022-02-20 19:40:07,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:07,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:40:07,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:07,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2022-02-20 19:40:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2022-02-20 19:40:07,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1628 transitions. [2022-02-20 19:40:09,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1628 edges. 1628 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:09,337 INFO L225 Difference]: With dead ends: 884 [2022-02-20 19:40:09,338 INFO L226 Difference]: Without dead ends: 846 [2022-02-20 19:40:09,338 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:40:09,339 INFO L933 BasicCegarLoop]: 1549 mSDtfsCounter, 1484 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1610 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:40:09,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1484 Valid, 1610 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:09,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2022-02-20 19:40:09,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 844. [2022-02-20 19:40:09,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:09,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 846 states. Second operand has 844 states, 842 states have (on average 1.8610451306413303) internal successors, (1567), 843 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have 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:40:09,357 INFO L74 IsIncluded]: Start isIncluded. First operand 846 states. Second operand has 844 states, 842 states have (on average 1.8610451306413303) internal successors, (1567), 843 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have 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:40:09,358 INFO L87 Difference]: Start difference. First operand 846 states. Second operand has 844 states, 842 states have (on average 1.8610451306413303) internal successors, (1567), 843 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have 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:40:09,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:09,399 INFO L93 Difference]: Finished difference Result 846 states and 1568 transitions. [2022-02-20 19:40:09,399 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1568 transitions. [2022-02-20 19:40:09,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:09,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:09,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 844 states, 842 states have (on average 1.8610451306413303) internal successors, (1567), 843 states have internal predecessors, (1567), 0 states have call successors, (0), 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 846 states. [2022-02-20 19:40:09,405 INFO L87 Difference]: Start difference. First operand has 844 states, 842 states have (on average 1.8610451306413303) internal successors, (1567), 843 states have internal predecessors, (1567), 0 states have call successors, (0), 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 846 states. [2022-02-20 19:40:09,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:09,443 INFO L93 Difference]: Finished difference Result 846 states and 1568 transitions. [2022-02-20 19:40:09,443 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1568 transitions. [2022-02-20 19:40:09,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:09,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:09,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:09,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:09,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 842 states have (on average 1.8610451306413303) internal successors, (1567), 843 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have 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:40:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1567 transitions. [2022-02-20 19:40:09,489 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1567 transitions. Word has length 41 [2022-02-20 19:40:09,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:09,489 INFO L470 AbstractCegarLoop]: Abstraction has 844 states and 1567 transitions. [2022-02-20 19:40:09,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:09,490 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1567 transitions. [2022-02-20 19:40:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:40:09,493 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:09,493 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] [2022-02-20 19:40:09,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:40:09,494 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:09,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:09,494 INFO L85 PathProgramCache]: Analyzing trace with hash -360939040, now seen corresponding path program 1 times [2022-02-20 19:40:09,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:09,495 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504231767] [2022-02-20 19:40:09,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:09,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:09,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {11910#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;~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; {11910#true} is VALID [2022-02-20 19:40:09,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {11910#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {11910#true} is VALID [2022-02-20 19:40:09,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {11910#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {11910#true} is VALID [2022-02-20 19:40:09,587 INFO L290 TraceCheckUtils]: 3: Hoare triple {11910#true} assume 0 == ~r1~0 % 256; {11910#true} is VALID [2022-02-20 19:40:09,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {11910#true} assume ~id1~0 >= 0; {11910#true} is VALID [2022-02-20 19:40:09,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {11910#true} assume 0 == ~st1~0; {11910#true} is VALID [2022-02-20 19:40:09,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {11910#true} assume ~send1~0 == ~id1~0; {11910#true} is VALID [2022-02-20 19:40:09,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {11910#true} assume 0 == ~mode1~0 % 256; {11910#true} is VALID [2022-02-20 19:40:09,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {11910#true} assume ~id2~0 >= 0; {11910#true} is VALID [2022-02-20 19:40:09,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {11910#true} assume 0 == ~st2~0; {11910#true} is VALID [2022-02-20 19:40:09,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {11910#true} assume ~send2~0 == ~id2~0; {11910#true} is VALID [2022-02-20 19:40:09,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {11910#true} assume 0 == ~mode2~0 % 256; {11910#true} is VALID [2022-02-20 19:40:09,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {11910#true} assume ~id3~0 >= 0; {11910#true} is VALID [2022-02-20 19:40:09,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {11910#true} assume 0 == ~st3~0; {11910#true} is VALID [2022-02-20 19:40:09,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {11910#true} assume ~send3~0 == ~id3~0; {11910#true} is VALID [2022-02-20 19:40:09,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {11910#true} assume 0 == ~mode3~0 % 256; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:09,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:09,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:09,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:09,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:09,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:09,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:09,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {11912#(= (+ (* (- 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;main1_~i2~0#1 := 0; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:09,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {11912#(= (+ (* (- 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; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:09,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:09,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:09,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {11912#(= (+ (* (- 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; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:09,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {11912#(= (+ (* (- 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; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:09,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:09,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:09,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {11912#(= (+ (* (- 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; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:09,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {11912#(= (+ (* (- 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; {11912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:09,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {11912#(= (+ (* (- 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; {11911#false} is VALID [2022-02-20 19:40:09,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {11911#false} assume !(node3_~m3~0#1 != ~nomsg~0); {11911#false} is VALID [2022-02-20 19:40:09,618 INFO L290 TraceCheckUtils]: 34: Hoare triple {11911#false} ~mode3~0 := 0; {11911#false} is VALID [2022-02-20 19:40:09,618 INFO L290 TraceCheckUtils]: 35: Hoare triple {11911#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {11911#false} is VALID [2022-02-20 19:40:09,619 INFO L290 TraceCheckUtils]: 36: Hoare triple {11911#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {11911#false} is VALID [2022-02-20 19:40:09,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {11911#false} check_#res#1 := check_~tmp~1#1; {11911#false} is VALID [2022-02-20 19:40:09,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {11911#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {11911#false} is VALID [2022-02-20 19:40:09,620 INFO L290 TraceCheckUtils]: 39: Hoare triple {11911#false} assume 0 == assert_~arg#1 % 256; {11911#false} is VALID [2022-02-20 19:40:09,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {11911#false} assume !false; {11911#false} is VALID [2022-02-20 19:40:09,620 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:40:09,622 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:09,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504231767] [2022-02-20 19:40:09,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504231767] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:09,622 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:09,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:09,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237865113] [2022-02-20 19:40:09,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:09,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:40:09,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:09,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:09,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:09,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:09,653 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:09,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:09,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:09,654 INFO L87 Difference]: Start difference. First operand 844 states and 1567 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:11,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:11,655 INFO L93 Difference]: Finished difference Result 968 states and 1759 transitions. [2022-02-20 19:40:11,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:11,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:40:11,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:11,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2022-02-20 19:40:11,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2022-02-20 19:40:11,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1628 transitions. [2022-02-20 19:40:13,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1628 edges. 1628 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:13,136 INFO L225 Difference]: With dead ends: 968 [2022-02-20 19:40:13,136 INFO L226 Difference]: Without dead ends: 900 [2022-02-20 19:40:13,136 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:40:13,137 INFO L933 BasicCegarLoop]: 1544 mSDtfsCounter, 1480 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1609 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:40:13,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1480 Valid, 1609 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:13,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2022-02-20 19:40:13,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 898. [2022-02-20 19:40:13,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:13,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 900 states. Second operand has 898 states, 896 states have (on average 1.8415178571428572) internal successors, (1650), 897 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have 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:40:13,156 INFO L74 IsIncluded]: Start isIncluded. First operand 900 states. Second operand has 898 states, 896 states have (on average 1.8415178571428572) internal successors, (1650), 897 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have 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:40:13,158 INFO L87 Difference]: Start difference. First operand 900 states. Second operand has 898 states, 896 states have (on average 1.8415178571428572) internal successors, (1650), 897 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have 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:40:13,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:13,195 INFO L93 Difference]: Finished difference Result 900 states and 1651 transitions. [2022-02-20 19:40:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1651 transitions. [2022-02-20 19:40:13,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:13,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:13,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 898 states, 896 states have (on average 1.8415178571428572) internal successors, (1650), 897 states have internal predecessors, (1650), 0 states have call successors, (0), 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 900 states. [2022-02-20 19:40:13,201 INFO L87 Difference]: Start difference. First operand has 898 states, 896 states have (on average 1.8415178571428572) internal successors, (1650), 897 states have internal predecessors, (1650), 0 states have call successors, (0), 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 900 states. [2022-02-20 19:40:13,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:13,238 INFO L93 Difference]: Finished difference Result 900 states and 1651 transitions. [2022-02-20 19:40:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1651 transitions. [2022-02-20 19:40:13,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:13,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:13,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:13,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:13,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 896 states have (on average 1.8415178571428572) internal successors, (1650), 897 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have 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:40:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1650 transitions. [2022-02-20 19:40:13,284 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1650 transitions. Word has length 41 [2022-02-20 19:40:13,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:13,285 INFO L470 AbstractCegarLoop]: Abstraction has 898 states and 1650 transitions. [2022-02-20 19:40:13,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1650 transitions. [2022-02-20 19:40:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:40:13,287 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:13,287 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] [2022-02-20 19:40:13,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:40:13,288 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:13,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:13,288 INFO L85 PathProgramCache]: Analyzing trace with hash 857046358, now seen corresponding path program 1 times [2022-02-20 19:40:13,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:13,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642526544] [2022-02-20 19:40:13,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:13,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:13,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {15653#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;~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; {15653#true} is VALID [2022-02-20 19:40:13,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {15653#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {15653#true} is VALID [2022-02-20 19:40:13,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {15653#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {15653#true} is VALID [2022-02-20 19:40:13,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {15653#true} assume 0 == ~r1~0 % 256; {15653#true} is VALID [2022-02-20 19:40:13,354 INFO L290 TraceCheckUtils]: 4: Hoare triple {15653#true} assume ~id1~0 >= 0; {15653#true} is VALID [2022-02-20 19:40:13,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {15653#true} assume 0 == ~st1~0; {15655#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {15655#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {15655#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {15655#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {15655#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {15655#(<= ~st1~0 0)} assume ~id2~0 >= 0; {15655#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {15655#(<= ~st1~0 0)} assume 0 == ~st2~0; {15656#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {15656#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {15656#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {15656#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {15656#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {15656#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {15656#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {15656#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {15657#(<= (+ ~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;main1_~i2~0#1 := 0; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {15657#(<= (+ ~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; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {15657#(<= (+ ~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; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {15657#(<= (+ ~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; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {15657#(<= (+ ~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; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {15657#(<= (+ ~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; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {15657#(<= (+ ~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; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,366 INFO L290 TraceCheckUtils]: 35: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {15657#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {15654#false} is VALID [2022-02-20 19:40:13,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {15654#false} check_#res#1 := check_~tmp~1#1; {15654#false} is VALID [2022-02-20 19:40:13,367 INFO L290 TraceCheckUtils]: 38: Hoare triple {15654#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {15654#false} is VALID [2022-02-20 19:40:13,367 INFO L290 TraceCheckUtils]: 39: Hoare triple {15654#false} assume 0 == assert_~arg#1 % 256; {15654#false} is VALID [2022-02-20 19:40:13,367 INFO L290 TraceCheckUtils]: 40: Hoare triple {15654#false} assume !false; {15654#false} is VALID [2022-02-20 19:40:13,368 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:40:13,368 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:13,368 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642526544] [2022-02-20 19:40:13,368 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642526544] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:13,369 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:13,369 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:13,369 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797789601] [2022-02-20 19:40:13,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:13,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:40:13,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:13,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:13,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:13,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:13,397 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:13,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:13,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:13,398 INFO L87 Difference]: Start difference. First operand 898 states and 1650 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:16,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:16,000 INFO L93 Difference]: Finished difference Result 1630 states and 2784 transitions. [2022-02-20 19:40:16,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:40:16,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:40:16,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:16,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1874 transitions. [2022-02-20 19:40:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1874 transitions. [2022-02-20 19:40:16,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1874 transitions. [2022-02-20 19:40:17,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1874 edges. 1874 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:17,570 INFO L225 Difference]: With dead ends: 1630 [2022-02-20 19:40:17,570 INFO L226 Difference]: Without dead ends: 1508 [2022-02-20 19:40:17,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:40:17,572 INFO L933 BasicCegarLoop]: 1516 mSDtfsCounter, 4693 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4693 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:17,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4693 Valid, 1934 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:17,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2022-02-20 19:40:17,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1018. [2022-02-20 19:40:17,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:17,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1508 states. Second operand has 1018 states, 1016 states have (on average 1.8011811023622046) internal successors, (1830), 1017 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have 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:40:17,657 INFO L74 IsIncluded]: Start isIncluded. First operand 1508 states. Second operand has 1018 states, 1016 states have (on average 1.8011811023622046) internal successors, (1830), 1017 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have 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:40:17,658 INFO L87 Difference]: Start difference. First operand 1508 states. Second operand has 1018 states, 1016 states have (on average 1.8011811023622046) internal successors, (1830), 1017 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have 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:40:17,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:17,754 INFO L93 Difference]: Finished difference Result 1508 states and 2571 transitions. [2022-02-20 19:40:17,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2571 transitions. [2022-02-20 19:40:17,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:17,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:17,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 1018 states, 1016 states have (on average 1.8011811023622046) internal successors, (1830), 1017 states have internal predecessors, (1830), 0 states have call successors, (0), 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 1508 states. [2022-02-20 19:40:17,760 INFO L87 Difference]: Start difference. First operand has 1018 states, 1016 states have (on average 1.8011811023622046) internal successors, (1830), 1017 states have internal predecessors, (1830), 0 states have call successors, (0), 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 1508 states. [2022-02-20 19:40:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:17,857 INFO L93 Difference]: Finished difference Result 1508 states and 2571 transitions. [2022-02-20 19:40:17,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2571 transitions. [2022-02-20 19:40:17,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:17,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:17,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:17,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1016 states have (on average 1.8011811023622046) internal successors, (1830), 1017 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have 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:40:17,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1830 transitions. [2022-02-20 19:40:17,912 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1830 transitions. Word has length 41 [2022-02-20 19:40:17,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:17,912 INFO L470 AbstractCegarLoop]: Abstraction has 1018 states and 1830 transitions. [2022-02-20 19:40:17,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:40:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1830 transitions. [2022-02-20 19:40:17,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:40:17,913 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:17,913 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] [2022-02-20 19:40:17,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:40:17,914 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:17,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:17,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1867096070, now seen corresponding path program 1 times [2022-02-20 19:40:17,915 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:17,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962647221] [2022-02-20 19:40:17,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:17,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:17,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {21559#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;~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; {21559#true} is VALID [2022-02-20 19:40:17,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {21559#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {21559#true} is VALID [2022-02-20 19:40:17,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {21559#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {21559#true} is VALID [2022-02-20 19:40:17,994 INFO L290 TraceCheckUtils]: 3: Hoare triple {21559#true} assume 0 == ~r1~0 % 256; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:17,995 INFO L290 TraceCheckUtils]: 4: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:17,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:17,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:17,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:17,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:17,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:17,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:17,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:17,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:17,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:17,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:17,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {21561#(<= ~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;main1_~i2~0#1 := 0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {21561#(<= ~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; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {21561#(<= ~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; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {21561#(<= ~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; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,005 INFO L290 TraceCheckUtils]: 29: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,005 INFO L290 TraceCheckUtils]: 30: Hoare triple {21561#(<= ~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; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,005 INFO L290 TraceCheckUtils]: 31: Hoare triple {21561#(<= ~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; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,006 INFO L290 TraceCheckUtils]: 32: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {21561#(<= ~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; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:18,008 INFO L290 TraceCheckUtils]: 37: Hoare triple {21561#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 3; {21560#false} is VALID [2022-02-20 19:40:18,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {21560#false} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {21560#false} is VALID [2022-02-20 19:40:18,008 INFO L290 TraceCheckUtils]: 39: Hoare triple {21560#false} check_#res#1 := check_~tmp~1#1; {21560#false} is VALID [2022-02-20 19:40:18,009 INFO L290 TraceCheckUtils]: 40: Hoare triple {21560#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {21560#false} is VALID [2022-02-20 19:40:18,009 INFO L290 TraceCheckUtils]: 41: Hoare triple {21560#false} assume 0 == assert_~arg#1 % 256; {21560#false} is VALID [2022-02-20 19:40:18,009 INFO L290 TraceCheckUtils]: 42: Hoare triple {21560#false} assume !false; {21560#false} is VALID [2022-02-20 19:40:18,009 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:40:18,009 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:18,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962647221] [2022-02-20 19:40:18,010 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962647221] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:18,010 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:18,010 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:18,010 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976528797] [2022-02-20 19:40:18,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:18,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:40:18,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:18,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:18,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:18,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:18,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:18,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:18,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:18,046 INFO L87 Difference]: Start difference. First operand 1018 states and 1830 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:19,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:19,669 INFO L93 Difference]: Finished difference Result 1458 states and 2492 transitions. [2022-02-20 19:40:19,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:19,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:40:19,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:19,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1629 transitions. [2022-02-20 19:40:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1629 transitions. [2022-02-20 19:40:19,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1629 transitions. [2022-02-20 19:40:21,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1629 edges. 1629 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:21,109 INFO L225 Difference]: With dead ends: 1458 [2022-02-20 19:40:21,109 INFO L226 Difference]: Without dead ends: 1216 [2022-02-20 19:40:21,110 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:40:21,110 INFO L933 BasicCegarLoop]: 1517 mSDtfsCounter, 1471 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 1569 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:40:21,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1471 Valid, 1569 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2022-02-20 19:40:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1206. [2022-02-20 19:40:21,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:21,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1216 states. Second operand has 1206 states, 1204 states have (on average 1.739202657807309) internal successors, (2094), 1205 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have 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:40:21,284 INFO L74 IsIncluded]: Start isIncluded. First operand 1216 states. Second operand has 1206 states, 1204 states have (on average 1.739202657807309) internal successors, (2094), 1205 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have 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:40:21,286 INFO L87 Difference]: Start difference. First operand 1216 states. Second operand has 1206 states, 1204 states have (on average 1.739202657807309) internal successors, (2094), 1205 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have 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:40:21,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:21,350 INFO L93 Difference]: Finished difference Result 1216 states and 2103 transitions. [2022-02-20 19:40:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 2103 transitions. [2022-02-20 19:40:21,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:21,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:21,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 1206 states, 1204 states have (on average 1.739202657807309) internal successors, (2094), 1205 states have internal predecessors, (2094), 0 states have call successors, (0), 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 1216 states. [2022-02-20 19:40:21,356 INFO L87 Difference]: Start difference. First operand has 1206 states, 1204 states have (on average 1.739202657807309) internal successors, (2094), 1205 states have internal predecessors, (2094), 0 states have call successors, (0), 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 1216 states. [2022-02-20 19:40:21,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:21,421 INFO L93 Difference]: Finished difference Result 1216 states and 2103 transitions. [2022-02-20 19:40:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 2103 transitions. [2022-02-20 19:40:21,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:21,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:21,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:21,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1204 states have (on average 1.739202657807309) internal successors, (2094), 1205 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have 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:40:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 2094 transitions. [2022-02-20 19:40:21,498 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 2094 transitions. Word has length 43 [2022-02-20 19:40:21,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:21,499 INFO L470 AbstractCegarLoop]: Abstraction has 1206 states and 2094 transitions. [2022-02-20 19:40:21,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:21,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 2094 transitions. [2022-02-20 19:40:21,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:40:21,501 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:21,501 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] [2022-02-20 19:40:21,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:40:21,502 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:21,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:21,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1933589582, now seen corresponding path program 1 times [2022-02-20 19:40:21,503 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:21,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987633026] [2022-02-20 19:40:21,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:21,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:21,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {26904#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;~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; {26904#true} is VALID [2022-02-20 19:40:21,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {26904#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {26904#true} is VALID [2022-02-20 19:40:21,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {26904#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {26904#true} is VALID [2022-02-20 19:40:21,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {26904#true} assume 0 == ~r1~0 % 256; {26904#true} is VALID [2022-02-20 19:40:21,669 INFO L290 TraceCheckUtils]: 4: Hoare triple {26904#true} assume ~id1~0 >= 0; {26904#true} is VALID [2022-02-20 19:40:21,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {26904#true} assume 0 == ~st1~0; {26906#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:21,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {26906#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send1~0 == ~id1~0; {26906#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:21,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {26906#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode1~0 % 256; {26906#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:21,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {26906#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id2~0 >= 0; {26906#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:21,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {26906#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st2~0; {26907#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:21,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {26907#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {26907#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:21,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {26907#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {26907#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:21,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {26907#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {26907#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:21,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {26907#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 == ~id3~0; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode3~0 % 256; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} init_#res#1 := init_~tmp~0#1; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == assume_abort_if_not_~cond#1); {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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;main1_~i2~0#1 := 0; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode1~0 % 256); {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode2~0 % 256); {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode3~0 % 256); {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,697 INFO L290 TraceCheckUtils]: 33: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,698 INFO L290 TraceCheckUtils]: 35: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,702 INFO L290 TraceCheckUtils]: 36: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 % 256 >= 3); {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:21,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {26908#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {26905#false} is VALID [2022-02-20 19:40:21,706 INFO L290 TraceCheckUtils]: 39: Hoare triple {26905#false} check_#res#1 := check_~tmp~1#1; {26905#false} is VALID [2022-02-20 19:40:21,706 INFO L290 TraceCheckUtils]: 40: Hoare triple {26905#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {26905#false} is VALID [2022-02-20 19:40:21,706 INFO L290 TraceCheckUtils]: 41: Hoare triple {26905#false} assume 0 == assert_~arg#1 % 256; {26905#false} is VALID [2022-02-20 19:40:21,707 INFO L290 TraceCheckUtils]: 42: Hoare triple {26905#false} assume !false; {26905#false} is VALID [2022-02-20 19:40:21,707 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:40:21,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:21,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987633026] [2022-02-20 19:40:21,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987633026] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:21,708 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:21,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:21,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929373634] [2022-02-20 19:40:21,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:21,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:40:21,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:21,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:21,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:21,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:21,752 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:21,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:21,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:21,753 INFO L87 Difference]: Start difference. First operand 1206 states and 2094 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:24,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:24,434 INFO L93 Difference]: Finished difference Result 1638 states and 2728 transitions. [2022-02-20 19:40:24,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:40:24,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:40:24,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1636 transitions. [2022-02-20 19:40:24,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1636 transitions. [2022-02-20 19:40:24,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1636 transitions. [2022-02-20 19:40:25,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1636 edges. 1636 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:25,882 INFO L225 Difference]: With dead ends: 1638 [2022-02-20 19:40:25,882 INFO L226 Difference]: Without dead ends: 1208 [2022-02-20 19:40:25,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:40:25,883 INFO L933 BasicCegarLoop]: 1515 mSDtfsCounter, 3008 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3008 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:25,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3008 Valid, 1625 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:25,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2022-02-20 19:40:26,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1206. [2022-02-20 19:40:26,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:26,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1208 states. Second operand has 1206 states, 1204 states have (on average 1.7325581395348837) internal successors, (2086), 1205 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have 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:40:26,101 INFO L74 IsIncluded]: Start isIncluded. First operand 1208 states. Second operand has 1206 states, 1204 states have (on average 1.7325581395348837) internal successors, (2086), 1205 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have 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:40:26,102 INFO L87 Difference]: Start difference. First operand 1208 states. Second operand has 1206 states, 1204 states have (on average 1.7325581395348837) internal successors, (2086), 1205 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have 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:40:26,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:26,164 INFO L93 Difference]: Finished difference Result 1208 states and 2087 transitions. [2022-02-20 19:40:26,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 2087 transitions. [2022-02-20 19:40:26,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:26,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:26,168 INFO L74 IsIncluded]: Start isIncluded. First operand has 1206 states, 1204 states have (on average 1.7325581395348837) internal successors, (2086), 1205 states have internal predecessors, (2086), 0 states have call successors, (0), 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 1208 states. [2022-02-20 19:40:26,169 INFO L87 Difference]: Start difference. First operand has 1206 states, 1204 states have (on average 1.7325581395348837) internal successors, (2086), 1205 states have internal predecessors, (2086), 0 states have call successors, (0), 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 1208 states. [2022-02-20 19:40:26,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:26,230 INFO L93 Difference]: Finished difference Result 1208 states and 2087 transitions. [2022-02-20 19:40:26,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 2087 transitions. [2022-02-20 19:40:26,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:26,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:26,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:26,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:26,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1204 states have (on average 1.7325581395348837) internal successors, (2086), 1205 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have 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:40:26,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 2086 transitions. [2022-02-20 19:40:26,304 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 2086 transitions. Word has length 43 [2022-02-20 19:40:26,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:26,304 INFO L470 AbstractCegarLoop]: Abstraction has 1206 states and 2086 transitions. [2022-02-20 19:40:26,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 2086 transitions. [2022-02-20 19:40:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 19:40:26,305 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:26,306 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] [2022-02-20 19:40:26,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:40:26,306 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:26,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:26,307 INFO L85 PathProgramCache]: Analyzing trace with hash -602988295, now seen corresponding path program 1 times [2022-02-20 19:40:26,307 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:26,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311727487] [2022-02-20 19:40:26,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:26,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:26,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {32461#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;~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; {32461#true} is VALID [2022-02-20 19:40:26,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {32461#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {32461#true} is VALID [2022-02-20 19:40:26,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {32461#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {32461#true} is VALID [2022-02-20 19:40:26,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {32461#true} assume 0 == ~r1~0 % 256; {32461#true} is VALID [2022-02-20 19:40:26,435 INFO L290 TraceCheckUtils]: 4: Hoare triple {32461#true} assume ~id1~0 >= 0; {32461#true} is VALID [2022-02-20 19:40:26,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {32461#true} assume 0 == ~st1~0; {32461#true} is VALID [2022-02-20 19:40:26,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {32461#true} assume ~send1~0 == ~id1~0; {32461#true} is VALID [2022-02-20 19:40:26,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {32461#true} assume 0 == ~mode1~0 % 256; {32461#true} is VALID [2022-02-20 19:40:26,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {32461#true} assume ~id2~0 >= 0; {32461#true} is VALID [2022-02-20 19:40:26,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {32461#true} assume 0 == ~st2~0; {32461#true} is VALID [2022-02-20 19:40:26,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {32461#true} assume ~send2~0 == ~id2~0; {32461#true} is VALID [2022-02-20 19:40:26,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {32461#true} assume 0 == ~mode2~0 % 256; {32461#true} is VALID [2022-02-20 19:40:26,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {32461#true} assume ~id3~0 >= 0; {32461#true} is VALID [2022-02-20 19:40:26,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {32461#true} assume 0 == ~st3~0; {32461#true} is VALID [2022-02-20 19:40:26,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {32461#true} assume ~send3~0 == ~id3~0; {32461#true} is VALID [2022-02-20 19:40:26,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {32461#true} assume 0 == ~mode3~0 % 256; {32461#true} is VALID [2022-02-20 19:40:26,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {32461#true} assume ~id1~0 != ~id2~0; {32461#true} is VALID [2022-02-20 19:40:26,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {32461#true} assume ~id1~0 != ~id3~0; {32461#true} is VALID [2022-02-20 19:40:26,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {32461#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {32463#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 19:40:26,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {32463#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {32464#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 19:40:26,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {32464#(= |ULTIMATE.start_init_#res#1| 1)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {32465#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} is VALID [2022-02-20 19:40:26,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {32465#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} assume !(0 == assume_abort_if_not_~cond#1); {32461#true} is VALID [2022-02-20 19:40:26,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {32461#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;main1_~i2~0#1 := 0; {32461#true} is VALID [2022-02-20 19:40:26,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {32461#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; {32461#true} is VALID [2022-02-20 19:40:26,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {32461#true} assume !(0 != ~mode1~0 % 256); {32461#true} is VALID [2022-02-20 19:40:26,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {32461#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {32461#true} is VALID [2022-02-20 19:40:26,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {32461#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; {32461#true} is VALID [2022-02-20 19:40:26,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {32461#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; {32461#true} is VALID [2022-02-20 19:40:26,441 INFO L290 TraceCheckUtils]: 28: Hoare triple {32461#true} assume !(0 != ~mode2~0 % 256); {32461#true} is VALID [2022-02-20 19:40:26,441 INFO L290 TraceCheckUtils]: 29: Hoare triple {32461#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {32461#true} is VALID [2022-02-20 19:40:26,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {32461#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; {32461#true} is VALID [2022-02-20 19:40:26,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {32461#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; {32461#true} is VALID [2022-02-20 19:40:26,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {32461#true} assume !(0 != ~mode3~0 % 256); {32461#true} is VALID [2022-02-20 19:40:26,442 INFO L290 TraceCheckUtils]: 33: Hoare triple {32461#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {32461#true} is VALID [2022-02-20 19:40:26,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {32461#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; {32461#true} is VALID [2022-02-20 19:40:26,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {32461#true} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {32461#true} is VALID [2022-02-20 19:40:26,442 INFO L290 TraceCheckUtils]: 36: Hoare triple {32461#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {32461#true} is VALID [2022-02-20 19:40:26,442 INFO L290 TraceCheckUtils]: 37: Hoare triple {32461#true} assume !(~r1~0 % 256 >= 3); {32461#true} is VALID [2022-02-20 19:40:26,442 INFO L290 TraceCheckUtils]: 38: Hoare triple {32461#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {32461#true} is VALID [2022-02-20 19:40:26,443 INFO L290 TraceCheckUtils]: 39: Hoare triple {32461#true} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {32466#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 19:40:26,443 INFO L290 TraceCheckUtils]: 40: Hoare triple {32466#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {32467#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 19:40:26,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {32467#(not (= 0 |ULTIMATE.start_check_#res#1|))} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {32468#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 19:40:26,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {32468#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {32462#false} is VALID [2022-02-20 19:40:26,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {32462#false} assume !false; {32462#false} is VALID [2022-02-20 19:40:26,446 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:40:26,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:26,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311727487] [2022-02-20 19:40:26,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311727487] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:26,447 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:26,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:40:26,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880534436] [2022-02-20 19:40:26,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:26,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 19:40:26,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:26,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:40:26,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:26,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:40:26,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:26,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:40:26,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:40:26,481 INFO L87 Difference]: Start difference. First operand 1206 states and 2086 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:40:33,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:33,559 INFO L93 Difference]: Finished difference Result 1540 states and 2558 transitions. [2022-02-20 19:40:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:40:33,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 19:40:33,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:40:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1583 transitions. [2022-02-20 19:40:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:40:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1583 transitions. [2022-02-20 19:40:33,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1583 transitions. [2022-02-20 19:40:34,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1583 edges. 1583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:34,829 INFO L225 Difference]: With dead ends: 1540 [2022-02-20 19:40:34,830 INFO L226 Difference]: Without dead ends: 1538 [2022-02-20 19:40:34,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:40:34,831 INFO L933 BasicCegarLoop]: 1552 mSDtfsCounter, 396 mSDsluCounter, 8921 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 10473 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:34,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 10473 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:34,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-02-20 19:40:35,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1230. [2022-02-20 19:40:35,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:35,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1538 states. Second operand has 1230 states, 1228 states have (on average 1.714983713355049) internal successors, (2106), 1229 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have 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:40:35,146 INFO L74 IsIncluded]: Start isIncluded. First operand 1538 states. Second operand has 1230 states, 1228 states have (on average 1.714983713355049) internal successors, (2106), 1229 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have 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:40:35,149 INFO L87 Difference]: Start difference. First operand 1538 states. Second operand has 1230 states, 1228 states have (on average 1.714983713355049) internal successors, (2106), 1229 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have 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:40:35,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:35,228 INFO L93 Difference]: Finished difference Result 1538 states and 2545 transitions. [2022-02-20 19:40:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2545 transitions. [2022-02-20 19:40:35,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:35,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:35,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 1230 states, 1228 states have (on average 1.714983713355049) internal successors, (2106), 1229 states have internal predecessors, (2106), 0 states have call successors, (0), 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 1538 states. [2022-02-20 19:40:35,234 INFO L87 Difference]: Start difference. First operand has 1230 states, 1228 states have (on average 1.714983713355049) internal successors, (2106), 1229 states have internal predecessors, (2106), 0 states have call successors, (0), 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 1538 states. [2022-02-20 19:40:35,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:35,310 INFO L93 Difference]: Finished difference Result 1538 states and 2545 transitions. [2022-02-20 19:40:35,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2545 transitions. [2022-02-20 19:40:35,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:35,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:35,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:35,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:35,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1228 states have (on average 1.714983713355049) internal successors, (2106), 1229 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have 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:40:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2106 transitions. [2022-02-20 19:40:35,355 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2106 transitions. Word has length 44 [2022-02-20 19:40:35,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:35,355 INFO L470 AbstractCegarLoop]: Abstraction has 1230 states and 2106 transitions. [2022-02-20 19:40:35,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:40:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2106 transitions. [2022-02-20 19:40:35,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 19:40:35,356 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:35,356 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] [2022-02-20 19:40:35,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:40:35,356 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:35,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1900121563, now seen corresponding path program 1 times [2022-02-20 19:40:35,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:35,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130704748] [2022-02-20 19:40:35,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:35,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {38622#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;~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; {38622#true} is VALID [2022-02-20 19:40:35,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {38622#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {38622#true} is VALID [2022-02-20 19:40:35,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {38622#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {38622#true} is VALID [2022-02-20 19:40:35,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {38622#true} assume 0 == ~r1~0 % 256; {38622#true} is VALID [2022-02-20 19:40:35,391 INFO L290 TraceCheckUtils]: 4: Hoare triple {38622#true} assume ~id1~0 >= 0; {38622#true} is VALID [2022-02-20 19:40:35,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {38622#true} assume 0 == ~st1~0; {38622#true} is VALID [2022-02-20 19:40:35,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {38622#true} assume ~send1~0 == ~id1~0; {38622#true} is VALID [2022-02-20 19:40:35,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {38622#true} assume 0 == ~mode1~0 % 256; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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;main1_~i2~0#1 := 0; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {38624#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {38623#false} is VALID [2022-02-20 19:40:35,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {38623#false} assume !(255 == ~r1~0 % 256); {38623#false} is VALID [2022-02-20 19:40:35,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {38623#false} ~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {38623#false} is VALID [2022-02-20 19:40:35,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {38623#false} assume node1_~m1~0#1 != ~nomsg~0; {38623#false} is VALID [2022-02-20 19:40:35,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {38623#false} assume !(node1_~m1~0#1 > ~id1~0); {38623#false} is VALID [2022-02-20 19:40:35,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {38623#false} assume node1_~m1~0#1 == ~id1~0;~st1~0 := 1; {38623#false} is VALID [2022-02-20 19:40:35,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {38623#false} ~mode1~0 := 0; {38623#false} is VALID [2022-02-20 19:40:35,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {38623#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; {38623#false} is VALID [2022-02-20 19:40:35,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {38623#false} assume !(0 != ~mode2~0 % 256); {38623#false} is VALID [2022-02-20 19:40:35,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {38623#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {38623#false} is VALID [2022-02-20 19:40:35,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {38623#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; {38623#false} is VALID [2022-02-20 19:40:35,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {38623#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; {38623#false} is VALID [2022-02-20 19:40:35,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {38623#false} assume !(0 != ~mode3~0 % 256); {38623#false} is VALID [2022-02-20 19:40:35,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {38623#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {38623#false} is VALID [2022-02-20 19:40:35,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {38623#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; {38623#false} is VALID [2022-02-20 19:40:35,403 INFO L290 TraceCheckUtils]: 39: Hoare triple {38623#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {38623#false} is VALID [2022-02-20 19:40:35,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {38623#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {38623#false} is VALID [2022-02-20 19:40:35,403 INFO L290 TraceCheckUtils]: 41: Hoare triple {38623#false} check_#res#1 := check_~tmp~1#1; {38623#false} is VALID [2022-02-20 19:40:35,403 INFO L290 TraceCheckUtils]: 42: Hoare triple {38623#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {38623#false} is VALID [2022-02-20 19:40:35,403 INFO L290 TraceCheckUtils]: 43: Hoare triple {38623#false} assume 0 == assert_~arg#1 % 256; {38623#false} is VALID [2022-02-20 19:40:35,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {38623#false} assume !false; {38623#false} is VALID [2022-02-20 19:40:35,404 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:40:35,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:35,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130704748] [2022-02-20 19:40:35,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130704748] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:35,404 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:35,405 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:35,405 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087553390] [2022-02-20 19:40:35,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:35,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 19:40:35,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:35,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:40:35,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:35,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:35,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:35,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:35,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:35,437 INFO L87 Difference]: Start difference. First operand 1230 states and 2106 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:40:37,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:37,619 INFO L93 Difference]: Finished difference Result 1701 states and 2784 transitions. [2022-02-20 19:40:37,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:37,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 19:40:37,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:40:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1625 transitions. [2022-02-20 19:40:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:40:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1625 transitions. [2022-02-20 19:40:37,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1625 transitions.