/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 07:26:35,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 07:26:35,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 07:26:35,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 07:26:35,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 07:26:35,134 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 07:26:35,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 07:26:35,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 07:26:35,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 07:26:35,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 07:26:35,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 07:26:35,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 07:26:35,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 07:26:35,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 07:26:35,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 07:26:35,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 07:26:35,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 07:26:35,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 07:26:35,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 07:26:35,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 07:26:35,144 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 07:26:35,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 07:26:35,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 07:26:35,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 07:26:35,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 07:26:35,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 07:26:35,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 07:26:35,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 07:26:35,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 07:26:35,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 07:26:35,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 07:26:35,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 07:26:35,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 07:26:35,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 07:26:35,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 07:26:35,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 07:26:35,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 07:26:35,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 07:26:35,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 07:26:35,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 07:26:35,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 07:26:35,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 07:26:35,155 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-20 07:26:35,161 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 07:26:35,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 07:26:35,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 07:26:35,162 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 07:26:35,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 07:26:35,162 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 07:26:35,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 07:26:35,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 07:26:35,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 07:26:35,163 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 07:26:35,163 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 07:26:35,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 07:26:35,163 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 07:26:35,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 07:26:35,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 07:26:35,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 07:26:35,163 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 07:26:35,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 07:26:35,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 07:26:35,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 07:26:35,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 07:26:35,164 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 07:26:35,164 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-03-20 07:26:35,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 07:26:35,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 07:26:35,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 07:26:35,369 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 07:26:35,373 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 07:26:35,374 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-03-20 07:26:35,420 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91346bd22/8e8b8261bcd6461e99105d2a0fb85f0d/FLAGeb22a5e99 [2022-03-20 07:26:35,764 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 07:26:35,764 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-03-20 07:26:35,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91346bd22/8e8b8261bcd6461e99105d2a0fb85f0d/FLAGeb22a5e99 [2022-03-20 07:26:35,785 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91346bd22/8e8b8261bcd6461e99105d2a0fb85f0d [2022-03-20 07:26:35,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 07:26:35,789 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 07:26:35,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 07:26:35,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 07:26:35,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 07:26:35,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 07:26:35" (1/1) ... [2022-03-20 07:26:35,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69ef7367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:35, skipping insertion in model container [2022-03-20 07:26:35,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 07:26:35" (1/1) ... [2022-03-20 07:26:35,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 07:26:35,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 07:26:36,037 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-03-20 07:26:36,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 07:26:36,064 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 07:26:36,116 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-03-20 07:26:36,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 07:26:36,134 INFO L208 MainTranslator]: Completed translation [2022-03-20 07:26:36,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:36 WrapperNode [2022-03-20 07:26:36,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 07:26:36,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 07:26:36,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 07:26:36,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 07:26:36,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:36" (1/1) ... [2022-03-20 07:26:36,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:36" (1/1) ... [2022-03-20 07:26:36,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:36" (1/1) ... [2022-03-20 07:26:36,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:36" (1/1) ... [2022-03-20 07:26:36,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:36" (1/1) ... [2022-03-20 07:26:36,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:36" (1/1) ... [2022-03-20 07:26:36,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:36" (1/1) ... [2022-03-20 07:26:36,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 07:26:36,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 07:26:36,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 07:26:36,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 07:26:36,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:36" (1/1) ... [2022-03-20 07:26:36,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 07:26:36,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 07:26:36,211 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-03-20 07:26:36,213 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-03-20 07:26:36,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 07:26:36,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 07:26:36,237 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 07:26:36,237 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-03-20 07:26:36,237 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-03-20 07:26:36,237 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-03-20 07:26:36,238 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 07:26:36,238 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-03-20 07:26:36,238 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-03-20 07:26:36,238 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-03-20 07:26:36,239 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-03-20 07:26:36,239 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-03-20 07:26:36,239 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-03-20 07:26:36,239 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-03-20 07:26:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 07:26:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 07:26:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 07:26:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 07:26:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-03-20 07:26:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 07:26:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-03-20 07:26:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-03-20 07:26:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-03-20 07:26:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-03-20 07:26:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-03-20 07:26:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-03-20 07:26:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-03-20 07:26:36,240 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-03-20 07:26:36,241 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-03-20 07:26:36,241 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-03-20 07:26:36,241 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 07:26:36,241 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-03-20 07:26:36,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 07:26:36,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 07:26:36,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 07:26:36,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 07:26:36,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 07:26:36,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 07:26:36,307 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 07:26:36,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 07:26:36,393 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 07:26:36,483 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2022-03-20 07:26:36,483 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2022-03-20 07:26:36,484 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 07:26:36,536 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2022-03-20 07:26:36,537 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2022-03-20 07:26:36,560 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 07:26:36,595 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-03-20 07:26:36,595 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-03-20 07:26:36,602 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 07:26:36,668 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-03-20 07:26:36,668 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-03-20 07:26:36,671 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 07:26:36,676 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 07:26:36,676 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-20 07:26:36,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 07:26:36 BoogieIcfgContainer [2022-03-20 07:26:36,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 07:26:36,678 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 07:26:36,679 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 07:26:36,683 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 07:26:36,685 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 07:26:36" (1/1) ... [2022-03-20 07:26:36,687 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-03-20 07:26:36,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 07:26:36 BasicIcfg [2022-03-20 07:26:36,723 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 07:26:36,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 07:26:36,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 07:26:36,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 07:26:36,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 07:26:35" (1/4) ... [2022-03-20 07:26:36,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62640d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 07:26:36, skipping insertion in model container [2022-03-20 07:26:36,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:36" (2/4) ... [2022-03-20 07:26:36,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62640d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 07:26:36, skipping insertion in model container [2022-03-20 07:26:36,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 07:26:36" (3/4) ... [2022-03-20 07:26:36,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62640d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 07:26:36, skipping insertion in model container [2022-03-20 07:26:36,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 07:26:36" (4/4) ... [2022-03-20 07:26:36,732 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.cJordan [2022-03-20 07:26:36,736 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-20 07:26:36,736 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 07:26:36,766 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 07:26:36,771 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-03-20 07:26:36,771 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 07:26:36,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 113 states have (on average 1.5575221238938053) internal successors, (176), 126 states have internal predecessors, (176), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-03-20 07:26:36,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 07:26:36,788 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:36,788 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:36,789 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:36,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:36,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1155157574, now seen corresponding path program 1 times [2022-03-20 07:26:36,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:36,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399508434] [2022-03-20 07:26:36,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:36,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:37,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:37,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:37,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:37,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:37,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399508434] [2022-03-20 07:26:37,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399508434] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:37,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:37,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 07:26:37,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139648552] [2022-03-20 07:26:37,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:37,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 07:26:37,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:37,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 07:26:37,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 07:26:37,216 INFO L87 Difference]: Start difference. First operand has 151 states, 113 states have (on average 1.5575221238938053) internal successors, (176), 126 states have internal predecessors, (176), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 07:26:37,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:37,522 INFO L93 Difference]: Finished difference Result 168 states and 236 transitions. [2022-03-20 07:26:37,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 07:26:37,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-03-20 07:26:37,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:37,533 INFO L225 Difference]: With dead ends: 168 [2022-03-20 07:26:37,533 INFO L226 Difference]: Without dead ends: 157 [2022-03-20 07:26:37,535 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 07:26:37,537 INFO L913 BasicCegarLoop]: 182 mSDtfsCounter, 180 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:37,538 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 286 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 07:26:37,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-03-20 07:26:37,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2022-03-20 07:26:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-03-20 07:26:37,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2022-03-20 07:26:37,570 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2022-03-20 07:26:37,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:37,571 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2022-03-20 07:26:37,571 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 07:26:37,571 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2022-03-20 07:26:37,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-20 07:26:37,572 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:37,572 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:37,572 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 07:26:37,572 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:37,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:37,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1515864402, now seen corresponding path program 1 times [2022-03-20 07:26:37,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:37,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354426937] [2022-03-20 07:26:37,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:37,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:37,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:37,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:37,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:37,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:37,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354426937] [2022-03-20 07:26:37,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354426937] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:37,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:37,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 07:26:37,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171943410] [2022-03-20 07:26:37,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:37,734 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 07:26:37,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:37,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 07:26:37,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 07:26:37,736 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 07:26:38,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:38,101 INFO L93 Difference]: Finished difference Result 220 states and 292 transitions. [2022-03-20 07:26:38,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 07:26:38,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-03-20 07:26:38,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:38,103 INFO L225 Difference]: With dead ends: 220 [2022-03-20 07:26:38,103 INFO L226 Difference]: Without dead ends: 219 [2022-03-20 07:26:38,104 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-20 07:26:38,105 INFO L913 BasicCegarLoop]: 202 mSDtfsCounter, 318 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:38,105 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 280 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 07:26:38,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-03-20 07:26:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2022-03-20 07:26:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) [2022-03-20 07:26:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2022-03-20 07:26:38,119 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2022-03-20 07:26:38,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:38,119 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2022-03-20 07:26:38,119 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 07:26:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2022-03-20 07:26:38,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-20 07:26:38,120 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:38,120 INFO L499 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-03-20 07:26:38,120 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 07:26:38,120 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:38,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:38,121 INFO L85 PathProgramCache]: Analyzing trace with hash 252875622, now seen corresponding path program 1 times [2022-03-20 07:26:38,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:38,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939797288] [2022-03-20 07:26:38,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:38,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:38,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:38,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:38,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:38,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:38,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939797288] [2022-03-20 07:26:38,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939797288] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:38,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:38,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 07:26:38,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850518478] [2022-03-20 07:26:38,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:38,227 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 07:26:38,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:38,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 07:26:38,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 07:26:38,228 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 07:26:38,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:38,495 INFO L93 Difference]: Finished difference Result 254 states and 335 transitions. [2022-03-20 07:26:38,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 07:26:38,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-03-20 07:26:38,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:38,497 INFO L225 Difference]: With dead ends: 254 [2022-03-20 07:26:38,497 INFO L226 Difference]: Without dead ends: 254 [2022-03-20 07:26:38,497 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-20 07:26:38,498 INFO L913 BasicCegarLoop]: 161 mSDtfsCounter, 320 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:38,498 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 252 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 07:26:38,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-03-20 07:26:38,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2022-03-20 07:26:38,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-03-20 07:26:38,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2022-03-20 07:26:38,508 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2022-03-20 07:26:38,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:38,508 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2022-03-20 07:26:38,509 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 07:26:38,509 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2022-03-20 07:26:38,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-20 07:26:38,510 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:38,510 INFO L499 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-03-20 07:26:38,510 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 07:26:38,510 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:38,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:38,510 INFO L85 PathProgramCache]: Analyzing trace with hash -301837211, now seen corresponding path program 1 times [2022-03-20 07:26:38,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:38,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496382310] [2022-03-20 07:26:38,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:38,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:38,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:38,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:38,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:38,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:38,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496382310] [2022-03-20 07:26:38,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496382310] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:38,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:38,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 07:26:38,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486269611] [2022-03-20 07:26:38,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:38,608 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 07:26:38,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:38,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 07:26:38,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 07:26:38,609 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 07:26:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:38,930 INFO L93 Difference]: Finished difference Result 217 states and 288 transitions. [2022-03-20 07:26:38,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 07:26:38,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-03-20 07:26:38,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:38,948 INFO L225 Difference]: With dead ends: 217 [2022-03-20 07:26:38,948 INFO L226 Difference]: Without dead ends: 217 [2022-03-20 07:26:38,948 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-20 07:26:38,949 INFO L913 BasicCegarLoop]: 168 mSDtfsCounter, 92 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:38,949 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 256 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 07:26:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-03-20 07:26:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-03-20 07:26:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-03-20 07:26:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2022-03-20 07:26:38,957 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2022-03-20 07:26:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:38,957 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2022-03-20 07:26:38,957 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 07:26:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-03-20 07:26:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-20 07:26:38,958 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:38,959 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:38,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 07:26:38,959 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:38,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:38,959 INFO L85 PathProgramCache]: Analyzing trace with hash -141227467, now seen corresponding path program 1 times [2022-03-20 07:26:38,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:38,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130176330] [2022-03-20 07:26:38,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:38,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:39,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:39,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:39,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:39,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 07:26:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:39,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:39,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130176330] [2022-03-20 07:26:39,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130176330] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:39,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:39,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 07:26:39,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036124219] [2022-03-20 07:26:39,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:39,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 07:26:39,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:39,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 07:26:39,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-20 07:26:39,137 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-20 07:26:39,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:39,453 INFO L93 Difference]: Finished difference Result 208 states and 271 transitions. [2022-03-20 07:26:39,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 07:26:39,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-03-20 07:26:39,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:39,454 INFO L225 Difference]: With dead ends: 208 [2022-03-20 07:26:39,454 INFO L226 Difference]: Without dead ends: 208 [2022-03-20 07:26:39,455 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-03-20 07:26:39,455 INFO L913 BasicCegarLoop]: 193 mSDtfsCounter, 459 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:39,456 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 435 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 07:26:39,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-03-20 07:26:39,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2022-03-20 07:26:39,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-03-20 07:26:39,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2022-03-20 07:26:39,462 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2022-03-20 07:26:39,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:39,462 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2022-03-20 07:26:39,462 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-20 07:26:39,463 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2022-03-20 07:26:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-20 07:26:39,464 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:39,464 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:39,464 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-20 07:26:39,464 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:39,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:39,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1455239378, now seen corresponding path program 1 times [2022-03-20 07:26:39,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:39,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068145134] [2022-03-20 07:26:39,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:39,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:39,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:39,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:39,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:39,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-03-20 07:26:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:39,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:26:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:39,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-03-20 07:26:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:39,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:39,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:39,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068145134] [2022-03-20 07:26:39,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068145134] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:39,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:39,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 07:26:39,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250362555] [2022-03-20 07:26:39,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:39,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 07:26:39,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:39,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 07:26:39,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-20 07:26:39,596 INFO L87 Difference]: Start difference. First operand 190 states and 250 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 07:26:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:39,885 INFO L93 Difference]: Finished difference Result 197 states and 257 transitions. [2022-03-20 07:26:39,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 07:26:39,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 51 [2022-03-20 07:26:39,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:39,887 INFO L225 Difference]: With dead ends: 197 [2022-03-20 07:26:39,887 INFO L226 Difference]: Without dead ends: 197 [2022-03-20 07:26:39,887 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-03-20 07:26:39,891 INFO L913 BasicCegarLoop]: 167 mSDtfsCounter, 191 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:39,894 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 360 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 07:26:39,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-03-20 07:26:39,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2022-03-20 07:26:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-03-20 07:26:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2022-03-20 07:26:39,907 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2022-03-20 07:26:39,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:39,907 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2022-03-20 07:26:39,907 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 07:26:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2022-03-20 07:26:39,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-20 07:26:39,910 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:39,910 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:39,910 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-20 07:26:39,910 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:39,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:39,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1069507529, now seen corresponding path program 1 times [2022-03-20 07:26:39,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:39,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089671498] [2022-03-20 07:26:39,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:39,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:39,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-20 07:26:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:40,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:40,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089671498] [2022-03-20 07:26:40,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089671498] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:40,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:40,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 07:26:40,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766407848] [2022-03-20 07:26:40,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:40,113 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 07:26:40,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:40,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 07:26:40,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-03-20 07:26:40,113 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 07:26:40,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:40,612 INFO L93 Difference]: Finished difference Result 210 states and 270 transitions. [2022-03-20 07:26:40,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 07:26:40,613 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-03-20 07:26:40,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:40,615 INFO L225 Difference]: With dead ends: 210 [2022-03-20 07:26:40,615 INFO L226 Difference]: Without dead ends: 210 [2022-03-20 07:26:40,616 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-03-20 07:26:40,619 INFO L913 BasicCegarLoop]: 194 mSDtfsCounter, 562 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:40,619 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [563 Valid, 494 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 07:26:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-03-20 07:26:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 188. [2022-03-20 07:26:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) [2022-03-20 07:26:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2022-03-20 07:26:40,629 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 50 [2022-03-20 07:26:40,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:40,629 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2022-03-20 07:26:40,629 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 07:26:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2022-03-20 07:26:40,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-20 07:26:40,632 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:40,632 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:40,632 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-20 07:26:40,632 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:40,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:40,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1382255258, now seen corresponding path program 1 times [2022-03-20 07:26:40,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:40,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193433340] [2022-03-20 07:26:40,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:40,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-20 07:26:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:40,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:40,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193433340] [2022-03-20 07:26:40,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193433340] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:40,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:40,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 07:26:40,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658197467] [2022-03-20 07:26:40,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:40,846 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 07:26:40,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:40,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 07:26:40,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-03-20 07:26:40,847 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 07:26:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:41,269 INFO L93 Difference]: Finished difference Result 182 states and 235 transitions. [2022-03-20 07:26:41,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 07:26:41,269 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2022-03-20 07:26:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:41,270 INFO L225 Difference]: With dead ends: 182 [2022-03-20 07:26:41,270 INFO L226 Difference]: Without dead ends: 182 [2022-03-20 07:26:41,271 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2022-03-20 07:26:41,271 INFO L913 BasicCegarLoop]: 153 mSDtfsCounter, 481 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:41,271 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [481 Valid, 379 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 07:26:41,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-03-20 07:26:41,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 176. [2022-03-20 07:26:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 142 states have (on average 1.352112676056338) internal successors, (192), 146 states have internal predecessors, (192), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2022-03-20 07:26:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 228 transitions. [2022-03-20 07:26:41,275 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 228 transitions. Word has length 52 [2022-03-20 07:26:41,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:41,275 INFO L478 AbstractCegarLoop]: Abstraction has 176 states and 228 transitions. [2022-03-20 07:26:41,275 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 07:26:41,275 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 228 transitions. [2022-03-20 07:26:41,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-20 07:26:41,276 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:41,276 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:41,276 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-20 07:26:41,276 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:41,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:41,276 INFO L85 PathProgramCache]: Analyzing trace with hash -459288966, now seen corresponding path program 1 times [2022-03-20 07:26:41,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:41,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232703291] [2022-03-20 07:26:41,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:41,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-20 07:26:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:41,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:41,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232703291] [2022-03-20 07:26:41,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232703291] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:41,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:41,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 07:26:41,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768380028] [2022-03-20 07:26:41,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:41,421 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 07:26:41,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:41,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 07:26:41,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-20 07:26:41,423 INFO L87 Difference]: Start difference. First operand 176 states and 228 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 07:26:41,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:41,629 INFO L93 Difference]: Finished difference Result 178 states and 228 transitions. [2022-03-20 07:26:41,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 07:26:41,630 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-03-20 07:26:41,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:41,632 INFO L225 Difference]: With dead ends: 178 [2022-03-20 07:26:41,632 INFO L226 Difference]: Without dead ends: 91 [2022-03-20 07:26:41,632 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-03-20 07:26:41,633 INFO L913 BasicCegarLoop]: 146 mSDtfsCounter, 400 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:41,634 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [401 Valid, 236 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 07:26:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-03-20 07:26:41,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-03-20 07:26:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-03-20 07:26:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2022-03-20 07:26:41,636 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 52 [2022-03-20 07:26:41,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:41,636 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2022-03-20 07:26:41,636 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 07:26:41,637 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-03-20 07:26:41,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-03-20 07:26:41,638 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:41,638 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:41,638 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-20 07:26:41,638 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:41,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:41,638 INFO L85 PathProgramCache]: Analyzing trace with hash -273247555, now seen corresponding path program 1 times [2022-03-20 07:26:41,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:41,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972618577] [2022-03-20 07:26:41,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:41,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 07:26:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:26:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:26:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:41,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:41,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972618577] [2022-03-20 07:26:41,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972618577] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:41,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:41,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 07:26:41,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013494625] [2022-03-20 07:26:41,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:41,852 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 07:26:41,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:41,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 07:26:41,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-20 07:26:41,853 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 07:26:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:42,118 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-03-20 07:26:42,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 07:26:42,118 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-03-20 07:26:42,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:42,119 INFO L225 Difference]: With dead ends: 91 [2022-03-20 07:26:42,119 INFO L226 Difference]: Without dead ends: 91 [2022-03-20 07:26:42,120 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-03-20 07:26:42,120 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 96 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:42,121 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 244 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 07:26:42,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-03-20 07:26:42,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-03-20 07:26:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-03-20 07:26:42,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-03-20 07:26:42,124 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 59 [2022-03-20 07:26:42,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:42,125 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-03-20 07:26:42,125 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 07:26:42,125 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-03-20 07:26:42,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-20 07:26:42,125 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:42,125 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:42,126 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-20 07:26:42,126 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:42,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:42,126 INFO L85 PathProgramCache]: Analyzing trace with hash 366370572, now seen corresponding path program 1 times [2022-03-20 07:26:42,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:42,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68133365] [2022-03-20 07:26:42,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:42,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 07:26:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:26:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:26:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:42,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:42,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68133365] [2022-03-20 07:26:42,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68133365] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:42,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:42,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 07:26:42,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569106082] [2022-03-20 07:26:42,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:42,307 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 07:26:42,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:42,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 07:26:42,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-20 07:26:42,308 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 07:26:42,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:42,453 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2022-03-20 07:26:42,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 07:26:42,454 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2022-03-20 07:26:42,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:42,455 INFO L225 Difference]: With dead ends: 103 [2022-03-20 07:26:42,455 INFO L226 Difference]: Without dead ends: 93 [2022-03-20 07:26:42,455 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-03-20 07:26:42,456 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 108 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:42,456 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 306 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 07:26:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-03-20 07:26:42,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2022-03-20 07:26:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-03-20 07:26:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2022-03-20 07:26:42,458 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 61 [2022-03-20 07:26:42,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:42,458 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2022-03-20 07:26:42,458 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 07:26:42,458 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-03-20 07:26:42,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-03-20 07:26:42,459 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:42,459 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:42,459 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-20 07:26:42,459 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:42,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:42,460 INFO L85 PathProgramCache]: Analyzing trace with hash -350640073, now seen corresponding path program 1 times [2022-03-20 07:26:42,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:42,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108878006] [2022-03-20 07:26:42,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:42,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 07:26:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:26:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:26:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:42,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:42,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108878006] [2022-03-20 07:26:42,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108878006] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:42,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:42,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 07:26:42,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12294283] [2022-03-20 07:26:42,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:42,577 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 07:26:42,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:42,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 07:26:42,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 07:26:42,577 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 07:26:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:42,671 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-03-20 07:26:42,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 07:26:42,671 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-03-20 07:26:42,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:42,671 INFO L225 Difference]: With dead ends: 78 [2022-03-20 07:26:42,672 INFO L226 Difference]: Without dead ends: 78 [2022-03-20 07:26:42,672 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 07:26:42,673 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 79 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:42,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 195 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 07:26:42,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-03-20 07:26:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-03-20 07:26:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.125) internal successors, (63), 57 states have internal predecessors, (63), 13 states have call successors, (13), 12 states have call predecessors, (13), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-03-20 07:26:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2022-03-20 07:26:42,675 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 62 [2022-03-20 07:26:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:42,676 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2022-03-20 07:26:42,676 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 07:26:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-03-20 07:26:42,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-03-20 07:26:42,677 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:42,677 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:42,677 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-20 07:26:42,677 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:42,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:42,677 INFO L85 PathProgramCache]: Analyzing trace with hash -57237066, now seen corresponding path program 1 times [2022-03-20 07:26:42,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:42,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223597618] [2022-03-20 07:26:42,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:42,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 07:26:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:26:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:26:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:42,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:42,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223597618] [2022-03-20 07:26:42,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223597618] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:42,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:42,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 07:26:42,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769598116] [2022-03-20 07:26:42,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:42,789 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 07:26:42,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:42,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 07:26:42,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 07:26:42,789 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 07:26:42,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:42,905 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2022-03-20 07:26:42,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 07:26:42,906 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-03-20 07:26:42,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:42,906 INFO L225 Difference]: With dead ends: 89 [2022-03-20 07:26:42,906 INFO L226 Difference]: Without dead ends: 89 [2022-03-20 07:26:42,907 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-03-20 07:26:42,907 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 78 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:42,908 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 186 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 07:26:42,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-03-20 07:26:42,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2022-03-20 07:26:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 59 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-03-20 07:26:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-03-20 07:26:42,911 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 62 [2022-03-20 07:26:42,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:42,912 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-03-20 07:26:42,912 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 07:26:42,912 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-03-20 07:26:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-03-20 07:26:42,913 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:42,913 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:42,913 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-20 07:26:42,913 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:42,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:42,913 INFO L85 PathProgramCache]: Analyzing trace with hash -747542986, now seen corresponding path program 1 times [2022-03-20 07:26:42,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:42,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491036886] [2022-03-20 07:26:42,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:42,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:42,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 07:26:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:26:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:26:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:43,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:43,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491036886] [2022-03-20 07:26:43,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491036886] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:43,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:43,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 07:26:43,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445501968] [2022-03-20 07:26:43,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:43,060 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 07:26:43,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:43,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 07:26:43,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-20 07:26:43,060 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 07:26:43,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:43,197 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2022-03-20 07:26:43,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 07:26:43,197 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-03-20 07:26:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:43,198 INFO L225 Difference]: With dead ends: 80 [2022-03-20 07:26:43,198 INFO L226 Difference]: Without dead ends: 80 [2022-03-20 07:26:43,198 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-03-20 07:26:43,198 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 86 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:43,199 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 246 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 07:26:43,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-03-20 07:26:43,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-03-20 07:26:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.103448275862069) internal successors, (64), 59 states have internal predecessors, (64), 13 states have call successors, (13), 12 states have call predecessors, (13), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-03-20 07:26:43,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-03-20 07:26:43,201 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 62 [2022-03-20 07:26:43,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:43,201 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-03-20 07:26:43,201 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 07:26:43,201 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-03-20 07:26:43,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-20 07:26:43,202 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:43,202 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:43,202 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-20 07:26:43,202 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:43,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:43,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1805188072, now seen corresponding path program 1 times [2022-03-20 07:26:43,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:43,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593950314] [2022-03-20 07:26:43,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:43,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 07:26:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:26:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:26:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,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-03-20 07:26:43,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:43,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593950314] [2022-03-20 07:26:43,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593950314] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:43,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:43,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 07:26:43,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107055986] [2022-03-20 07:26:43,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:43,322 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 07:26:43,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:43,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 07:26:43,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 07:26:43,323 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 07:26:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:43,415 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-03-20 07:26:43,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 07:26:43,415 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-03-20 07:26:43,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:43,417 INFO L225 Difference]: With dead ends: 77 [2022-03-20 07:26:43,417 INFO L226 Difference]: Without dead ends: 76 [2022-03-20 07:26:43,418 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-03-20 07:26:43,419 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 92 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:43,419 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 137 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 07:26:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-03-20 07:26:43,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-03-20 07:26:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-03-20 07:26:43,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-03-20 07:26:43,421 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 63 [2022-03-20 07:26:43,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:43,421 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-03-20 07:26:43,421 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 07:26:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-03-20 07:26:43,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-20 07:26:43,422 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:43,422 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:43,422 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-20 07:26:43,422 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:43,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:43,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1247346341, now seen corresponding path program 1 times [2022-03-20 07:26:43,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:43,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455551098] [2022-03-20 07:26:43,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:43,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 07:26:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:26:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:26:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:43,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:43,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455551098] [2022-03-20 07:26:43,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455551098] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:43,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:43,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 07:26:43,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990631186] [2022-03-20 07:26:43,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:43,543 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 07:26:43,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:43,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 07:26:43,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 07:26:43,544 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 07:26:43,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:43,691 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-03-20 07:26:43,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 07:26:43,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-03-20 07:26:43,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:43,692 INFO L225 Difference]: With dead ends: 134 [2022-03-20 07:26:43,692 INFO L226 Difference]: Without dead ends: 134 [2022-03-20 07:26:43,692 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-03-20 07:26:43,692 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 159 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:43,693 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 184 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 07:26:43,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-03-20 07:26:43,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-03-20 07:26:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-03-20 07:26:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2022-03-20 07:26:43,698 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2022-03-20 07:26:43,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:43,698 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2022-03-20 07:26:43,698 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 07:26:43,698 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2022-03-20 07:26:43,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-20 07:26:43,699 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:43,699 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:43,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-20 07:26:43,699 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:43,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:43,700 INFO L85 PathProgramCache]: Analyzing trace with hash -359842660, now seen corresponding path program 1 times [2022-03-20 07:26:43,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:43,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393614613] [2022-03-20 07:26:43,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:43,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 07:26:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:26:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:26:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:43,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:43,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393614613] [2022-03-20 07:26:43,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393614613] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:43,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:43,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 07:26:43,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959103152] [2022-03-20 07:26:43,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:43,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 07:26:43,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:43,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 07:26:43,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-20 07:26:43,858 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 07:26:44,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:44,008 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-03-20 07:26:44,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 07:26:44,008 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-03-20 07:26:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:44,009 INFO L225 Difference]: With dead ends: 133 [2022-03-20 07:26:44,009 INFO L226 Difference]: Without dead ends: 133 [2022-03-20 07:26:44,009 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-03-20 07:26:44,010 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 36 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:44,010 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 258 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 07:26:44,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-03-20 07:26:44,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-03-20 07:26:44,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-03-20 07:26:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2022-03-20 07:26:44,012 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2022-03-20 07:26:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:44,013 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2022-03-20 07:26:44,013 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 07:26:44,013 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-03-20 07:26:44,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-03-20 07:26:44,013 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:44,013 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:44,013 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-20 07:26:44,013 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:44,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:44,014 INFO L85 PathProgramCache]: Analyzing trace with hash 544985405, now seen corresponding path program 1 times [2022-03-20 07:26:44,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:44,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637688209] [2022-03-20 07:26:44,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:44,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:44,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:44,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:44,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:44,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 07:26:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:44,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:26:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:44,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:26:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:44,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:44,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-03-20 07:26:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:44,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:44,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637688209] [2022-03-20 07:26:44,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637688209] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:44,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:44,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 07:26:44,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383790545] [2022-03-20 07:26:44,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:44,143 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 07:26:44,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:44,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 07:26:44,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-03-20 07:26:44,144 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-03-20 07:26:44,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:44,243 INFO L93 Difference]: Finished difference Result 104 states and 103 transitions. [2022-03-20 07:26:44,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 07:26:44,243 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2022-03-20 07:26:44,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:44,244 INFO L225 Difference]: With dead ends: 104 [2022-03-20 07:26:44,244 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 07:26:44,244 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-03-20 07:26:44,244 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 31 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:44,245 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 143 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 07:26:44,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 07:26:44,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 07:26:44,245 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-03-20 07:26:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 07:26:44,245 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2022-03-20 07:26:44,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:44,245 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 07:26:44,245 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-03-20 07:26:44,245 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 07:26:44,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 07:26:44,247 INFO L788 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 07:26:44,248 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-20 07:26:44,250 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:44,251 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 07:26:44,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 07:26:44 BasicIcfg [2022-03-20 07:26:44,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 07:26:44,253 INFO L158 Benchmark]: Toolchain (without parser) took 8464.52ms. Allocated memory was 206.6MB in the beginning and 337.6MB in the end (delta: 131.1MB). Free memory was 153.3MB in the beginning and 123.6MB in the end (delta: 29.7MB). Peak memory consumption was 160.0MB. Max. memory is 8.0GB. [2022-03-20 07:26:44,253 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 206.6MB. Free memory is still 169.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 07:26:44,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.74ms. Allocated memory is still 206.6MB. Free memory was 153.1MB in the beginning and 177.1MB in the end (delta: -24.0MB). Peak memory consumption was 6.6MB. Max. memory is 8.0GB. [2022-03-20 07:26:44,254 INFO L158 Benchmark]: Boogie Preprocessor took 48.39ms. Allocated memory is still 206.6MB. Free memory was 177.1MB in the beginning and 175.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 07:26:44,254 INFO L158 Benchmark]: RCFGBuilder took 493.71ms. Allocated memory is still 206.6MB. Free memory was 175.0MB in the beginning and 152.3MB in the end (delta: 22.7MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-03-20 07:26:44,254 INFO L158 Benchmark]: IcfgTransformer took 44.15ms. Allocated memory is still 206.6MB. Free memory was 152.2MB in the beginning and 149.5MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-20 07:26:44,254 INFO L158 Benchmark]: TraceAbstraction took 7529.05ms. Allocated memory was 206.6MB in the beginning and 337.6MB in the end (delta: 131.1MB). Free memory was 149.2MB in the beginning and 123.6MB in the end (delta: 25.5MB). Peak memory consumption was 156.5MB. Max. memory is 8.0GB. [2022-03-20 07:26:44,255 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.14ms. Allocated memory is still 206.6MB. Free memory is still 169.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 344.74ms. Allocated memory is still 206.6MB. Free memory was 153.1MB in the beginning and 177.1MB in the end (delta: -24.0MB). Peak memory consumption was 6.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.39ms. Allocated memory is still 206.6MB. Free memory was 177.1MB in the beginning and 175.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 493.71ms. Allocated memory is still 206.6MB. Free memory was 175.0MB in the beginning and 152.3MB in the end (delta: 22.7MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * IcfgTransformer took 44.15ms. Allocated memory is still 206.6MB. Free memory was 152.2MB in the beginning and 149.5MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 7529.05ms. Allocated memory was 206.6MB in the beginning and 337.6MB in the end (delta: 131.1MB). Free memory was 149.2MB in the beginning and 123.6MB in the end (delta: 25.5MB). Peak memory consumption was 156.5MB. 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 13 procedures, 151 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3776 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3768 mSDsluCounter, 4877 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2712 mSDsCounter, 1055 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4849 IncrementalHoareTripleChecker+Invalid, 5904 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1055 mSolverCounterUnsat, 2165 mSDtfsCounter, 4849 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 352 GetRequests, 165 SyntacticMatches, 4 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=3, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 147 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 929 NumberOfCodeBlocks, 929 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 911 ConstructedInterpolants, 0 QuantifiedInterpolants, 4122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 RESULT: Ultimate proved your program to be correct! [2022-03-20 07:26:44,290 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...