/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-7390193 [2022-04-05 04:11:33,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 04:11:33,076 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 04:11:33,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 04:11:33,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 04:11:33,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 04:11:33,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 04:11:33,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 04:11:33,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 04:11:33,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 04:11:33,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 04:11:33,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 04:11:33,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 04:11:33,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 04:11:33,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 04:11:33,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 04:11:33,110 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 04:11:33,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 04:11:33,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 04:11:33,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 04:11:33,114 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 04:11:33,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 04:11:33,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 04:11:33,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 04:11:33,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 04:11:33,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 04:11:33,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 04:11:33,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 04:11:33,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 04:11:33,134 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 04:11:33,135 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 04:11:33,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 04:11:33,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 04:11:33,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 04:11:33,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 04:11:33,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 04:11:33,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 04:11:33,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 04:11:33,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 04:11:33,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 04:11:33,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 04:11:33,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 04:11:33,144 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-05 04:11:33,151 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 04:11:33,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 04:11:33,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 04:11:33,152 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-05 04:11:33,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 04:11:33,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-05 04:11:33,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 04:11:33,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 04:11:33,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 04:11:33,153 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 04:11:33,153 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-05 04:11:33,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 04:11:33,153 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 04:11:33,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 04:11:33,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 04:11:33,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 04:11:33,153 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-05 04:11:33,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 04:11:33,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 04:11:33,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 04:11:33,154 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 04:11:33,155 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 04:11:33,155 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-04-05 04:11:33,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 04:11:33,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 04:11:33,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 04:11:33,363 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 04:11:33,365 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 04:11:33,366 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-04-05 04:11:33,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2fe39612/9c467efaecab4e6bad7366e69715eb6c/FLAG62acb04eb [2022-04-05 04:11:33,764 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 04:11:33,765 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-04-05 04:11:33,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2fe39612/9c467efaecab4e6bad7366e69715eb6c/FLAG62acb04eb [2022-04-05 04:11:34,160 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2fe39612/9c467efaecab4e6bad7366e69715eb6c [2022-04-05 04:11:34,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 04:11:34,165 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 04:11:34,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 04:11:34,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 04:11:34,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 04:11:34,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 04:11:34" (1/1) ... [2022-04-05 04:11:34,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@280b614e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:34, skipping insertion in model container [2022-04-05 04:11:34,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 04:11:34" (1/1) ... [2022-04-05 04:11:34,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 04:11:34,209 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 04:11:34,380 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-04-05 04:11:34,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 04:11:34,390 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 04:11:34,430 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-04-05 04:11:34,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 04:11:34,440 INFO L208 MainTranslator]: Completed translation [2022-04-05 04:11:34,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:34 WrapperNode [2022-04-05 04:11:34,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 04:11:34,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 04:11:34,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 04:11:34,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 04:11:34,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:34" (1/1) ... [2022-04-05 04:11:34,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:34" (1/1) ... [2022-04-05 04:11:34,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:34" (1/1) ... [2022-04-05 04:11:34,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:34" (1/1) ... [2022-04-05 04:11:34,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:34" (1/1) ... [2022-04-05 04:11:34,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:34" (1/1) ... [2022-04-05 04:11:34,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:34" (1/1) ... [2022-04-05 04:11:34,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 04:11:34,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 04:11:34,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 04:11:34,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 04:11:34,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:34" (1/1) ... [2022-04-05 04:11:34,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 04:11:34,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 04:11:34,515 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-04-05 04:11:34,525 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-04-05 04:11:34,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 04:11:34,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 04:11:34,540 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 04:11:34,540 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-04-05 04:11:34,540 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-04-05 04:11:34,540 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-04-05 04:11:34,540 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 04:11:34,540 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-04-05 04:11:34,540 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-04-05 04:11:34,540 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-04-05 04:11:34,540 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-04-05 04:11:34,540 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-04-05 04:11:34,541 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-04-05 04:11:34,541 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-04-05 04:11:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 04:11:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 04:11:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 04:11:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 04:11:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-05 04:11:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-05 04:11:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-05 04:11:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-04-05 04:11:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-04-05 04:11:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-04-05 04:11:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-04-05 04:11:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-04-05 04:11:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-04-05 04:11:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-04-05 04:11:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-04-05 04:11:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-04-05 04:11:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 04:11:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-04-05 04:11:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 04:11:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 04:11:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 04:11:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 04:11:34,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 04:11:34,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 04:11:34,608 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 04:11:34,610 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 04:11:34,686 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:11:34,747 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2022-04-05 04:11:34,747 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2022-04-05 04:11:34,748 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:11:34,777 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2022-04-05 04:11:34,777 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2022-04-05 04:11:34,796 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:11:34,812 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-04-05 04:11:34,812 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-04-05 04:11:34,828 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:11:34,928 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-04-05 04:11:34,928 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-04-05 04:11:34,932 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 04:11:34,937 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 04:11:34,937 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-05 04:11:34,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 04:11:34 BoogieIcfgContainer [2022-04-05 04:11:34,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 04:11:34,940 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 04:11:34,940 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 04:11:34,950 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 04:11:34,952 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 04:11:34" (1/1) ... [2022-04-05 04:11:34,954 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-05 04:11:34,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 04:11:34 BasicIcfg [2022-04-05 04:11:34,985 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 04:11:34,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 04:11:34,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 04:11:34,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 04:11:34,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 04:11:34" (1/4) ... [2022-04-05 04:11:34,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474f79a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 04:11:34, skipping insertion in model container [2022-04-05 04:11:34,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:34" (2/4) ... [2022-04-05 04:11:34,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474f79a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 04:11:34, skipping insertion in model container [2022-04-05 04:11:34,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 04:11:34" (3/4) ... [2022-04-05 04:11:34,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474f79a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 04:11:34, skipping insertion in model container [2022-04-05 04:11:34,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 04:11:34" (4/4) ... [2022-04-05 04:11:34,994 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.cJordan [2022-04-05 04:11:34,998 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-05 04:11:34,998 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-05 04:11:35,040 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 04:11:35,048 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-04-05 04:11:35,048 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-05 04:11:35,065 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-04-05 04:11:35,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-05 04:11:35,080 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:35,080 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-04-05 04:11:35,081 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:35,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:35,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1155157574, now seen corresponding path program 1 times [2022-04-05 04:11:35,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:35,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982791433] [2022-04-05 04:11:35,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:35,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:35,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:35,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:35,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:35,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982791433] [2022-04-05 04:11:35,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982791433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:35,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:35,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 04:11:35,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302747164] [2022-04-05 04:11:35,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:35,462 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 04:11:35,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:35,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 04:11:35,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-05 04:11:35,491 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-04-05 04:11:35,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:35,856 INFO L93 Difference]: Finished difference Result 168 states and 236 transitions. [2022-04-05 04:11:35,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-05 04:11:35,858 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-04-05 04:11:35,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:35,865 INFO L225 Difference]: With dead ends: 168 [2022-04-05 04:11:35,890 INFO L226 Difference]: Without dead ends: 157 [2022-04-05 04:11:35,892 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-04-05 04:11:35,894 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-04-05 04:11:35,895 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-04-05 04:11:35,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-05 04:11:35,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2022-04-05 04:11:35,923 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-04-05 04:11:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2022-04-05 04:11:35,926 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2022-04-05 04:11:35,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:35,926 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2022-04-05 04:11:35,926 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-04-05 04:11:35,926 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2022-04-05 04:11:35,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-05 04:11:35,927 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:35,927 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-04-05 04:11:35,927 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 04:11:35,927 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:35,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:35,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1515864402, now seen corresponding path program 1 times [2022-04-05 04:11:35,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:35,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231545826] [2022-04-05 04:11:35,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:35,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:35,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:36,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:36,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:36,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:36,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231545826] [2022-04-05 04:11:36,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231545826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:36,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:36,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 04:11:36,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781396407] [2022-04-05 04:11:36,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:36,045 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 04:11:36,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:36,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 04:11:36,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-05 04:11:36,046 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-04-05 04:11:36,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:36,383 INFO L93 Difference]: Finished difference Result 220 states and 292 transitions. [2022-04-05 04:11:36,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 04:11:36,384 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-04-05 04:11:36,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:36,385 INFO L225 Difference]: With dead ends: 220 [2022-04-05 04:11:36,385 INFO L226 Difference]: Without dead ends: 219 [2022-04-05 04:11:36,386 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-04-05 04:11:36,387 INFO L913 BasicCegarLoop]: 202 mSDtfsCounter, 318 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-04-05 04:11:36,387 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-04-05 04:11:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-05 04:11:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2022-04-05 04:11:36,398 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-04-05 04:11:36,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2022-04-05 04:11:36,400 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2022-04-05 04:11:36,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:36,400 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2022-04-05 04:11:36,400 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-04-05 04:11:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2022-04-05 04:11:36,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-05 04:11:36,401 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:36,401 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-04-05 04:11:36,401 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-05 04:11:36,401 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:36,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:36,402 INFO L85 PathProgramCache]: Analyzing trace with hash 252875622, now seen corresponding path program 1 times [2022-04-05 04:11:36,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:36,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377023950] [2022-04-05 04:11:36,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:36,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:36,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:36,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:36,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:36,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:36,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:36,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377023950] [2022-04-05 04:11:36,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377023950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:36,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:36,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 04:11:36,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890714453] [2022-04-05 04:11:36,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:36,507 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 04:11:36,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:36,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 04:11:36,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-05 04:11:36,508 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-04-05 04:11:36,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:36,787 INFO L93 Difference]: Finished difference Result 254 states and 335 transitions. [2022-04-05 04:11:36,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 04:11:36,788 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-04-05 04:11:36,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:36,792 INFO L225 Difference]: With dead ends: 254 [2022-04-05 04:11:36,792 INFO L226 Difference]: Without dead ends: 254 [2022-04-05 04:11:36,793 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-04-05 04:11:36,798 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-04-05 04:11:36,800 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-04-05 04:11:36,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-04-05 04:11:36,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2022-04-05 04:11:36,815 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-04-05 04:11:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2022-04-05 04:11:36,816 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2022-04-05 04:11:36,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:36,817 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2022-04-05 04:11:36,817 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-04-05 04:11:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2022-04-05 04:11:36,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-05 04:11:36,818 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:36,818 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-04-05 04:11:36,818 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-05 04:11:36,818 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:36,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:36,819 INFO L85 PathProgramCache]: Analyzing trace with hash -301837211, now seen corresponding path program 1 times [2022-04-05 04:11:36,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:36,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136897417] [2022-04-05 04:11:36,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:36,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:36,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:36,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:36,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:36,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:36,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136897417] [2022-04-05 04:11:36,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136897417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:36,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:36,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 04:11:36,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242291147] [2022-04-05 04:11:36,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:36,948 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 04:11:36,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:36,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 04:11:36,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-05 04:11:36,949 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-04-05 04:11:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:37,256 INFO L93 Difference]: Finished difference Result 217 states and 288 transitions. [2022-04-05 04:11:37,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 04:11:37,257 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-04-05 04:11:37,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:37,258 INFO L225 Difference]: With dead ends: 217 [2022-04-05 04:11:37,258 INFO L226 Difference]: Without dead ends: 217 [2022-04-05 04:11:37,259 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-04-05 04:11:37,259 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-04-05 04:11:37,260 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-04-05 04:11:37,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-05 04:11:37,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-04-05 04:11:37,267 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-04-05 04:11:37,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2022-04-05 04:11:37,268 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2022-04-05 04:11:37,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:37,268 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2022-04-05 04:11:37,269 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-04-05 04:11:37,269 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-04-05 04:11:37,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-05 04:11:37,270 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:37,270 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-04-05 04:11:37,270 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-05 04:11:37,270 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:37,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:37,271 INFO L85 PathProgramCache]: Analyzing trace with hash -141227467, now seen corresponding path program 1 times [2022-04-05 04:11:37,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:37,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13618348] [2022-04-05 04:11:37,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:37,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:37,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:37,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:37,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:37,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-05 04:11:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:37,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:37,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13618348] [2022-04-05 04:11:37,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13618348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:37,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:37,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-05 04:11:37,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373823256] [2022-04-05 04:11:37,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:37,405 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 04:11:37,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:37,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 04:11:37,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-05 04:11:37,406 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-04-05 04:11:37,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:37,687 INFO L93 Difference]: Finished difference Result 208 states and 271 transitions. [2022-04-05 04:11:37,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 04:11:37,688 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-04-05 04:11:37,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:37,689 INFO L225 Difference]: With dead ends: 208 [2022-04-05 04:11:37,689 INFO L226 Difference]: Without dead ends: 208 [2022-04-05 04:11:37,689 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-05 04:11:37,690 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-04-05 04:11:37,690 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-04-05 04:11:37,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-04-05 04:11:37,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2022-04-05 04:11:37,695 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-04-05 04:11:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2022-04-05 04:11:37,696 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2022-04-05 04:11:37,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:37,696 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2022-04-05 04:11:37,696 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-04-05 04:11:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2022-04-05 04:11:37,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-05 04:11:37,712 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:37,712 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-04-05 04:11:37,712 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-05 04:11:37,713 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:37,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:37,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1455239378, now seen corresponding path program 1 times [2022-04-05 04:11:37,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:37,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845354342] [2022-04-05 04:11:37,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:37,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:37,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:37,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:37,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:37,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-05 04:11:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:37,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:37,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-05 04:11:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:37,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:37,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:37,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845354342] [2022-04-05 04:11:37,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845354342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:37,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:37,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-05 04:11:37,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147245940] [2022-04-05 04:11:37,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:37,841 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 04:11:37,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:37,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 04:11:37,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-05 04:11:37,842 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-04-05 04:11:38,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:38,133 INFO L93 Difference]: Finished difference Result 197 states and 257 transitions. [2022-04-05 04:11:38,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 04:11:38,134 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-04-05 04:11:38,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:38,135 INFO L225 Difference]: With dead ends: 197 [2022-04-05 04:11:38,135 INFO L226 Difference]: Without dead ends: 197 [2022-04-05 04:11:38,135 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-04-05 04:11:38,136 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-04-05 04:11:38,136 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-04-05 04:11:38,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-05 04:11:38,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2022-04-05 04:11:38,140 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-04-05 04:11:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2022-04-05 04:11:38,141 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2022-04-05 04:11:38,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:38,141 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2022-04-05 04:11:38,141 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-04-05 04:11:38,142 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2022-04-05 04:11:38,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-05 04:11:38,143 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:38,143 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-04-05 04:11:38,143 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-05 04:11:38,143 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:38,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:38,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1069507529, now seen corresponding path program 1 times [2022-04-05 04:11:38,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:38,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509938143] [2022-04-05 04:11:38,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:38,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:38,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:38,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:38,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:38,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 04:11:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:38,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:38,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:38,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509938143] [2022-04-05 04:11:38,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509938143] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:38,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:38,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:11:38,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609902671] [2022-04-05 04:11:38,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:38,328 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:11:38,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:38,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:11:38,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:11:38,328 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-04-05 04:11:38,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:38,813 INFO L93 Difference]: Finished difference Result 210 states and 270 transitions. [2022-04-05 04:11:38,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 04:11:38,814 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-04-05 04:11:38,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:38,817 INFO L225 Difference]: With dead ends: 210 [2022-04-05 04:11:38,817 INFO L226 Difference]: Without dead ends: 210 [2022-04-05 04:11:38,817 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-04-05 04:11:38,819 INFO L913 BasicCegarLoop]: 194 mSDtfsCounter, 562 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-04-05 04:11:38,820 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-04-05 04:11:38,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-05 04:11:38,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 188. [2022-04-05 04:11:38,827 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-04-05 04:11:38,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2022-04-05 04:11:38,828 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 50 [2022-04-05 04:11:38,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:38,828 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2022-04-05 04:11:38,828 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-04-05 04:11:38,828 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2022-04-05 04:11:38,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-05 04:11:38,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:38,830 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-04-05 04:11:38,830 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-05 04:11:38,830 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:38,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:38,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1382255258, now seen corresponding path program 1 times [2022-04-05 04:11:38,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:38,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934025594] [2022-04-05 04:11:38,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:38,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:38,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:38,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:38,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:39,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 04:11:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:39,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:39,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:39,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:39,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934025594] [2022-04-05 04:11:39,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934025594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:39,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:39,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-05 04:11:39,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046547748] [2022-04-05 04:11:39,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:39,074 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-05 04:11:39,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:39,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-05 04:11:39,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-05 04:11:39,075 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-04-05 04:11:39,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:39,478 INFO L93 Difference]: Finished difference Result 182 states and 235 transitions. [2022-04-05 04:11:39,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 04:11:39,479 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-04-05 04:11:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:39,480 INFO L225 Difference]: With dead ends: 182 [2022-04-05 04:11:39,480 INFO L226 Difference]: Without dead ends: 182 [2022-04-05 04:11:39,480 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2022-04-05 04:11:39,481 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-04-05 04:11:39,481 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-04-05 04:11:39,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-05 04:11:39,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 176. [2022-04-05 04:11:39,486 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-04-05 04:11:39,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 228 transitions. [2022-04-05 04:11:39,487 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 228 transitions. Word has length 52 [2022-04-05 04:11:39,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:39,487 INFO L478 AbstractCegarLoop]: Abstraction has 176 states and 228 transitions. [2022-04-05 04:11:39,487 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-04-05 04:11:39,487 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 228 transitions. [2022-04-05 04:11:39,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-05 04:11:39,488 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:39,490 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-04-05 04:11:39,490 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-05 04:11:39,491 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:39,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:39,491 INFO L85 PathProgramCache]: Analyzing trace with hash -459288966, now seen corresponding path program 1 times [2022-04-05 04:11:39,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:39,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256305100] [2022-04-05 04:11:39,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:39,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:39,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:39,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:39,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:39,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 04:11:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:39,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:39,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:39,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256305100] [2022-04-05 04:11:39,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256305100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:39,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:39,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-05 04:11:39,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481142426] [2022-04-05 04:11:39,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:39,624 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-05 04:11:39,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:39,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-05 04:11:39,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-05 04:11:39,626 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-04-05 04:11:39,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:39,822 INFO L93 Difference]: Finished difference Result 178 states and 228 transitions. [2022-04-05 04:11:39,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 04:11:39,822 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-04-05 04:11:39,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:39,824 INFO L225 Difference]: With dead ends: 178 [2022-04-05 04:11:39,824 INFO L226 Difference]: Without dead ends: 91 [2022-04-05 04:11:39,825 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-04-05 04:11:39,826 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-04-05 04:11:39,826 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-04-05 04:11:39,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-05 04:11:39,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-05 04:11:39,829 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-04-05 04:11:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2022-04-05 04:11:39,829 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 52 [2022-04-05 04:11:39,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:39,829 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2022-04-05 04:11:39,829 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-04-05 04:11:39,830 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-04-05 04:11:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-05 04:11:39,831 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:39,831 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-04-05 04:11:39,831 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-05 04:11:39,831 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:39,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:39,831 INFO L85 PathProgramCache]: Analyzing trace with hash -273247555, now seen corresponding path program 1 times [2022-04-05 04:11:39,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:39,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029206203] [2022-04-05 04:11:39,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:39,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:39,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:39,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:39,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:39,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-05 04:11:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:39,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:11:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:39,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:39,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:40,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:40,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029206203] [2022-04-05 04:11:40,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029206203] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:40,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:40,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:11:40,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998393946] [2022-04-05 04:11:40,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:40,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:11:40,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:40,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:11:40,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:11:40,004 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-04-05 04:11:40,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:40,292 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-04-05 04:11:40,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 04:11:40,292 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-04-05 04:11:40,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:40,293 INFO L225 Difference]: With dead ends: 91 [2022-04-05 04:11:40,293 INFO L226 Difference]: Without dead ends: 91 [2022-04-05 04:11:40,293 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-04-05 04:11:40,294 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 96 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-04-05 04:11:40,294 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-04-05 04:11:40,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-05 04:11:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-05 04:11:40,296 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-04-05 04:11:40,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-04-05 04:11:40,297 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 59 [2022-04-05 04:11:40,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:40,297 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-04-05 04:11:40,297 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-04-05 04:11:40,297 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-04-05 04:11:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-05 04:11:40,297 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:40,298 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-04-05 04:11:40,298 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-05 04:11:40,298 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:40,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:40,299 INFO L85 PathProgramCache]: Analyzing trace with hash 366370572, now seen corresponding path program 1 times [2022-04-05 04:11:40,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:40,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37808777] [2022-04-05 04:11:40,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:40,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-05 04:11:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:11:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:40,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:40,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37808777] [2022-04-05 04:11:40,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37808777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:40,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:40,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:11:40,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543754492] [2022-04-05 04:11:40,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:40,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:11:40,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:40,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:11:40,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:11:40,477 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-04-05 04:11:40,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:40,600 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2022-04-05 04:11:40,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 04:11:40,600 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-04-05 04:11:40,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:40,601 INFO L225 Difference]: With dead ends: 103 [2022-04-05 04:11:40,601 INFO L226 Difference]: Without dead ends: 93 [2022-04-05 04:11:40,603 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-04-05 04:11:40,603 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 108 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:40,604 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 305 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 04:11:40,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-05 04:11:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2022-04-05 04:11:40,606 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-04-05 04:11:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2022-04-05 04:11:40,606 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 61 [2022-04-05 04:11:40,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:40,607 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2022-04-05 04:11:40,607 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-04-05 04:11:40,607 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-05 04:11:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-05 04:11:40,607 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:40,607 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-04-05 04:11:40,607 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-05 04:11:40,608 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:40,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash -350640073, now seen corresponding path program 1 times [2022-04-05 04:11:40,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:40,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957918909] [2022-04-05 04:11:40,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:40,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-05 04:11:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:11:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:40,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:40,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957918909] [2022-04-05 04:11:40,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957918909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:40,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:40,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-05 04:11:40,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692876739] [2022-04-05 04:11:40,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:40,725 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 04:11:40,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:40,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 04:11:40,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-05 04:11:40,725 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-04-05 04:11:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:40,816 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-04-05 04:11:40,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 04:11:40,816 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-04-05 04:11:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:40,816 INFO L225 Difference]: With dead ends: 78 [2022-04-05 04:11:40,817 INFO L226 Difference]: Without dead ends: 78 [2022-04-05 04:11:40,817 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-04-05 04:11:40,818 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-04-05 04:11:40,818 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-04-05 04:11:40,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-05 04:11:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-05 04:11:40,819 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-04-05 04:11:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2022-04-05 04:11:40,820 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 62 [2022-04-05 04:11:40,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:40,821 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2022-04-05 04:11:40,821 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-04-05 04:11:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-04-05 04:11:40,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-05 04:11:40,821 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:40,821 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-04-05 04:11:40,821 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-05 04:11:40,822 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:40,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:40,822 INFO L85 PathProgramCache]: Analyzing trace with hash -57237066, now seen corresponding path program 1 times [2022-04-05 04:11:40,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:40,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198103756] [2022-04-05 04:11:40,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:40,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-05 04:11:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:11:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:40,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:40,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198103756] [2022-04-05 04:11:40,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198103756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:40,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:40,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-05 04:11:40,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689329107] [2022-04-05 04:11:40,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:40,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 04:11:40,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:40,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 04:11:40,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-05 04:11:40,962 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-04-05 04:11:41,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:41,078 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2022-04-05 04:11:41,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 04:11:41,078 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-04-05 04:11:41,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:41,079 INFO L225 Difference]: With dead ends: 89 [2022-04-05 04:11:41,079 INFO L226 Difference]: Without dead ends: 89 [2022-04-05 04:11:41,079 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-04-05 04:11:41,080 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-04-05 04:11:41,080 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-04-05 04:11:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-05 04:11:41,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2022-04-05 04:11:41,084 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-04-05 04:11:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-04-05 04:11:41,084 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 62 [2022-04-05 04:11:41,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:41,084 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-04-05 04:11:41,085 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-04-05 04:11:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-04-05 04:11:41,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-05 04:11:41,087 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:41,087 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-04-05 04:11:41,087 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-05 04:11:41,087 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:41,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:41,088 INFO L85 PathProgramCache]: Analyzing trace with hash -747542986, now seen corresponding path program 1 times [2022-04-05 04:11:41,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:41,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208874839] [2022-04-05 04:11:41,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:41,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-05 04:11:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:11:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:41,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:41,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208874839] [2022-04-05 04:11:41,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208874839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:41,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:41,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:11:41,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265305667] [2022-04-05 04:11:41,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:41,234 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:11:41,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:41,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:11:41,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:11:41,235 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-04-05 04:11:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:41,380 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2022-04-05 04:11:41,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 04:11:41,381 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-04-05 04:11:41,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:41,381 INFO L225 Difference]: With dead ends: 80 [2022-04-05 04:11:41,381 INFO L226 Difference]: Without dead ends: 80 [2022-04-05 04:11:41,381 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-04-05 04:11:41,382 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 86 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:41,382 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 245 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 04:11:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-05 04:11:41,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-04-05 04:11:41,385 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-04-05 04:11:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-04-05 04:11:41,385 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 62 [2022-04-05 04:11:41,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:41,386 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-04-05 04:11:41,386 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-04-05 04:11:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-04-05 04:11:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-05 04:11:41,387 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:41,387 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-04-05 04:11:41,388 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-05 04:11:41,388 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:41,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:41,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1805188072, now seen corresponding path program 1 times [2022-04-05 04:11:41,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:41,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002954984] [2022-04-05 04:11:41,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:41,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-05 04:11:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:11:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:41,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:41,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002954984] [2022-04-05 04:11:41,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002954984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:41,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:41,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-05 04:11:41,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463031237] [2022-04-05 04:11:41,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:41,505 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 04:11:41,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:41,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 04:11:41,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-05 04:11:41,505 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-04-05 04:11:41,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:41,597 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-04-05 04:11:41,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 04:11:41,597 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-04-05 04:11:41,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:41,599 INFO L225 Difference]: With dead ends: 77 [2022-04-05 04:11:41,599 INFO L226 Difference]: Without dead ends: 76 [2022-04-05 04:11:41,600 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-04-05 04:11:41,600 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-04-05 04:11:41,601 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-04-05 04:11:41,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-05 04:11:41,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-05 04:11:41,604 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-04-05 04:11:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-04-05 04:11:41,605 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 63 [2022-04-05 04:11:41,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:41,605 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-04-05 04:11:41,605 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-04-05 04:11:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-05 04:11:41,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-05 04:11:41,605 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:41,606 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-04-05 04:11:41,606 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-05 04:11:41,606 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:41,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:41,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1247346341, now seen corresponding path program 1 times [2022-04-05 04:11:41,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:41,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282440246] [2022-04-05 04:11:41,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:41,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-05 04:11:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:11:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:41,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:41,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282440246] [2022-04-05 04:11:41,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282440246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:41,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:41,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-05 04:11:41,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636774706] [2022-04-05 04:11:41,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:41,727 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 04:11:41,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:41,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 04:11:41,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-05 04:11:41,728 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-04-05 04:11:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:41,867 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-04-05 04:11:41,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 04:11:41,868 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-04-05 04:11:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:41,868 INFO L225 Difference]: With dead ends: 134 [2022-04-05 04:11:41,868 INFO L226 Difference]: Without dead ends: 134 [2022-04-05 04:11:41,868 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-04-05 04:11:41,869 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-04-05 04:11:41,869 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-04-05 04:11:41,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-05 04:11:41,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-04-05 04:11:41,872 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-04-05 04:11:41,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2022-04-05 04:11:41,873 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2022-04-05 04:11:41,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:41,873 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2022-04-05 04:11:41,873 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-04-05 04:11:41,873 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2022-04-05 04:11:41,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-05 04:11:41,874 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:41,874 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-04-05 04:11:41,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-05 04:11:41,875 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:41,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:41,875 INFO L85 PathProgramCache]: Analyzing trace with hash -359842660, now seen corresponding path program 1 times [2022-04-05 04:11:41,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:41,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935942770] [2022-04-05 04:11:41,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:41,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-05 04:11:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:42,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:11:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:42,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:42,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:42,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:42,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935942770] [2022-04-05 04:11:42,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935942770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:42,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:42,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:11:42,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900560431] [2022-04-05 04:11:42,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:42,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:11:42,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:42,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:11:42,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:11:42,033 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-04-05 04:11:42,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:42,176 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-04-05 04:11:42,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 04:11:42,176 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-04-05 04:11:42,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:42,178 INFO L225 Difference]: With dead ends: 133 [2022-04-05 04:11:42,178 INFO L226 Difference]: Without dead ends: 133 [2022-04-05 04:11:42,178 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-04-05 04:11:42,179 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 36 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:42,179 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 257 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 04:11:42,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-05 04:11:42,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-04-05 04:11:42,182 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-04-05 04:11:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2022-04-05 04:11:42,183 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2022-04-05 04:11:42,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:42,183 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2022-04-05 04:11:42,183 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-04-05 04:11:42,184 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-05 04:11:42,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-05 04:11:42,185 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:42,185 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-04-05 04:11:42,185 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-05 04:11:42,185 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:42,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:42,186 INFO L85 PathProgramCache]: Analyzing trace with hash 544985405, now seen corresponding path program 1 times [2022-04-05 04:11:42,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:42,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976437929] [2022-04-05 04:11:42,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:42,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:42,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:42,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:42,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:42,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-05 04:11:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:42,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:11:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:42,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:42,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:42,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-05 04:11:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:42,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:42,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:42,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976437929] [2022-04-05 04:11:42,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976437929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:42,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:42,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-05 04:11:42,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849243554] [2022-04-05 04:11:42,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:42,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-05 04:11:42,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:42,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-05 04:11:42,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-05 04:11:42,342 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-04-05 04:11:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:42,441 INFO L93 Difference]: Finished difference Result 104 states and 103 transitions. [2022-04-05 04:11:42,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 04:11:42,441 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-04-05 04:11:42,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:42,442 INFO L225 Difference]: With dead ends: 104 [2022-04-05 04:11:42,442 INFO L226 Difference]: Without dead ends: 0 [2022-04-05 04:11:42,442 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-04-05 04:11:42,443 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-04-05 04:11:42,443 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-04-05 04:11:42,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-05 04:11:42,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-05 04:11:42,444 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-04-05 04:11:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-05 04:11:42,444 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2022-04-05 04:11:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:42,444 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-05 04:11:42,444 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-04-05 04:11:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-05 04:11:42,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-05 04:11:42,447 INFO L788 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-05 04:11:42,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-05 04:11:42,454 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-04-05 04:11:42,455 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-05 04:11:42,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 04:11:42 BasicIcfg [2022-04-05 04:11:42,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-05 04:11:42,459 INFO L158 Benchmark]: Toolchain (without parser) took 8294.11ms. Allocated memory was 194.0MB in the beginning and 294.6MB in the end (delta: 100.7MB). Free memory was 139.4MB in the beginning and 246.4MB in the end (delta: -107.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-05 04:11:42,459 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 156.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-05 04:11:42,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.61ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 139.2MB in the beginning and 202.5MB in the end (delta: -63.3MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-04-05 04:11:42,459 INFO L158 Benchmark]: Boogie Preprocessor took 36.05ms. Allocated memory is still 232.8MB. Free memory was 202.5MB in the beginning and 200.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-05 04:11:42,460 INFO L158 Benchmark]: RCFGBuilder took 461.60ms. Allocated memory is still 232.8MB. Free memory was 200.4MB in the beginning and 177.4MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-04-05 04:11:42,460 INFO L158 Benchmark]: IcfgTransformer took 45.37ms. Allocated memory is still 232.8MB. Free memory was 177.4MB in the beginning and 174.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-05 04:11:42,460 INFO L158 Benchmark]: TraceAbstraction took 7471.32ms. Allocated memory was 232.8MB in the beginning and 294.6MB in the end (delta: 61.9MB). Free memory was 174.3MB in the beginning and 246.4MB in the end (delta: -72.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-05 04:11:42,463 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.09ms. Allocated memory is still 194.0MB. Free memory is still 156.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 273.61ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 139.2MB in the beginning and 202.5MB in the end (delta: -63.3MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.05ms. Allocated memory is still 232.8MB. Free memory was 202.5MB in the beginning and 200.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 461.60ms. Allocated memory is still 232.8MB. Free memory was 200.4MB in the beginning and 177.4MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * IcfgTransformer took 45.37ms. Allocated memory is still 232.8MB. Free memory was 177.4MB in the beginning and 174.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 7471.32ms. Allocated memory was 232.8MB in the beginning and 294.6MB in the end (delta: 61.9MB). Free memory was 174.3MB in the beginning and 246.4MB in the end (delta: -72.1MB). There was no memory consumed. 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.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3776 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3768 mSDsluCounter, 4874 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2709 mSDsCounter, 1055 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4852 IncrementalHoareTripleChecker+Invalid, 5907 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1055 mSolverCounterUnsat, 2165 mSDtfsCounter, 4852 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.0s 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.2s 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-04-05 04:11:42,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...