/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-09 23:25:43,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-09 23:25:43,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-09 23:25:43,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-09 23:25:43,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-09 23:25:43,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-09 23:25:43,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-09 23:25:43,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-09 23:25:43,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-09 23:25:43,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-09 23:25:43,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-09 23:25:43,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-09 23:25:43,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-09 23:25:43,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-09 23:25:43,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-09 23:25:43,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-09 23:25:43,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-09 23:25:43,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-09 23:25:43,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-09 23:25:43,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-09 23:25:43,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-09 23:25:43,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-09 23:25:43,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-09 23:25:43,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-09 23:25:43,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-09 23:25:43,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-09 23:25:43,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-09 23:25:43,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-09 23:25:43,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-09 23:25:43,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-09 23:25:43,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-09 23:25:43,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-09 23:25:43,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-09 23:25:43,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-09 23:25:43,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-09 23:25:43,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-09 23:25:43,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-09 23:25:43,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-09 23:25:43,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-09 23:25:43,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-09 23:25:43,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-09 23:25:43,222 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-09 23:25:43,237 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-09 23:25:43,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-09 23:25:43,237 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-09 23:25:43,237 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-09 23:25:43,238 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-09 23:25:43,238 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-09 23:25:43,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-09 23:25:43,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-09 23:25:43,238 INFO L138 SettingsManager]: * Use SBE=true [2022-01-09 23:25:43,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-09 23:25:43,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-09 23:25:43,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-09 23:25:43,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-09 23:25:43,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-09 23:25:43,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-09 23:25:43,239 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-09 23:25:43,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-09 23:25:43,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-09 23:25:43,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-09 23:25:43,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-09 23:25:43,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-09 23:25:43,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:25:43,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-09 23:25:43,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-09 23:25:43,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-09 23:25:43,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-09 23:25:43,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-09 23:25:43,240 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-09 23:25:43,240 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-09 23:25:43,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-09 23:25:43,240 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-09 23:25:43,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-09 23:25:43,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-09 23:25:43,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-09 23:25:43,408 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-09 23:25:43,409 INFO L275 PluginConnector]: CDTParser initialized [2022-01-09 23:25:43,410 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2022-01-09 23:25:43,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef969a233/320eb91cbeda4d97a5218ab27eaf6d26/FLAG0a9b1193f [2022-01-09 23:25:43,943 INFO L306 CDTParser]: Found 1 translation units. [2022-01-09 23:25:43,943 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2022-01-09 23:25:43,956 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef969a233/320eb91cbeda4d97a5218ab27eaf6d26/FLAG0a9b1193f [2022-01-09 23:25:43,972 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef969a233/320eb91cbeda4d97a5218ab27eaf6d26 [2022-01-09 23:25:43,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-09 23:25:43,976 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-09 23:25:43,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-09 23:25:43,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-09 23:25:43,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-09 23:25:43,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:25:43" (1/1) ... [2022-01-09 23:25:43,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fd3418b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:43, skipping insertion in model container [2022-01-09 23:25:43,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:25:43" (1/1) ... [2022-01-09 23:25:43,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-09 23:25:44,047 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-09 23:25:44,183 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/cdaudio_simpl1.cil-1.c[2074,2087] [2022-01-09 23:25:44,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:25:44,320 INFO L203 MainTranslator]: Completed pre-run [2022-01-09 23:25:44,333 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/cdaudio_simpl1.cil-1.c[2074,2087] [2022-01-09 23:25:44,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:25:44,396 INFO L208 MainTranslator]: Completed translation [2022-01-09 23:25:44,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:44 WrapperNode [2022-01-09 23:25:44,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-09 23:25:44,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-09 23:25:44,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-09 23:25:44,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-09 23:25:44,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:44" (1/1) ... [2022-01-09 23:25:44,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:44" (1/1) ... [2022-01-09 23:25:44,469 INFO L137 Inliner]: procedures = 41, calls = 108, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 1583 [2022-01-09 23:25:44,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-09 23:25:44,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-09 23:25:44,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-09 23:25:44,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-09 23:25:44,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:44" (1/1) ... [2022-01-09 23:25:44,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:44" (1/1) ... [2022-01-09 23:25:44,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:44" (1/1) ... [2022-01-09 23:25:44,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:44" (1/1) ... [2022-01-09 23:25:44,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:44" (1/1) ... [2022-01-09 23:25:44,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:44" (1/1) ... [2022-01-09 23:25:44,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:44" (1/1) ... [2022-01-09 23:25:44,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-09 23:25:44,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-09 23:25:44,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-09 23:25:44,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-09 23:25:44,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:44" (1/1) ... [2022-01-09 23:25:44,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:25:44,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:25:44,584 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-09 23:25:44,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-09 23:25:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-01-09 23:25:44,627 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-01-09 23:25:44,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-09 23:25:44,627 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2022-01-09 23:25:44,627 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2022-01-09 23:25:44,627 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-01-09 23:25:44,627 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-01-09 23:25:44,628 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-01-09 23:25:44,628 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-01-09 23:25:44,628 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-01-09 23:25:44,628 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-01-09 23:25:44,628 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-01-09 23:25:44,629 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-01-09 23:25:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-01-09 23:25:44,631 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-01-09 23:25:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-01-09 23:25:44,631 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-01-09 23:25:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-01-09 23:25:44,631 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-01-09 23:25:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-01-09 23:25:44,631 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-01-09 23:25:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-09 23:25:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-01-09 23:25:44,632 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-01-09 23:25:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-01-09 23:25:44,632 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-01-09 23:25:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-09 23:25:44,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-09 23:25:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-01-09 23:25:44,636 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-01-09 23:25:44,852 INFO L234 CfgBuilder]: Building ICFG [2022-01-09 23:25:44,853 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-09 23:25:44,930 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-09 23:25:44,961 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-01-09 23:25:44,961 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-01-09 23:25:44,990 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-09 23:25:45,000 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-01-09 23:25:45,000 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-01-09 23:25:45,004 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-09 23:25:45,005 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-09 23:25:45,007 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-09 23:25:45,013 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-09 23:25:45,020 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-09 23:25:45,022 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-09 23:25:45,023 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-09 23:25:45,440 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: CdAudioPnp_#res#1 := 0; [2022-01-09 23:25:45,440 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume !false; [2022-01-09 23:25:45,441 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##257: assume false; [2022-01-09 23:25:45,441 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##286: assume !false; [2022-01-09 23:25:45,441 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume false; [2022-01-09 23:25:45,441 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2022-01-09 23:25:45,441 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2022-01-09 23:25:45,441 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##133: assume false; [2022-01-09 23:25:45,441 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##134: assume !false; [2022-01-09 23:25:45,441 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2022-01-09 23:25:45,441 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2022-01-09 23:25:45,442 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-01-09 23:25:45,442 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-01-09 23:25:45,442 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2022-01-09 23:25:45,442 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2022-01-09 23:25:45,471 INFO L275 CfgBuilder]: Performing block encoding [2022-01-09 23:25:45,483 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-09 23:25:45,483 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-09 23:25:45,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:25:45 BoogieIcfgContainer [2022-01-09 23:25:45,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-09 23:25:45,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-09 23:25:45,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-09 23:25:45,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-09 23:25:45,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:25:43" (1/3) ... [2022-01-09 23:25:45,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d6db38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:25:45, skipping insertion in model container [2022-01-09 23:25:45,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:44" (2/3) ... [2022-01-09 23:25:45,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d6db38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:25:45, skipping insertion in model container [2022-01-09 23:25:45,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:25:45" (3/3) ... [2022-01-09 23:25:45,491 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2022-01-09 23:25:45,495 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-09 23:25:45,495 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-09 23:25:45,580 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-09 23:25:45,586 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-09 23:25:45,586 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-09 23:25:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 470 states, 368 states have (on average 1.5081521739130435) internal successors, (555), 387 states have internal predecessors, (555), 87 states have call successors, (87), 13 states have call predecessors, (87), 13 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-01-09 23:25:45,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-09 23:25:45,627 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:45,627 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:45,628 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:45,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:45,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1469618458, now seen corresponding path program 1 times [2022-01-09 23:25:45,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:45,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760387183] [2022-01-09 23:25:45,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:45,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:45,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:45,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760387183] [2022-01-09 23:25:45,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760387183] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:45,738 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:45,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:25:45,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961702310] [2022-01-09 23:25:45,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:45,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:25:45,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:45,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:25:45,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:45,760 INFO L87 Difference]: Start difference. First operand has 470 states, 368 states have (on average 1.5081521739130435) internal successors, (555), 387 states have internal predecessors, (555), 87 states have call successors, (87), 13 states have call predecessors, (87), 13 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:45,894 INFO L93 Difference]: Finished difference Result 813 states and 1302 transitions. [2022-01-09 23:25:45,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:25:45,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-09 23:25:45,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:45,912 INFO L225 Difference]: With dead ends: 813 [2022-01-09 23:25:45,913 INFO L226 Difference]: Without dead ends: 463 [2022-01-09 23:25:45,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:45,920 INFO L933 BasicCegarLoop]: 703 mSDtfsCounter, 8 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:45,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 1357 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:25:45,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2022-01-09 23:25:45,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2022-01-09 23:25:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 363 states have (on average 1.4765840220385675) internal successors, (536), 380 states have internal predecessors, (536), 87 states have call successors, (87), 13 states have call predecessors, (87), 12 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2022-01-09 23:25:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 694 transitions. [2022-01-09 23:25:45,975 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 694 transitions. Word has length 13 [2022-01-09 23:25:45,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:45,975 INFO L470 AbstractCegarLoop]: Abstraction has 463 states and 694 transitions. [2022-01-09 23:25:45,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:45,975 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 694 transitions. [2022-01-09 23:25:45,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-09 23:25:45,976 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:45,976 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:45,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-09 23:25:45,976 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:45,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:45,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1712839840, now seen corresponding path program 1 times [2022-01-09 23:25:45,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:45,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926335419] [2022-01-09 23:25:45,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:45,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:46,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:46,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:46,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926335419] [2022-01-09 23:25:46,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926335419] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:46,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:46,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:25:46,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355735058] [2022-01-09 23:25:46,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:46,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:25:46,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:46,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:25:46,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:46,016 INFO L87 Difference]: Start difference. First operand 463 states and 694 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:46,124 INFO L93 Difference]: Finished difference Result 708 states and 1039 transitions. [2022-01-09 23:25:46,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:25:46,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-09 23:25:46,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:46,128 INFO L225 Difference]: With dead ends: 708 [2022-01-09 23:25:46,128 INFO L226 Difference]: Without dead ends: 601 [2022-01-09 23:25:46,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:46,130 INFO L933 BasicCegarLoop]: 828 mSDtfsCounter, 569 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:46,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [569 Valid, 1055 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:25:46,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-01-09 23:25:46,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 581. [2022-01-09 23:25:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 467 states have (on average 1.436830835117773) internal successors, (671), 470 states have internal predecessors, (671), 93 states have call successors, (93), 21 states have call predecessors, (93), 20 states have return successors, (97), 91 states have call predecessors, (97), 81 states have call successors, (97) [2022-01-09 23:25:46,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 861 transitions. [2022-01-09 23:25:46,167 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 861 transitions. Word has length 15 [2022-01-09 23:25:46,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:46,167 INFO L470 AbstractCegarLoop]: Abstraction has 581 states and 861 transitions. [2022-01-09 23:25:46,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 861 transitions. [2022-01-09 23:25:46,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-09 23:25:46,168 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:46,168 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:46,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-09 23:25:46,169 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:46,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:46,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1900703522, now seen corresponding path program 1 times [2022-01-09 23:25:46,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:46,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277978456] [2022-01-09 23:25:46,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:46,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:46,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:46,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277978456] [2022-01-09 23:25:46,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277978456] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:46,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:46,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:25:46,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403299921] [2022-01-09 23:25:46,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:46,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:25:46,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:46,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:25:46,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:46,268 INFO L87 Difference]: Start difference. First operand 581 states and 861 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:46,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:46,298 INFO L93 Difference]: Finished difference Result 864 states and 1250 transitions. [2022-01-09 23:25:46,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:25:46,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-09 23:25:46,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:46,305 INFO L225 Difference]: With dead ends: 864 [2022-01-09 23:25:46,306 INFO L226 Difference]: Without dead ends: 727 [2022-01-09 23:25:46,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:46,311 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 608 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:46,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [608 Valid, 859 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:25:46,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2022-01-09 23:25:46,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 689. [2022-01-09 23:25:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 565 states have (on average 1.4336283185840708) internal successors, (810), 564 states have internal predecessors, (810), 94 states have call successors, (94), 26 states have call predecessors, (94), 29 states have return successors, (110), 98 states have call predecessors, (110), 85 states have call successors, (110) [2022-01-09 23:25:46,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1014 transitions. [2022-01-09 23:25:46,352 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1014 transitions. Word has length 19 [2022-01-09 23:25:46,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:46,352 INFO L470 AbstractCegarLoop]: Abstraction has 689 states and 1014 transitions. [2022-01-09 23:25:46,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:46,352 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1014 transitions. [2022-01-09 23:25:46,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-09 23:25:46,358 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:46,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:46,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-09 23:25:46,358 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:46,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:46,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2011147442, now seen corresponding path program 1 times [2022-01-09 23:25:46,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:46,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792459792] [2022-01-09 23:25:46,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:46,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:46,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:46,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792459792] [2022-01-09 23:25:46,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792459792] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:46,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:46,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:25:46,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936139089] [2022-01-09 23:25:46,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:46,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:25:46,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:46,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:25:46,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:46,452 INFO L87 Difference]: Start difference. First operand 689 states and 1014 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:46,581 INFO L93 Difference]: Finished difference Result 1296 states and 1967 transitions. [2022-01-09 23:25:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:25:46,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-09 23:25:46,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:46,609 INFO L225 Difference]: With dead ends: 1296 [2022-01-09 23:25:46,610 INFO L226 Difference]: Without dead ends: 1061 [2022-01-09 23:25:46,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:46,617 INFO L933 BasicCegarLoop]: 1012 mSDtfsCounter, 341 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:46,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 1631 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:25:46,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2022-01-09 23:25:46,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 821. [2022-01-09 23:25:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 674 states have (on average 1.4347181008902077) internal successors, (967), 672 states have internal predecessors, (967), 107 states have call successors, (107), 34 states have call predecessors, (107), 39 states have return successors, (172), 114 states have call predecessors, (172), 98 states have call successors, (172) [2022-01-09 23:25:46,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1246 transitions. [2022-01-09 23:25:46,658 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1246 transitions. Word has length 21 [2022-01-09 23:25:46,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:46,659 INFO L470 AbstractCegarLoop]: Abstraction has 821 states and 1246 transitions. [2022-01-09 23:25:46,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1246 transitions. [2022-01-09 23:25:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-09 23:25:46,662 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:46,662 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:46,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-09 23:25:46,662 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:46,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:46,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1977476652, now seen corresponding path program 1 times [2022-01-09 23:25:46,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:46,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304416898] [2022-01-09 23:25:46,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:46,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:46,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:46,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304416898] [2022-01-09 23:25:46,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304416898] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:46,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:46,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 23:25:46,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461067243] [2022-01-09 23:25:46,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:46,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:25:46,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:46,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:25:46,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:25:46,762 INFO L87 Difference]: Start difference. First operand 821 states and 1246 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:47,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:47,055 INFO L93 Difference]: Finished difference Result 1378 states and 2097 transitions. [2022-01-09 23:25:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 23:25:47,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-09 23:25:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:47,058 INFO L225 Difference]: With dead ends: 1378 [2022-01-09 23:25:47,059 INFO L226 Difference]: Without dead ends: 833 [2022-01-09 23:25:47,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:25:47,061 INFO L933 BasicCegarLoop]: 707 mSDtfsCounter, 1047 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:47,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1048 Valid, 861 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:25:47,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2022-01-09 23:25:47,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 809. [2022-01-09 23:25:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 664 states have (on average 1.4292168674698795) internal successors, (949), 662 states have internal predecessors, (949), 105 states have call successors, (105), 32 states have call predecessors, (105), 39 states have return successors, (168), 114 states have call predecessors, (168), 96 states have call successors, (168) [2022-01-09 23:25:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1222 transitions. [2022-01-09 23:25:47,090 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1222 transitions. Word has length 22 [2022-01-09 23:25:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:47,090 INFO L470 AbstractCegarLoop]: Abstraction has 809 states and 1222 transitions. [2022-01-09 23:25:47,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1222 transitions. [2022-01-09 23:25:47,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-09 23:25:47,092 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:47,092 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:47,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-09 23:25:47,092 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:47,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:47,093 INFO L85 PathProgramCache]: Analyzing trace with hash -401986458, now seen corresponding path program 1 times [2022-01-09 23:25:47,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:47,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971754295] [2022-01-09 23:25:47,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:47,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:47,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:47,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971754295] [2022-01-09 23:25:47,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971754295] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:47,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:47,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:25:47,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387464136] [2022-01-09 23:25:47,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:47,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:25:47,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:47,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:25:47,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:47,121 INFO L87 Difference]: Start difference. First operand 809 states and 1222 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:47,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:47,167 INFO L93 Difference]: Finished difference Result 812 states and 1224 transitions. [2022-01-09 23:25:47,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:25:47,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-09 23:25:47,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:47,171 INFO L225 Difference]: With dead ends: 812 [2022-01-09 23:25:47,171 INFO L226 Difference]: Without dead ends: 808 [2022-01-09 23:25:47,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:47,173 INFO L933 BasicCegarLoop]: 652 mSDtfsCounter, 22 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:47,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 1258 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:25:47,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2022-01-09 23:25:47,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2022-01-09 23:25:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 664 states have (on average 1.4262048192771084) internal successors, (947), 661 states have internal predecessors, (947), 104 states have call successors, (104), 32 states have call predecessors, (104), 39 states have return successors, (168), 114 states have call predecessors, (168), 96 states have call successors, (168) [2022-01-09 23:25:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1219 transitions. [2022-01-09 23:25:47,198 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1219 transitions. Word has length 23 [2022-01-09 23:25:47,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:47,199 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 1219 transitions. [2022-01-09 23:25:47,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1219 transitions. [2022-01-09 23:25:47,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-09 23:25:47,200 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:47,200 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:47,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-09 23:25:47,200 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:47,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:47,201 INFO L85 PathProgramCache]: Analyzing trace with hash 18720905, now seen corresponding path program 1 times [2022-01-09 23:25:47,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:47,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747743411] [2022-01-09 23:25:47,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:47,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:47,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:47,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747743411] [2022-01-09 23:25:47,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747743411] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:47,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:47,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 23:25:47,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354986334] [2022-01-09 23:25:47,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:47,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:25:47,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:47,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:25:47,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:25:47,257 INFO L87 Difference]: Start difference. First operand 808 states and 1219 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:47,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:47,331 INFO L93 Difference]: Finished difference Result 1228 states and 1788 transitions. [2022-01-09 23:25:47,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-09 23:25:47,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-01-09 23:25:47,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:47,335 INFO L225 Difference]: With dead ends: 1228 [2022-01-09 23:25:47,335 INFO L226 Difference]: Without dead ends: 812 [2022-01-09 23:25:47,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:25:47,336 INFO L933 BasicCegarLoop]: 766 mSDtfsCounter, 323 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:47,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 1958 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:25:47,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-01-09 23:25:47,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 683. [2022-01-09 23:25:47,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 560 states have (on average 1.4089285714285715) internal successors, (789), 559 states have internal predecessors, (789), 89 states have call successors, (89), 28 states have call predecessors, (89), 33 states have return successors, (109), 95 states have call predecessors, (109), 81 states have call successors, (109) [2022-01-09 23:25:47,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 987 transitions. [2022-01-09 23:25:47,359 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 987 transitions. Word has length 28 [2022-01-09 23:25:47,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:47,360 INFO L470 AbstractCegarLoop]: Abstraction has 683 states and 987 transitions. [2022-01-09 23:25:47,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 987 transitions. [2022-01-09 23:25:47,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-09 23:25:47,366 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:47,366 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:47,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-09 23:25:47,366 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:47,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:47,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1728135655, now seen corresponding path program 1 times [2022-01-09 23:25:47,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:47,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661309225] [2022-01-09 23:25:47,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:47,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:47,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:47,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:47,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661309225] [2022-01-09 23:25:47,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661309225] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:47,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:47,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:25:47,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780011833] [2022-01-09 23:25:47,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:47,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:25:47,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:47,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:25:47,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:47,402 INFO L87 Difference]: Start difference. First operand 683 states and 987 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:47,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:47,430 INFO L93 Difference]: Finished difference Result 768 states and 1098 transitions. [2022-01-09 23:25:47,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:25:47,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-01-09 23:25:47,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:47,434 INFO L225 Difference]: With dead ends: 768 [2022-01-09 23:25:47,434 INFO L226 Difference]: Without dead ends: 748 [2022-01-09 23:25:47,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:47,435 INFO L933 BasicCegarLoop]: 657 mSDtfsCounter, 628 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:47,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 721 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:25:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-01-09 23:25:47,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 711. [2022-01-09 23:25:47,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 586 states have (on average 1.418088737201365) internal successors, (831), 592 states have internal predecessors, (831), 89 states have call successors, (89), 29 states have call predecessors, (89), 35 states have return successors, (104), 89 states have call predecessors, (104), 82 states have call successors, (104) [2022-01-09 23:25:47,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1024 transitions. [2022-01-09 23:25:47,454 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1024 transitions. Word has length 29 [2022-01-09 23:25:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:47,455 INFO L470 AbstractCegarLoop]: Abstraction has 711 states and 1024 transitions. [2022-01-09 23:25:47,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1024 transitions. [2022-01-09 23:25:47,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-09 23:25:47,458 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:47,458 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:47,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-09 23:25:47,458 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:47,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:47,459 INFO L85 PathProgramCache]: Analyzing trace with hash -881374565, now seen corresponding path program 1 times [2022-01-09 23:25:47,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:47,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311578218] [2022-01-09 23:25:47,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:47,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:47,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-09 23:25:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:47,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:47,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311578218] [2022-01-09 23:25:47,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311578218] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:47,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:47,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 23:25:47,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876066865] [2022-01-09 23:25:47,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:47,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:25:47,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:47,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:25:47,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:25:47,495 INFO L87 Difference]: Start difference. First operand 711 states and 1024 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:47,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:47,671 INFO L93 Difference]: Finished difference Result 1007 states and 1455 transitions. [2022-01-09 23:25:47,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-09 23:25:47,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-01-09 23:25:47,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:47,675 INFO L225 Difference]: With dead ends: 1007 [2022-01-09 23:25:47,675 INFO L226 Difference]: Without dead ends: 780 [2022-01-09 23:25:47,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:25:47,677 INFO L933 BasicCegarLoop]: 732 mSDtfsCounter, 254 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:47,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 1782 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:25:47,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2022-01-09 23:25:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 694. [2022-01-09 23:25:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 571 states have (on average 1.4133099824868651) internal successors, (807), 579 states have internal predecessors, (807), 88 states have call successors, (88), 28 states have call predecessors, (88), 34 states have return successors, (100), 86 states have call predecessors, (100), 81 states have call successors, (100) [2022-01-09 23:25:47,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 995 transitions. [2022-01-09 23:25:47,700 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 995 transitions. Word has length 35 [2022-01-09 23:25:47,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:47,700 INFO L470 AbstractCegarLoop]: Abstraction has 694 states and 995 transitions. [2022-01-09 23:25:47,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 995 transitions. [2022-01-09 23:25:47,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-09 23:25:47,701 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:47,701 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:47,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-09 23:25:47,702 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:47,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:47,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1008894041, now seen corresponding path program 1 times [2022-01-09 23:25:47,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:47,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478863000] [2022-01-09 23:25:47,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:47,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:47,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-01-09 23:25:47,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:47,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478863000] [2022-01-09 23:25:47,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478863000] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:47,724 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:47,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 23:25:47,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713202846] [2022-01-09 23:25:47,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:47,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:25:47,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:47,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:25:47,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:25:47,726 INFO L87 Difference]: Start difference. First operand 694 states and 995 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:47,938 INFO L93 Difference]: Finished difference Result 754 states and 1071 transitions. [2022-01-09 23:25:47,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 23:25:47,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-01-09 23:25:47,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:47,940 INFO L225 Difference]: With dead ends: 754 [2022-01-09 23:25:47,940 INFO L226 Difference]: Without dead ends: 712 [2022-01-09 23:25:47,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:25:47,941 INFO L933 BasicCegarLoop]: 647 mSDtfsCounter, 696 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:47,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [696 Valid, 1109 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:25:47,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-01-09 23:25:47,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 694. [2022-01-09 23:25:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 571 states have (on average 1.4098073555166375) internal successors, (805), 579 states have internal predecessors, (805), 88 states have call successors, (88), 28 states have call predecessors, (88), 34 states have return successors, (100), 86 states have call predecessors, (100), 81 states have call successors, (100) [2022-01-09 23:25:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 993 transitions. [2022-01-09 23:25:47,966 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 993 transitions. Word has length 32 [2022-01-09 23:25:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:47,967 INFO L470 AbstractCegarLoop]: Abstraction has 694 states and 993 transitions. [2022-01-09 23:25:47,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 993 transitions. [2022-01-09 23:25:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-09 23:25:47,969 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:47,969 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:47,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-09 23:25:47,969 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:47,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1219758973, now seen corresponding path program 1 times [2022-01-09 23:25:47,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:47,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373579909] [2022-01-09 23:25:47,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:47,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:48,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-09 23:25:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:48,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:48,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373579909] [2022-01-09 23:25:48,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373579909] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:48,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:48,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 23:25:48,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433845977] [2022-01-09 23:25:48,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:48,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:25:48,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:48,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:25:48,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:25:48,008 INFO L87 Difference]: Start difference. First operand 694 states and 993 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:48,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:48,176 INFO L93 Difference]: Finished difference Result 779 states and 1121 transitions. [2022-01-09 23:25:48,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-09 23:25:48,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-01-09 23:25:48,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:48,180 INFO L225 Difference]: With dead ends: 779 [2022-01-09 23:25:48,180 INFO L226 Difference]: Without dead ends: 719 [2022-01-09 23:25:48,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:25:48,181 INFO L933 BasicCegarLoop]: 653 mSDtfsCounter, 706 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:48,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [727 Valid, 1259 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:25:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-01-09 23:25:48,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 683. [2022-01-09 23:25:48,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 564 states have (on average 1.4113475177304964) internal successors, (796), 572 states have internal predecessors, (796), 86 states have call successors, (86), 26 states have call predecessors, (86), 32 states have return successors, (98), 84 states have call predecessors, (98), 79 states have call successors, (98) [2022-01-09 23:25:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 980 transitions. [2022-01-09 23:25:48,209 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 980 transitions. Word has length 36 [2022-01-09 23:25:48,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:48,210 INFO L470 AbstractCegarLoop]: Abstraction has 683 states and 980 transitions. [2022-01-09 23:25:48,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 980 transitions. [2022-01-09 23:25:48,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-09 23:25:48,211 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:48,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:48,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-09 23:25:48,212 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:48,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:48,212 INFO L85 PathProgramCache]: Analyzing trace with hash 138802018, now seen corresponding path program 1 times [2022-01-09 23:25:48,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:48,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165819399] [2022-01-09 23:25:48,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:48,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:48,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:48,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165819399] [2022-01-09 23:25:48,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165819399] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:48,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:48,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:25:48,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732082652] [2022-01-09 23:25:48,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:48,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:25:48,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:48,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:25:48,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:48,238 INFO L87 Difference]: Start difference. First operand 683 states and 980 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:48,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:48,307 INFO L93 Difference]: Finished difference Result 851 states and 1212 transitions. [2022-01-09 23:25:48,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:25:48,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-09 23:25:48,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:48,311 INFO L225 Difference]: With dead ends: 851 [2022-01-09 23:25:48,311 INFO L226 Difference]: Without dead ends: 835 [2022-01-09 23:25:48,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:48,312 INFO L933 BasicCegarLoop]: 772 mSDtfsCounter, 135 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:48,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 1388 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:25:48,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-01-09 23:25:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 734. [2022-01-09 23:25:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 611 states have (on average 1.386252045826514) internal successors, (847), 612 states have internal predecessors, (847), 86 states have call successors, (86), 26 states have call predecessors, (86), 36 states have return successors, (109), 95 states have call predecessors, (109), 79 states have call successors, (109) [2022-01-09 23:25:48,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1042 transitions. [2022-01-09 23:25:48,340 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1042 transitions. Word has length 34 [2022-01-09 23:25:48,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:48,340 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 1042 transitions. [2022-01-09 23:25:48,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:48,340 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1042 transitions. [2022-01-09 23:25:48,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-09 23:25:48,341 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:48,341 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:48,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-09 23:25:48,342 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:48,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:48,342 INFO L85 PathProgramCache]: Analyzing trace with hash -298326112, now seen corresponding path program 1 times [2022-01-09 23:25:48,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:48,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101706763] [2022-01-09 23:25:48,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:48,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:48,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:48,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101706763] [2022-01-09 23:25:48,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101706763] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:48,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:48,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 23:25:48,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670534243] [2022-01-09 23:25:48,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:48,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:25:48,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:48,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:25:48,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:25:48,392 INFO L87 Difference]: Start difference. First operand 734 states and 1042 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:48,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:48,589 INFO L93 Difference]: Finished difference Result 762 states and 1073 transitions. [2022-01-09 23:25:48,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 23:25:48,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-09 23:25:48,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:48,592 INFO L225 Difference]: With dead ends: 762 [2022-01-09 23:25:48,592 INFO L226 Difference]: Without dead ends: 715 [2022-01-09 23:25:48,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:25:48,593 INFO L933 BasicCegarLoop]: 643 mSDtfsCounter, 674 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:48,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [674 Valid, 1105 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:25:48,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-01-09 23:25:48,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 705. [2022-01-09 23:25:48,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 585 states have (on average 1.3914529914529914) internal successors, (814), 592 states have internal predecessors, (814), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-01-09 23:25:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 998 transitions. [2022-01-09 23:25:48,617 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 998 transitions. Word has length 34 [2022-01-09 23:25:48,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:48,617 INFO L470 AbstractCegarLoop]: Abstraction has 705 states and 998 transitions. [2022-01-09 23:25:48,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:48,617 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 998 transitions. [2022-01-09 23:25:48,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-09 23:25:48,618 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:48,618 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:48,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-09 23:25:48,619 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:48,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:48,619 INFO L85 PathProgramCache]: Analyzing trace with hash 452395620, now seen corresponding path program 1 times [2022-01-09 23:25:48,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:48,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534198858] [2022-01-09 23:25:48,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:48,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:48,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:48,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534198858] [2022-01-09 23:25:48,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534198858] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:48,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:48,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 23:25:48,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515856090] [2022-01-09 23:25:48,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:48,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:25:48,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:48,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:25:48,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:25:48,674 INFO L87 Difference]: Start difference. First operand 705 states and 998 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:48,905 INFO L93 Difference]: Finished difference Result 806 states and 1144 transitions. [2022-01-09 23:25:48,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 23:25:48,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-09 23:25:48,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:48,908 INFO L225 Difference]: With dead ends: 806 [2022-01-09 23:25:48,908 INFO L226 Difference]: Without dead ends: 802 [2022-01-09 23:25:48,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:25:48,909 INFO L933 BasicCegarLoop]: 739 mSDtfsCounter, 748 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:48,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [757 Valid, 1197 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:25:48,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-01-09 23:25:48,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 708. [2022-01-09 23:25:48,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 588 states have (on average 1.3911564625850341) internal successors, (818), 595 states have internal predecessors, (818), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-01-09 23:25:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1002 transitions. [2022-01-09 23:25:48,947 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1002 transitions. Word has length 35 [2022-01-09 23:25:48,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:48,947 INFO L470 AbstractCegarLoop]: Abstraction has 708 states and 1002 transitions. [2022-01-09 23:25:48,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:48,947 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1002 transitions. [2022-01-09 23:25:48,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-09 23:25:48,948 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:48,948 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:48,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-09 23:25:48,948 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:48,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:48,949 INFO L85 PathProgramCache]: Analyzing trace with hash 452672450, now seen corresponding path program 1 times [2022-01-09 23:25:48,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:48,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774119924] [2022-01-09 23:25:48,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:48,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:48,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:48,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774119924] [2022-01-09 23:25:48,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774119924] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:48,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:48,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-09 23:25:48,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814785857] [2022-01-09 23:25:48,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:48,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 23:25:48,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:48,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 23:25:48,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:25:48,988 INFO L87 Difference]: Start difference. First operand 708 states and 1002 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:49,072 INFO L93 Difference]: Finished difference Result 721 states and 1015 transitions. [2022-01-09 23:25:49,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-09 23:25:49,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-09 23:25:49,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:49,076 INFO L225 Difference]: With dead ends: 721 [2022-01-09 23:25:49,076 INFO L226 Difference]: Without dead ends: 691 [2022-01-09 23:25:49,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-09 23:25:49,079 INFO L933 BasicCegarLoop]: 651 mSDtfsCounter, 38 mSDsluCounter, 2556 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3207 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:49,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 3207 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:25:49,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-01-09 23:25:49,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2022-01-09 23:25:49,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 571 states have (on average 1.3975481611208407) internal successors, (798), 578 states have internal predecessors, (798), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-01-09 23:25:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 982 transitions. [2022-01-09 23:25:49,124 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 982 transitions. Word has length 35 [2022-01-09 23:25:49,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:49,124 INFO L470 AbstractCegarLoop]: Abstraction has 691 states and 982 transitions. [2022-01-09 23:25:49,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 982 transitions. [2022-01-09 23:25:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-09 23:25:49,126 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:49,126 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:49,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-09 23:25:49,126 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:49,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:49,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1417116411, now seen corresponding path program 1 times [2022-01-09 23:25:49,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:49,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385910919] [2022-01-09 23:25:49,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:49,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:49,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-09 23:25:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:49,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:49,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385910919] [2022-01-09 23:25:49,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385910919] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:49,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:49,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 23:25:49,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404951165] [2022-01-09 23:25:49,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:49,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:25:49,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:49,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:25:49,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:25:49,157 INFO L87 Difference]: Start difference. First operand 691 states and 982 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:49,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:49,353 INFO L93 Difference]: Finished difference Result 732 states and 1051 transitions. [2022-01-09 23:25:49,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-09 23:25:49,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-01-09 23:25:49,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:49,356 INFO L225 Difference]: With dead ends: 732 [2022-01-09 23:25:49,356 INFO L226 Difference]: Without dead ends: 725 [2022-01-09 23:25:49,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:25:49,357 INFO L933 BasicCegarLoop]: 628 mSDtfsCounter, 153 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:49,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 1553 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:25:49,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-01-09 23:25:49,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 705. [2022-01-09 23:25:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 585 states have (on average 1.393162393162393) internal successors, (815), 592 states have internal predecessors, (815), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-01-09 23:25:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 999 transitions. [2022-01-09 23:25:49,385 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 999 transitions. Word has length 37 [2022-01-09 23:25:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:49,385 INFO L470 AbstractCegarLoop]: Abstraction has 705 states and 999 transitions. [2022-01-09 23:25:49,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:49,385 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 999 transitions. [2022-01-09 23:25:49,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-09 23:25:49,386 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:49,387 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:49,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-09 23:25:49,387 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:49,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:49,387 INFO L85 PathProgramCache]: Analyzing trace with hash 607738208, now seen corresponding path program 1 times [2022-01-09 23:25:49,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:49,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723719076] [2022-01-09 23:25:49,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:49,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:49,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-09 23:25:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:49,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:49,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723719076] [2022-01-09 23:25:49,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723719076] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:49,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:49,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-09 23:25:49,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076352771] [2022-01-09 23:25:49,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:49,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 23:25:49,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:49,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 23:25:49,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:25:49,451 INFO L87 Difference]: Start difference. First operand 705 states and 999 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:49,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:49,799 INFO L93 Difference]: Finished difference Result 731 states and 1047 transitions. [2022-01-09 23:25:49,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:25:49,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-01-09 23:25:49,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:49,802 INFO L225 Difference]: With dead ends: 731 [2022-01-09 23:25:49,802 INFO L226 Difference]: Without dead ends: 725 [2022-01-09 23:25:49,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-09 23:25:49,803 INFO L933 BasicCegarLoop]: 622 mSDtfsCounter, 750 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:49,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [794 Valid, 1884 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:25:49,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-01-09 23:25:49,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 705. [2022-01-09 23:25:49,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 585 states have (on average 1.3914529914529914) internal successors, (814), 592 states have internal predecessors, (814), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-01-09 23:25:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 998 transitions. [2022-01-09 23:25:49,831 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 998 transitions. Word has length 39 [2022-01-09 23:25:49,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:49,831 INFO L470 AbstractCegarLoop]: Abstraction has 705 states and 998 transitions. [2022-01-09 23:25:49,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:49,831 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 998 transitions. [2022-01-09 23:25:49,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-09 23:25:49,832 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:49,832 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:49,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-09 23:25:49,832 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:49,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:49,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1973073460, now seen corresponding path program 1 times [2022-01-09 23:25:49,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:49,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224135910] [2022-01-09 23:25:49,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:49,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:49,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-09 23:25:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:49,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:49,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224135910] [2022-01-09 23:25:49,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224135910] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:49,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:49,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-09 23:25:49,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538683359] [2022-01-09 23:25:49,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:49,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-09 23:25:49,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:49,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-09 23:25:49,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:25:49,880 INFO L87 Difference]: Start difference. First operand 705 states and 998 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:50,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:50,200 INFO L93 Difference]: Finished difference Result 744 states and 1063 transitions. [2022-01-09 23:25:50,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-09 23:25:50,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-01-09 23:25:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:50,202 INFO L225 Difference]: With dead ends: 744 [2022-01-09 23:25:50,202 INFO L226 Difference]: Without dead ends: 712 [2022-01-09 23:25:50,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-09 23:25:50,203 INFO L933 BasicCegarLoop]: 621 mSDtfsCounter, 158 mSDsluCounter, 3356 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 3977 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:50,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 3977 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:25:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-01-09 23:25:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 696. [2022-01-09 23:25:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 578 states have (on average 1.3737024221453287) internal successors, (794), 585 states have internal predecessors, (794), 84 states have call successors, (84), 26 states have call predecessors, (84), 33 states have return successors, (96), 84 states have call predecessors, (96), 77 states have call successors, (96) [2022-01-09 23:25:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 974 transitions. [2022-01-09 23:25:50,231 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 974 transitions. Word has length 40 [2022-01-09 23:25:50,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:50,231 INFO L470 AbstractCegarLoop]: Abstraction has 696 states and 974 transitions. [2022-01-09 23:25:50,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:50,231 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 974 transitions. [2022-01-09 23:25:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-09 23:25:50,233 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:50,233 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:50,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-09 23:25:50,233 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:50,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:50,233 INFO L85 PathProgramCache]: Analyzing trace with hash -577176493, now seen corresponding path program 1 times [2022-01-09 23:25:50,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:50,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053156681] [2022-01-09 23:25:50,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:50,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:50,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-09 23:25:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:50,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:50,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053156681] [2022-01-09 23:25:50,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053156681] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:50,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:50,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-09 23:25:50,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351287206] [2022-01-09 23:25:50,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:50,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-09 23:25:50,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:50,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-09 23:25:50,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:25:50,267 INFO L87 Difference]: Start difference. First operand 696 states and 974 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:50,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:50,669 INFO L93 Difference]: Finished difference Result 777 states and 1087 transitions. [2022-01-09 23:25:50,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-09 23:25:50,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-01-09 23:25:50,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:50,672 INFO L225 Difference]: With dead ends: 777 [2022-01-09 23:25:50,672 INFO L226 Difference]: Without dead ends: 741 [2022-01-09 23:25:50,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-09 23:25:50,673 INFO L933 BasicCegarLoop]: 663 mSDtfsCounter, 792 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:50,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [812 Valid, 1517 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:25:50,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-01-09 23:25:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 696. [2022-01-09 23:25:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 578 states have (on average 1.3719723183391004) internal successors, (793), 585 states have internal predecessors, (793), 84 states have call successors, (84), 26 states have call predecessors, (84), 33 states have return successors, (96), 84 states have call predecessors, (96), 77 states have call successors, (96) [2022-01-09 23:25:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 973 transitions. [2022-01-09 23:25:50,707 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 973 transitions. Word has length 41 [2022-01-09 23:25:50,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:50,707 INFO L470 AbstractCegarLoop]: Abstraction has 696 states and 973 transitions. [2022-01-09 23:25:50,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:50,707 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 973 transitions. [2022-01-09 23:25:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-09 23:25:50,708 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:50,709 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:50,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-09 23:25:50,709 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:50,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:50,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1220210391, now seen corresponding path program 1 times [2022-01-09 23:25:50,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:50,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140043157] [2022-01-09 23:25:50,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:50,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:50,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-09 23:25:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:50,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-09 23:25:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:50,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:50,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140043157] [2022-01-09 23:25:50,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140043157] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:50,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:50,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-09 23:25:50,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147119719] [2022-01-09 23:25:50,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:50,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-09 23:25:50,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:50,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-09 23:25:50,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:25:50,737 INFO L87 Difference]: Start difference. First operand 696 states and 973 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:25:51,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:51,129 INFO L93 Difference]: Finished difference Result 906 states and 1276 transitions. [2022-01-09 23:25:51,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:25:51,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-01-09 23:25:51,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:51,132 INFO L225 Difference]: With dead ends: 906 [2022-01-09 23:25:51,132 INFO L226 Difference]: Without dead ends: 688 [2022-01-09 23:25:51,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-09 23:25:51,133 INFO L933 BasicCegarLoop]: 605 mSDtfsCounter, 252 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:51,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 1799 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:25:51,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-01-09 23:25:51,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 672. [2022-01-09 23:25:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 557 states have (on average 1.3698384201077198) internal successors, (763), 563 states have internal predecessors, (763), 83 states have call successors, (83), 26 states have call predecessors, (83), 31 states have return successors, (94), 82 states have call predecessors, (94), 77 states have call successors, (94) [2022-01-09 23:25:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 940 transitions. [2022-01-09 23:25:51,161 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 940 transitions. Word has length 43 [2022-01-09 23:25:51,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:51,161 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 940 transitions. [2022-01-09 23:25:51,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:25:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 940 transitions. [2022-01-09 23:25:51,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-09 23:25:51,162 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:51,162 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:51,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-09 23:25:51,163 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:51,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:51,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1828304678, now seen corresponding path program 1 times [2022-01-09 23:25:51,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:51,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979507647] [2022-01-09 23:25:51,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:51,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:51,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-09 23:25:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:51,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:25:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:51,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:51,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979507647] [2022-01-09 23:25:51,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979507647] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:51,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:51,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-09 23:25:51,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049150864] [2022-01-09 23:25:51,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:51,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-09 23:25:51,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:51,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-09 23:25:51,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-01-09 23:25:51,267 INFO L87 Difference]: Start difference. First operand 672 states and 940 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:25:51,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:51,870 INFO L93 Difference]: Finished difference Result 702 states and 994 transitions. [2022-01-09 23:25:51,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-09 23:25:51,870 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-01-09 23:25:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:51,873 INFO L225 Difference]: With dead ends: 702 [2022-01-09 23:25:51,873 INFO L226 Difference]: Without dead ends: 686 [2022-01-09 23:25:51,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-01-09 23:25:51,874 INFO L933 BasicCegarLoop]: 611 mSDtfsCounter, 98 mSDsluCounter, 3850 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 4461 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:51,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 4461 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-09 23:25:51,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-01-09 23:25:51,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 670. [2022-01-09 23:25:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 556 states have (on average 1.368705035971223) internal successors, (761), 562 states have internal predecessors, (761), 82 states have call successors, (82), 26 states have call predecessors, (82), 31 states have return successors, (93), 81 states have call predecessors, (93), 76 states have call successors, (93) [2022-01-09 23:25:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 936 transitions. [2022-01-09 23:25:51,912 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 936 transitions. Word has length 43 [2022-01-09 23:25:51,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:51,912 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 936 transitions. [2022-01-09 23:25:51,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:25:51,913 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 936 transitions. [2022-01-09 23:25:51,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-09 23:25:51,914 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:51,914 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:51,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-09 23:25:51,914 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:51,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:51,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1534576112, now seen corresponding path program 1 times [2022-01-09 23:25:51,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:51,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793817448] [2022-01-09 23:25:51,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:51,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:51,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-09 23:25:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:52,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:25:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:52,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:52,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793817448] [2022-01-09 23:25:52,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793817448] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:52,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:52,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-09 23:25:52,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030502641] [2022-01-09 23:25:52,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:52,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-09 23:25:52,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:52,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-09 23:25:52,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-01-09 23:25:52,014 INFO L87 Difference]: Start difference. First operand 670 states and 936 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:25:52,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:52,718 INFO L93 Difference]: Finished difference Result 722 states and 1014 transitions. [2022-01-09 23:25:52,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-09 23:25:52,719 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2022-01-09 23:25:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:52,721 INFO L225 Difference]: With dead ends: 722 [2022-01-09 23:25:52,721 INFO L226 Difference]: Without dead ends: 702 [2022-01-09 23:25:52,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-01-09 23:25:52,722 INFO L933 BasicCegarLoop]: 597 mSDtfsCounter, 247 mSDsluCounter, 4138 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 4735 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:52,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 4735 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-09 23:25:52,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-01-09 23:25:52,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 668. [2022-01-09 23:25:52,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 555 states have (on average 1.3675675675675676) internal successors, (759), 561 states have internal predecessors, (759), 81 states have call successors, (81), 26 states have call predecessors, (81), 31 states have return successors, (92), 80 states have call predecessors, (92), 75 states have call successors, (92) [2022-01-09 23:25:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 932 transitions. [2022-01-09 23:25:52,751 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 932 transitions. Word has length 47 [2022-01-09 23:25:52,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:52,751 INFO L470 AbstractCegarLoop]: Abstraction has 668 states and 932 transitions. [2022-01-09 23:25:52,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:25:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 932 transitions. [2022-01-09 23:25:52,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-09 23:25:52,752 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:52,752 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:52,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-09 23:25:52,752 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:52,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:52,753 INFO L85 PathProgramCache]: Analyzing trace with hash 397890919, now seen corresponding path program 1 times [2022-01-09 23:25:52,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:52,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222641120] [2022-01-09 23:25:52,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:52,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:52,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:25:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:52,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:25:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:52,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:52,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:52,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222641120] [2022-01-09 23:25:52,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222641120] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:52,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:52,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-09 23:25:52,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504861967] [2022-01-09 23:25:52,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:52,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-09 23:25:52,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:52,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-09 23:25:52,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-01-09 23:25:52,863 INFO L87 Difference]: Start difference. First operand 668 states and 932 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:25:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:53,589 INFO L93 Difference]: Finished difference Result 720 states and 1010 transitions. [2022-01-09 23:25:53,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-09 23:25:53,589 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-01-09 23:25:53,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:53,591 INFO L225 Difference]: With dead ends: 720 [2022-01-09 23:25:53,591 INFO L226 Difference]: Without dead ends: 699 [2022-01-09 23:25:53,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-01-09 23:25:53,592 INFO L933 BasicCegarLoop]: 581 mSDtfsCounter, 168 mSDsluCounter, 4931 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 5512 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:53,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 5512 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1638 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-09 23:25:53,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-01-09 23:25:53,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 667. [2022-01-09 23:25:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 554 states have (on average 1.3501805054151625) internal successors, (748), 560 states have internal predecessors, (748), 81 states have call successors, (81), 26 states have call predecessors, (81), 31 states have return successors, (92), 80 states have call predecessors, (92), 75 states have call successors, (92) [2022-01-09 23:25:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 921 transitions. [2022-01-09 23:25:53,618 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 921 transitions. Word has length 44 [2022-01-09 23:25:53,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:53,618 INFO L470 AbstractCegarLoop]: Abstraction has 667 states and 921 transitions. [2022-01-09 23:25:53,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:25:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 921 transitions. [2022-01-09 23:25:53,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-09 23:25:53,619 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:53,619 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:53,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-09 23:25:53,620 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:53,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:53,620 INFO L85 PathProgramCache]: Analyzing trace with hash 117751789, now seen corresponding path program 1 times [2022-01-09 23:25:53,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:53,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886322513] [2022-01-09 23:25:53,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:53,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:53,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 23:25:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:53,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:25:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:53,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:53,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:53,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886322513] [2022-01-09 23:25:53,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886322513] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:53,704 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:53,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-09 23:25:53,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227636760] [2022-01-09 23:25:53,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:53,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-09 23:25:53,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:53,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-09 23:25:53,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-01-09 23:25:53,705 INFO L87 Difference]: Start difference. First operand 667 states and 921 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:25:54,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:54,318 INFO L93 Difference]: Finished difference Result 696 states and 974 transitions. [2022-01-09 23:25:54,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-09 23:25:54,319 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-01-09 23:25:54,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:54,321 INFO L225 Difference]: With dead ends: 696 [2022-01-09 23:25:54,321 INFO L226 Difference]: Without dead ends: 680 [2022-01-09 23:25:54,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-01-09 23:25:54,322 INFO L933 BasicCegarLoop]: 589 mSDtfsCounter, 98 mSDsluCounter, 3693 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 4282 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:54,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 4282 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-09 23:25:54,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2022-01-09 23:25:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 664. [2022-01-09 23:25:54,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 552 states have (on average 1.3496376811594204) internal successors, (745), 558 states have internal predecessors, (745), 80 states have call successors, (80), 26 states have call predecessors, (80), 31 states have return successors, (91), 79 states have call predecessors, (91), 74 states have call successors, (91) [2022-01-09 23:25:54,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 916 transitions. [2022-01-09 23:25:54,353 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 916 transitions. Word has length 44 [2022-01-09 23:25:54,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:54,354 INFO L470 AbstractCegarLoop]: Abstraction has 664 states and 916 transitions. [2022-01-09 23:25:54,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:25:54,354 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 916 transitions. [2022-01-09 23:25:54,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-09 23:25:54,355 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:54,355 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:54,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-09 23:25:54,355 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:54,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:54,356 INFO L85 PathProgramCache]: Analyzing trace with hash -914670889, now seen corresponding path program 1 times [2022-01-09 23:25:54,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:54,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092281588] [2022-01-09 23:25:54,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:54,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:54,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-09 23:25:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:54,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:54,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092281588] [2022-01-09 23:25:54,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092281588] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:54,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:54,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-09 23:25:54,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838633177] [2022-01-09 23:25:54,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:54,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-09 23:25:54,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:54,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-09 23:25:54,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-09 23:25:54,404 INFO L87 Difference]: Start difference. First operand 664 states and 916 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:54,699 INFO L93 Difference]: Finished difference Result 735 states and 1013 transitions. [2022-01-09 23:25:54,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-09 23:25:54,699 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-01-09 23:25:54,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:54,702 INFO L225 Difference]: With dead ends: 735 [2022-01-09 23:25:54,702 INFO L226 Difference]: Without dead ends: 668 [2022-01-09 23:25:54,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-01-09 23:25:54,702 INFO L933 BasicCegarLoop]: 585 mSDtfsCounter, 235 mSDsluCounter, 3099 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 3684 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:54,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 3684 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:25:54,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-01-09 23:25:54,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 652. [2022-01-09 23:25:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 543 states have (on average 1.3443830570902393) internal successors, (730), 549 states have internal predecessors, (730), 77 states have call successors, (77), 26 states have call predecessors, (77), 31 states have return successors, (88), 76 states have call predecessors, (88), 71 states have call successors, (88) [2022-01-09 23:25:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 895 transitions. [2022-01-09 23:25:54,749 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 895 transitions. Word has length 44 [2022-01-09 23:25:54,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:54,749 INFO L470 AbstractCegarLoop]: Abstraction has 652 states and 895 transitions. [2022-01-09 23:25:54,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 895 transitions. [2022-01-09 23:25:54,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-09 23:25:54,750 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:54,750 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:54,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-09 23:25:54,750 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:54,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:54,751 INFO L85 PathProgramCache]: Analyzing trace with hash -501722536, now seen corresponding path program 1 times [2022-01-09 23:25:54,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:54,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449342629] [2022-01-09 23:25:54,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:54,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:54,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:25:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:54,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-09 23:25:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:54,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:54,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449342629] [2022-01-09 23:25:54,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449342629] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:54,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:54,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-09 23:25:54,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110212011] [2022-01-09 23:25:54,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:54,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 23:25:54,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:54,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 23:25:54,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:25:54,787 INFO L87 Difference]: Start difference. First operand 652 states and 895 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:25:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:55,065 INFO L93 Difference]: Finished difference Result 797 states and 1137 transitions. [2022-01-09 23:25:55,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-09 23:25:55,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-01-09 23:25:55,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:55,068 INFO L225 Difference]: With dead ends: 797 [2022-01-09 23:25:55,068 INFO L226 Difference]: Without dead ends: 703 [2022-01-09 23:25:55,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-09 23:25:55,068 INFO L933 BasicCegarLoop]: 540 mSDtfsCounter, 130 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:55,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 2209 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:25:55,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2022-01-09 23:25:55,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 659. [2022-01-09 23:25:55,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 548 states have (on average 1.344890510948905) internal successors, (737), 555 states have internal predecessors, (737), 78 states have call successors, (78), 26 states have call predecessors, (78), 32 states have return successors, (95), 77 states have call predecessors, (95), 72 states have call successors, (95) [2022-01-09 23:25:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 910 transitions. [2022-01-09 23:25:55,099 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 910 transitions. Word has length 45 [2022-01-09 23:25:55,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:55,099 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 910 transitions. [2022-01-09 23:25:55,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:25:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 910 transitions. [2022-01-09 23:25:55,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-09 23:25:55,100 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:55,101 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:55,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-09 23:25:55,101 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:55,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:55,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1011195626, now seen corresponding path program 1 times [2022-01-09 23:25:55,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:55,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152399948] [2022-01-09 23:25:55,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:55,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:55,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:25:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:55,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-09 23:25:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:55,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:55,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152399948] [2022-01-09 23:25:55,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152399948] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:55,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:55,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-09 23:25:55,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372687725] [2022-01-09 23:25:55,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:55,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-09 23:25:55,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:55,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-09 23:25:55,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-09 23:25:55,155 INFO L87 Difference]: Start difference. First operand 659 states and 910 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:25:55,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:55,467 INFO L93 Difference]: Finished difference Result 697 states and 978 transitions. [2022-01-09 23:25:55,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-09 23:25:55,468 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-01-09 23:25:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:55,470 INFO L225 Difference]: With dead ends: 697 [2022-01-09 23:25:55,470 INFO L226 Difference]: Without dead ends: 677 [2022-01-09 23:25:55,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-01-09 23:25:55,471 INFO L933 BasicCegarLoop]: 553 mSDtfsCounter, 245 mSDsluCounter, 2872 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 3425 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:55,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 3425 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:25:55,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-01-09 23:25:55,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 657. [2022-01-09 23:25:55,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 547 states have (on average 1.3436928702010968) internal successors, (735), 554 states have internal predecessors, (735), 77 states have call successors, (77), 26 states have call predecessors, (77), 32 states have return successors, (94), 76 states have call predecessors, (94), 71 states have call successors, (94) [2022-01-09 23:25:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 906 transitions. [2022-01-09 23:25:55,524 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 906 transitions. Word has length 45 [2022-01-09 23:25:55,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:55,524 INFO L470 AbstractCegarLoop]: Abstraction has 657 states and 906 transitions. [2022-01-09 23:25:55,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:25:55,524 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 906 transitions. [2022-01-09 23:25:55,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-09 23:25:55,525 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:55,526 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:55,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-09 23:25:55,526 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:55,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:55,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1504244121, now seen corresponding path program 1 times [2022-01-09 23:25:55,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:55,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556260151] [2022-01-09 23:25:55,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:55,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:55,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-09 23:25:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:55,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:55,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556260151] [2022-01-09 23:25:55,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556260151] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:55,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:55,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-09 23:25:55,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622140002] [2022-01-09 23:25:55,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:55,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-09 23:25:55,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:55,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-09 23:25:55,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:25:55,567 INFO L87 Difference]: Start difference. First operand 657 states and 906 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:55,826 INFO L93 Difference]: Finished difference Result 704 states and 988 transitions. [2022-01-09 23:25:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-09 23:25:55,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-01-09 23:25:55,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:55,829 INFO L225 Difference]: With dead ends: 704 [2022-01-09 23:25:55,829 INFO L226 Difference]: Without dead ends: 669 [2022-01-09 23:25:55,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-09 23:25:55,829 INFO L933 BasicCegarLoop]: 553 mSDtfsCounter, 166 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 3532 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:55,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 3532 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:25:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-01-09 23:25:55,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 649. [2022-01-09 23:25:55,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 541 states have (on average 1.3364140480591498) internal successors, (723), 548 states have internal predecessors, (723), 75 states have call successors, (75), 26 states have call predecessors, (75), 32 states have return successors, (92), 74 states have call predecessors, (92), 69 states have call successors, (92) [2022-01-09 23:25:55,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 890 transitions. [2022-01-09 23:25:55,856 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 890 transitions. Word has length 45 [2022-01-09 23:25:55,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:55,857 INFO L470 AbstractCegarLoop]: Abstraction has 649 states and 890 transitions. [2022-01-09 23:25:55,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 890 transitions. [2022-01-09 23:25:55,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-09 23:25:55,858 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:55,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:55,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-09 23:25:55,858 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:55,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:55,859 INFO L85 PathProgramCache]: Analyzing trace with hash -945301524, now seen corresponding path program 1 times [2022-01-09 23:25:55,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:55,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902054242] [2022-01-09 23:25:55,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:55,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:55,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:25:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:55,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:25:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:55,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-01-09 23:25:55,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:55,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902054242] [2022-01-09 23:25:55,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902054242] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:55,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:55,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-09 23:25:55,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360246628] [2022-01-09 23:25:55,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:55,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-09 23:25:55,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:55,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-09 23:25:55,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-01-09 23:25:55,962 INFO L87 Difference]: Start difference. First operand 649 states and 890 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:25:56,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:56,591 INFO L93 Difference]: Finished difference Result 684 states and 955 transitions. [2022-01-09 23:25:56,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-09 23:25:56,592 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-01-09 23:25:56,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:56,594 INFO L225 Difference]: With dead ends: 684 [2022-01-09 23:25:56,594 INFO L226 Difference]: Without dead ends: 666 [2022-01-09 23:25:56,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-01-09 23:25:56,595 INFO L933 BasicCegarLoop]: 544 mSDtfsCounter, 110 mSDsluCounter, 3773 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 4317 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:56,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 4317 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-09 23:25:56,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-01-09 23:25:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 646. [2022-01-09 23:25:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 539 states have (on average 1.3358070500927643) internal successors, (720), 546 states have internal predecessors, (720), 74 states have call successors, (74), 26 states have call predecessors, (74), 32 states have return successors, (91), 73 states have call predecessors, (91), 68 states have call successors, (91) [2022-01-09 23:25:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 885 transitions. [2022-01-09 23:25:56,623 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 885 transitions. Word has length 46 [2022-01-09 23:25:56,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:56,623 INFO L470 AbstractCegarLoop]: Abstraction has 646 states and 885 transitions. [2022-01-09 23:25:56,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:25:56,623 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 885 transitions. [2022-01-09 23:25:56,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-09 23:25:56,624 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:56,624 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:56,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-09 23:25:56,625 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:56,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:56,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1146484836, now seen corresponding path program 1 times [2022-01-09 23:25:56,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:56,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834084740] [2022-01-09 23:25:56,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:56,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:56,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:25:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:56,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-09 23:25:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:56,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:56,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834084740] [2022-01-09 23:25:56,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834084740] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:56,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:56,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-09 23:25:56,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293055111] [2022-01-09 23:25:56,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:56,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-09 23:25:56,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:56,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-09 23:25:56,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-09 23:25:56,677 INFO L87 Difference]: Start difference. First operand 646 states and 885 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:25:56,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:56,915 INFO L93 Difference]: Finished difference Result 703 states and 992 transitions. [2022-01-09 23:25:56,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:25:56,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-01-09 23:25:56,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:56,917 INFO L225 Difference]: With dead ends: 703 [2022-01-09 23:25:56,917 INFO L226 Difference]: Without dead ends: 676 [2022-01-09 23:25:56,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:25:56,918 INFO L933 BasicCegarLoop]: 532 mSDtfsCounter, 102 mSDsluCounter, 2133 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 2665 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:56,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 2665 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:25:56,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-01-09 23:25:56,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 650. [2022-01-09 23:25:56,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 541 states have (on average 1.33456561922366) internal successors, (722), 550 states have internal predecessors, (722), 74 states have call successors, (74), 26 states have call predecessors, (74), 34 states have return successors, (107), 73 states have call predecessors, (107), 68 states have call successors, (107) [2022-01-09 23:25:56,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 903 transitions. [2022-01-09 23:25:56,956 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 903 transitions. Word has length 46 [2022-01-09 23:25:56,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:56,956 INFO L470 AbstractCegarLoop]: Abstraction has 650 states and 903 transitions. [2022-01-09 23:25:56,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:25:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 903 transitions. [2022-01-09 23:25:56,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-09 23:25:56,958 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:56,958 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:56,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-09 23:25:56,959 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:56,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:56,959 INFO L85 PathProgramCache]: Analyzing trace with hash -876237255, now seen corresponding path program 1 times [2022-01-09 23:25:56,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:56,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443958598] [2022-01-09 23:25:56,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:56,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:57,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:25:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:57,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:25:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:57,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-01-09 23:25:57,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:57,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443958598] [2022-01-09 23:25:57,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443958598] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:57,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:57,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-09 23:25:57,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923535307] [2022-01-09 23:25:57,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:57,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-09 23:25:57,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:57,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-09 23:25:57,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-01-09 23:25:57,074 INFO L87 Difference]: Start difference. First operand 650 states and 903 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:25:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:57,646 INFO L93 Difference]: Finished difference Result 685 states and 968 transitions. [2022-01-09 23:25:57,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-09 23:25:57,655 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-01-09 23:25:57,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:57,669 INFO L225 Difference]: With dead ends: 685 [2022-01-09 23:25:57,669 INFO L226 Difference]: Without dead ends: 667 [2022-01-09 23:25:57,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-01-09 23:25:57,670 INFO L933 BasicCegarLoop]: 538 mSDtfsCounter, 123 mSDsluCounter, 4152 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 4690 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:57,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 4690 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-09 23:25:57,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-01-09 23:25:57,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 647. [2022-01-09 23:25:57,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 539 states have (on average 1.3339517625231911) internal successors, (719), 548 states have internal predecessors, (719), 73 states have call successors, (73), 26 states have call predecessors, (73), 34 states have return successors, (106), 72 states have call predecessors, (106), 67 states have call successors, (106) [2022-01-09 23:25:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 898 transitions. [2022-01-09 23:25:57,709 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 898 transitions. Word has length 47 [2022-01-09 23:25:57,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:57,709 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 898 transitions. [2022-01-09 23:25:57,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:25:57,709 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 898 transitions. [2022-01-09 23:25:57,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-09 23:25:57,711 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:57,711 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:57,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-09 23:25:57,725 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:57,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:57,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1600404883, now seen corresponding path program 1 times [2022-01-09 23:25:57,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:57,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977824196] [2022-01-09 23:25:57,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:57,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:57,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 23:25:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:57,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-09 23:25:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:57,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:25:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:57,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-09 23:25:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:57,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:57,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977824196] [2022-01-09 23:25:57,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977824196] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:57,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:57,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-09 23:25:57,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472494768] [2022-01-09 23:25:57,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:57,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-09 23:25:57,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:57,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-09 23:25:57,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:25:57,818 INFO L87 Difference]: Start difference. First operand 647 states and 898 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-09 23:25:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:58,166 INFO L93 Difference]: Finished difference Result 1017 states and 1421 transitions. [2022-01-09 23:25:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:25:58,167 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 63 [2022-01-09 23:25:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:58,169 INFO L225 Difference]: With dead ends: 1017 [2022-01-09 23:25:58,169 INFO L226 Difference]: Without dead ends: 647 [2022-01-09 23:25:58,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-01-09 23:25:58,171 INFO L933 BasicCegarLoop]: 463 mSDtfsCounter, 862 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:58,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [882 Valid, 1397 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:25:58,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-01-09 23:25:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2022-01-09 23:25:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 539 states have (on average 1.3265306122448979) internal successors, (715), 548 states have internal predecessors, (715), 73 states have call successors, (73), 26 states have call predecessors, (73), 34 states have return successors, (101), 72 states have call predecessors, (101), 67 states have call successors, (101) [2022-01-09 23:25:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 889 transitions. [2022-01-09 23:25:58,247 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 889 transitions. Word has length 63 [2022-01-09 23:25:58,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:58,247 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 889 transitions. [2022-01-09 23:25:58,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-09 23:25:58,247 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 889 transitions. [2022-01-09 23:25:58,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-09 23:25:58,249 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:58,249 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:58,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-09 23:25:58,249 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:58,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:58,250 INFO L85 PathProgramCache]: Analyzing trace with hash -816949344, now seen corresponding path program 1 times [2022-01-09 23:25:58,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:58,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701111647] [2022-01-09 23:25:58,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:58,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:58,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 23:25:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:58,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-09 23:25:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:58,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:25:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:58,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-09 23:25:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:58,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:58,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701111647] [2022-01-09 23:25:58,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701111647] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:25:58,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674715273] [2022-01-09 23:25:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:58,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:25:58,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:25:58,347 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:25:58,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-09 23:25:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:58,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-09 23:25:58,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:25:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:58,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:25:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:58,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674715273] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-09 23:25:58,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:25:58,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2022-01-09 23:25:58,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735625027] [2022-01-09 23:25:58,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:58,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-09 23:25:58,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:58,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-09 23:25:58,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-09 23:25:58,992 INFO L87 Difference]: Start difference. First operand 647 states and 889 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-09 23:25:59,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:59,315 INFO L93 Difference]: Finished difference Result 935 states and 1273 transitions. [2022-01-09 23:25:59,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-09 23:25:59,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2022-01-09 23:25:59,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:59,318 INFO L225 Difference]: With dead ends: 935 [2022-01-09 23:25:59,318 INFO L226 Difference]: Without dead ends: 784 [2022-01-09 23:25:59,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-01-09 23:25:59,328 INFO L933 BasicCegarLoop]: 578 mSDtfsCounter, 659 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:59,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [662 Valid, 1350 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:25:59,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-01-09 23:25:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 685. [2022-01-09 23:25:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 570 states have (on average 1.3263157894736841) internal successors, (756), 579 states have internal predecessors, (756), 76 states have call successors, (76), 28 states have call predecessors, (76), 38 states have return successors, (107), 77 states have call predecessors, (107), 70 states have call successors, (107) [2022-01-09 23:25:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 939 transitions. [2022-01-09 23:25:59,362 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 939 transitions. Word has length 64 [2022-01-09 23:25:59,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:59,363 INFO L470 AbstractCegarLoop]: Abstraction has 685 states and 939 transitions. [2022-01-09 23:25:59,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-09 23:25:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 939 transitions. [2022-01-09 23:25:59,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-09 23:25:59,364 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:59,364 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:59,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-09 23:25:59,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-01-09 23:25:59,580 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:59,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:59,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1640527845, now seen corresponding path program 1 times [2022-01-09 23:25:59,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:59,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608225263] [2022-01-09 23:25:59,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:59,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:59,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-09 23:25:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:59,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:25:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:59,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:59,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:59,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608225263] [2022-01-09 23:25:59,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608225263] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:59,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:59,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-09 23:25:59,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373633948] [2022-01-09 23:25:59,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:59,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-09 23:25:59,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:59,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-09 23:25:59,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-01-09 23:25:59,700 INFO L87 Difference]: Start difference. First operand 685 states and 939 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:00,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:00,547 INFO L93 Difference]: Finished difference Result 703 states and 957 transitions. [2022-01-09 23:26:00,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-09 23:26:00,548 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-01-09 23:26:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:00,550 INFO L225 Difference]: With dead ends: 703 [2022-01-09 23:26:00,550 INFO L226 Difference]: Without dead ends: 683 [2022-01-09 23:26:00,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-01-09 23:26:00,551 INFO L933 BasicCegarLoop]: 499 mSDtfsCounter, 239 mSDsluCounter, 3766 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 4265 SdHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:00,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 4265 Invalid, 1597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-09 23:26:00,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-01-09 23:26:00,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2022-01-09 23:26:00,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 569 states have (on average 1.3251318101933216) internal successors, (754), 578 states have internal predecessors, (754), 75 states have call successors, (75), 28 states have call predecessors, (75), 38 states have return successors, (106), 76 states have call predecessors, (106), 69 states have call successors, (106) [2022-01-09 23:26:00,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 935 transitions. [2022-01-09 23:26:00,584 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 935 transitions. Word has length 48 [2022-01-09 23:26:00,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:00,584 INFO L470 AbstractCegarLoop]: Abstraction has 683 states and 935 transitions. [2022-01-09 23:26:00,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:00,584 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 935 transitions. [2022-01-09 23:26:00,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-09 23:26:00,585 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:00,585 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:00,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-09 23:26:00,586 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:00,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:00,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1335817887, now seen corresponding path program 1 times [2022-01-09 23:26:00,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:00,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369603134] [2022-01-09 23:26:00,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:00,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:00,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:26:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:00,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-09 23:26:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:00,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:00,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:00,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369603134] [2022-01-09 23:26:00,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369603134] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:00,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:00,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-09 23:26:00,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737200414] [2022-01-09 23:26:00,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:00,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-09 23:26:00,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:00,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-09 23:26:00,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:26:00,619 INFO L87 Difference]: Start difference. First operand 683 states and 935 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:00,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:00,862 INFO L93 Difference]: Finished difference Result 919 states and 1254 transitions. [2022-01-09 23:26:00,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-09 23:26:00,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-01-09 23:26:00,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:00,864 INFO L225 Difference]: With dead ends: 919 [2022-01-09 23:26:00,864 INFO L226 Difference]: Without dead ends: 641 [2022-01-09 23:26:00,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:26:00,865 INFO L933 BasicCegarLoop]: 496 mSDtfsCounter, 99 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:00,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 1584 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:26:00,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-01-09 23:26:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 606. [2022-01-09 23:26:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 509 states have (on average 1.3143418467583496) internal successors, (669), 517 states have internal predecessors, (669), 65 states have call successors, (65), 25 states have call predecessors, (65), 31 states have return successors, (73), 63 states have call predecessors, (73), 59 states have call successors, (73) [2022-01-09 23:26:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 807 transitions. [2022-01-09 23:26:00,894 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 807 transitions. Word has length 48 [2022-01-09 23:26:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:00,894 INFO L470 AbstractCegarLoop]: Abstraction has 606 states and 807 transitions. [2022-01-09 23:26:00,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 807 transitions. [2022-01-09 23:26:00,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-09 23:26:00,896 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:00,896 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:00,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-09 23:26:00,896 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:00,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:00,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1170302788, now seen corresponding path program 1 times [2022-01-09 23:26:00,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:00,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716774823] [2022-01-09 23:26:00,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:00,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:00,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-09 23:26:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:00,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:01,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:01,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:01,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716774823] [2022-01-09 23:26:01,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716774823] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:01,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:01,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-09 23:26:01,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212100081] [2022-01-09 23:26:01,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:01,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-09 23:26:01,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:01,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-09 23:26:01,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-01-09 23:26:01,028 INFO L87 Difference]: Start difference. First operand 606 states and 807 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:01,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:01,702 INFO L93 Difference]: Finished difference Result 621 states and 822 transitions. [2022-01-09 23:26:01,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-09 23:26:01,702 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-01-09 23:26:01,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:01,704 INFO L225 Difference]: With dead ends: 621 [2022-01-09 23:26:01,704 INFO L226 Difference]: Without dead ends: 597 [2022-01-09 23:26:01,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-01-09 23:26:01,705 INFO L933 BasicCegarLoop]: 501 mSDtfsCounter, 118 mSDsluCounter, 3884 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 4385 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:01,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 4385 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-09 23:26:01,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-01-09 23:26:01,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2022-01-09 23:26:01,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 502 states have (on average 1.3147410358565736) internal successors, (660), 510 states have internal predecessors, (660), 63 states have call successors, (63), 25 states have call predecessors, (63), 31 states have return successors, (71), 61 states have call predecessors, (71), 57 states have call successors, (71) [2022-01-09 23:26:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 794 transitions. [2022-01-09 23:26:01,731 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 794 transitions. Word has length 54 [2022-01-09 23:26:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:01,732 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 794 transitions. [2022-01-09 23:26:01,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 794 transitions. [2022-01-09 23:26:01,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-09 23:26:01,733 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:01,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:01,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-09 23:26:01,733 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:01,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:01,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1066234985, now seen corresponding path program 1 times [2022-01-09 23:26:01,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:01,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300701806] [2022-01-09 23:26:01,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:01,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:01,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-09 23:26:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:01,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:01,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:01,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300701806] [2022-01-09 23:26:01,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300701806] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:01,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:01,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-09 23:26:01,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548893325] [2022-01-09 23:26:01,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:01,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-09 23:26:01,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:01,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-09 23:26:01,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-01-09 23:26:01,876 INFO L87 Difference]: Start difference. First operand 597 states and 794 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:02,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:02,525 INFO L93 Difference]: Finished difference Result 612 states and 809 transitions. [2022-01-09 23:26:02,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-09 23:26:02,525 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-01-09 23:26:02,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:02,531 INFO L225 Difference]: With dead ends: 612 [2022-01-09 23:26:02,531 INFO L226 Difference]: Without dead ends: 594 [2022-01-09 23:26:02,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-01-09 23:26:02,532 INFO L933 BasicCegarLoop]: 476 mSDtfsCounter, 118 mSDsluCounter, 3715 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 4191 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:02,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 4191 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-09 23:26:02,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-01-09 23:26:02,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2022-01-09 23:26:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 500 states have (on average 1.314) internal successors, (657), 508 states have internal predecessors, (657), 62 states have call successors, (62), 25 states have call predecessors, (62), 31 states have return successors, (70), 60 states have call predecessors, (70), 56 states have call successors, (70) [2022-01-09 23:26:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 789 transitions. [2022-01-09 23:26:02,558 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 789 transitions. Word has length 48 [2022-01-09 23:26:02,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:02,558 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 789 transitions. [2022-01-09 23:26:02,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 789 transitions. [2022-01-09 23:26:02,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-09 23:26:02,559 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:02,559 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:02,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-09 23:26:02,560 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:02,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:02,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1131207190, now seen corresponding path program 1 times [2022-01-09 23:26:02,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:02,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631200026] [2022-01-09 23:26:02,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:02,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:02,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-09 23:26:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:02,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-09 23:26:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:02,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:02,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:02,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631200026] [2022-01-09 23:26:02,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631200026] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:02,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:02,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-09 23:26:02,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443504504] [2022-01-09 23:26:02,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:02,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-09 23:26:02,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:02,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-09 23:26:02,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-09 23:26:02,700 INFO L87 Difference]: Start difference. First operand 594 states and 789 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-09 23:26:03,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:03,418 INFO L93 Difference]: Finished difference Result 628 states and 824 transitions. [2022-01-09 23:26:03,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-09 23:26:03,418 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-01-09 23:26:03,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:03,420 INFO L225 Difference]: With dead ends: 628 [2022-01-09 23:26:03,420 INFO L226 Difference]: Without dead ends: 608 [2022-01-09 23:26:03,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-01-09 23:26:03,421 INFO L933 BasicCegarLoop]: 462 mSDtfsCounter, 256 mSDsluCounter, 3741 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 4203 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:03,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 4203 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1452 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-09 23:26:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-01-09 23:26:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 592. [2022-01-09 23:26:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 499 states have (on average 1.312625250501002) internal successors, (655), 507 states have internal predecessors, (655), 61 states have call successors, (61), 25 states have call predecessors, (61), 31 states have return successors, (69), 59 states have call predecessors, (69), 55 states have call successors, (69) [2022-01-09 23:26:03,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 785 transitions. [2022-01-09 23:26:03,448 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 785 transitions. Word has length 51 [2022-01-09 23:26:03,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:03,449 INFO L470 AbstractCegarLoop]: Abstraction has 592 states and 785 transitions. [2022-01-09 23:26:03,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-09 23:26:03,449 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 785 transitions. [2022-01-09 23:26:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-09 23:26:03,451 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:03,452 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:03,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-09 23:26:03,452 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:03,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:03,452 INFO L85 PathProgramCache]: Analyzing trace with hash -480998912, now seen corresponding path program 1 times [2022-01-09 23:26:03,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:03,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926155275] [2022-01-09 23:26:03,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:03,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-09 23:26:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-09 23:26:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:03,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:03,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926155275] [2022-01-09 23:26:03,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926155275] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:03,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:03,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-09 23:26:03,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635557685] [2022-01-09 23:26:03,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:03,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-09 23:26:03,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:03,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-09 23:26:03,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-09 23:26:03,491 INFO L87 Difference]: Start difference. First operand 592 states and 785 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:03,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:03,805 INFO L93 Difference]: Finished difference Result 674 states and 879 transitions. [2022-01-09 23:26:03,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:26:03,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-01-09 23:26:03,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:03,814 INFO L225 Difference]: With dead ends: 674 [2022-01-09 23:26:03,814 INFO L226 Difference]: Without dead ends: 648 [2022-01-09 23:26:03,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-09 23:26:03,815 INFO L933 BasicCegarLoop]: 510 mSDtfsCounter, 267 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:03,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 2340 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:26:03,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-01-09 23:26:03,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 598. [2022-01-09 23:26:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 504 states have (on average 1.3115079365079365) internal successors, (661), 512 states have internal predecessors, (661), 62 states have call successors, (62), 25 states have call predecessors, (62), 31 states have return successors, (70), 60 states have call predecessors, (70), 56 states have call successors, (70) [2022-01-09 23:26:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 793 transitions. [2022-01-09 23:26:03,870 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 793 transitions. Word has length 50 [2022-01-09 23:26:03,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:03,870 INFO L470 AbstractCegarLoop]: Abstraction has 598 states and 793 transitions. [2022-01-09 23:26:03,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 793 transitions. [2022-01-09 23:26:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-09 23:26:03,872 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:03,872 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:03,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-09 23:26:03,873 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:03,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:03,873 INFO L85 PathProgramCache]: Analyzing trace with hash 266979750, now seen corresponding path program 1 times [2022-01-09 23:26:03,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:03,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168803849] [2022-01-09 23:26:03,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:03,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-09 23:26:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-09 23:26:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:03,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:03,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168803849] [2022-01-09 23:26:03,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168803849] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:03,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:03,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-09 23:26:03,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524134238] [2022-01-09 23:26:03,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:03,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 23:26:03,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:03,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 23:26:03,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:26:03,925 INFO L87 Difference]: Start difference. First operand 598 states and 793 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-09 23:26:04,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:04,282 INFO L93 Difference]: Finished difference Result 703 states and 934 transitions. [2022-01-09 23:26:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-09 23:26:04,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2022-01-09 23:26:04,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:04,284 INFO L225 Difference]: With dead ends: 703 [2022-01-09 23:26:04,284 INFO L226 Difference]: Without dead ends: 598 [2022-01-09 23:26:04,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:26:04,285 INFO L933 BasicCegarLoop]: 463 mSDtfsCounter, 113 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:04,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 1415 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:26:04,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-01-09 23:26:04,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2022-01-09 23:26:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 504 states have (on average 1.3055555555555556) internal successors, (658), 512 states have internal predecessors, (658), 62 states have call successors, (62), 25 states have call predecessors, (62), 31 states have return successors, (70), 60 states have call predecessors, (70), 56 states have call successors, (70) [2022-01-09 23:26:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 790 transitions. [2022-01-09 23:26:04,312 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 790 transitions. Word has length 53 [2022-01-09 23:26:04,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:04,312 INFO L470 AbstractCegarLoop]: Abstraction has 598 states and 790 transitions. [2022-01-09 23:26:04,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-09 23:26:04,312 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 790 transitions. [2022-01-09 23:26:04,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-09 23:26:04,313 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:04,314 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:04,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-09 23:26:04,314 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:04,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1095084481, now seen corresponding path program 1 times [2022-01-09 23:26:04,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:04,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682204826] [2022-01-09 23:26:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:04,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:04,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:26:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:04,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-09 23:26:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:04,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:04,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:04,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682204826] [2022-01-09 23:26:04,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682204826] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:04,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:04,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-09 23:26:04,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257791410] [2022-01-09 23:26:04,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:04,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-09 23:26:04,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:04,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-09 23:26:04,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-09 23:26:04,415 INFO L87 Difference]: Start difference. First operand 598 states and 790 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-09 23:26:05,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:05,046 INFO L93 Difference]: Finished difference Result 616 states and 808 transitions. [2022-01-09 23:26:05,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-09 23:26:05,047 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2022-01-09 23:26:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:05,048 INFO L225 Difference]: With dead ends: 616 [2022-01-09 23:26:05,048 INFO L226 Difference]: Without dead ends: 596 [2022-01-09 23:26:05,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-01-09 23:26:05,049 INFO L933 BasicCegarLoop]: 470 mSDtfsCounter, 256 mSDsluCounter, 3431 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 3901 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:05,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 3901 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-09 23:26:05,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-01-09 23:26:05,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2022-01-09 23:26:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 503 states have (on average 1.3041749502982107) internal successors, (656), 511 states have internal predecessors, (656), 61 states have call successors, (61), 25 states have call predecessors, (61), 31 states have return successors, (69), 59 states have call predecessors, (69), 55 states have call successors, (69) [2022-01-09 23:26:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 786 transitions. [2022-01-09 23:26:05,099 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 786 transitions. Word has length 52 [2022-01-09 23:26:05,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:05,100 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 786 transitions. [2022-01-09 23:26:05,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-09 23:26:05,100 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 786 transitions. [2022-01-09 23:26:05,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-09 23:26:05,101 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:05,101 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:05,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-09 23:26:05,102 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:05,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:05,102 INFO L85 PathProgramCache]: Analyzing trace with hash 309046761, now seen corresponding path program 1 times [2022-01-09 23:26:05,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:05,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178936378] [2022-01-09 23:26:05,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:05,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-09 23:26:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-09 23:26:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:05,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:05,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178936378] [2022-01-09 23:26:05,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178936378] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:05,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:05,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-09 23:26:05,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878698966] [2022-01-09 23:26:05,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:05,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-09 23:26:05,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:05,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-09 23:26:05,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-09 23:26:05,163 INFO L87 Difference]: Start difference. First operand 596 states and 786 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:05,542 INFO L93 Difference]: Finished difference Result 630 states and 826 transitions. [2022-01-09 23:26:05,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-09 23:26:05,543 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-01-09 23:26:05,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:05,544 INFO L225 Difference]: With dead ends: 630 [2022-01-09 23:26:05,544 INFO L226 Difference]: Without dead ends: 576 [2022-01-09 23:26:05,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-01-09 23:26:05,546 INFO L933 BasicCegarLoop]: 469 mSDtfsCounter, 266 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 2742 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:05,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 2742 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:26:05,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-01-09 23:26:05,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 569. [2022-01-09 23:26:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 481 states have (on average 1.288981288981289) internal successors, (620), 489 states have internal predecessors, (620), 56 states have call successors, (56), 25 states have call predecessors, (56), 31 states have return successors, (63), 54 states have call predecessors, (63), 50 states have call successors, (63) [2022-01-09 23:26:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 739 transitions. [2022-01-09 23:26:05,575 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 739 transitions. Word has length 51 [2022-01-09 23:26:05,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:05,575 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 739 transitions. [2022-01-09 23:26:05,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:05,576 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 739 transitions. [2022-01-09 23:26:05,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-09 23:26:05,576 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:05,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:05,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-09 23:26:05,577 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:05,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:05,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1614181273, now seen corresponding path program 1 times [2022-01-09 23:26:05,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:05,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233273931] [2022-01-09 23:26:05,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:05,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-09 23:26:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-09 23:26:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:05,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:05,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233273931] [2022-01-09 23:26:05,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233273931] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:05,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:05,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-09 23:26:05,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356593210] [2022-01-09 23:26:05,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:05,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-09 23:26:05,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:05,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-09 23:26:05,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-09 23:26:05,617 INFO L87 Difference]: Start difference. First operand 569 states and 739 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:05,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:05,870 INFO L93 Difference]: Finished difference Result 610 states and 781 transitions. [2022-01-09 23:26:05,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:26:05,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-01-09 23:26:05,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:05,887 INFO L225 Difference]: With dead ends: 610 [2022-01-09 23:26:05,887 INFO L226 Difference]: Without dead ends: 563 [2022-01-09 23:26:05,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:26:05,887 INFO L933 BasicCegarLoop]: 412 mSDtfsCounter, 179 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:05,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 1733 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:26:05,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-01-09 23:26:05,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 559. [2022-01-09 23:26:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 473 states have (on average 1.285412262156448) internal successors, (608), 481 states have internal predecessors, (608), 54 states have call successors, (54), 25 states have call predecessors, (54), 31 states have return successors, (61), 52 states have call predecessors, (61), 48 states have call successors, (61) [2022-01-09 23:26:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 723 transitions. [2022-01-09 23:26:05,928 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 723 transitions. Word has length 51 [2022-01-09 23:26:05,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:05,930 INFO L470 AbstractCegarLoop]: Abstraction has 559 states and 723 transitions. [2022-01-09 23:26:05,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:05,930 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 723 transitions. [2022-01-09 23:26:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-09 23:26:05,931 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:05,931 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:05,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-09 23:26:05,931 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:05,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:05,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1624287433, now seen corresponding path program 1 times [2022-01-09 23:26:05,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:05,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322265932] [2022-01-09 23:26:05,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:05,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-09 23:26:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-09 23:26:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:05,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:05,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322265932] [2022-01-09 23:26:05,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322265932] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:05,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:05,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-09 23:26:05,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582150669] [2022-01-09 23:26:05,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:05,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-09 23:26:05,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:05,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-09 23:26:05,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-09 23:26:05,979 INFO L87 Difference]: Start difference. First operand 559 states and 723 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:06,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:06,236 INFO L93 Difference]: Finished difference Result 586 states and 751 transitions. [2022-01-09 23:26:06,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:26:06,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2022-01-09 23:26:06,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:06,238 INFO L225 Difference]: With dead ends: 586 [2022-01-09 23:26:06,238 INFO L226 Difference]: Without dead ends: 554 [2022-01-09 23:26:06,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:26:06,238 INFO L933 BasicCegarLoop]: 412 mSDtfsCounter, 96 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:06,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 1981 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:26:06,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-01-09 23:26:06,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2022-01-09 23:26:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 469 states have (on average 1.2857142857142858) internal successors, (603), 477 states have internal predecessors, (603), 53 states have call successors, (53), 25 states have call predecessors, (53), 31 states have return successors, (60), 51 states have call predecessors, (60), 47 states have call successors, (60) [2022-01-09 23:26:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 716 transitions. [2022-01-09 23:26:06,261 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 716 transitions. Word has length 52 [2022-01-09 23:26:06,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:06,261 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 716 transitions. [2022-01-09 23:26:06,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 716 transitions. [2022-01-09 23:26:06,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-09 23:26:06,264 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:06,264 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:06,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-09 23:26:06,264 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:06,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:06,264 INFO L85 PathProgramCache]: Analyzing trace with hash 576638373, now seen corresponding path program 1 times [2022-01-09 23:26:06,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:06,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424970765] [2022-01-09 23:26:06,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:06,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:06,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-09 23:26:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:06,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:06,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:06,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:06,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424970765] [2022-01-09 23:26:06,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424970765] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:06,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:06,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-09 23:26:06,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679455162] [2022-01-09 23:26:06,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:06,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-09 23:26:06,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:06,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-09 23:26:06,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:26:06,300 INFO L87 Difference]: Start difference. First operand 554 states and 716 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:06,565 INFO L93 Difference]: Finished difference Result 653 states and 844 transitions. [2022-01-09 23:26:06,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:26:06,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2022-01-09 23:26:06,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:06,566 INFO L225 Difference]: With dead ends: 653 [2022-01-09 23:26:06,566 INFO L226 Difference]: Without dead ends: 641 [2022-01-09 23:26:06,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-09 23:26:06,567 INFO L933 BasicCegarLoop]: 412 mSDtfsCounter, 216 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:06,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 1198 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:26:06,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-01-09 23:26:06,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 586. [2022-01-09 23:26:06,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 499 states have (on average 1.280561122244489) internal successors, (639), 507 states have internal predecessors, (639), 53 states have call successors, (53), 25 states have call predecessors, (53), 33 states have return successors, (62), 53 states have call predecessors, (62), 47 states have call successors, (62) [2022-01-09 23:26:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 754 transitions. [2022-01-09 23:26:06,594 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 754 transitions. Word has length 52 [2022-01-09 23:26:06,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:06,594 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 754 transitions. [2022-01-09 23:26:06,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 754 transitions. [2022-01-09 23:26:06,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-09 23:26:06,595 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:06,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:06,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-09 23:26:06,596 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:06,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:06,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2037022253, now seen corresponding path program 1 times [2022-01-09 23:26:06,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:06,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006299079] [2022-01-09 23:26:06,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:06,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:06,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-09 23:26:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:06,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:06,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-09 23:26:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:06,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-09 23:26:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:06,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:06,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:06,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006299079] [2022-01-09 23:26:06,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006299079] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:06,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:06,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-09 23:26:06,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146585614] [2022-01-09 23:26:06,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:06,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 23:26:06,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:06,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 23:26:06,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:26:06,666 INFO L87 Difference]: Start difference. First operand 586 states and 754 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-09 23:26:06,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:06,963 INFO L93 Difference]: Finished difference Result 716 states and 919 transitions. [2022-01-09 23:26:06,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-09 23:26:06,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2022-01-09 23:26:06,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:06,964 INFO L225 Difference]: With dead ends: 716 [2022-01-09 23:26:06,965 INFO L226 Difference]: Without dead ends: 643 [2022-01-09 23:26:06,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-09 23:26:06,965 INFO L933 BasicCegarLoop]: 450 mSDtfsCounter, 417 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:06,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 1304 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:26:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-01-09 23:26:06,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 626. [2022-01-09 23:26:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 533 states have (on average 1.2870544090056286) internal successors, (686), 540 states have internal predecessors, (686), 55 states have call successors, (55), 28 states have call predecessors, (55), 37 states have return successors, (67), 57 states have call predecessors, (67), 50 states have call successors, (67) [2022-01-09 23:26:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 808 transitions. [2022-01-09 23:26:06,994 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 808 transitions. Word has length 56 [2022-01-09 23:26:06,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:06,994 INFO L470 AbstractCegarLoop]: Abstraction has 626 states and 808 transitions. [2022-01-09 23:26:06,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-09 23:26:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 808 transitions. [2022-01-09 23:26:06,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-09 23:26:06,995 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:06,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:06,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-09 23:26:06,996 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:06,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:06,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1140697567, now seen corresponding path program 1 times [2022-01-09 23:26:06,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:06,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065510004] [2022-01-09 23:26:06,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:06,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-09 23:26:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:07,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:07,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065510004] [2022-01-09 23:26:07,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065510004] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:07,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:07,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-09 23:26:07,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893590578] [2022-01-09 23:26:07,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:07,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-09 23:26:07,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:07,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-09 23:26:07,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-09 23:26:07,035 INFO L87 Difference]: Start difference. First operand 626 states and 808 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:07,466 INFO L93 Difference]: Finished difference Result 687 states and 887 transitions. [2022-01-09 23:26:07,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-09 23:26:07,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-01-09 23:26:07,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:07,467 INFO L225 Difference]: With dead ends: 687 [2022-01-09 23:26:07,467 INFO L226 Difference]: Without dead ends: 678 [2022-01-09 23:26:07,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-01-09 23:26:07,468 INFO L933 BasicCegarLoop]: 423 mSDtfsCounter, 747 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:07,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [781 Valid, 1443 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:26:07,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-01-09 23:26:07,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 626. [2022-01-09 23:26:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 533 states have (on average 1.2833020637898687) internal successors, (684), 540 states have internal predecessors, (684), 55 states have call successors, (55), 28 states have call predecessors, (55), 37 states have return successors, (67), 57 states have call predecessors, (67), 50 states have call successors, (67) [2022-01-09 23:26:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 806 transitions. [2022-01-09 23:26:07,499 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 806 transitions. Word has length 53 [2022-01-09 23:26:07,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:07,500 INFO L470 AbstractCegarLoop]: Abstraction has 626 states and 806 transitions. [2022-01-09 23:26:07,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 806 transitions. [2022-01-09 23:26:07,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-09 23:26:07,501 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:07,501 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:07,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-09 23:26:07,501 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:07,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:07,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1949554969, now seen corresponding path program 1 times [2022-01-09 23:26:07,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:07,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299413270] [2022-01-09 23:26:07,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:07,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-09 23:26:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-09 23:26:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-09 23:26:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:07,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:07,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299413270] [2022-01-09 23:26:07,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299413270] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:07,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:07,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-09 23:26:07,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140881694] [2022-01-09 23:26:07,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:07,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-09 23:26:07,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:07,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-09 23:26:07,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-09 23:26:07,645 INFO L87 Difference]: Start difference. First operand 626 states and 806 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-09 23:26:08,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:08,336 INFO L93 Difference]: Finished difference Result 669 states and 855 transitions. [2022-01-09 23:26:08,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-09 23:26:08,336 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 59 [2022-01-09 23:26:08,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:08,338 INFO L225 Difference]: With dead ends: 669 [2022-01-09 23:26:08,338 INFO L226 Difference]: Without dead ends: 649 [2022-01-09 23:26:08,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-01-09 23:26:08,338 INFO L933 BasicCegarLoop]: 428 mSDtfsCounter, 243 mSDsluCounter, 3593 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 4021 SdHoareTripleChecker+Invalid, 1658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:08,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 4021 Invalid, 1658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1554 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-09 23:26:08,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2022-01-09 23:26:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 624. [2022-01-09 23:26:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 532 states have (on average 1.281954887218045) internal successors, (682), 539 states have internal predecessors, (682), 54 states have call successors, (54), 28 states have call predecessors, (54), 37 states have return successors, (66), 56 states have call predecessors, (66), 49 states have call successors, (66) [2022-01-09 23:26:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 802 transitions. [2022-01-09 23:26:08,375 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 802 transitions. Word has length 59 [2022-01-09 23:26:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:08,375 INFO L470 AbstractCegarLoop]: Abstraction has 624 states and 802 transitions. [2022-01-09 23:26:08,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-09 23:26:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 802 transitions. [2022-01-09 23:26:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-09 23:26:08,377 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:08,377 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:08,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-09 23:26:08,377 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:08,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:08,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1478759627, now seen corresponding path program 1 times [2022-01-09 23:26:08,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:08,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688420775] [2022-01-09 23:26:08,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:08,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:08,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-09 23:26:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:08,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-09 23:26:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:08,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:08,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:08,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688420775] [2022-01-09 23:26:08,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688420775] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:08,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:08,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-09 23:26:08,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128674603] [2022-01-09 23:26:08,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:08,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-09 23:26:08,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:08,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-09 23:26:08,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-01-09 23:26:08,495 INFO L87 Difference]: Start difference. First operand 624 states and 802 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-09 23:26:09,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:09,312 INFO L93 Difference]: Finished difference Result 644 states and 823 transitions. [2022-01-09 23:26:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-09 23:26:09,312 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2022-01-09 23:26:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:09,314 INFO L225 Difference]: With dead ends: 644 [2022-01-09 23:26:09,314 INFO L226 Difference]: Without dead ends: 620 [2022-01-09 23:26:09,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2022-01-09 23:26:09,314 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 232 mSDsluCounter, 3964 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 4368 SdHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:09,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 4368 Invalid, 1873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-09 23:26:09,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2022-01-09 23:26:09,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2022-01-09 23:26:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 529 states have (on average 1.281663516068053) internal successors, (678), 536 states have internal predecessors, (678), 53 states have call successors, (53), 28 states have call predecessors, (53), 37 states have return successors, (65), 55 states have call predecessors, (65), 48 states have call successors, (65) [2022-01-09 23:26:09,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 796 transitions. [2022-01-09 23:26:09,347 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 796 transitions. Word has length 55 [2022-01-09 23:26:09,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:09,347 INFO L470 AbstractCegarLoop]: Abstraction has 620 states and 796 transitions. [2022-01-09 23:26:09,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-09 23:26:09,348 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 796 transitions. [2022-01-09 23:26:09,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-09 23:26:09,348 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:09,349 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:09,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-09 23:26:09,350 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:09,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:09,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1059320829, now seen corresponding path program 1 times [2022-01-09 23:26:09,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:09,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419315332] [2022-01-09 23:26:09,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:09,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:09,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-09 23:26:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:09,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-09 23:26:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:09,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:09,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419315332] [2022-01-09 23:26:09,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419315332] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:09,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:09,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-09 23:26:09,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390973350] [2022-01-09 23:26:09,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:09,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-09 23:26:09,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:09,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-09 23:26:09,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-09 23:26:09,424 INFO L87 Difference]: Start difference. First operand 620 states and 796 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:09,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:09,668 INFO L93 Difference]: Finished difference Result 647 states and 824 transitions. [2022-01-09 23:26:09,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:26:09,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-01-09 23:26:09,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:09,670 INFO L225 Difference]: With dead ends: 647 [2022-01-09 23:26:09,670 INFO L226 Difference]: Without dead ends: 615 [2022-01-09 23:26:09,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:26:09,670 INFO L933 BasicCegarLoop]: 394 mSDtfsCounter, 171 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:09,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 1655 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:26:09,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-01-09 23:26:09,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2022-01-09 23:26:09,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 525 states have (on average 1.2819047619047619) internal successors, (673), 532 states have internal predecessors, (673), 52 states have call successors, (52), 28 states have call predecessors, (52), 37 states have return successors, (64), 54 states have call predecessors, (64), 47 states have call successors, (64) [2022-01-09 23:26:09,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 789 transitions. [2022-01-09 23:26:09,701 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 789 transitions. Word has length 54 [2022-01-09 23:26:09,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:09,702 INFO L470 AbstractCegarLoop]: Abstraction has 615 states and 789 transitions. [2022-01-09 23:26:09,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:09,702 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 789 transitions. [2022-01-09 23:26:09,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-09 23:26:09,703 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:09,703 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:09,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-09 23:26:09,703 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:09,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:09,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1513227889, now seen corresponding path program 1 times [2022-01-09 23:26:09,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:09,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340270395] [2022-01-09 23:26:09,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:09,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:09,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-09 23:26:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:09,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-09 23:26:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:09,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:09,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340270395] [2022-01-09 23:26:09,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340270395] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:09,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:09,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-09 23:26:09,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219463830] [2022-01-09 23:26:09,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:09,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-09 23:26:09,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:09,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-09 23:26:09,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-01-09 23:26:09,779 INFO L87 Difference]: Start difference. First operand 615 states and 789 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:10,172 INFO L93 Difference]: Finished difference Result 638 states and 814 transitions. [2022-01-09 23:26:10,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-09 23:26:10,173 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-01-09 23:26:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:10,174 INFO L225 Difference]: With dead ends: 638 [2022-01-09 23:26:10,174 INFO L226 Difference]: Without dead ends: 612 [2022-01-09 23:26:10,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-01-09 23:26:10,174 INFO L933 BasicCegarLoop]: 403 mSDtfsCounter, 232 mSDsluCounter, 2622 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 3025 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:10,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 3025 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:26:10,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2022-01-09 23:26:10,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2022-01-09 23:26:10,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 523 states have (on average 1.2810707456978967) internal successors, (670), 530 states have internal predecessors, (670), 51 states have call successors, (51), 28 states have call predecessors, (51), 37 states have return successors, (63), 53 states have call predecessors, (63), 46 states have call successors, (63) [2022-01-09 23:26:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 784 transitions. [2022-01-09 23:26:10,206 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 784 transitions. Word has length 54 [2022-01-09 23:26:10,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:10,206 INFO L470 AbstractCegarLoop]: Abstraction has 612 states and 784 transitions. [2022-01-09 23:26:10,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:10,206 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 784 transitions. [2022-01-09 23:26:10,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-09 23:26:10,207 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:10,207 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:10,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-09 23:26:10,207 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:10,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:10,207 INFO L85 PathProgramCache]: Analyzing trace with hash 362195338, now seen corresponding path program 1 times [2022-01-09 23:26:10,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:10,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821790029] [2022-01-09 23:26:10,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:10,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:10,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-09 23:26:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:10,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:10,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:10,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821790029] [2022-01-09 23:26:10,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821790029] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:10,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:10,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-09 23:26:10,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876212483] [2022-01-09 23:26:10,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:10,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-09 23:26:10,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:10,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-09 23:26:10,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-09 23:26:10,254 INFO L87 Difference]: Start difference. First operand 612 states and 784 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:10,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:10,687 INFO L93 Difference]: Finished difference Result 668 states and 856 transitions. [2022-01-09 23:26:10,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-09 23:26:10,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-01-09 23:26:10,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:10,689 INFO L225 Difference]: With dead ends: 668 [2022-01-09 23:26:10,689 INFO L226 Difference]: Without dead ends: 664 [2022-01-09 23:26:10,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-01-09 23:26:10,689 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 723 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:10,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [753 Valid, 1361 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:26:10,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-01-09 23:26:10,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 609. [2022-01-09 23:26:10,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 520 states have (on average 1.2788461538461537) internal successors, (665), 527 states have internal predecessors, (665), 51 states have call successors, (51), 28 states have call predecessors, (51), 37 states have return successors, (63), 53 states have call predecessors, (63), 46 states have call successors, (63) [2022-01-09 23:26:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 779 transitions. [2022-01-09 23:26:10,723 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 779 transitions. Word has length 54 [2022-01-09 23:26:10,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:10,723 INFO L470 AbstractCegarLoop]: Abstraction has 609 states and 779 transitions. [2022-01-09 23:26:10,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:10,723 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 779 transitions. [2022-01-09 23:26:10,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-09 23:26:10,724 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:10,724 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:10,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-09 23:26:10,724 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:10,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:10,724 INFO L85 PathProgramCache]: Analyzing trace with hash 362472168, now seen corresponding path program 1 times [2022-01-09 23:26:10,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:10,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399722613] [2022-01-09 23:26:10,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:10,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:10,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-09 23:26:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:10,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:10,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:10,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399722613] [2022-01-09 23:26:10,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399722613] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:10,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:10,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-09 23:26:10,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574492020] [2022-01-09 23:26:10,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:10,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-09 23:26:10,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:10,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-09 23:26:10,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-01-09 23:26:10,826 INFO L87 Difference]: Start difference. First operand 609 states and 779 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:11,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:11,385 INFO L93 Difference]: Finished difference Result 619 states and 788 transitions. [2022-01-09 23:26:11,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-09 23:26:11,386 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-01-09 23:26:11,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:11,387 INFO L225 Difference]: With dead ends: 619 [2022-01-09 23:26:11,387 INFO L226 Difference]: Without dead ends: 591 [2022-01-09 23:26:11,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-01-09 23:26:11,388 INFO L933 BasicCegarLoop]: 372 mSDtfsCounter, 287 mSDsluCounter, 2154 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 2526 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:11,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 2526 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-09 23:26:11,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-01-09 23:26:11,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 587. [2022-01-09 23:26:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 499 states have (on average 1.2725450901803608) internal successors, (635), 506 states have internal predecessors, (635), 51 states have call successors, (51), 28 states have call predecessors, (51), 36 states have return successors, (62), 52 states have call predecessors, (62), 46 states have call successors, (62) [2022-01-09 23:26:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 748 transitions. [2022-01-09 23:26:11,419 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 748 transitions. Word has length 54 [2022-01-09 23:26:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:11,419 INFO L470 AbstractCegarLoop]: Abstraction has 587 states and 748 transitions. [2022-01-09 23:26:11,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 748 transitions. [2022-01-09 23:26:11,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-09 23:26:11,420 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:11,420 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:11,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-09 23:26:11,420 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:11,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:11,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1415863677, now seen corresponding path program 1 times [2022-01-09 23:26:11,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:11,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6739716] [2022-01-09 23:26:11,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:11,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:11,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-09 23:26:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:11,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:11,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:11,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6739716] [2022-01-09 23:26:11,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6739716] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:11,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:11,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-09 23:26:11,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327333330] [2022-01-09 23:26:11,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:11,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-09 23:26:11,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:11,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-09 23:26:11,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:26:11,452 INFO L87 Difference]: Start difference. First operand 587 states and 748 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:11,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:11,694 INFO L93 Difference]: Finished difference Result 613 states and 778 transitions. [2022-01-09 23:26:11,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:26:11,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-01-09 23:26:11,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:11,696 INFO L225 Difference]: With dead ends: 613 [2022-01-09 23:26:11,696 INFO L226 Difference]: Without dead ends: 580 [2022-01-09 23:26:11,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-09 23:26:11,697 INFO L933 BasicCegarLoop]: 412 mSDtfsCounter, 232 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:11,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 951 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:26:11,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2022-01-09 23:26:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 576. [2022-01-09 23:26:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 489 states have (on average 1.2638036809815951) internal successors, (618), 496 states have internal predecessors, (618), 51 states have call successors, (51), 28 states have call predecessors, (51), 35 states have return successors, (61), 51 states have call predecessors, (61), 46 states have call successors, (61) [2022-01-09 23:26:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 730 transitions. [2022-01-09 23:26:11,729 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 730 transitions. Word has length 54 [2022-01-09 23:26:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:11,729 INFO L470 AbstractCegarLoop]: Abstraction has 576 states and 730 transitions. [2022-01-09 23:26:11,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 730 transitions. [2022-01-09 23:26:11,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-09 23:26:11,730 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:11,730 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:11,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-09 23:26:11,730 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:11,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:11,730 INFO L85 PathProgramCache]: Analyzing trace with hash -275547021, now seen corresponding path program 1 times [2022-01-09 23:26:11,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:11,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013712140] [2022-01-09 23:26:11,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:11,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:11,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-09 23:26:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:11,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-09 23:26:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:11,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:11,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:11,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013712140] [2022-01-09 23:26:11,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013712140] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:11,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:11,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-09 23:26:11,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787860659] [2022-01-09 23:26:11,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:11,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-09 23:26:11,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:11,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-09 23:26:11,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:26:11,776 INFO L87 Difference]: Start difference. First operand 576 states and 730 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-09 23:26:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:12,112 INFO L93 Difference]: Finished difference Result 625 states and 782 transitions. [2022-01-09 23:26:12,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-09 23:26:12,113 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2022-01-09 23:26:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:12,114 INFO L225 Difference]: With dead ends: 625 [2022-01-09 23:26:12,114 INFO L226 Difference]: Without dead ends: 594 [2022-01-09 23:26:12,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-09 23:26:12,115 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 282 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:12,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 1510 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:26:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-01-09 23:26:12,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 576. [2022-01-09 23:26:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 489 states have (on average 1.261758691206544) internal successors, (617), 496 states have internal predecessors, (617), 51 states have call successors, (51), 28 states have call predecessors, (51), 35 states have return successors, (61), 51 states have call predecessors, (61), 46 states have call successors, (61) [2022-01-09 23:26:12,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 729 transitions. [2022-01-09 23:26:12,182 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 729 transitions. Word has length 56 [2022-01-09 23:26:12,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:12,182 INFO L470 AbstractCegarLoop]: Abstraction has 576 states and 729 transitions. [2022-01-09 23:26:12,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-09 23:26:12,182 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 729 transitions. [2022-01-09 23:26:12,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-09 23:26:12,186 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:12,186 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:12,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-09 23:26:12,186 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:12,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:12,187 INFO L85 PathProgramCache]: Analyzing trace with hash -252914767, now seen corresponding path program 1 times [2022-01-09 23:26:12,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:12,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483582111] [2022-01-09 23:26:12,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:12,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:12,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-09 23:26:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:12,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-09 23:26:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:12,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:12,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:12,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:12,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483582111] [2022-01-09 23:26:12,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483582111] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:12,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:12,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-09 23:26:12,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238937465] [2022-01-09 23:26:12,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:12,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-09 23:26:12,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:12,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-09 23:26:12,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-09 23:26:12,289 INFO L87 Difference]: Start difference. First operand 576 states and 729 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-09 23:26:12,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:12,952 INFO L93 Difference]: Finished difference Result 619 states and 778 transitions. [2022-01-09 23:26:12,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-09 23:26:12,952 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2022-01-09 23:26:12,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:12,954 INFO L225 Difference]: With dead ends: 619 [2022-01-09 23:26:12,954 INFO L226 Difference]: Without dead ends: 589 [2022-01-09 23:26:12,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-01-09 23:26:12,956 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 260 mSDsluCounter, 3003 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 3394 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:12,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 3394 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-09 23:26:12,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-01-09 23:26:12,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 571. [2022-01-09 23:26:12,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 485 states have (on average 1.2577319587628866) internal successors, (610), 492 states have internal predecessors, (610), 50 states have call successors, (50), 28 states have call predecessors, (50), 35 states have return successors, (59), 50 states have call predecessors, (59), 45 states have call successors, (59) [2022-01-09 23:26:12,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 719 transitions. [2022-01-09 23:26:12,989 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 719 transitions. Word has length 56 [2022-01-09 23:26:12,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:12,990 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 719 transitions. [2022-01-09 23:26:12,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-09 23:26:12,990 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 719 transitions. [2022-01-09 23:26:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-09 23:26:12,991 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:12,991 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:12,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-09 23:26:12,992 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:12,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:12,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1867013461, now seen corresponding path program 1 times [2022-01-09 23:26:12,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:12,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540650694] [2022-01-09 23:26:12,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:12,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-09 23:26:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-09 23:26:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:13,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:13,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540650694] [2022-01-09 23:26:13,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540650694] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:13,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:13,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-09 23:26:13,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138937152] [2022-01-09 23:26:13,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:13,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-09 23:26:13,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:13,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-09 23:26:13,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:26:13,041 INFO L87 Difference]: Start difference. First operand 571 states and 719 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-09 23:26:13,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:13,299 INFO L93 Difference]: Finished difference Result 602 states and 751 transitions. [2022-01-09 23:26:13,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-09 23:26:13,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2022-01-09 23:26:13,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:13,300 INFO L225 Difference]: With dead ends: 602 [2022-01-09 23:26:13,300 INFO L226 Difference]: Without dead ends: 565 [2022-01-09 23:26:13,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-09 23:26:13,301 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 170 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:13,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 1809 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:26:13,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-01-09 23:26:13,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2022-01-09 23:26:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 480 states have (on average 1.2583333333333333) internal successors, (604), 487 states have internal predecessors, (604), 49 states have call successors, (49), 28 states have call predecessors, (49), 35 states have return successors, (58), 49 states have call predecessors, (58), 44 states have call successors, (58) [2022-01-09 23:26:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 711 transitions. [2022-01-09 23:26:13,345 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 711 transitions. Word has length 56 [2022-01-09 23:26:13,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:13,345 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 711 transitions. [2022-01-09 23:26:13,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-09 23:26:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 711 transitions. [2022-01-09 23:26:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-09 23:26:13,346 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:13,346 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:13,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-09 23:26:13,346 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:13,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:13,347 INFO L85 PathProgramCache]: Analyzing trace with hash -929165957, now seen corresponding path program 1 times [2022-01-09 23:26:13,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:13,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980438011] [2022-01-09 23:26:13,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:13,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-09 23:26:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:13,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:13,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980438011] [2022-01-09 23:26:13,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980438011] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:13,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:13,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-09 23:26:13,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367557281] [2022-01-09 23:26:13,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:13,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-09 23:26:13,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:13,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-09 23:26:13,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-01-09 23:26:13,437 INFO L87 Difference]: Start difference. First operand 565 states and 711 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:14,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:14,130 INFO L93 Difference]: Finished difference Result 722 states and 895 transitions. [2022-01-09 23:26:14,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-09 23:26:14,131 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2022-01-09 23:26:14,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:14,132 INFO L225 Difference]: With dead ends: 722 [2022-01-09 23:26:14,132 INFO L226 Difference]: Without dead ends: 604 [2022-01-09 23:26:14,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-01-09 23:26:14,133 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 217 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 2711 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:14,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 2711 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-09 23:26:14,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-01-09 23:26:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 571. [2022-01-09 23:26:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 486 states have (on average 1.2469135802469136) internal successors, (606), 493 states have internal predecessors, (606), 49 states have call successors, (49), 28 states have call predecessors, (49), 35 states have return successors, (58), 49 states have call predecessors, (58), 44 states have call successors, (58) [2022-01-09 23:26:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 713 transitions. [2022-01-09 23:26:14,169 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 713 transitions. Word has length 56 [2022-01-09 23:26:14,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:14,169 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 713 transitions. [2022-01-09 23:26:14,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 713 transitions. [2022-01-09 23:26:14,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-09 23:26:14,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:14,170 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:14,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-01-09 23:26:14,170 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:14,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:14,170 INFO L85 PathProgramCache]: Analyzing trace with hash -535968494, now seen corresponding path program 1 times [2022-01-09 23:26:14,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:14,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541614759] [2022-01-09 23:26:14,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:14,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:26:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-09 23:26:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-09 23:26:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:14,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:14,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541614759] [2022-01-09 23:26:14,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541614759] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:14,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:14,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-09 23:26:14,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681827236] [2022-01-09 23:26:14,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:14,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-09 23:26:14,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:14,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-09 23:26:14,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-09 23:26:14,264 INFO L87 Difference]: Start difference. First operand 571 states and 713 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-09 23:26:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:14,905 INFO L93 Difference]: Finished difference Result 591 states and 734 transitions. [2022-01-09 23:26:14,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-09 23:26:14,906 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 62 [2022-01-09 23:26:14,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:14,907 INFO L225 Difference]: With dead ends: 591 [2022-01-09 23:26:14,907 INFO L226 Difference]: Without dead ends: 569 [2022-01-09 23:26:14,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-01-09 23:26:14,908 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 235 mSDsluCounter, 2703 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 3067 SdHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:14,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 3067 Invalid, 1412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-09 23:26:14,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-01-09 23:26:14,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2022-01-09 23:26:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 484 states have (on average 1.2458677685950412) internal successors, (603), 491 states have internal predecessors, (603), 49 states have call successors, (49), 28 states have call predecessors, (49), 35 states have return successors, (58), 49 states have call predecessors, (58), 44 states have call successors, (58) [2022-01-09 23:26:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 710 transitions. [2022-01-09 23:26:14,939 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 710 transitions. Word has length 62 [2022-01-09 23:26:14,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:14,940 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 710 transitions. [2022-01-09 23:26:14,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-09 23:26:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 710 transitions. [2022-01-09 23:26:14,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-09 23:26:14,941 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:14,941 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:14,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-01-09 23:26:14,941 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:14,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:14,941 INFO L85 PathProgramCache]: Analyzing trace with hash -274878733, now seen corresponding path program 1 times [2022-01-09 23:26:14,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:14,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127678451] [2022-01-09 23:26:14,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:14,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:26:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-09 23:26:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-09 23:26:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:14,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:14,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127678451] [2022-01-09 23:26:14,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127678451] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:14,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:14,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-09 23:26:14,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031388184] [2022-01-09 23:26:14,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:14,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-09 23:26:14,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:14,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-09 23:26:14,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:26:14,989 INFO L87 Difference]: Start difference. First operand 569 states and 710 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-09 23:26:15,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:15,372 INFO L93 Difference]: Finished difference Result 600 states and 742 transitions. [2022-01-09 23:26:15,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-09 23:26:15,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 63 [2022-01-09 23:26:15,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:15,373 INFO L225 Difference]: With dead ends: 600 [2022-01-09 23:26:15,373 INFO L226 Difference]: Without dead ends: 553 [2022-01-09 23:26:15,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-09 23:26:15,374 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 170 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:15,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 1672 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:26:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-01-09 23:26:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2022-01-09 23:26:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 471 states have (on average 1.2420382165605095) internal successors, (585), 478 states have internal predecessors, (585), 46 states have call successors, (46), 28 states have call predecessors, (46), 35 states have return successors, (54), 46 states have call predecessors, (54), 41 states have call successors, (54) [2022-01-09 23:26:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 685 transitions. [2022-01-09 23:26:15,405 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 685 transitions. Word has length 63 [2022-01-09 23:26:15,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:15,405 INFO L470 AbstractCegarLoop]: Abstraction has 553 states and 685 transitions. [2022-01-09 23:26:15,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-09 23:26:15,405 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 685 transitions. [2022-01-09 23:26:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-09 23:26:15,406 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:15,406 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:15,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-01-09 23:26:15,406 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:15,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:15,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1927582732, now seen corresponding path program 1 times [2022-01-09 23:26:15,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:15,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166906793] [2022-01-09 23:26:15,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:15,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-09 23:26:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-09 23:26:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:15,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:15,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166906793] [2022-01-09 23:26:15,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166906793] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:15,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:15,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-09 23:26:15,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226696471] [2022-01-09 23:26:15,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:15,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-09 23:26:15,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:15,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-09 23:26:15,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:26:15,451 INFO L87 Difference]: Start difference. First operand 553 states and 685 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-09 23:26:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:15,745 INFO L93 Difference]: Finished difference Result 584 states and 717 transitions. [2022-01-09 23:26:15,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-09 23:26:15,745 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-01-09 23:26:15,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:15,746 INFO L225 Difference]: With dead ends: 584 [2022-01-09 23:26:15,746 INFO L226 Difference]: Without dead ends: 540 [2022-01-09 23:26:15,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-09 23:26:15,747 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 264 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:15,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 1241 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:26:15,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-01-09 23:26:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2022-01-09 23:26:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 459 states have (on average 1.2374727668845316) internal successors, (568), 466 states have internal predecessors, (568), 45 states have call successors, (45), 28 states have call predecessors, (45), 35 states have return successors, (53), 45 states have call predecessors, (53), 40 states have call successors, (53) [2022-01-09 23:26:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 666 transitions. [2022-01-09 23:26:15,782 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 666 transitions. Word has length 58 [2022-01-09 23:26:15,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:15,782 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 666 transitions. [2022-01-09 23:26:15,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-09 23:26:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 666 transitions. [2022-01-09 23:26:15,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-09 23:26:15,783 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:15,783 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:15,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-01-09 23:26:15,784 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:15,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:15,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1948179698, now seen corresponding path program 1 times [2022-01-09 23:26:15,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:15,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424304470] [2022-01-09 23:26:15,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:15,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-09 23:26:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-09 23:26:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:15,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:15,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424304470] [2022-01-09 23:26:15,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424304470] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:15,916 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:15,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-09 23:26:15,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922465623] [2022-01-09 23:26:15,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:15,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-09 23:26:15,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:15,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-09 23:26:15,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-01-09 23:26:15,917 INFO L87 Difference]: Start difference. First operand 540 states and 666 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-09 23:26:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:16,413 INFO L93 Difference]: Finished difference Result 556 states and 682 transitions. [2022-01-09 23:26:16,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-09 23:26:16,415 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2022-01-09 23:26:16,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:16,417 INFO L225 Difference]: With dead ends: 556 [2022-01-09 23:26:16,417 INFO L226 Difference]: Without dead ends: 535 [2022-01-09 23:26:16,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-01-09 23:26:16,417 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 207 mSDsluCounter, 2323 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:16,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 2652 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-09 23:26:16,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-01-09 23:26:16,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2022-01-09 23:26:16,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 456 states have (on average 1.236842105263158) internal successors, (564), 463 states have internal predecessors, (564), 43 states have call successors, (43), 28 states have call predecessors, (43), 35 states have return successors, (51), 43 states have call predecessors, (51), 38 states have call successors, (51) [2022-01-09 23:26:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 658 transitions. [2022-01-09 23:26:16,460 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 658 transitions. Word has length 64 [2022-01-09 23:26:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:16,460 INFO L470 AbstractCegarLoop]: Abstraction has 535 states and 658 transitions. [2022-01-09 23:26:16,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-09 23:26:16,460 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 658 transitions. [2022-01-09 23:26:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-09 23:26:16,461 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:16,461 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:16,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-01-09 23:26:16,461 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:16,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:16,461 INFO L85 PathProgramCache]: Analyzing trace with hash 233509778, now seen corresponding path program 1 times [2022-01-09 23:26:16,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:16,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097942301] [2022-01-09 23:26:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:16,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:16,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-09 23:26:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:16,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:16,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:16,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097942301] [2022-01-09 23:26:16,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097942301] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:16,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:16,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-09 23:26:16,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255632654] [2022-01-09 23:26:16,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:16,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-09 23:26:16,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:16,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-09 23:26:16,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-01-09 23:26:16,607 INFO L87 Difference]: Start difference. First operand 535 states and 658 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:17,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:17,033 INFO L93 Difference]: Finished difference Result 537 states and 659 transitions. [2022-01-09 23:26:17,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-09 23:26:17,034 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2022-01-09 23:26:17,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:17,035 INFO L225 Difference]: With dead ends: 537 [2022-01-09 23:26:17,035 INFO L226 Difference]: Without dead ends: 493 [2022-01-09 23:26:17,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-01-09 23:26:17,036 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 115 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:17,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 2522 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-09 23:26:17,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-01-09 23:26:17,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2022-01-09 23:26:17,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 419 states have (on average 1.2458233890214798) internal successors, (522), 425 states have internal predecessors, (522), 40 states have call successors, (40), 26 states have call predecessors, (40), 33 states have return successors, (49), 41 states have call predecessors, (49), 36 states have call successors, (49) [2022-01-09 23:26:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 611 transitions. [2022-01-09 23:26:17,064 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 611 transitions. Word has length 57 [2022-01-09 23:26:17,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:17,064 INFO L470 AbstractCegarLoop]: Abstraction has 493 states and 611 transitions. [2022-01-09 23:26:17,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 611 transitions. [2022-01-09 23:26:17,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-09 23:26:17,065 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:17,065 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:17,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-01-09 23:26:17,066 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:17,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:17,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1034079897, now seen corresponding path program 1 times [2022-01-09 23:26:17,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:17,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896478770] [2022-01-09 23:26:17,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:17,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:17,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-09 23:26:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:17,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:17,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-09 23:26:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:17,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:17,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896478770] [2022-01-09 23:26:17,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896478770] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:17,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:17,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-09 23:26:17,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830042381] [2022-01-09 23:26:17,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:17,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-09 23:26:17,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:17,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-09 23:26:17,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-01-09 23:26:17,191 INFO L87 Difference]: Start difference. First operand 493 states and 611 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-09 23:26:18,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:18,115 INFO L93 Difference]: Finished difference Result 1028 states and 1263 transitions. [2022-01-09 23:26:18,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-09 23:26:18,116 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2022-01-09 23:26:18,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:18,118 INFO L225 Difference]: With dead ends: 1028 [2022-01-09 23:26:18,118 INFO L226 Difference]: Without dead ends: 908 [2022-01-09 23:26:18,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=1287, Unknown=0, NotChecked=0, Total=1560 [2022-01-09 23:26:18,119 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 686 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:18,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [702 Valid, 2237 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-09 23:26:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2022-01-09 23:26:18,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 717. [2022-01-09 23:26:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 604 states have (on average 1.2450331125827814) internal successors, (752), 616 states have internal predecessors, (752), 59 states have call successors, (59), 42 states have call predecessors, (59), 53 states have return successors, (75), 58 states have call predecessors, (75), 55 states have call successors, (75) [2022-01-09 23:26:18,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 886 transitions. [2022-01-09 23:26:18,188 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 886 transitions. Word has length 58 [2022-01-09 23:26:18,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:18,188 INFO L470 AbstractCegarLoop]: Abstraction has 717 states and 886 transitions. [2022-01-09 23:26:18,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-09 23:26:18,189 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 886 transitions. [2022-01-09 23:26:18,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-09 23:26:18,189 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:18,190 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:18,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-01-09 23:26:18,190 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:18,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:18,190 INFO L85 PathProgramCache]: Analyzing trace with hash -158060891, now seen corresponding path program 1 times [2022-01-09 23:26:18,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:18,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452265316] [2022-01-09 23:26:18,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:18,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:18,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-09 23:26:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:18,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:18,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-09 23:26:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:18,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:18,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:18,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452265316] [2022-01-09 23:26:18,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452265316] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:18,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:18,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-09 23:26:18,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873850542] [2022-01-09 23:26:18,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:18,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-09 23:26:18,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:18,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-09 23:26:18,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-09 23:26:18,229 INFO L87 Difference]: Start difference. First operand 717 states and 886 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-09 23:26:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:18,621 INFO L93 Difference]: Finished difference Result 1014 states and 1243 transitions. [2022-01-09 23:26:18,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-09 23:26:18,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2022-01-09 23:26:18,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:18,623 INFO L225 Difference]: With dead ends: 1014 [2022-01-09 23:26:18,623 INFO L226 Difference]: Without dead ends: 905 [2022-01-09 23:26:18,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-01-09 23:26:18,624 INFO L933 BasicCegarLoop]: 557 mSDtfsCounter, 789 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:18,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [815 Valid, 1876 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:26:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2022-01-09 23:26:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 537. [2022-01-09 23:26:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 458 states have (on average 1.2314410480349345) internal successors, (564), 464 states have internal predecessors, (564), 42 states have call successors, (42), 30 states have call predecessors, (42), 36 states have return successors, (51), 42 states have call predecessors, (51), 38 states have call successors, (51) [2022-01-09 23:26:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 657 transitions. [2022-01-09 23:26:18,664 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 657 transitions. Word has length 58 [2022-01-09 23:26:18,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:18,664 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 657 transitions. [2022-01-09 23:26:18,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-09 23:26:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 657 transitions. [2022-01-09 23:26:18,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-09 23:26:18,665 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:18,665 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:18,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-01-09 23:26:18,665 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:18,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:18,665 INFO L85 PathProgramCache]: Analyzing trace with hash 273629316, now seen corresponding path program 1 times [2022-01-09 23:26:18,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:18,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961808203] [2022-01-09 23:26:18,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:18,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:18,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-09 23:26:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:18,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-09 23:26:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:18,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-09 23:26:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:18,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:18,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:18,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961808203] [2022-01-09 23:26:18,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961808203] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:18,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:18,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-09 23:26:18,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454813383] [2022-01-09 23:26:18,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:18,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-09 23:26:18,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:18,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-09 23:26:18,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-09 23:26:18,772 INFO L87 Difference]: Start difference. First operand 537 states and 657 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-09 23:26:19,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:19,272 INFO L93 Difference]: Finished difference Result 554 states and 674 transitions. [2022-01-09 23:26:19,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-09 23:26:19,273 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2022-01-09 23:26:19,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:19,274 INFO L225 Difference]: With dead ends: 554 [2022-01-09 23:26:19,274 INFO L226 Difference]: Without dead ends: 504 [2022-01-09 23:26:19,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-01-09 23:26:19,274 INFO L933 BasicCegarLoop]: 296 mSDtfsCounter, 218 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:19,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 2383 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-09 23:26:19,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-01-09 23:26:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2022-01-09 23:26:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 432 states have (on average 1.2222222222222223) internal successors, (528), 438 states have internal predecessors, (528), 37 states have call successors, (37), 28 states have call predecessors, (37), 34 states have return successors, (45), 37 states have call predecessors, (45), 33 states have call successors, (45) [2022-01-09 23:26:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 610 transitions. [2022-01-09 23:26:19,346 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 610 transitions. Word has length 60 [2022-01-09 23:26:19,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:19,346 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 610 transitions. [2022-01-09 23:26:19,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-09 23:26:19,347 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 610 transitions. [2022-01-09 23:26:19,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-09 23:26:19,347 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:19,347 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:19,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-01-09 23:26:19,347 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:19,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:19,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1406802114, now seen corresponding path program 1 times [2022-01-09 23:26:19,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:19,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925085668] [2022-01-09 23:26:19,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:19,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:19,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-09 23:26:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:19,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-09 23:26:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:19,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:19,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925085668] [2022-01-09 23:26:19,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925085668] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:19,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:19,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-09 23:26:19,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045405909] [2022-01-09 23:26:19,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:19,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-09 23:26:19,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:19,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-09 23:26:19,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-09 23:26:19,389 INFO L87 Difference]: Start difference. First operand 504 states and 610 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:19,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:19,584 INFO L93 Difference]: Finished difference Result 531 states and 638 transitions. [2022-01-09 23:26:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:26:19,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2022-01-09 23:26:19,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:19,585 INFO L225 Difference]: With dead ends: 531 [2022-01-09 23:26:19,585 INFO L226 Difference]: Without dead ends: 494 [2022-01-09 23:26:19,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:26:19,586 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 67 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:19,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 1141 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:26:19,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2022-01-09 23:26:19,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2022-01-09 23:26:19,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 423 states have (on average 1.2222222222222223) internal successors, (517), 429 states have internal predecessors, (517), 36 states have call successors, (36), 28 states have call predecessors, (36), 34 states have return successors, (43), 36 states have call predecessors, (43), 32 states have call successors, (43) [2022-01-09 23:26:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 596 transitions. [2022-01-09 23:26:19,621 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 596 transitions. Word has length 58 [2022-01-09 23:26:19,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:19,621 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 596 transitions. [2022-01-09 23:26:19,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-09 23:26:19,621 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 596 transitions. [2022-01-09 23:26:19,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-09 23:26:19,622 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:19,622 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:19,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-01-09 23:26:19,622 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:19,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:19,623 INFO L85 PathProgramCache]: Analyzing trace with hash 472047151, now seen corresponding path program 1 times [2022-01-09 23:26:19,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:19,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781939725] [2022-01-09 23:26:19,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:19,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-09 23:26:19,634 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-09 23:26:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-09 23:26:19,673 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-09 23:26:19,673 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-09 23:26:19,674 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-09 23:26:19,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-01-09 23:26:19,677 INFO L732 BasicCegarLoop]: Path program 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] [2022-01-09 23:26:19,679 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-09 23:26:19,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:26:19 BoogieIcfgContainer [2022-01-09 23:26:19,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-09 23:26:19,758 INFO L158 Benchmark]: Toolchain (without parser) took 35781.96ms. Allocated memory was 192.9MB in the beginning and 487.6MB in the end (delta: 294.6MB). Free memory was 134.6MB in the beginning and 302.4MB in the end (delta: -167.7MB). Peak memory consumption was 127.7MB. Max. memory is 8.0GB. [2022-01-09 23:26:19,758 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 192.9MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-09 23:26:19,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.18ms. Allocated memory is still 192.9MB. Free memory was 134.4MB in the beginning and 145.7MB in the end (delta: -11.3MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. [2022-01-09 23:26:19,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.65ms. Allocated memory is still 192.9MB. Free memory was 145.7MB in the beginning and 138.7MB in the end (delta: 7.0MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-01-09 23:26:19,758 INFO L158 Benchmark]: Boogie Preprocessor took 74.15ms. Allocated memory is still 192.9MB. Free memory was 138.7MB in the beginning and 133.6MB in the end (delta: 5.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-09 23:26:19,758 INFO L158 Benchmark]: RCFGBuilder took 941.06ms. Allocated memory is still 192.9MB. Free memory was 133.6MB in the beginning and 59.2MB in the end (delta: 74.4MB). Peak memory consumption was 74.4MB. Max. memory is 8.0GB. [2022-01-09 23:26:19,758 INFO L158 Benchmark]: TraceAbstraction took 34270.73ms. Allocated memory was 192.9MB in the beginning and 487.6MB in the end (delta: 294.6MB). Free memory was 58.7MB in the beginning and 302.4MB in the end (delta: -243.7MB). Peak memory consumption was 52.0MB. Max. memory is 8.0GB. [2022-01-09 23:26:19,760 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.08ms. Allocated memory is still 192.9MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 416.18ms. Allocated memory is still 192.9MB. Free memory was 134.4MB in the beginning and 145.7MB in the end (delta: -11.3MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.65ms. Allocated memory is still 192.9MB. Free memory was 145.7MB in the beginning and 138.7MB in the end (delta: 7.0MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 74.15ms. Allocated memory is still 192.9MB. Free memory was 138.7MB in the beginning and 133.6MB in the end (delta: 5.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 941.06ms. Allocated memory is still 192.9MB. Free memory was 133.6MB in the beginning and 59.2MB in the end (delta: 74.4MB). Peak memory consumption was 74.4MB. Max. memory is 8.0GB. * TraceAbstraction took 34270.73ms. Allocated memory was 192.9MB in the beginning and 487.6MB in the end (delta: 294.6MB). Free memory was 58.7MB in the beginning and 302.4MB in the end (delta: -243.7MB). Peak memory consumption was 52.0MB. 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 - CounterExampleResult [Line: 59]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int s ; [L33] int UNLOADED ; [L34] int NP ; [L35] int DC ; [L36] int SKIP1 ; [L37] int SKIP2 ; [L38] int MPR1 ; [L39] int MPR3 ; [L40] int IPC ; [L41] int pended ; [L42] int compFptr ; [L43] int compRegistered ; [L44] int lowerDriverReturn ; [L45] int setEventCalled ; [L46] int customIrp ; [L47] int routine ; [L48] int myStatus ; [L49] int pirp ; [L50] int Executive ; [L51] int Suspended ; [L52] int KernelMode ; [L53] int DeviceUsageTypePaging ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L1718] int pirp__IoStatus__Status ; [L1719] int d = __VERIFIER_nondet_int() ; [L1720] int status = __VERIFIER_nondet_int() ; [L1721] int irp = __VERIFIER_nondet_int() ; [L1722] int we_should_unload = __VERIFIER_nondet_int() ; [L1723] int irp_choice = __VERIFIER_nondet_int() ; [L1724] int devobj = __VERIFIER_nondet_int() ; [L1725] int __cil_tmp9 ; [L1730] s = 0 [L1731] UNLOADED = 0 [L1732] NP = 0 [L1733] DC = 0 [L1734] SKIP1 = 0 [L1735] SKIP2 = 0 [L1736] MPR1 = 0 [L1737] MPR3 = 0 [L1738] IPC = 0 [L1739] pended = 0 [L1740] compFptr = 0 [L1741] compRegistered = 0 [L1742] lowerDriverReturn = 0 [L1743] setEventCalled = 0 [L1744] customIrp = 0 [L1745] routine = 0 [L1746] myStatus = 0 [L1747] pirp = 0 [L1748] Executive = 0 [L1749] Suspended = 5 [L1750] KernelMode = 0 [L1751] DeviceUsageTypePaging = 1 [L1754] pirp = irp [L1755] CALL _BLAST_init() [L67] UNLOADED = 0 [L68] NP = 1 [L69] DC = 2 [L70] SKIP1 = 3 [L71] SKIP2 = 4 [L72] MPR1 = 5 [L73] MPR3 = 6 [L74] IPC = 7 [L75] s = UNLOADED [L76] pended = 0 [L77] compFptr = 0 [L78] compRegistered = 0 [L79] lowerDriverReturn = 0 [L80] setEventCalled = 0 [L81] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1755] RET _BLAST_init() [L1757] COND TRUE status >= 0 [L1758] s = NP [L1759] customIrp = 0 [L1760] setEventCalled = customIrp [L1761] lowerDriverReturn = setEventCalled [L1762] compRegistered = lowerDriverReturn [L1763] compFptr = compRegistered [L1764] pended = compFptr [L1765] pirp__IoStatus__Status = 0 [L1766] myStatus = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1767] COND TRUE irp_choice == 0 [L1768] pirp__IoStatus__Status = -1073741637 [L1769] myStatus = -1073741637 VAL [compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1772] CALL stub_driver_init() [L1707] s = NP [L1708] customIrp = 0 [L1709] setEventCalled = customIrp [L1710] lowerDriverReturn = setEventCalled [L1711] compRegistered = lowerDriverReturn [L1712] compFptr = compRegistered [L1713] pended = compFptr VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1772] RET stub_driver_init() [L1775] COND FALSE !(status < 0) [L1779] int tmp_ndt_1; [L1780] tmp_ndt_1 = __VERIFIER_nondet_int() [L1781] COND TRUE tmp_ndt_1 == 2 VAL [compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1798] CALL, EXPR CdAudioDeviceControl(devobj, pirp) [L313] int deviceExtension__Active = __VERIFIER_nondet_int() ; [L314] int status ; VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L317] COND FALSE !(deviceExtension__Active == 2) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L320] COND FALSE !(deviceExtension__Active == 3) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L323] COND FALSE !(deviceExtension__Active == 1) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L326] COND TRUE deviceExtension__Active == 7 VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L348] CALL, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L1591] int currentIrpStack__Parameters__DeviceIoControl__IoControlCode = __VERIFIER_nondet_int() ; [L1592] int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ; [L1593] int irpSp__Control ; [L1594] int tmp ; [L1595] int tmp___0 ; [L1596] int __cil_tmp8 ; [L1597] int __cil_tmp9 ; [L1598] int __cil_tmp10 ; [L1599] int __cil_tmp11 ; [L1600] int __cil_tmp12 ; [L1604] __cil_tmp8 = 56 [L1605] __cil_tmp9 = 16384 [L1606] __cil_tmp10 = 131072 [L1607] __cil_tmp11 = 147456 [L1608] __cil_tmp12 = 147512 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1609] COND TRUE currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp12 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1610] COND FALSE !(s != NP) VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1615] COND FALSE !(compRegistered != 0) [L1620] compRegistered = 1 [L1621] routine = 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] irpSp__Control = 224 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1626] CALL, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1900] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1901] int returnVal2 ; [L1902] int compRetStatus ; [L1903] int lcontext = __VERIFIER_nondet_int() ; [L1904] unsigned long __cil_tmp8 ; VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1907] COND TRUE \read(compRegistered) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1908] COND TRUE routine == 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] CALL, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1569] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1570] int Irp__AssociatedIrp__SystemBuffer = __VERIFIER_nondet_int() ; [L1573] COND TRUE \read(Irp__PendingReturned) VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, Context=-1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1574] COND TRUE pended == 0 [L1575] pended = 1 VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, Context=-1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1582] COND FALSE !(myStatus >= 0) VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, Context=-1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1587] return (myStatus); VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \result=-1073741637, compFptr=0, compRegistered=1, Context=-1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] RET, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, HPCdrCompletion(DeviceObject, Irp, lcontext)=-1073741637, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] compRetStatus = HPCdrCompletion(DeviceObject, Irp, lcontext) [L1920] __cil_tmp8 = (unsigned long )compRetStatus VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=18446744072635809979, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1921] COND FALSE !(__cil_tmp8 == -1073741802) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=18446744072635809979, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1928] COND FALSE !(\read(Irp__PendingReturned)) [L1931] int tmp_ndt_4; [L1932] tmp_ndt_4 = __VERIFIER_nondet_int() [L1933] COND TRUE tmp_ndt_4 == 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=18446744072635809979, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1944] returnVal2 = 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=18446744072635809979, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1958] COND TRUE s == NP [L1959] s = IPC [L1960] lowerDriverReturn = returnVal2 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=18446744072635809979, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1981] return (returnVal2); VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \result=0, __cil_tmp8=18446744072635809979, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1626] RET, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IofCallDriver(deviceExtension__TargetDeviceObject, Irp)=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1626] tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp) [L1628] return (tmp); VAL [\old(DeviceObject)=0, \old(Irp)=0, \result=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp=0, UNLOADED=0] [L348] RET, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L348] status = CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L363] return (status); VAL [\old(DeviceObject)=0, \old(Irp)=0, \result=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0] [L1798] RET, EXPR CdAudioDeviceControl(devobj, pirp) [L1798] status = CdAudioDeviceControl(devobj, pirp) [L1819] COND FALSE !(\read(we_should_unload)) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1825] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1826] COND FALSE !(s == NP) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1833] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1834] COND FALSE !(s == MPR3) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1841] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1842] COND TRUE status != -1 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1843] COND TRUE s != SKIP2 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1844] COND FALSE !(s != IPC) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1857] COND FALSE !(pended != 1) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1869] COND TRUE status != 259 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1871] CALL errorFn() VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L59] reach_error() VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 470 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.1s, OverallIterations: 68, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 25.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21658 SdHoareTripleChecker+Valid, 20.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21332 mSDsluCounter, 160543 SdHoareTripleChecker+Invalid, 16.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125393 mSDsCounter, 5722 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41678 IncrementalHoareTripleChecker+Invalid, 47400 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5722 mSolverCounterUnsat, 35150 mSDtfsCounter, 41678 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1098 GetRequests, 424 SyntacticMatches, 10 SemanticMatches, 664 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=821occurred in iteration=4, InterpolantAutomatonStates: 598, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 67 MinimizatonAttempts, 2265 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 3221 NumberOfCodeBlocks, 3221 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 3158 ConstructedInterpolants, 0 QuantifiedInterpolants, 8979 SizeOfPredicates, 4 NumberOfNonLiveVariables, 471 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 69 InterpolantComputations, 67 PerfectInterpolantSequences, 12/15 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 RESULT: Ultimate proved your program to be incorrect! [2022-01-09 23:26:19,781 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...