/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:34:44,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:34:44,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:34:45,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:34:45,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:34:45,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:34:45,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:34:45,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:34:45,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:34:45,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:34:45,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:34:45,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:34:45,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:34:45,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:34:45,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:34:45,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:34:45,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:34:45,072 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:34:45,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:34:45,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:34:45,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:34:45,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:34:45,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:34:45,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:34:45,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:34:45,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:34:45,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:34:45,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:34:45,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:34:45,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:34:45,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:34:45,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:34:45,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:34:45,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:34:45,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:34:45,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:34:45,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:34:45,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:34:45,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:34:45,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:34:45,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:34:45,121 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-15 21:34:45,177 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:34:45,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:34:45,178 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:34:45,179 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:34:45,181 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:34:45,181 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:34:45,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:34:45,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:34:45,185 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:34:45,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:34:45,187 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:34:45,187 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:34:45,187 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:34:45,187 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:34:45,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:34:45,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:34:45,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:34:45,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:34:45,189 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:34:45,189 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:34:45,189 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:34:45,189 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:34:45,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:34:45,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:34:45,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:34:45,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:34:45,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:34:45,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:34:45,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:34:45,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:34:45,192 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:34:45,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:34:45,193 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:34:45,193 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 [2022-10-15 21:34:45,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:34:45,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:34:45,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:34:45,726 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:34:45,727 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:34:45,728 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-15 21:34:45,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeee42e29/f1a0bafb328d45dd9c62fa9f95a50202/FLAG2bba6ed2d [2022-10-15 21:34:46,745 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:34:46,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-15 21:34:46,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeee42e29/f1a0bafb328d45dd9c62fa9f95a50202/FLAG2bba6ed2d [2022-10-15 21:34:47,249 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeee42e29/f1a0bafb328d45dd9c62fa9f95a50202 [2022-10-15 21:34:47,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:34:47,259 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:34:47,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:34:47,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:34:47,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:34:47,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:34:47" (1/1) ... [2022-10-15 21:34:47,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd94c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:34:47, skipping insertion in model container [2022-10-15 21:34:47,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:34:47" (1/1) ... [2022-10-15 21:34:47,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:34:47,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:34:48,359 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/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i[120657,120670] [2022-10-15 21:34:48,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:34:48,418 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:34:48,712 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/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i[120657,120670] [2022-10-15 21:34:48,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:34:48,848 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:34:48,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:34:48 WrapperNode [2022-10-15 21:34:48,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:34:48,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:34:48,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:34:48,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:34:48,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:34:48" (1/1) ... [2022-10-15 21:34:48,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:34:48" (1/1) ... [2022-10-15 21:34:49,108 INFO L138 Inliner]: procedures = 150, calls = 816, calls flagged for inlining = 62, calls inlined = 44, statements flattened = 1723 [2022-10-15 21:34:49,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:34:49,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:34:49,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:34:49,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:34:49,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:34:48" (1/1) ... [2022-10-15 21:34:49,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:34:48" (1/1) ... [2022-10-15 21:34:49,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:34:48" (1/1) ... [2022-10-15 21:34:49,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:34:48" (1/1) ... [2022-10-15 21:34:49,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:34:48" (1/1) ... [2022-10-15 21:34:49,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:34:48" (1/1) ... [2022-10-15 21:34:49,289 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:34:48" (1/1) ... [2022-10-15 21:34:49,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:34:48" (1/1) ... [2022-10-15 21:34:49,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:34:49,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:34:49,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:34:49,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:34:49,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:34:48" (1/1) ... [2022-10-15 21:34:49,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:34:49,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:34:49,464 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-10-15 21:34:49,535 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-10-15 21:34:49,596 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-10-15 21:34:49,596 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-10-15 21:34:49,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-10-15 21:34:49,597 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add [2022-10-15 21:34:49,597 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_add [2022-10-15 21:34:49,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-10-15 21:34:49,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-10-15 21:34:49,598 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-10-15 21:34:49,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-10-15 21:34:49,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 21:34:49,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-10-15 21:34:49,599 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-10-15 21:34:49,599 INFO L130 BoogieDeclarations]: Found specification of procedure aem_init_ipmi_data [2022-10-15 21:34:49,599 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_init_ipmi_data [2022-10-15 21:34:49,599 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2022-10-15 21:34:49,600 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2022-10-15 21:34:49,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-15 21:34:49,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-15 21:34:49,600 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-10-15 21:34:49,600 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-10-15 21:34:49,600 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-10-15 21:34:49,601 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-10-15 21:34:49,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 21:34:49,601 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-10-15 21:34:49,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-10-15 21:34:49,601 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-10-15 21:34:49,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-10-15 21:34:49,602 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-15 21:34:49,602 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-15 21:34:49,602 INFO L130 BoogieDeclarations]: Found specification of procedure aem_delete [2022-10-15 21:34:49,602 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_delete [2022-10-15 21:34:49,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 21:34:49,602 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-10-15 21:34:49,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-10-15 21:34:49,603 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file [2022-10-15 21:34:49,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file [2022-10-15 21:34:49,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:34:49,603 INFO L130 BoogieDeclarations]: Found specification of procedure aem_idr_get [2022-10-15 21:34:49,603 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_idr_get [2022-10-15 21:34:49,604 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2022-10-15 21:34:49,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2022-10-15 21:34:49,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-10-15 21:34:49,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-10-15 21:34:49,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 21:34:49,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 21:34:49,604 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-10-15 21:34:49,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 21:34:49,605 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_register [2022-10-15 21:34:49,605 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_register [2022-10-15 21:34:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-10-15 21:34:49,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-10-15 21:34:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_unregister [2022-10-15 21:34:49,607 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_unregister [2022-10-15 21:34:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kzalloc_6 [2022-10-15 21:34:49,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kzalloc_6 [2022-10-15 21:34:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure aem_send_message [2022-10-15 21:34:49,609 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_send_message [2022-10-15 21:34:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure driver_unregister [2022-10-15 21:34:49,610 INFO L138 BoogieDeclarations]: Found implementation of procedure driver_unregister [2022-10-15 21:34:49,610 INFO L130 BoogieDeclarations]: Found specification of procedure aem_register_sensors [2022-10-15 21:34:49,610 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_register_sensors [2022-10-15 21:34:49,611 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-10-15 21:34:49,611 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-10-15 21:34:49,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 21:34:49,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-15 21:34:49,611 INFO L130 BoogieDeclarations]: Found specification of procedure aem_idr_put [2022-10-15 21:34:49,611 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_idr_put [2022-10-15 21:34:49,612 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2022-10-15 21:34:49,612 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2022-10-15 21:34:49,613 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-10-15 21:34:49,613 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-10-15 21:34:49,613 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-10-15 21:34:49,614 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-10-15 21:34:49,615 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-10-15 21:34:49,615 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-10-15 21:34:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:34:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2022-10-15 21:34:49,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2022-10-15 21:34:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-10-15 21:34:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-10-15 21:34:49,617 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-10-15 21:34:49,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:34:49,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:34:49,617 INFO L130 BoogieDeclarations]: Found specification of procedure aem_remove_sensors [2022-10-15 21:34:49,617 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_remove_sensors [2022-10-15 21:34:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_alloc [2022-10-15 21:34:49,618 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_alloc [2022-10-15 21:34:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-10-15 21:34:49,618 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-10-15 21:34:50,107 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:34:50,111 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:34:50,253 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-10-15 21:34:53,163 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:34:53,178 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:34:53,178 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 21:34:53,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:34:53 BoogieIcfgContainer [2022-10-15 21:34:53,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:34:53,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:34:53,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:34:53,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:34:53,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:34:47" (1/3) ... [2022-10-15 21:34:53,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7bfa6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:34:53, skipping insertion in model container [2022-10-15 21:34:53,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:34:48" (2/3) ... [2022-10-15 21:34:53,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7bfa6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:34:53, skipping insertion in model container [2022-10-15 21:34:53,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:34:53" (3/3) ... [2022-10-15 21:34:53,191 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-15 21:34:53,213 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:34:53,214 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-10-15 21:34:53,306 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:34:53,318 INFO L357 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=FINITE_AUTOMATA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@130cf507, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:34:53,319 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-10-15 21:34:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 510 states, 352 states have (on average 1.3153409090909092) internal successors, (463), 380 states have internal predecessors, (463), 102 states have call successors, (102), 36 states have call predecessors, (102), 35 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2022-10-15 21:34:53,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-10-15 21:34:53,351 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:53,352 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 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-10-15 21:34:53,353 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [aem_send_messageErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, aem_send_messageErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-15 21:34:53,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:53,362 INFO L85 PathProgramCache]: Analyzing trace with hash 881680937, now seen corresponding path program 1 times [2022-10-15 21:34:53,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:53,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619102825] [2022-10-15 21:34:53,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:53,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:34:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:34:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:34:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:34:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:34:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:34:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-15 21:34:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:34:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-15 21:34:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:34:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 21:34:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:34:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:34:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:34:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-10-15 21:34:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:34:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-10-15 21:34:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:34:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-10-15 21:34:54,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:54,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619102825] [2022-10-15 21:34:54,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619102825] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:34:54,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:34:54,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:34:54,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759679476] [2022-10-15 21:34:54,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:34:54,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:34:54,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:54,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:34:54,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:34:54,468 INFO L87 Difference]: Start difference. First operand has 510 states, 352 states have (on average 1.3153409090909092) internal successors, (463), 380 states have internal predecessors, (463), 102 states have call successors, (102), 36 states have call predecessors, (102), 35 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:34:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:34:56,979 INFO L93 Difference]: Finished difference Result 1055 states and 1406 transitions. [2022-10-15 21:34:56,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:34:56,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 147 [2022-10-15 21:34:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:34:57,010 INFO L225 Difference]: With dead ends: 1055 [2022-10-15 21:34:57,011 INFO L226 Difference]: Without dead ends: 534 [2022-10-15 21:34:57,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:34:57,026 INFO L413 NwaCegarLoop]: 626 mSDtfsCounter, 282 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-10-15 21:34:57,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 929 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-10-15 21:34:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-10-15 21:34:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 495. [2022-10-15 21:34:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 344 states have (on average 1.2936046511627908) internal successors, (445), 365 states have internal predecessors, (445), 96 states have call successors, (96), 35 states have call predecessors, (96), 35 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2022-10-15 21:34:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 637 transitions. [2022-10-15 21:34:57,181 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 637 transitions. Word has length 147 [2022-10-15 21:34:57,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:34:57,183 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 637 transitions. [2022-10-15 21:34:57,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:34:57,184 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 637 transitions. [2022-10-15 21:34:57,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-10-15 21:34:57,191 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:34:57,192 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 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-10-15 21:34:57,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:34:57,193 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [aem_send_messageErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, aem_send_messageErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-15 21:34:57,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:34:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1596057129, now seen corresponding path program 1 times [2022-10-15 21:34:57,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:34:57,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192216408] [2022-10-15 21:34:57,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:34:57,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:34:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:34:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:34:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:34:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:34:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:34:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:34:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-15 21:34:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:34:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-15 21:34:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:34:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 21:34:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:34:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:34:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:34:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-10-15 21:34:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:57,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:34:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:58,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-10-15 21:34:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:58,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:34:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:58,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:34:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:34:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-10-15 21:34:58,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:34:58,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192216408] [2022-10-15 21:34:58,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192216408] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:34:58,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:34:58,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:34:58,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379113770] [2022-10-15 21:34:58,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:34:58,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:34:58,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:34:58,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:34:58,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:34:58,042 INFO L87 Difference]: Start difference. First operand 495 states and 637 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:34:59,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-15 21:35:02,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:02,522 INFO L93 Difference]: Finished difference Result 541 states and 698 transitions. [2022-10-15 21:35:02,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:35:02,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 147 [2022-10-15 21:35:02,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:02,538 INFO L225 Difference]: With dead ends: 541 [2022-10-15 21:35:02,539 INFO L226 Difference]: Without dead ends: 539 [2022-10-15 21:35:02,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:35:02,541 INFO L413 NwaCegarLoop]: 599 mSDtfsCounter, 172 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:02,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1468 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-10-15 21:35:02,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-10-15 21:35:02,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 500. [2022-10-15 21:35:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 349 states have (on average 1.2836676217765044) internal successors, (448), 368 states have internal predecessors, (448), 96 states have call successors, (96), 37 states have call predecessors, (96), 37 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2022-10-15 21:35:02,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 640 transitions. [2022-10-15 21:35:02,599 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 640 transitions. Word has length 147 [2022-10-15 21:35:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:02,601 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 640 transitions. [2022-10-15 21:35:02,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:35:02,601 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 640 transitions. [2022-10-15 21:35:02,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-10-15 21:35:02,603 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:02,604 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 21:35:02,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:35:02,604 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [aem_send_messageErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, aem_send_messageErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-15 21:35:02,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:02,605 INFO L85 PathProgramCache]: Analyzing trace with hash -507567047, now seen corresponding path program 1 times [2022-10-15 21:35:02,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:02,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26855226] [2022-10-15 21:35:02,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:02,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-15 21:35:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-15 21:35:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 21:35:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:35:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-10-15 21:35:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-10-15 21:35:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-10-15 21:35:03,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:03,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26855226] [2022-10-15 21:35:03,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26855226] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:03,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:03,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:35:03,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643150264] [2022-10-15 21:35:03,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:03,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:35:03,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:03,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:35:03,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:35:03,317 INFO L87 Difference]: Start difference. First operand 500 states and 640 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:35:07,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:07,412 INFO L93 Difference]: Finished difference Result 539 states and 696 transitions. [2022-10-15 21:35:07,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:35:07,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 149 [2022-10-15 21:35:07,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:07,423 INFO L225 Difference]: With dead ends: 539 [2022-10-15 21:35:07,424 INFO L226 Difference]: Without dead ends: 538 [2022-10-15 21:35:07,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:35:07,428 INFO L413 NwaCegarLoop]: 596 mSDtfsCounter, 184 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:07,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1820 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-10-15 21:35:07,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-10-15 21:35:07,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 499. [2022-10-15 21:35:07,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 349 states have (on average 1.2808022922636104) internal successors, (447), 367 states have internal predecessors, (447), 96 states have call successors, (96), 37 states have call predecessors, (96), 37 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2022-10-15 21:35:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 639 transitions. [2022-10-15 21:35:07,500 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 639 transitions. Word has length 149 [2022-10-15 21:35:07,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:07,504 INFO L495 AbstractCegarLoop]: Abstraction has 499 states and 639 transitions. [2022-10-15 21:35:07,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:35:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 639 transitions. [2022-10-15 21:35:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-10-15 21:35:07,514 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:07,516 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 21:35:07,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:35:07,516 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [aem_send_messageErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, aem_send_messageErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-15 21:35:07,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:07,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1445291020, now seen corresponding path program 1 times [2022-10-15 21:35:07,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:07,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868855659] [2022-10-15 21:35:07,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:07,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:07,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:07,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:07,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:07,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:07,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:07,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:07,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:07,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:07,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:07,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-15 21:35:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:08,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:08,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:08,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-15 21:35:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:08,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:08,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:08,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 21:35:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:08,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:08,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:08,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:35:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:08,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:08,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:08,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-10-15 21:35:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:08,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:08,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:08,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-10-15 21:35:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:08,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:08,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-10-15 21:35:08,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:08,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868855659] [2022-10-15 21:35:08,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868855659] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:08,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:08,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:35:08,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538254680] [2022-10-15 21:35:08,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:08,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:35:08,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:08,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:35:08,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:35:08,240 INFO L87 Difference]: Start difference. First operand 499 states and 639 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:35:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:11,571 INFO L93 Difference]: Finished difference Result 538 states and 695 transitions. [2022-10-15 21:35:11,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:35:11,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 150 [2022-10-15 21:35:11,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:11,577 INFO L225 Difference]: With dead ends: 538 [2022-10-15 21:35:11,578 INFO L226 Difference]: Without dead ends: 537 [2022-10-15 21:35:11,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:35:11,580 INFO L413 NwaCegarLoop]: 604 mSDtfsCounter, 677 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:11,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 1414 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-10-15 21:35:11,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-10-15 21:35:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 498. [2022-10-15 21:35:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 349 states have (on average 1.2779369627507164) internal successors, (446), 366 states have internal predecessors, (446), 96 states have call successors, (96), 37 states have call predecessors, (96), 37 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2022-10-15 21:35:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 638 transitions. [2022-10-15 21:35:11,623 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 638 transitions. Word has length 150 [2022-10-15 21:35:11,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:11,624 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 638 transitions. [2022-10-15 21:35:11,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:35:11,624 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 638 transitions. [2022-10-15 21:35:11,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-10-15 21:35:11,629 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:11,629 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 21:35:11,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 21:35:11,630 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting aem_remove_sensorsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [aem_send_messageErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, aem_send_messageErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-15 21:35:11,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:11,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1478382912, now seen corresponding path program 1 times [2022-10-15 21:35:11,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:11,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136305246] [2022-10-15 21:35:11,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:11,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:11,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:11,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:11,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:11,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:11,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:11,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:11,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:11,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:11,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:11,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-15 21:35:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:11,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:11,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:11,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-15 21:35:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:11,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:11,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:11,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 21:35:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:12,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:12,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:12,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:35:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:12,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:12,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:12,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-10-15 21:35:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:12,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:12,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:12,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-10-15 21:35:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:12,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:12,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:12,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-10-15 21:35:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:12,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-10-15 21:35:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2022-10-15 21:35:12,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:12,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136305246] [2022-10-15 21:35:12,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136305246] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:12,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:12,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 21:35:12,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409344653] [2022-10-15 21:35:12,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:12,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:35:12,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:12,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:35:12,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:35:12,109 INFO L87 Difference]: Start difference. First operand 498 states and 638 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-10-15 21:35:15,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:15,426 INFO L93 Difference]: Finished difference Result 1133 states and 1448 transitions. [2022-10-15 21:35:15,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:35:15,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 184 [2022-10-15 21:35:15,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:15,434 INFO L225 Difference]: With dead ends: 1133 [2022-10-15 21:35:15,435 INFO L226 Difference]: Without dead ends: 683 [2022-10-15 21:35:15,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:35:15,439 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 592 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:15,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1448 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-10-15 21:35:15,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-10-15 21:35:15,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 637. [2022-10-15 21:35:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 449 states have (on average 1.2672605790645879) internal successors, (569), 466 states have internal predecessors, (569), 118 states have call successors, (118), 54 states have call predecessors, (118), 54 states have return successors, (118), 118 states have call predecessors, (118), 118 states have call successors, (118) [2022-10-15 21:35:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 805 transitions. [2022-10-15 21:35:15,493 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 805 transitions. Word has length 184 [2022-10-15 21:35:15,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:15,499 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 805 transitions. [2022-10-15 21:35:15,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-10-15 21:35:15,500 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 805 transitions. [2022-10-15 21:35:15,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-10-15 21:35:15,506 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:15,507 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 21:35:15,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 21:35:15,507 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting aem_remove_sensorsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [aem_send_messageErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, aem_send_messageErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-15 21:35:15,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:15,508 INFO L85 PathProgramCache]: Analyzing trace with hash -560766958, now seen corresponding path program 1 times [2022-10-15 21:35:15,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:15,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41358502] [2022-10-15 21:35:15,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:15,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-15 21:35:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-15 21:35:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 21:35:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:35:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:15,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-10-15 21:35:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:16,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:16,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:16,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-10-15 21:35:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:16,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:16,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:16,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-10-15 21:35:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:16,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-10-15 21:35:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:16,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-10-15 21:35:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:16,079 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2022-10-15 21:35:16,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:16,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41358502] [2022-10-15 21:35:16,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41358502] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:16,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:16,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 21:35:16,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826460193] [2022-10-15 21:35:16,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:16,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:35:16,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:16,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:35:16,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:35:16,087 INFO L87 Difference]: Start difference. First operand 637 states and 805 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-10-15 21:35:22,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:22,152 INFO L93 Difference]: Finished difference Result 1806 states and 2307 transitions. [2022-10-15 21:35:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:35:22,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 187 [2022-10-15 21:35:22,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:22,166 INFO L225 Difference]: With dead ends: 1806 [2022-10-15 21:35:22,166 INFO L226 Difference]: Without dead ends: 1217 [2022-10-15 21:35:22,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:35:22,172 INFO L413 NwaCegarLoop]: 1039 mSDtfsCounter, 814 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 413 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:22,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 2246 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-10-15 21:35:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2022-10-15 21:35:22,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1117. [2022-10-15 21:35:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 803 states have (on average 1.277708592777086) internal successors, (1026), 822 states have internal predecessors, (1026), 205 states have call successors, (205), 93 states have call predecessors, (205), 93 states have return successors, (205), 205 states have call predecessors, (205), 205 states have call successors, (205) [2022-10-15 21:35:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1436 transitions. [2022-10-15 21:35:22,285 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1436 transitions. Word has length 187 [2022-10-15 21:35:22,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:22,286 INFO L495 AbstractCegarLoop]: Abstraction has 1117 states and 1436 transitions. [2022-10-15 21:35:22,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-10-15 21:35:22,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1436 transitions. [2022-10-15 21:35:22,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-10-15 21:35:22,292 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:22,293 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 21:35:22,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 21:35:22,293 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting aem_remove_sensorsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [aem_send_messageErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, aem_send_messageErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-15 21:35:22,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:22,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1373705023, now seen corresponding path program 1 times [2022-10-15 21:35:22,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:22,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822498285] [2022-10-15 21:35:22,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:22,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-15 21:35:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-15 21:35:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 21:35:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:35:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-10-15 21:35:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-10-15 21:35:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-10-15 21:35:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-10-15 21:35:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,872 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2022-10-15 21:35:22,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:22,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822498285] [2022-10-15 21:35:22,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822498285] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:22,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:22,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:35:22,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437397906] [2022-10-15 21:35:22,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:22,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:35:22,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:22,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:35:22,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:35:22,876 INFO L87 Difference]: Start difference. First operand 1117 states and 1436 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-10-15 21:35:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:27,438 INFO L93 Difference]: Finished difference Result 2291 states and 2983 transitions. [2022-10-15 21:35:27,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:35:27,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 196 [2022-10-15 21:35:27,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:27,448 INFO L225 Difference]: With dead ends: 2291 [2022-10-15 21:35:27,448 INFO L226 Difference]: Without dead ends: 1222 [2022-10-15 21:35:27,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:35:27,453 INFO L413 NwaCegarLoop]: 587 mSDtfsCounter, 291 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:27,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1736 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-10-15 21:35:27,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2022-10-15 21:35:27,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1138. [2022-10-15 21:35:27,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 821 states have (on average 1.2752740560292326) internal successors, (1047), 840 states have internal predecessors, (1047), 208 states have call successors, (208), 93 states have call predecessors, (208), 93 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208) [2022-10-15 21:35:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1463 transitions. [2022-10-15 21:35:27,548 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1463 transitions. Word has length 196 [2022-10-15 21:35:27,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:27,549 INFO L495 AbstractCegarLoop]: Abstraction has 1138 states and 1463 transitions. [2022-10-15 21:35:27,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-10-15 21:35:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1463 transitions. [2022-10-15 21:35:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-10-15 21:35:27,554 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:27,554 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 21:35:27,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 21:35:27,555 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting aem_send_messageErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [aem_send_messageErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, aem_send_messageErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-15 21:35:27,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:27,555 INFO L85 PathProgramCache]: Analyzing trace with hash -983492622, now seen corresponding path program 1 times [2022-10-15 21:35:27,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:27,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406621005] [2022-10-15 21:35:27,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:27,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-15 21:35:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-15 21:35:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 21:35:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:35:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-10-15 21:35:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-10-15 21:35:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-10-15 21:35:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-10-15 21:35:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-10-15 21:35:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2022-10-15 21:35:28,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:28,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406621005] [2022-10-15 21:35:28,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406621005] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:28,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:28,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-15 21:35:28,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557838664] [2022-10-15 21:35:28,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:28,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 21:35:28,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:28,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 21:35:28,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:35:28,396 INFO L87 Difference]: Start difference. First operand 1138 states and 1463 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-10-15 21:35:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:33,586 INFO L93 Difference]: Finished difference Result 2533 states and 3331 transitions. [2022-10-15 21:35:33,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:35:33,586 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 200 [2022-10-15 21:35:33,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:33,600 INFO L225 Difference]: With dead ends: 2533 [2022-10-15 21:35:33,600 INFO L226 Difference]: Without dead ends: 1443 [2022-10-15 21:35:33,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:35:33,610 INFO L413 NwaCegarLoop]: 700 mSDtfsCounter, 376 mSDsluCounter, 2378 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 3078 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:33,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 3078 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-10-15 21:35:33,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2022-10-15 21:35:33,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1146. [2022-10-15 21:35:33,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 827 states have (on average 1.2732769044740024) internal successors, (1053), 846 states have internal predecessors, (1053), 208 states have call successors, (208), 93 states have call predecessors, (208), 95 states have return successors, (214), 210 states have call predecessors, (214), 208 states have call successors, (214) [2022-10-15 21:35:33,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1475 transitions. [2022-10-15 21:35:33,716 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1475 transitions. Word has length 200 [2022-10-15 21:35:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:33,717 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 1475 transitions. [2022-10-15 21:35:33,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-10-15 21:35:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1475 transitions. [2022-10-15 21:35:33,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-10-15 21:35:33,722 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:33,722 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 21:35:33,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 21:35:33,723 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting aem_send_messageErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [aem_send_messageErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, aem_send_messageErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-15 21:35:33,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:33,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1180006127, now seen corresponding path program 1 times [2022-10-15 21:35:33,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:33,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530825362] [2022-10-15 21:35:33,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:33,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-15 21:35:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-15 21:35:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 21:35:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:35:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-10-15 21:35:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-10-15 21:35:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-10-15 21:35:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:35,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-10-15 21:35:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:35,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-10-15 21:35:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2022-10-15 21:35:35,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:35,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530825362] [2022-10-15 21:35:35,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530825362] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:35:35,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695424619] [2022-10-15 21:35:35,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:35,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:35:35,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:35:35,072 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:35:35,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 21:35:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:35,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 2200 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-15 21:35:35,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:35:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2022-10-15 21:35:35,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:35:35,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695424619] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:35,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:35:35,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-10-15 21:35:35,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508564200] [2022-10-15 21:35:35,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:35,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:35:35,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:35,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:35:35,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:35:35,819 INFO L87 Difference]: Start difference. First operand 1146 states and 1475 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-10-15 21:35:35,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:35,984 INFO L93 Difference]: Finished difference Result 1823 states and 2331 transitions. [2022-10-15 21:35:35,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:35:35,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 200 [2022-10-15 21:35:35,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:35,991 INFO L225 Difference]: With dead ends: 1823 [2022-10-15 21:35:35,991 INFO L226 Difference]: Without dead ends: 717 [2022-10-15 21:35:35,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:35:35,999 INFO L413 NwaCegarLoop]: 631 mSDtfsCounter, 3 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:35,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1887 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:35:36,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-10-15 21:35:36,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 706. [2022-10-15 21:35:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 503 states have (on average 1.2584493041749503) internal successors, (633), 520 states have internal predecessors, (633), 126 states have call successors, (126), 60 states have call predecessors, (126), 61 states have return successors, (129), 127 states have call predecessors, (129), 126 states have call successors, (129) [2022-10-15 21:35:36,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 888 transitions. [2022-10-15 21:35:36,054 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 888 transitions. Word has length 200 [2022-10-15 21:35:36,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:36,056 INFO L495 AbstractCegarLoop]: Abstraction has 706 states and 888 transitions. [2022-10-15 21:35:36,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-10-15 21:35:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 888 transitions. [2022-10-15 21:35:36,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-10-15 21:35:36,060 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:36,061 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 21:35:36,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 21:35:36,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:35:36,275 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting aem_send_messageErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [aem_send_messageErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, aem_send_messageErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-15 21:35:36,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:36,276 INFO L85 PathProgramCache]: Analyzing trace with hash 480282904, now seen corresponding path program 1 times [2022-10-15 21:35:36,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:36,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324030398] [2022-10-15 21:35:36,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:36,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-15 21:35:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-15 21:35:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 21:35:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:35:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-10-15 21:35:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-10-15 21:35:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-10-15 21:35:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-10-15 21:35:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-10-15 21:35:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2022-10-15 21:35:37,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:37,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324030398] [2022-10-15 21:35:37,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324030398] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:35:37,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639686340] [2022-10-15 21:35:37,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:37,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:35:37,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:35:37,532 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:35:37,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 21:35:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:38,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 2217 conjuncts, 48 conjunts are in the unsatisfiable core [2022-10-15 21:35:38,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:35:38,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 55 [2022-10-15 21:35:38,846 INFO L356 Elim1Store]: treesize reduction 70, result has 27.8 percent of original size [2022-10-15 21:35:38,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 112 [2022-10-15 21:35:38,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 107 [2022-10-15 21:35:39,013 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-10-15 21:35:39,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 21:35:39,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-15 21:35:39,229 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-10-15 21:35:39,234 INFO L158 Benchmark]: Toolchain (without parser) took 51979.05ms. Allocated memory was 151.0MB in the beginning and 396.4MB in the end (delta: 245.4MB). Free memory was 118.6MB in the beginning and 121.6MB in the end (delta: -3.1MB). Peak memory consumption was 243.3MB. Max. memory is 8.0GB. [2022-10-15 21:35:39,235 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 151.0MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 21:35:39,235 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1586.81ms. Allocated memory is still 151.0MB. Free memory was 118.3MB in the beginning and 69.4MB in the end (delta: 48.9MB). Peak memory consumption was 48.9MB. Max. memory is 8.0GB.