/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 04:09:49,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 04:09:49,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 04:09:49,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 04:09:49,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 04:09:49,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 04:09:49,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 04:09:49,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 04:09:49,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 04:09:49,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 04:09:49,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 04:09:49,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 04:09:49,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 04:09:49,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 04:09:49,332 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 04:09:49,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 04:09:49,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 04:09:49,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 04:09:49,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 04:09:49,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 04:09:49,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 04:09:49,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 04:09:49,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 04:09:49,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 04:09:49,367 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 04:09:49,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 04:09:49,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 04:09:49,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 04:09:49,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 04:09:49,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 04:09:49,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 04:09:49,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 04:09:49,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 04:09:49,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 04:09:49,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 04:09:49,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 04:09:49,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 04:09:49,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 04:09:49,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 04:09:49,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 04:09:49,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 04:09:49,386 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 04:09:49,414 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 04:09:49,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 04:09:49,414 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 04:09:49,414 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 04:09:49,427 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 04:09:49,427 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 04:09:49,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 04:09:49,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 04:09:49,428 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 04:09:49,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 04:09:49,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 04:09:49,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 04:09:49,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 04:09:49,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 04:09:49,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 04:09:49,429 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 04:09:49,429 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 04:09:49,429 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 04:09:49,429 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 04:09:49,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 04:09:49,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 04:09:49,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 04:09:49,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 04:09:49,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 04:09:49,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 04:09:49,430 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 04:09:49,430 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 04:09:49,431 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 04:09:49,431 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 04:09:49,432 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 04:09:49,432 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 04:09:49,432 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 04:09:49,432 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 04:09:49,432 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 04:09:49,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 04:09:49,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 04:09:49,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 04:09:49,710 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 04:09:49,710 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 04:09:49,711 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-01-10 04:09:49,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b305c5e2/edf8a2fff68744aa8a3b9c9714d45ac8/FLAGa6ac6bbc0 [2022-01-10 04:09:50,199 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 04:09:50,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-01-10 04:09:50,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b305c5e2/edf8a2fff68744aa8a3b9c9714d45ac8/FLAGa6ac6bbc0 [2022-01-10 04:09:50,233 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b305c5e2/edf8a2fff68744aa8a3b9c9714d45ac8 [2022-01-10 04:09:50,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 04:09:50,236 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 04:09:50,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 04:09:50,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 04:09:50,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 04:09:50,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:09:50" (1/1) ... [2022-01-10 04:09:50,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f9cc27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:09:50, skipping insertion in model container [2022-01-10 04:09:50,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:09:50" (1/1) ... [2022-01-10 04:09:50,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 04:09:50,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 04:09:50,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2022-01-10 04:09:50,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 04:09:50,567 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 04:09:50,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2022-01-10 04:09:50,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 04:09:50,647 INFO L208 MainTranslator]: Completed translation [2022-01-10 04:09:50,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:09:50 WrapperNode [2022-01-10 04:09:50,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 04:09:50,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 04:09:50,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 04:09:50,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 04:09:50,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:09:50" (1/1) ... [2022-01-10 04:09:50,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:09:50" (1/1) ... [2022-01-10 04:09:50,720 INFO L137 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 400 [2022-01-10 04:09:50,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 04:09:50,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 04:09:50,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 04:09:50,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 04:09:50,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:09:50" (1/1) ... [2022-01-10 04:09:50,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:09:50" (1/1) ... [2022-01-10 04:09:50,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:09:50" (1/1) ... [2022-01-10 04:09:50,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:09:50" (1/1) ... [2022-01-10 04:09:50,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:09:50" (1/1) ... [2022-01-10 04:09:50,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:09:50" (1/1) ... [2022-01-10 04:09:50,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:09:50" (1/1) ... [2022-01-10 04:09:50,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 04:09:50,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 04:09:50,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 04:09:50,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 04:09:50,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:09:50" (1/1) ... [2022-01-10 04:09:50,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 04:09:50,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 04:09:50,808 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-01-10 04:09:50,835 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-01-10 04:09:50,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 04:09:50,850 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-01-10 04:09:50,850 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-01-10 04:09:50,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 04:09:50,850 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-01-10 04:09:50,850 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-01-10 04:09:50,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 04:09:50,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 04:09:50,986 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 04:09:50,988 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 04:09:51,026 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 04:09:51,035 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 04:09:51,036 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 04:09:51,266 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##82: assume !false; [2022-01-10 04:09:51,266 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##81: assume false; [2022-01-10 04:09:51,267 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !false; [2022-01-10 04:09:51,267 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume false; [2022-01-10 04:09:51,267 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2022-01-10 04:09:51,267 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2022-01-10 04:09:51,268 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 04:09:51,310 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-01-10 04:09:51,310 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-01-10 04:09:51,313 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 04:09:51,319 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 04:09:51,319 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 04:09:51,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:09:51 BoogieIcfgContainer [2022-01-10 04:09:51,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 04:09:51,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 04:09:51,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 04:09:51,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 04:09:51,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 04:09:50" (1/3) ... [2022-01-10 04:09:51,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5e55ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:09:51, skipping insertion in model container [2022-01-10 04:09:51,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:09:50" (2/3) ... [2022-01-10 04:09:51,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5e55ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:09:51, skipping insertion in model container [2022-01-10 04:09:51,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:09:51" (3/3) ... [2022-01-10 04:09:51,326 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2022-01-10 04:09:51,330 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 04:09:51,330 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 04:09:51,367 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 04:09:51,372 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 04:09:51,372 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 04:09:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 103 states have (on average 1.6116504854368932) internal successors, (166), 114 states have internal predecessors, (166), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-10 04:09:51,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 04:09:51,390 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:09:51,390 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:09:51,390 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:09:51,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:09:51,399 INFO L85 PathProgramCache]: Analyzing trace with hash -454322622, now seen corresponding path program 1 times [2022-01-10 04:09:51,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:09:51,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721544601] [2022-01-10 04:09:51,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:09:51,410 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:09:51,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:09:51,415 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:09:51,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 04:09:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:09:51,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:09:51,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:09:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:09:51,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:09:51,561 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:09:51,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721544601] [2022-01-10 04:09:51,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721544601] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:09:51,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:09:51,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:09:51,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813845386] [2022-01-10 04:09:51,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:09:51,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:09:51,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:09:51,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:09:51,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:51,598 INFO L87 Difference]: Start difference. First operand has 121 states, 103 states have (on average 1.6116504854368932) internal successors, (166), 114 states have internal predecessors, (166), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:09:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:09:51,654 INFO L93 Difference]: Finished difference Result 235 states and 382 transitions. [2022-01-10 04:09:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:09:51,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 04:09:51,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:09:51,663 INFO L225 Difference]: With dead ends: 235 [2022-01-10 04:09:51,663 INFO L226 Difference]: Without dead ends: 111 [2022-01-10 04:09:51,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:51,669 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 102 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:09:51,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 242 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:09:51,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-01-10 04:09:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-01-10 04:09:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.5052631578947369) internal successors, (143), 104 states have internal predecessors, (143), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 04:09:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2022-01-10 04:09:51,707 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 13 [2022-01-10 04:09:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:09:51,707 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2022-01-10 04:09:51,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:09:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2022-01-10 04:09:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 04:09:51,708 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:09:51,708 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:09:51,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-01-10 04:09:51,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:09:51,917 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:09:51,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:09:51,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1664019001, now seen corresponding path program 1 times [2022-01-10 04:09:51,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:09:51,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248404197] [2022-01-10 04:09:51,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:09:51,924 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:09:51,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:09:51,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:09:51,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 04:09:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:09:52,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:09:52,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:09:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:09:52,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:09:52,048 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:09:52,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248404197] [2022-01-10 04:09:52,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248404197] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:09:52,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:09:52,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:09:52,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833554194] [2022-01-10 04:09:52,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:09:52,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:09:52,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:09:52,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:09:52,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:52,051 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:09:52,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:09:52,137 INFO L93 Difference]: Finished difference Result 203 states and 288 transitions. [2022-01-10 04:09:52,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:09:52,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 04:09:52,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:09:52,139 INFO L225 Difference]: With dead ends: 203 [2022-01-10 04:09:52,139 INFO L226 Difference]: Without dead ends: 156 [2022-01-10 04:09:52,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:52,141 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 112 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:09:52,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 237 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:09:52,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-01-10 04:09:52,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2022-01-10 04:09:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 130 states have (on average 1.4230769230769231) internal successors, (185), 131 states have internal predecessors, (185), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 04:09:52,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 203 transitions. [2022-01-10 04:09:52,156 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 203 transitions. Word has length 16 [2022-01-10 04:09:52,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:09:52,156 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 203 transitions. [2022-01-10 04:09:52,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:09:52,156 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 203 transitions. [2022-01-10 04:09:52,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 04:09:52,157 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:09:52,157 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:09:52,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 04:09:52,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:09:52,366 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:09:52,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:09:52,367 INFO L85 PathProgramCache]: Analyzing trace with hash -45143919, now seen corresponding path program 1 times [2022-01-10 04:09:52,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:09:52,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90367184] [2022-01-10 04:09:52,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:09:52,368 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:09:52,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:09:52,369 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:09:52,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 04:09:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:09:52,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:09:52,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:09:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:09:52,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:09:52,475 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:09:52,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90367184] [2022-01-10 04:09:52,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90367184] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:09:52,475 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:09:52,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:09:52,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121558675] [2022-01-10 04:09:52,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:09:52,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:09:52,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:09:52,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:09:52,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:52,477 INFO L87 Difference]: Start difference. First operand 143 states and 203 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:09:52,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:09:52,515 INFO L93 Difference]: Finished difference Result 246 states and 339 transitions. [2022-01-10 04:09:52,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:09:52,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-01-10 04:09:52,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:09:52,519 INFO L225 Difference]: With dead ends: 246 [2022-01-10 04:09:52,519 INFO L226 Difference]: Without dead ends: 198 [2022-01-10 04:09:52,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:52,526 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 128 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:09:52,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 222 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:09:52,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-01-10 04:09:52,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 154. [2022-01-10 04:09:52,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 141 states have (on average 1.4113475177304964) internal successors, (199), 142 states have internal predecessors, (199), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 04:09:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 216 transitions. [2022-01-10 04:09:52,553 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 216 transitions. Word has length 17 [2022-01-10 04:09:52,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:09:52,553 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 216 transitions. [2022-01-10 04:09:52,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:09:52,553 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 216 transitions. [2022-01-10 04:09:52,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 04:09:52,555 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:09:52,555 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:09:52,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 04:09:52,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:09:52,756 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:09:52,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:09:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash 111527333, now seen corresponding path program 1 times [2022-01-10 04:09:52,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:09:52,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266935528] [2022-01-10 04:09:52,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:09:52,757 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:09:52,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:09:52,758 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:09:52,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 04:09:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:09:52,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 04:09:52,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:09:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:09:52,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:09:52,978 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:09:52,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266935528] [2022-01-10 04:09:52,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266935528] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:09:52,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:09:52,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 04:09:52,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294481358] [2022-01-10 04:09:52,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:09:52,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 04:09:52,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:09:52,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 04:09:52,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 04:09:52,981 INFO L87 Difference]: Start difference. First operand 154 states and 216 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:09:53,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:09:53,053 INFO L93 Difference]: Finished difference Result 157 states and 218 transitions. [2022-01-10 04:09:53,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 04:09:53,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 04:09:53,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:09:53,056 INFO L225 Difference]: With dead ends: 157 [2022-01-10 04:09:53,056 INFO L226 Difference]: Without dead ends: 154 [2022-01-10 04:09:53,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-01-10 04:09:53,059 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 142 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:09:53,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 249 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:09:53,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-01-10 04:09:53,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2022-01-10 04:09:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 141 states have (on average 1.4042553191489362) internal successors, (198), 142 states have internal predecessors, (198), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 04:09:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 215 transitions. [2022-01-10 04:09:53,079 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 215 transitions. Word has length 27 [2022-01-10 04:09:53,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:09:53,080 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 215 transitions. [2022-01-10 04:09:53,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:09:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 215 transitions. [2022-01-10 04:09:53,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 04:09:53,081 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:09:53,081 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:09:53,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 04:09:53,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:09:53,282 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:09:53,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:09:53,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1365306542, now seen corresponding path program 1 times [2022-01-10 04:09:53,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:09:53,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373442409] [2022-01-10 04:09:53,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:09:53,283 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:09:53,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:09:53,284 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:09:53,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 04:09:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:09:53,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:09:53,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:09:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:09:53,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:09:53,428 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:09:53,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373442409] [2022-01-10 04:09:53,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373442409] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:09:53,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:09:53,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:09:53,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544179340] [2022-01-10 04:09:53,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:09:53,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:09:53,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:09:53,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:09:53,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:53,431 INFO L87 Difference]: Start difference. First operand 154 states and 215 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:09:53,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:09:53,478 INFO L93 Difference]: Finished difference Result 200 states and 276 transitions. [2022-01-10 04:09:53,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:09:53,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-10 04:09:53,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:09:53,481 INFO L225 Difference]: With dead ends: 200 [2022-01-10 04:09:53,481 INFO L226 Difference]: Without dead ends: 152 [2022-01-10 04:09:53,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:53,483 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 5 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:09:53,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 269 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:09:53,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-01-10 04:09:53,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-01-10 04:09:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 140 states have (on average 1.3928571428571428) internal successors, (195), 140 states have internal predecessors, (195), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 8 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 04:09:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 211 transitions. [2022-01-10 04:09:53,498 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 211 transitions. Word has length 31 [2022-01-10 04:09:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:09:53,499 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 211 transitions. [2022-01-10 04:09:53,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:09:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 211 transitions. [2022-01-10 04:09:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 04:09:53,500 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:09:53,501 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:09:53,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 04:09:53,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:09:53,710 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:09:53,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:09:53,710 INFO L85 PathProgramCache]: Analyzing trace with hash 52355391, now seen corresponding path program 1 times [2022-01-10 04:09:53,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:09:53,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733618728] [2022-01-10 04:09:53,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:09:53,711 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:09:53,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:09:53,712 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:09:53,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 04:09:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:09:53,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:09:53,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:09:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:09:53,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:09:53,839 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:09:53,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733618728] [2022-01-10 04:09:53,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733618728] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:09:53,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:09:53,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:09:53,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793382528] [2022-01-10 04:09:53,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:09:53,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:09:53,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:09:53,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:09:53,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:53,841 INFO L87 Difference]: Start difference. First operand 152 states and 211 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:09:53,858 INFO L93 Difference]: Finished difference Result 214 states and 290 transitions. [2022-01-10 04:09:53,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:09:53,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-01-10 04:09:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:09:53,860 INFO L225 Difference]: With dead ends: 214 [2022-01-10 04:09:53,860 INFO L226 Difference]: Without dead ends: 161 [2022-01-10 04:09:53,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:53,861 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 67 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:09:53,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 285 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:09:53,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-01-10 04:09:53,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 145. [2022-01-10 04:09:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 133 states have (on average 1.3909774436090225) internal successors, (185), 133 states have internal predecessors, (185), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 04:09:53,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 200 transitions. [2022-01-10 04:09:53,869 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 200 transitions. Word has length 33 [2022-01-10 04:09:53,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:09:53,869 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 200 transitions. [2022-01-10 04:09:53,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:53,869 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 200 transitions. [2022-01-10 04:09:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 04:09:53,870 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:09:53,870 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:09:53,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 04:09:54,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:09:54,079 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:09:54,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:09:54,080 INFO L85 PathProgramCache]: Analyzing trace with hash -572632936, now seen corresponding path program 1 times [2022-01-10 04:09:54,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:09:54,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480318295] [2022-01-10 04:09:54,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:09:54,080 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:09:54,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:09:54,082 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:09:54,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 04:09:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:09:54,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 04:09:54,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:09:54,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:09:54,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:09:54,402 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:09:54,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480318295] [2022-01-10 04:09:54,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480318295] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:09:54,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:09:54,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 04:09:54,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572505899] [2022-01-10 04:09:54,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:09:54,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 04:09:54,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:09:54,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 04:09:54,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 04:09:54,404 INFO L87 Difference]: Start difference. First operand 145 states and 200 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:54,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:09:54,484 INFO L93 Difference]: Finished difference Result 191 states and 261 transitions. [2022-01-10 04:09:54,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 04:09:54,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-01-10 04:09:54,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:09:54,493 INFO L225 Difference]: With dead ends: 191 [2022-01-10 04:09:54,493 INFO L226 Difference]: Without dead ends: 145 [2022-01-10 04:09:54,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-01-10 04:09:54,494 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 131 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:09:54,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 241 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:09:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-01-10 04:09:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-01-10 04:09:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 133 states have (on average 1.3834586466165413) internal successors, (184), 133 states have internal predecessors, (184), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 04:09:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 199 transitions. [2022-01-10 04:09:54,505 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 199 transitions. Word has length 37 [2022-01-10 04:09:54,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:09:54,506 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 199 transitions. [2022-01-10 04:09:54,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 199 transitions. [2022-01-10 04:09:54,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 04:09:54,508 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:09:54,508 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:09:54,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 04:09:54,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:09:54,720 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:09:54,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:09:54,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1593142548, now seen corresponding path program 1 times [2022-01-10 04:09:54,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:09:54,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766809378] [2022-01-10 04:09:54,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:09:54,721 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:09:54,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:09:54,722 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:09:54,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 04:09:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:09:54,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 04:09:54,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:09:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:09:54,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:09:54,966 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:09:54,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766809378] [2022-01-10 04:09:54,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766809378] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:09:54,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:09:54,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 04:09:54,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923351548] [2022-01-10 04:09:54,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:09:54,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 04:09:54,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:09:54,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 04:09:54,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 04:09:54,968 INFO L87 Difference]: Start difference. First operand 145 states and 199 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:55,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:09:55,131 INFO L93 Difference]: Finished difference Result 167 states and 226 transitions. [2022-01-10 04:09:55,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 04:09:55,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-01-10 04:09:55,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:09:55,133 INFO L225 Difference]: With dead ends: 167 [2022-01-10 04:09:55,133 INFO L226 Difference]: Without dead ends: 145 [2022-01-10 04:09:55,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-01-10 04:09:55,134 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 179 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:09:55,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 460 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:09:55,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-01-10 04:09:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-01-10 04:09:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 04:09:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 198 transitions. [2022-01-10 04:09:55,142 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 198 transitions. Word has length 38 [2022-01-10 04:09:55,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:09:55,142 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 198 transitions. [2022-01-10 04:09:55,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:55,143 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 198 transitions. [2022-01-10 04:09:55,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 04:09:55,143 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:09:55,144 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:09:55,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-01-10 04:09:55,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:09:55,356 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:09:55,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:09:55,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1687313027, now seen corresponding path program 1 times [2022-01-10 04:09:55,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:09:55,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375241373] [2022-01-10 04:09:55,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:09:55,357 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:09:55,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:09:55,358 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:09:55,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 04:09:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:09:55,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:09:55,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:09:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:09:55,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:09:55,489 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:09:55,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375241373] [2022-01-10 04:09:55,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375241373] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:09:55,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:09:55,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:09:55,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350807247] [2022-01-10 04:09:55,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:09:55,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:09:55,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:09:55,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:09:55,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:55,491 INFO L87 Difference]: Start difference. First operand 145 states and 198 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:55,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:09:55,507 INFO L93 Difference]: Finished difference Result 213 states and 290 transitions. [2022-01-10 04:09:55,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:09:55,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-01-10 04:09:55,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:09:55,510 INFO L225 Difference]: With dead ends: 213 [2022-01-10 04:09:55,511 INFO L226 Difference]: Without dead ends: 161 [2022-01-10 04:09:55,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:55,513 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 5 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:09:55,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 281 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:09:55,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-01-10 04:09:55,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 151. [2022-01-10 04:09:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 139 states have (on average 1.3669064748201438) internal successors, (190), 139 states have internal predecessors, (190), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 04:09:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2022-01-10 04:09:55,524 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 205 transitions. Word has length 39 [2022-01-10 04:09:55,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:09:55,525 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 205 transitions. [2022-01-10 04:09:55,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 205 transitions. [2022-01-10 04:09:55,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 04:09:55,527 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:09:55,527 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:09:55,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 04:09:55,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:09:55,736 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:09:55,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:09:55,737 INFO L85 PathProgramCache]: Analyzing trace with hash -986248449, now seen corresponding path program 1 times [2022-01-10 04:09:55,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:09:55,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393778644] [2022-01-10 04:09:55,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:09:55,738 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:09:55,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:09:55,739 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:09:55,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 04:09:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:09:55,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 04:09:55,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:09:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:09:55,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:09:55,904 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:09:55,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393778644] [2022-01-10 04:09:55,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393778644] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:09:55,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:09:55,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 04:09:55,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330231605] [2022-01-10 04:09:55,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:09:55,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 04:09:55,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:09:55,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 04:09:55,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 04:09:55,906 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:55,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:09:55,945 INFO L93 Difference]: Finished difference Result 213 states and 288 transitions. [2022-01-10 04:09:55,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 04:09:55,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-01-10 04:09:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:09:55,948 INFO L225 Difference]: With dead ends: 213 [2022-01-10 04:09:55,948 INFO L226 Difference]: Without dead ends: 182 [2022-01-10 04:09:55,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 04:09:55,949 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 29 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:09:55,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 770 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:09:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-01-10 04:09:55,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 156. [2022-01-10 04:09:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 04:09:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 210 transitions. [2022-01-10 04:09:55,960 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 210 transitions. Word has length 39 [2022-01-10 04:09:55,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:09:55,960 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 210 transitions. [2022-01-10 04:09:55,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:55,960 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 210 transitions. [2022-01-10 04:09:55,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 04:09:55,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:09:55,961 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:09:55,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 04:09:56,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:09:56,171 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:09:56,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:09:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1635168586, now seen corresponding path program 1 times [2022-01-10 04:09:56,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:09:56,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884233314] [2022-01-10 04:09:56,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:09:56,172 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:09:56,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:09:56,173 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:09:56,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 04:09:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:09:56,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:09:56,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:09:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:09:56,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:09:56,300 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:09:56,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884233314] [2022-01-10 04:09:56,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884233314] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:09:56,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:09:56,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:09:56,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293847267] [2022-01-10 04:09:56,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:09:56,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:09:56,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:09:56,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:09:56,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:56,302 INFO L87 Difference]: Start difference. First operand 156 states and 210 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:56,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:09:56,319 INFO L93 Difference]: Finished difference Result 224 states and 302 transitions. [2022-01-10 04:09:56,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:09:56,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-01-10 04:09:56,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:09:56,322 INFO L225 Difference]: With dead ends: 224 [2022-01-10 04:09:56,322 INFO L226 Difference]: Without dead ends: 172 [2022-01-10 04:09:56,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:56,323 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 5 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:09:56,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 296 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:09:56,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-01-10 04:09:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 159. [2022-01-10 04:09:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 146 states have (on average 1.3493150684931507) internal successors, (197), 146 states have internal predecessors, (197), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 04:09:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 213 transitions. [2022-01-10 04:09:56,334 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 213 transitions. Word has length 40 [2022-01-10 04:09:56,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:09:56,334 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 213 transitions. [2022-01-10 04:09:56,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 213 transitions. [2022-01-10 04:09:56,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 04:09:56,335 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:09:56,335 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:09:56,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 04:09:56,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:09:56,544 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:09:56,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:09:56,545 INFO L85 PathProgramCache]: Analyzing trace with hash -934104008, now seen corresponding path program 1 times [2022-01-10 04:09:56,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:09:56,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973059397] [2022-01-10 04:09:56,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:09:56,545 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:09:56,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:09:56,546 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:09:56,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 04:09:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:09:56,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 04:09:56,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:09:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:09:56,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:09:56,707 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:09:56,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973059397] [2022-01-10 04:09:56,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973059397] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:09:56,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:09:56,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 04:09:56,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867608262] [2022-01-10 04:09:56,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:09:56,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 04:09:56,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:09:56,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 04:09:56,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 04:09:56,709 INFO L87 Difference]: Start difference. First operand 159 states and 213 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:56,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:09:56,756 INFO L93 Difference]: Finished difference Result 224 states and 300 transitions. [2022-01-10 04:09:56,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 04:09:56,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-01-10 04:09:56,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:09:56,758 INFO L225 Difference]: With dead ends: 224 [2022-01-10 04:09:56,759 INFO L226 Difference]: Without dead ends: 193 [2022-01-10 04:09:56,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 04:09:56,759 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 29 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:09:56,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 850 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:09:56,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-01-10 04:09:56,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 156. [2022-01-10 04:09:56,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 04:09:56,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 210 transitions. [2022-01-10 04:09:56,768 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 210 transitions. Word has length 40 [2022-01-10 04:09:56,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:09:56,769 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 210 transitions. [2022-01-10 04:09:56,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:56,769 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 210 transitions. [2022-01-10 04:09:56,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 04:09:56,770 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:09:56,770 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:09:56,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 04:09:56,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:09:56,979 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:09:56,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:09:56,980 INFO L85 PathProgramCache]: Analyzing trace with hash 368817782, now seen corresponding path program 1 times [2022-01-10 04:09:56,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:09:56,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404473349] [2022-01-10 04:09:56,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:09:56,980 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:09:56,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:09:56,982 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:09:56,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 04:09:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:09:57,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:09:57,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:09:57,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:09:57,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:09:57,114 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:09:57,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404473349] [2022-01-10 04:09:57,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404473349] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:09:57,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:09:57,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:09:57,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696223902] [2022-01-10 04:09:57,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:09:57,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:09:57,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:09:57,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:09:57,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:57,116 INFO L87 Difference]: Start difference. First operand 156 states and 210 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:57,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:09:57,183 INFO L93 Difference]: Finished difference Result 214 states and 286 transitions. [2022-01-10 04:09:57,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:09:57,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-01-10 04:09:57,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:09:57,185 INFO L225 Difference]: With dead ends: 214 [2022-01-10 04:09:57,185 INFO L226 Difference]: Without dead ends: 174 [2022-01-10 04:09:57,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:57,186 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 36 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:09:57,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 284 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:09:57,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-01-10 04:09:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 161. [2022-01-10 04:09:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 145 states have internal predecessors, (195), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2022-01-10 04:09:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 214 transitions. [2022-01-10 04:09:57,193 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 214 transitions. Word has length 40 [2022-01-10 04:09:57,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:09:57,193 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 214 transitions. [2022-01-10 04:09:57,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 214 transitions. [2022-01-10 04:09:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 04:09:57,194 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:09:57,194 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:09:57,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 04:09:57,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:09:57,404 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:09:57,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:09:57,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1582571415, now seen corresponding path program 1 times [2022-01-10 04:09:57,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:09:57,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837007673] [2022-01-10 04:09:57,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:09:57,405 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:09:57,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:09:57,406 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:09:57,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 04:09:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:09:57,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 04:09:57,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:09:57,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:09:57,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:09:57,555 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:09:57,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837007673] [2022-01-10 04:09:57,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837007673] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:09:57,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:09:57,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 04:09:57,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037583139] [2022-01-10 04:09:57,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:09:57,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 04:09:57,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:09:57,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 04:09:57,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 04:09:57,557 INFO L87 Difference]: Start difference. First operand 161 states and 214 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:57,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:09:57,603 INFO L93 Difference]: Finished difference Result 223 states and 294 transitions. [2022-01-10 04:09:57,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 04:09:57,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-01-10 04:09:57,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:09:57,605 INFO L225 Difference]: With dead ends: 223 [2022-01-10 04:09:57,605 INFO L226 Difference]: Without dead ends: 171 [2022-01-10 04:09:57,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 04:09:57,606 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 43 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:09:57,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 810 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:09:57,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-01-10 04:09:57,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 148. [2022-01-10 04:09:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 136 states have (on average 1.2794117647058822) internal successors, (174), 133 states have internal predecessors, (174), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (11), 11 states have call predecessors, (11), 4 states have call successors, (11) [2022-01-10 04:09:57,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2022-01-10 04:09:57,613 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 40 [2022-01-10 04:09:57,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:09:57,613 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2022-01-10 04:09:57,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2022-01-10 04:09:57,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 04:09:57,614 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:09:57,614 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:09:57,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-01-10 04:09:57,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:09:57,831 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:09:57,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:09:57,832 INFO L85 PathProgramCache]: Analyzing trace with hash -760530929, now seen corresponding path program 1 times [2022-01-10 04:09:57,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:09:57,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368179176] [2022-01-10 04:09:57,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:09:57,832 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:09:57,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:09:57,834 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:09:57,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-01-10 04:09:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:09:57,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:09:57,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:09:57,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:09:57,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:09:57,959 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:09:57,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368179176] [2022-01-10 04:09:57,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368179176] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:09:57,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:09:57,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:09:57,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480902763] [2022-01-10 04:09:57,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:09:57,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:09:57,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:09:57,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:09:57,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:57,961 INFO L87 Difference]: Start difference. First operand 148 states and 191 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:57,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:09:57,975 INFO L93 Difference]: Finished difference Result 158 states and 203 transitions. [2022-01-10 04:09:57,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:09:57,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-01-10 04:09:57,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:09:57,976 INFO L225 Difference]: With dead ends: 158 [2022-01-10 04:09:57,976 INFO L226 Difference]: Without dead ends: 42 [2022-01-10 04:09:57,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:57,979 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:09:57,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 133 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:09:57,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-10 04:09:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-01-10 04:09:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:57,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-01-10 04:09:57,982 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-01-10 04:09:57,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:09:57,982 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-01-10 04:09:57,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:57,982 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-01-10 04:09:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 04:09:57,983 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:09:57,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:09:57,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-01-10 04:09:58,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:09:58,192 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:09:58,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:09:58,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1689213541, now seen corresponding path program 1 times [2022-01-10 04:09:58,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:09:58,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465237869] [2022-01-10 04:09:58,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:09:58,193 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:09:58,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:09:58,194 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:09:58,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-01-10 04:09:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:09:58,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:09:58,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:09:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:09:58,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:09:58,321 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:09:58,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465237869] [2022-01-10 04:09:58,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465237869] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:09:58,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:09:58,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:09:58,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558579912] [2022-01-10 04:09:58,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:09:58,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:09:58,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:09:58,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:09:58,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:58,323 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:09:58,330 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-01-10 04:09:58,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:09:58,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-01-10 04:09:58,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:09:58,331 INFO L225 Difference]: With dead ends: 42 [2022-01-10 04:09:58,331 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 04:09:58,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:09:58,332 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:09:58,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:09:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 04:09:58,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 04:09:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:09:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 04:09:58,333 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2022-01-10 04:09:58,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:09:58,333 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 04:09:58,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:09:58,333 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 04:09:58,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 04:09:58,336 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 04:09:58,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-01-10 04:09:58,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:09:58,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 04:10:00,100 INFO L861 garLoopResultBuilder]: At program point errorFnENTRY(lines 577 584) the Hoare annotation is: true [2022-01-10 04:10:00,100 INFO L858 garLoopResultBuilder]: For program point errorFnFINAL(lines 577 584) no Hoare annotation was computed. [2022-01-10 04:10:00,100 INFO L858 garLoopResultBuilder]: For program point errorFnEXIT(lines 577 584) no Hoare annotation was computed. [2022-01-10 04:10:00,100 INFO L858 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-01-10 04:10:00,101 INFO L858 garLoopResultBuilder]: For program point L201(lines 201 205) no Hoare annotation was computed. [2022-01-10 04:10:00,101 INFO L858 garLoopResultBuilder]: For program point L135(lines 135 273) no Hoare annotation was computed. [2022-01-10 04:10:00,101 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 284) no Hoare annotation was computed. [2022-01-10 04:10:00,101 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 04:10:00,101 INFO L854 garLoopResultBuilder]: At program point L251(line 251) the Hoare annotation is: false [2022-01-10 04:10:00,101 INFO L858 garLoopResultBuilder]: For program point L251-1(lines 247 253) no Hoare annotation was computed. [2022-01-10 04:10:00,102 INFO L854 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: false [2022-01-10 04:10:00,102 INFO L854 garLoopResultBuilder]: At program point L103(lines 102 284) the Hoare annotation is: (and (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~MPR1~0 (_ bv5 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32))) [2022-01-10 04:10:00,102 INFO L854 garLoopResultBuilder]: At program point L70(lines 51 72) the Hoare annotation is: (and (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~MPR1~0 (_ bv5 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32))) [2022-01-10 04:10:00,102 INFO L854 garLoopResultBuilder]: At program point L384(lines 377 417) the Hoare annotation is: (and (= (_ bv3 32) ~SKIP1~0) (= ~MPR1~0 (_ bv5 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32))) [2022-01-10 04:10:00,102 INFO L854 garLoopResultBuilder]: At program point L285(lines 75 287) the Hoare annotation is: (and (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~MPR1~0 (_ bv5 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32))) [2022-01-10 04:10:00,102 INFO L858 garLoopResultBuilder]: For program point L153(lines 153 267) no Hoare annotation was computed. [2022-01-10 04:10:00,102 INFO L858 garLoopResultBuilder]: For program point L120(lines 120 278) no Hoare annotation was computed. [2022-01-10 04:10:00,102 INFO L854 garLoopResultBuilder]: At program point L236(line 236) the Hoare annotation is: false [2022-01-10 04:10:00,102 INFO L858 garLoopResultBuilder]: For program point L236-1(lines 232 238) no Hoare annotation was computed. [2022-01-10 04:10:00,102 INFO L858 garLoopResultBuilder]: For program point L550(lines 550 562) no Hoare annotation was computed. [2022-01-10 04:10:00,103 INFO L858 garLoopResultBuilder]: For program point L385(lines 369 418) no Hoare annotation was computed. [2022-01-10 04:10:00,103 INFO L858 garLoopResultBuilder]: For program point L352(lines 352 367) no Hoare annotation was computed. [2022-01-10 04:10:00,103 INFO L854 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: false [2022-01-10 04:10:00,103 INFO L854 garLoopResultBuilder]: At program point L187(lines 187 188) the Hoare annotation is: (and (= ~compRegistered~0 (_ bv1 32)) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~MPR1~0 (_ bv5 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32))) [2022-01-10 04:10:00,103 INFO L858 garLoopResultBuilder]: For program point L220-1(lines 216 222) no Hoare annotation was computed. [2022-01-10 04:10:00,103 INFO L858 garLoopResultBuilder]: For program point L187-1(lines 187 188) no Hoare annotation was computed. [2022-01-10 04:10:00,103 INFO L858 garLoopResultBuilder]: For program point L171(lines 171 183) no Hoare annotation was computed. [2022-01-10 04:10:00,103 INFO L858 garLoopResultBuilder]: For program point L138(lines 138 272) no Hoare annotation was computed. [2022-01-10 04:10:00,104 INFO L858 garLoopResultBuilder]: For program point L105(lines 105 283) no Hoare annotation was computed. [2022-01-10 04:10:00,104 INFO L854 garLoopResultBuilder]: At program point L551(lines 550 562) the Hoare annotation is: (and (= ~compRegistered~0 (_ bv1 32)) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~MPR1~0 (_ bv5 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= |ULTIMATE.start_KbFilter_PnP_~__cil_tmp23~0#1| ((_ sign_extend 32) (_ bv259 32)))) [2022-01-10 04:10:00,105 INFO L858 garLoopResultBuilder]: For program point L386(lines 386 415) no Hoare annotation was computed. [2022-01-10 04:10:00,105 INFO L854 garLoopResultBuilder]: At program point L353(lines 352 367) the Hoare annotation is: (and (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~MPR1~0 (_ bv5 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32))) [2022-01-10 04:10:00,106 INFO L858 garLoopResultBuilder]: For program point L370(lines 370 374) no Hoare annotation was computed. [2022-01-10 04:10:00,106 INFO L854 garLoopResultBuilder]: At program point L106(lines 105 283) the Hoare annotation is: (and (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~MPR1~0 (_ bv5 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32))) [2022-01-10 04:10:00,106 INFO L861 garLoopResultBuilder]: At program point L420(lines 288 422) the Hoare annotation is: true [2022-01-10 04:10:00,106 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 414) no Hoare annotation was computed. [2022-01-10 04:10:00,106 INFO L858 garLoopResultBuilder]: For program point L156(lines 156 266) no Hoare annotation was computed. [2022-01-10 04:10:00,106 INFO L858 garLoopResultBuilder]: For program point L123(lines 123 277) no Hoare annotation was computed. [2022-01-10 04:10:00,106 INFO L854 garLoopResultBuilder]: At program point L536(lines 528 547) the Hoare annotation is: false [2022-01-10 04:10:00,107 INFO L858 garLoopResultBuilder]: For program point L404(lines 404 412) no Hoare annotation was computed. [2022-01-10 04:10:00,108 INFO L854 garLoopResultBuilder]: At program point L173(line 173) the Hoare annotation is: false [2022-01-10 04:10:00,108 INFO L854 garLoopResultBuilder]: At program point L553(lines 552 562) the Hoare annotation is: (and (= ~compRegistered~0 (_ bv1 32)) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~MPR1~0 (_ bv5 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= |ULTIMATE.start_KbFilter_PnP_~__cil_tmp23~0#1| ((_ sign_extend 32) (_ bv259 32)))) [2022-01-10 04:10:00,108 INFO L858 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2022-01-10 04:10:00,109 INFO L854 garLoopResultBuilder]: At program point L355(lines 354 367) the Hoare annotation is: (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) [2022-01-10 04:10:00,109 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 04:10:00,109 INFO L858 garLoopResultBuilder]: For program point L405(lines 405 407) no Hoare annotation was computed. [2022-01-10 04:10:00,109 INFO L858 garLoopResultBuilder]: For program point L141(lines 141 271) no Hoare annotation was computed. [2022-01-10 04:10:00,109 INFO L858 garLoopResultBuilder]: For program point L108(lines 108 282) no Hoare annotation was computed. [2022-01-10 04:10:00,109 INFO L858 garLoopResultBuilder]: For program point L389(lines 389 391) no Hoare annotation was computed. [2022-01-10 04:10:00,109 INFO L858 garLoopResultBuilder]: For program point L323(lines 323 368) no Hoare annotation was computed. [2022-01-10 04:10:00,109 INFO L854 garLoopResultBuilder]: At program point L323-1(lines 297 421) the Hoare annotation is: (and (= (_ bv3 32) ~SKIP1~0) (= ~MPR1~0 (_ bv5 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32))) [2022-01-10 04:10:00,109 INFO L854 garLoopResultBuilder]: At program point L257(lines 257 258) the Hoare annotation is: (and (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~MPR1~0 (_ bv5 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= ~s~0 (_ bv3 32))) [2022-01-10 04:10:00,109 INFO L858 garLoopResultBuilder]: For program point L257-1(lines 257 258) no Hoare annotation was computed. [2022-01-10 04:10:00,109 INFO L858 garLoopResultBuilder]: For program point L505(lines 505 511) no Hoare annotation was computed. [2022-01-10 04:10:00,109 INFO L858 garLoopResultBuilder]: For program point L340(lines 340 345) no Hoare annotation was computed. [2022-01-10 04:10:00,109 INFO L858 garLoopResultBuilder]: For program point L340-2(lines 339 349) no Hoare annotation was computed. [2022-01-10 04:10:00,110 INFO L854 garLoopResultBuilder]: At program point L109(lines 108 282) the Hoare annotation is: (and (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~MPR1~0 (_ bv5 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32))) [2022-01-10 04:10:00,110 INFO L858 garLoopResultBuilder]: For program point L192(lines 192 198) no Hoare annotation was computed. [2022-01-10 04:10:00,110 INFO L858 garLoopResultBuilder]: For program point L159(lines 159 265) no Hoare annotation was computed. [2022-01-10 04:10:00,110 INFO L858 garLoopResultBuilder]: For program point L126(lines 126 276) no Hoare annotation was computed. [2022-01-10 04:10:00,110 INFO L858 garLoopResultBuilder]: For program point L192-2(lines 166 261) no Hoare annotation was computed. [2022-01-10 04:10:00,110 INFO L854 garLoopResultBuilder]: At program point L242(line 242) the Hoare annotation is: (and (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~MPR1~0 (_ bv5 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= ~s~0 (_ bv3 32))) [2022-01-10 04:10:00,110 INFO L858 garLoopResultBuilder]: For program point L242-1(line 242) no Hoare annotation was computed. [2022-01-10 04:10:00,110 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 182) no Hoare annotation was computed. [2022-01-10 04:10:00,110 INFO L858 garLoopResultBuilder]: For program point L176-1(lines 171 183) no Hoare annotation was computed. [2022-01-10 04:10:00,110 INFO L854 garLoopResultBuilder]: At program point L523(lines 523 564) the Hoare annotation is: (and (= ~compRegistered~0 (_ bv1 32)) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~MPR1~0 (_ bv5 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= |ULTIMATE.start_KbFilter_PnP_~__cil_tmp23~0#1| ((_ sign_extend 32) (_ bv259 32)))) [2022-01-10 04:10:00,110 INFO L854 garLoopResultBuilder]: At program point L226(lines 226 227) the Hoare annotation is: (and (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~MPR1~0 (_ bv5 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= ~s~0 (_ bv3 32))) [2022-01-10 04:10:00,110 INFO L858 garLoopResultBuilder]: For program point L226-1(lines 226 227) no Hoare annotation was computed. [2022-01-10 04:10:00,111 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 04:10:00,111 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 270) no Hoare annotation was computed. [2022-01-10 04:10:00,111 INFO L858 garLoopResultBuilder]: For program point L111(lines 111 281) no Hoare annotation was computed. [2022-01-10 04:10:00,112 INFO L858 garLoopResultBuilder]: For program point L541(lines 541 545) no Hoare annotation was computed. [2022-01-10 04:10:00,112 INFO L858 garLoopResultBuilder]: For program point L541-1(lines 528 547) no Hoare annotation was computed. [2022-01-10 04:10:00,112 INFO L858 garLoopResultBuilder]: For program point L409(lines 409 411) no Hoare annotation was computed. [2022-01-10 04:10:00,112 INFO L854 garLoopResultBuilder]: At program point L376(lines 369 418) the Hoare annotation is: (and (= (_ bv3 32) ~SKIP1~0) (= ~MPR1~0 (_ bv5 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32))) [2022-01-10 04:10:00,112 INFO L854 garLoopResultBuilder]: At program point L178(line 178) the Hoare annotation is: false [2022-01-10 04:10:00,112 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 264) no Hoare annotation was computed. [2022-01-10 04:10:00,112 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 275) no Hoare annotation was computed. [2022-01-10 04:10:00,112 INFO L854 garLoopResultBuilder]: At program point L509(line 509) the Hoare annotation is: false [2022-01-10 04:10:00,112 INFO L854 garLoopResultBuilder]: At program point L509-1(lines 501 514) the Hoare annotation is: (and (= ~compRegistered~0 (_ bv1 32)) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~MPR1~0 (_ bv5 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32))) [2022-01-10 04:10:00,112 INFO L854 garLoopResultBuilder]: At program point L262(lines 166 263) the Hoare annotation is: (and (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~MPR1~0 (_ bv5 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32))) [2022-01-10 04:10:00,112 INFO L854 garLoopResultBuilder]: At program point L543(line 543) the Hoare annotation is: false [2022-01-10 04:10:00,112 INFO L858 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2022-01-10 04:10:00,113 INFO L858 garLoopResultBuilder]: For program point L147(lines 147 269) no Hoare annotation was computed. [2022-01-10 04:10:00,113 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 280) no Hoare annotation was computed. [2022-01-10 04:10:00,113 INFO L854 garLoopResultBuilder]: At program point L48(lines 37 50) the Hoare annotation is: (and (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~MPR1~0 (_ bv5 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32))) [2022-01-10 04:10:00,113 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 04:10:00,113 INFO L858 garLoopResultBuilder]: For program point L528(lines 528 547) no Hoare annotation was computed. [2022-01-10 04:10:00,113 INFO L854 garLoopResultBuilder]: At program point L396(lines 387 414) the Hoare annotation is: (and (= (_ bv3 32) ~SKIP1~0) (= ~MPR1~0 (_ bv5 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32))) [2022-01-10 04:10:00,113 INFO L854 garLoopResultBuilder]: At program point L165(lines 111 281) the Hoare annotation is: (and (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~MPR1~0 (_ bv5 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32))) [2022-01-10 04:10:00,113 INFO L858 garLoopResultBuilder]: For program point L132(lines 132 274) no Hoare annotation was computed. [2022-01-10 04:10:00,113 INFO L858 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2022-01-10 04:10:00,113 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 238) no Hoare annotation was computed. [2022-01-10 04:10:00,113 INFO L858 garLoopResultBuilder]: For program point L216(lines 216 222) no Hoare annotation was computed. [2022-01-10 04:10:00,113 INFO L858 garLoopResultBuilder]: For program point L150(lines 150 268) no Hoare annotation was computed. [2022-01-10 04:10:00,113 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 279) no Hoare annotation was computed. [2022-01-10 04:10:00,114 INFO L858 garLoopResultBuilder]: For program point L398(lines 398 402) no Hoare annotation was computed. [2022-01-10 04:10:00,114 INFO L858 garLoopResultBuilder]: For program point L332(lines 332 335) no Hoare annotation was computed. [2022-01-10 04:10:00,114 INFO L858 garLoopResultBuilder]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2022-01-10 04:10:00,114 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 206) no Hoare annotation was computed. [2022-01-10 04:10:00,114 INFO L854 garLoopResultBuilder]: At program point L457(lines 456 473) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~MPR1~0 (_ bv5 32)))) (.cse2 (not (= ~pended~0 (_ bv0 32)))) (.cse3 (not (= ~NP~0 (_ bv1 32))))) (and (or .cse0 .cse1 (not (= ~compRegistered~0 (_ bv1 32))) (not (= |old(~s~0)| ~NP~0)) (= ~s~0 ~MPR1~0) .cse2 .cse3) (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 (not (= |old(~s~0)| ~SKIP1~0)) .cse2 (= ~s~0 (_ bv3 32)) .cse3))) [2022-01-10 04:10:00,114 INFO L858 garLoopResultBuilder]: For program point L445(lines 445 448) no Hoare annotation was computed. [2022-01-10 04:10:00,114 INFO L854 garLoopResultBuilder]: At program point L573(lines 565 575) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~MPR1~0 (_ bv5 32)))) (.cse2 (not (= ~pended~0 (_ bv0 32)))) (.cse3 (not (= ~NP~0 (_ bv1 32))))) (and (or .cse0 .cse1 (and (= ~setEventCalled~0 (_ bv1 32)) (= ~NP~0 ~s~0)) (not (= ~compRegistered~0 (_ bv1 32))) (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3) (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 (not (= |old(~s~0)| ~SKIP1~0)) .cse2 .cse3))) [2022-01-10 04:10:00,114 INFO L858 garLoopResultBuilder]: For program point L445-2(lines 445 448) no Hoare annotation was computed. [2022-01-10 04:10:00,114 INFO L854 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 437 500) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~MPR1~0 (_ bv5 32)))) (.cse2 (not (= ~pended~0 (_ bv0 32)))) (.cse3 (not (= ~NP~0 (_ bv1 32))))) (and (or .cse0 .cse1 (not (= ~compRegistered~0 (_ bv1 32))) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~s~0) .cse2 .cse3) (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 (not (= |old(~s~0)| ~SKIP1~0)) .cse2 (= ~s~0 (_ bv3 32)) .cse3))) [2022-01-10 04:10:00,114 INFO L854 garLoopResultBuilder]: At program point L520(lines 515 522) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~MPR1~0 (_ bv5 32)))) (.cse2 (not (= ~pended~0 (_ bv0 32)))) (.cse3 (not (= ~NP~0 (_ bv1 32))))) (and (or .cse0 .cse1 (and (= ~setEventCalled~0 (_ bv1 32)) (= ~NP~0 ~s~0)) (not (= ~compRegistered~0 (_ bv1 32))) (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3) (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 (not (= |old(~s~0)| ~SKIP1~0)) .cse2 .cse3))) [2022-01-10 04:10:00,114 INFO L858 garLoopResultBuilder]: For program point IofCallDriverFINAL(lines 437 500) no Hoare annotation was computed. [2022-01-10 04:10:00,115 INFO L858 garLoopResultBuilder]: For program point L479(lines 479 496) no Hoare annotation was computed. [2022-01-10 04:10:00,115 INFO L854 garLoopResultBuilder]: At program point L471(lines 444 499) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~MPR1~0 (_ bv5 32)))) (.cse2 (= (bvadd |IofCallDriver_~returnVal2~0#1| (_ bv1073741823 32)) (_ bv0 32))) (.cse5 (= |IofCallDriver_~returnVal2~0#1| (_ bv259 32))) (.cse6 (not (= ~pended~0 (_ bv0 32)))) (.cse4 (= |IofCallDriver_~returnVal2~0#1| (_ bv0 32))) (.cse7 (not (= ~NP~0 (_ bv1 32))))) (and (let ((.cse3 (= ~s~0 ~MPR1~0))) (or .cse0 .cse1 (and .cse2 .cse3) (not (= ~compRegistered~0 (_ bv1 32))) (and .cse4 .cse3) (and (= ~setEventCalled~0 (_ bv1 32)) .cse5 .cse3) (not (= |old(~s~0)| ~NP~0)) .cse6 .cse7)) (let ((.cse8 (= ~s~0 (_ bv3 32)))) (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 (and .cse2 .cse8) (and .cse5 .cse8) (not (= |old(~s~0)| ~SKIP1~0)) .cse6 (and .cse4 .cse8) .cse7)))) [2022-01-10 04:10:00,115 INFO L858 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 437 500) no Hoare annotation was computed. [2022-01-10 04:10:00,115 INFO L854 garLoopResultBuilder]: At program point L459(lines 458 473) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~MPR1~0 (_ bv5 32)))) (.cse2 (not (= ~pended~0 (_ bv0 32)))) (.cse3 (not (= ~NP~0 (_ bv1 32))))) (and (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 (not (= |old(~s~0)| ~SKIP1~0)) .cse2 (= ~s~0 (_ bv3 32)) .cse3) (or .cse0 .cse1 (not (= ~compRegistered~0 (_ bv1 32))) (not (= |old(~s~0)| ~NP~0)) (and (= ~setEventCalled~0 (_ bv1 32)) (= ~s~0 ~MPR1~0)) .cse2 .cse3))) [2022-01-10 04:10:00,115 INFO L858 garLoopResultBuilder]: For program point L488(lines 488 495) no Hoare annotation was computed. [2022-01-10 04:10:00,115 INFO L858 garLoopResultBuilder]: For program point L451(lines 451 474) no Hoare annotation was computed. [2022-01-10 04:10:00,116 INFO L858 garLoopResultBuilder]: For program point L480(lines 480 486) no Hoare annotation was computed. [2022-01-10 04:10:00,116 INFO L854 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~MPR1~0 (_ bv5 32)))) (.cse2 (not (= ~pended~0 (_ bv0 32)))) (.cse3 (not (= ~NP~0 (_ bv1 32))))) (and (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 (not (= |old(~s~0)| ~SKIP1~0)) .cse2 .cse3) (or .cse0 .cse1 (not (= ~compRegistered~0 (_ bv1 32))) (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3))) [2022-01-10 04:10:00,116 INFO L854 garLoopResultBuilder]: At program point L431-1(lines 423 436) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~MPR1~0 (_ bv5 32)))) (.cse2 (not (= ~pended~0 (_ bv0 32)))) (.cse3 (not (= ~NP~0 (_ bv1 32))))) (and (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 (not (= |old(~s~0)| ~SKIP1~0)) .cse2 .cse3) (or .cse0 .cse1 (not (= ~compRegistered~0 (_ bv1 32))) (not (= |old(~s~0)| ~NP~0)) (and (= ~setEventCalled~0 (_ bv1 32)) (= ~s~0 ~MPR1~0)) .cse2 .cse3))) [2022-01-10 04:10:00,116 INFO L854 garLoopResultBuilder]: At program point L493(line 493) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~MPR1~0 (_ bv5 32)))) (.cse2 (not (= ~pended~0 (_ bv0 32)))) (.cse3 (not (= ~NP~0 (_ bv1 32))))) (and (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 (not (= |old(~s~0)| ~SKIP1~0)) .cse2 .cse3) (or .cse0 .cse1 (not (= ~compRegistered~0 (_ bv1 32))) (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3))) [2022-01-10 04:10:00,116 INFO L858 garLoopResultBuilder]: For program point L493-1(lines 475 497) no Hoare annotation was computed. [2022-01-10 04:10:00,116 INFO L858 garLoopResultBuilder]: For program point L427(lines 427 433) no Hoare annotation was computed. [2022-01-10 04:10:00,116 INFO L858 garLoopResultBuilder]: For program point L456(lines 456 473) no Hoare annotation was computed. [2022-01-10 04:10:00,116 INFO L854 garLoopResultBuilder]: At program point L452(lines 451 474) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~MPR1~0 (_ bv5 32)))) (.cse2 (not (= ~pended~0 (_ bv0 32)))) (.cse3 (not (= ~NP~0 (_ bv1 32))))) (and (or .cse0 .cse1 (not (= ~compRegistered~0 (_ bv1 32))) (not (= |old(~s~0)| ~NP~0)) (= ~s~0 ~MPR1~0) .cse2 .cse3) (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 (not (= |old(~s~0)| ~SKIP1~0)) .cse2 (= ~s~0 (_ bv3 32)) .cse3))) [2022-01-10 04:10:00,119 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:00,120 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 04:10:00,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 04:10:00 BoogieIcfgContainer [2022-01-10 04:10:00,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 04:10:00,159 INFO L158 Benchmark]: Toolchain (without parser) took 9922.97ms. Allocated memory was 183.5MB in the beginning and 268.4MB in the end (delta: 84.9MB). Free memory was 125.8MB in the beginning and 178.6MB in the end (delta: -52.8MB). Peak memory consumption was 129.5MB. Max. memory is 8.0GB. [2022-01-10 04:10:00,159 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 04:10:00,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.67ms. Allocated memory was 183.5MB in the beginning and 268.4MB in the end (delta: 84.9MB). Free memory was 125.6MB in the beginning and 235.5MB in the end (delta: -109.9MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2022-01-10 04:10:00,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.50ms. Allocated memory is still 268.4MB. Free memory was 235.5MB in the beginning and 232.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 04:10:00,160 INFO L158 Benchmark]: Boogie Preprocessor took 44.88ms. Allocated memory is still 268.4MB. Free memory was 232.8MB in the beginning and 231.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 04:10:00,160 INFO L158 Benchmark]: RCFGBuilder took 553.58ms. Allocated memory is still 268.4MB. Free memory was 230.8MB in the beginning and 207.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-01-10 04:10:00,160 INFO L158 Benchmark]: TraceAbstraction took 8836.45ms. Allocated memory is still 268.4MB. Free memory was 207.7MB in the beginning and 178.6MB in the end (delta: 29.1MB). Peak memory consumption was 125.6MB. Max. memory is 8.0GB. [2022-01-10 04:10:00,161 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 407.67ms. Allocated memory was 183.5MB in the beginning and 268.4MB in the end (delta: 84.9MB). Free memory was 125.6MB in the beginning and 235.5MB in the end (delta: -109.9MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.50ms. Allocated memory is still 268.4MB. Free memory was 235.5MB in the beginning and 232.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.88ms. Allocated memory is still 268.4MB. Free memory was 232.8MB in the beginning and 231.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 553.58ms. Allocated memory is still 268.4MB. Free memory was 230.8MB in the beginning and 207.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 8836.45ms. Allocated memory is still 268.4MB. Free memory was 207.7MB in the beginning and 178.6MB in the end (delta: 29.1MB). Peak memory consumption was 125.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1119 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1114 mSDsluCounter, 5681 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3266 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 508 IncrementalHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 2415 mSDtfsCounter, 508 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 523 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=13, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 195 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 165 PreInvPairs, 215 NumberOfFragments, 1042 HoareAnnotationTreeSize, 165 FomulaSimplifications, 1064 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 43 FomulaSimplificationsInter, 2229 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 531 NumberOfCodeBlocks, 531 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 515 ConstructedInterpolants, 0 QuantifiedInterpolants, 1135 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2156 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: status == 0bv32 - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 423]: Loop Invariant Derived loop invariant: (((((!(3bv32 == SKIP1) || !(compRegistered == 0bv32)) || !(MPR1 == 5bv32)) || !(\old(s) == SKIP1)) || !(pended == 0bv32)) || !(NP == 1bv32)) && ((((((!(3bv32 == SKIP1) || !(MPR1 == 5bv32)) || !(compRegistered == 1bv32)) || !(\old(s) == NP)) || (setEventCalled == 1bv32 && s == MPR1)) || !(pended == 0bv32)) || !(NP == 1bv32)) - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: ((((((((!(3bv32 == SKIP1) || !(MPR1 == 5bv32)) || (~bvadd16(returnVal2, 1073741823bv32) == 0bv32 && s == MPR1)) || !(compRegistered == 1bv32)) || (returnVal2 == 0bv32 && s == MPR1)) || ((setEventCalled == 1bv32 && returnVal2 == 259bv32) && s == MPR1)) || !(\old(s) == NP)) || !(pended == 0bv32)) || !(NP == 1bv32)) && ((((((((!(3bv32 == SKIP1) || !(compRegistered == 0bv32)) || !(MPR1 == 5bv32)) || (~bvadd16(returnVal2, 1073741823bv32) == 0bv32 && s == 3bv32)) || (returnVal2 == 259bv32 && s == 3bv32)) || !(\old(s) == SKIP1)) || !(pended == 0bv32)) || (returnVal2 == 0bv32 && s == 3bv32)) || !(NP == 1bv32)) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: ((((((!(3bv32 == SKIP1) || !(compRegistered == 0bv32)) || !(MPR1 == 5bv32)) || !(\old(s) == SKIP1)) || !(pended == 0bv32)) || s == 3bv32) || !(NP == 1bv32)) && ((((((!(3bv32 == SKIP1) || !(MPR1 == 5bv32)) || !(compRegistered == 1bv32)) || !(\old(s) == NP)) || (setEventCalled == 1bv32 && s == MPR1)) || !(pended == 0bv32)) || !(NP == 1bv32)) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: ((3bv32 == SKIP1 && MPR1 == 5bv32) && pended == 0bv32) && NP == 1bv32 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((3bv32 == SKIP1 && status == 0bv32) && MPR1 == 5bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32 - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: ((((((compRegistered == 1bv32 && 3bv32 == SKIP1) && status == 0bv32) && MPR1 == 5bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && __cil_tmp23 == ~sign_extendFrom8To32(259bv32) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((3bv32 == SKIP1 && status == 0bv32) && MPR1 == 5bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32 - InvariantResult [Line: 523]: Loop Invariant Derived loop invariant: ((((((compRegistered == 1bv32 && 3bv32 == SKIP1) && status == 0bv32) && MPR1 == 5bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && __cil_tmp23 == ~sign_extendFrom8To32(259bv32) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: (((3bv32 == SKIP1 && status == 0bv32) && MPR1 == 5bv32) && pended == 0bv32) && NP == 1bv32 - InvariantResult [Line: 501]: Loop Invariant Derived loop invariant: ((((compRegistered == 1bv32 && 3bv32 == SKIP1) && status == 0bv32) && MPR1 == 5bv32) && pended == 0bv32) && NP == 1bv32 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((((3bv32 == SKIP1 && status == 0bv32) && MPR1 == 5bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((3bv32 == SKIP1 && status == 0bv32) && MPR1 == 5bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((3bv32 == SKIP1 && status == 0bv32) && MPR1 == 5bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32 - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((3bv32 == SKIP1 && MPR1 == 5bv32) && pended == 0bv32) && NP == 1bv32 - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: ((3bv32 == SKIP1 && MPR1 == 5bv32) && pended == 0bv32) && NP == 1bv32 - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((3bv32 == SKIP1 && status == 0bv32) && MPR1 == 5bv32) && pended == 0bv32) && NP == 1bv32 - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((3bv32 == SKIP1 && status == 0bv32) && MPR1 == 5bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32 - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: ((((((!(3bv32 == SKIP1) || !(MPR1 == 5bv32)) || (setEventCalled == 1bv32 && NP == s)) || !(compRegistered == 1bv32)) || !(\old(s) == NP)) || !(pended == 0bv32)) || !(NP == 1bv32)) && (((((!(3bv32 == SKIP1) || !(compRegistered == 0bv32)) || !(MPR1 == 5bv32)) || !(\old(s) == SKIP1)) || !(pended == 0bv32)) || !(NP == 1bv32)) - InvariantResult [Line: 565]: Loop Invariant Derived loop invariant: ((((((!(3bv32 == SKIP1) || !(MPR1 == 5bv32)) || (setEventCalled == 1bv32 && NP == s)) || !(compRegistered == 1bv32)) || !(\old(s) == NP)) || !(pended == 0bv32)) || !(NP == 1bv32)) && (((((!(3bv32 == SKIP1) || !(compRegistered == 0bv32)) || !(MPR1 == 5bv32)) || !(\old(s) == SKIP1)) || !(pended == 0bv32)) || !(NP == 1bv32)) - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((!(3bv32 == SKIP1) || !(MPR1 == 5bv32)) || !(compRegistered == 1bv32)) || !(\old(s) == NP)) || s == MPR1) || !(pended == 0bv32)) || !(NP == 1bv32)) && ((((((!(3bv32 == SKIP1) || !(compRegistered == 0bv32)) || !(MPR1 == 5bv32)) || !(\old(s) == SKIP1)) || !(pended == 0bv32)) || s == 3bv32) || !(NP == 1bv32)) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: ((((((compRegistered == 1bv32 && 3bv32 == SKIP1) && status == 0bv32) && MPR1 == 5bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && __cil_tmp23 == ~sign_extendFrom8To32(259bv32) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((!(3bv32 == SKIP1) || !(MPR1 == 5bv32)) || !(compRegistered == 1bv32)) || !(\old(s) == NP)) || s == MPR1) || !(pended == 0bv32)) || !(NP == 1bv32)) && ((((((!(3bv32 == SKIP1) || !(compRegistered == 0bv32)) || !(MPR1 == 5bv32)) || !(\old(s) == SKIP1)) || !(pended == 0bv32)) || s == 3bv32) || !(NP == 1bv32)) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: ((3bv32 == SKIP1 && MPR1 == 5bv32) && pended == 0bv32) && NP == 1bv32 - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: ((((3bv32 == SKIP1 && status == 0bv32) && MPR1 == 5bv32) && compRegistered == 0bv32) && pended == 0bv32) && NP == 1bv32 RESULT: Ultimate proved your program to be correct! [2022-01-10 04:10:00,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...