/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 16:15:26,037 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 16:15:26,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 16:15:26,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 16:15:26,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 16:15:26,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 16:15:26,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 16:15:26,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 16:15:26,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 16:15:26,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 16:15:26,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 16:15:26,084 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 16:15:26,084 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 16:15:26,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 16:15:26,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 16:15:26,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 16:15:26,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 16:15:26,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 16:15:26,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 16:15:26,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 16:15:26,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 16:15:26,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 16:15:26,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 16:15:26,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 16:15:26,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 16:15:26,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 16:15:26,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 16:15:26,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 16:15:26,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 16:15:26,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 16:15:26,122 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 16:15:26,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 16:15:26,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 16:15:26,124 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 16:15:26,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 16:15:26,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 16:15:26,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 16:15:26,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 16:15:26,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 16:15:26,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 16:15:26,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 16:15:26,129 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 16:15:26,143 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 16:15:26,144 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 16:15:26,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 16:15:26,145 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 16:15:26,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 16:15:26,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 16:15:26,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 16:15:26,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 16:15:26,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 16:15:26,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 16:15:26,146 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 16:15:26,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 16:15:26,146 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 16:15:26,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 16:15:26,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 16:15:26,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 16:15:26,147 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 16:15:26,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 16:15:26,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 16:15:26,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 16:15:26,147 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 16:15:26,148 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 16:15:26,148 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 16:15:26,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 16:15:26,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 16:15:26,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 16:15:26,346 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 16:15:26,347 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 16:15:26,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-01-31 16:15:26,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3699c794/e8e6e26e021d4cf48dcaf8636cd13cb1/FLAGbf79aa0cd [2022-01-31 16:15:26,748 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 16:15:26,748 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-01-31 16:15:26,766 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3699c794/e8e6e26e021d4cf48dcaf8636cd13cb1/FLAGbf79aa0cd [2022-01-31 16:15:27,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3699c794/e8e6e26e021d4cf48dcaf8636cd13cb1 [2022-01-31 16:15:27,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 16:15:27,140 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 16:15:27,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 16:15:27,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 16:15:27,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 16:15:27,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:15:27" (1/1) ... [2022-01-31 16:15:27,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c9022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:27, skipping insertion in model container [2022-01-31 16:15:27,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:15:27" (1/1) ... [2022-01-31 16:15:27,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 16:15:27,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 16:15:27,462 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/floppy_simpl4.cil-2.c[48585,48598] [2022-01-31 16:15:27,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 16:15:27,470 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 16:15:27,539 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/floppy_simpl4.cil-2.c[48585,48598] [2022-01-31 16:15:27,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 16:15:27,551 INFO L208 MainTranslator]: Completed translation [2022-01-31 16:15:27,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:27 WrapperNode [2022-01-31 16:15:27,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 16:15:27,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 16:15:27,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 16:15:27,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 16:15:27,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:27" (1/1) ... [2022-01-31 16:15:27,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:27" (1/1) ... [2022-01-31 16:15:27,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:27" (1/1) ... [2022-01-31 16:15:27,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:27" (1/1) ... [2022-01-31 16:15:27,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:27" (1/1) ... [2022-01-31 16:15:27,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:27" (1/1) ... [2022-01-31 16:15:27,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:27" (1/1) ... [2022-01-31 16:15:27,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 16:15:27,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 16:15:27,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 16:15:27,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 16:15:27,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:27" (1/1) ... [2022-01-31 16:15:27,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 16:15:27,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:15:27,668 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-31 16:15:27,670 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-31 16:15:27,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 16:15:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 16:15:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 16:15:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-01-31 16:15:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2022-01-31 16:15:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2022-01-31 16:15:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2022-01-31 16:15:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2022-01-31 16:15:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2022-01-31 16:15:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2022-01-31 16:15:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2022-01-31 16:15:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-01-31 16:15:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 16:15:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-01-31 16:15:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-01-31 16:15:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-01-31 16:15:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-01-31 16:15:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-01-31 16:15:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-01-31 16:15:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-01-31 16:15:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-01-31 16:15:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-01-31 16:15:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-01-31 16:15:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-01-31 16:15:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-01-31 16:15:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-01-31 16:15:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2022-01-31 16:15:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2022-01-31 16:15:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2022-01-31 16:15:27,693 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2022-01-31 16:15:27,693 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-01-31 16:15:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 16:15:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 16:15:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 16:15:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 16:15:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-01-31 16:15:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 16:15:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-01-31 16:15:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2022-01-31 16:15:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2022-01-31 16:15:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2022-01-31 16:15:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2022-01-31 16:15:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2022-01-31 16:15:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2022-01-31 16:15:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-01-31 16:15:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-01-31 16:15:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-01-31 16:15:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-01-31 16:15:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-01-31 16:15:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-01-31 16:15:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-01-31 16:15:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-01-31 16:15:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-01-31 16:15:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-01-31 16:15:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-01-31 16:15:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2022-01-31 16:15:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2022-01-31 16:15:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2022-01-31 16:15:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2022-01-31 16:15:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-01-31 16:15:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-01-31 16:15:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-01-31 16:15:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2022-01-31 16:15:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-01-31 16:15:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 16:15:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-01-31 16:15:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 16:15:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 16:15:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 16:15:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 16:15:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 16:15:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 16:15:27,879 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 16:15:27,880 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 16:15:27,895 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:27,922 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 16:15:27,922 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 16:15:27,930 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:27,936 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 16:15:27,936 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 16:15:27,939 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:28,079 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-01-31 16:15:28,079 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-01-31 16:15:28,083 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:28,127 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2022-01-31 16:15:28,128 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2022-01-31 16:15:28,136 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:28,145 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-01-31 16:15:28,145 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-01-31 16:15:28,187 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:28,192 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 16:15:28,192 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 16:15:28,192 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:28,196 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 16:15:28,196 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 16:15:28,197 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:28,203 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 16:15:28,203 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 16:15:28,229 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:28,249 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-01-31 16:15:28,250 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-01-31 16:15:28,253 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:28,362 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-01-31 16:15:28,362 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-01-31 16:15:28,396 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:28,399 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 16:15:28,399 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 16:15:28,399 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:28,408 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 16:15:28,409 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 16:15:28,410 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:28,414 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 16:15:28,414 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 16:15:28,421 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 16:15:28,435 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 16:15:28,435 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 16:15:28,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:15:28 BoogieIcfgContainer [2022-01-31 16:15:28,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 16:15:28,439 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 16:15:28,439 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 16:15:28,440 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 16:15:28,442 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:15:28" (1/1) ... [2022-01-31 16:15:28,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 04:15:28 BasicIcfg [2022-01-31 16:15:28,488 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 16:15:28,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 16:15:28,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 16:15:28,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 16:15:28,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:15:27" (1/4) ... [2022-01-31 16:15:28,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3c2818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:15:28, skipping insertion in model container [2022-01-31 16:15:28,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:27" (2/4) ... [2022-01-31 16:15:28,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3c2818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:15:28, skipping insertion in model container [2022-01-31 16:15:28,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:15:28" (3/4) ... [2022-01-31 16:15:28,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3c2818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:15:28, skipping insertion in model container [2022-01-31 16:15:28,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 04:15:28" (4/4) ... [2022-01-31 16:15:28,495 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.cJordan [2022-01-31 16:15:28,499 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 16:15:28,499 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 16:15:28,558 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 16:15:28,566 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 16:15:28,566 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 16:15:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 389 states, 288 states have (on average 1.46875) internal successors, (423), 314 states have internal predecessors, (423), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71) [2022-01-31 16:15:28,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 16:15:28,608 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:28,609 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] [2022-01-31 16:15:28,609 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:28,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:28,613 INFO L85 PathProgramCache]: Analyzing trace with hash 871879161, now seen corresponding path program 1 times [2022-01-31 16:15:28,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:28,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046697552] [2022-01-31 16:15:28,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:28,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:28,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:28,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:28,990 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-31 16:15:28,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:28,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046697552] [2022-01-31 16:15:28,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046697552] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:28,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:28,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:15:28,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870687383] [2022-01-31 16:15:28,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:28,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:15:28,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:29,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:15:29,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:15:29,027 INFO L87 Difference]: Start difference. First operand has 389 states, 288 states have (on average 1.46875) internal successors, (423), 314 states have internal predecessors, (423), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 16:15:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:29,964 INFO L93 Difference]: Finished difference Result 430 states and 602 transitions. [2022-01-31 16:15:29,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:15:29,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-01-31 16:15:29,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:29,975 INFO L225 Difference]: With dead ends: 430 [2022-01-31 16:15:29,976 INFO L226 Difference]: Without dead ends: 422 [2022-01-31 16:15:29,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:15:29,979 INFO L933 BasicCegarLoop]: 496 mSDtfsCounter, 408 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:29,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 735 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:15:30,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-01-31 16:15:30,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2022-01-31 16:15:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 282 states have (on average 1.429078014184397) internal successors, (403), 306 states have internal predecessors, (403), 71 states have call successors, (71), 28 states have call predecessors, (71), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-01-31 16:15:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2022-01-31 16:15:30,049 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2022-01-31 16:15:30,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:30,049 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2022-01-31 16:15:30,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 16:15:30,050 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2022-01-31 16:15:30,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 16:15:30,051 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:30,051 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] [2022-01-31 16:15:30,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 16:15:30,051 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:30,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:30,052 INFO L85 PathProgramCache]: Analyzing trace with hash 291212257, now seen corresponding path program 1 times [2022-01-31 16:15:30,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:30,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548130301] [2022-01-31 16:15:30,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:30,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,196 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-31 16:15:30,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:30,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548130301] [2022-01-31 16:15:30,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548130301] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:30,196 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:30,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:15:30,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771981896] [2022-01-31 16:15:30,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:30,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:15:30,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:30,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:15:30,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:15:30,198 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:15:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:31,008 INFO L93 Difference]: Finished difference Result 585 states and 798 transitions. [2022-01-31 16:15:31,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:15:31,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-01-31 16:15:31,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:31,012 INFO L225 Difference]: With dead ends: 585 [2022-01-31 16:15:31,012 INFO L226 Difference]: Without dead ends: 584 [2022-01-31 16:15:31,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:31,013 INFO L933 BasicCegarLoop]: 634 mSDtfsCounter, 889 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:31,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [895 Valid, 891 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 16:15:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-01-31 16:15:31,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 525. [2022-01-31 16:15:31,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 405 states have (on average 1.3530864197530865) internal successors, (548), 410 states have internal predecessors, (548), 78 states have call successors, (78), 41 states have call predecessors, (78), 41 states have return successors, (90), 75 states have call predecessors, (90), 66 states have call successors, (90) [2022-01-31 16:15:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 716 transitions. [2022-01-31 16:15:31,069 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 716 transitions. Word has length 25 [2022-01-31 16:15:31,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:31,069 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 716 transitions. [2022-01-31 16:15:31,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:15:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 716 transitions. [2022-01-31 16:15:31,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 16:15:31,071 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:31,071 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:31,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 16:15:31,071 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:31,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:31,072 INFO L85 PathProgramCache]: Analyzing trace with hash 525888156, now seen corresponding path program 1 times [2022-01-31 16:15:31,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:31,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027844272] [2022-01-31 16:15:31,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:31,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,243 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-31 16:15:31,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:31,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027844272] [2022-01-31 16:15:31,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027844272] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:31,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:31,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:15:31,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027482775] [2022-01-31 16:15:31,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:31,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:15:31,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:31,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:15:31,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:15:31,244 INFO L87 Difference]: Start difference. First operand 525 states and 716 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:15:31,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:31,890 INFO L93 Difference]: Finished difference Result 676 states and 906 transitions. [2022-01-31 16:15:31,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:15:31,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-01-31 16:15:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:31,896 INFO L225 Difference]: With dead ends: 676 [2022-01-31 16:15:31,896 INFO L226 Difference]: Without dead ends: 676 [2022-01-31 16:15:31,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:31,897 INFO L933 BasicCegarLoop]: 459 mSDtfsCounter, 946 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:31,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [953 Valid, 603 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 16:15:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-01-31 16:15:31,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 583. [2022-01-31 16:15:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 450 states have (on average 1.3488888888888888) internal successors, (607), 463 states have internal predecessors, (607), 82 states have call successors, (82), 46 states have call predecessors, (82), 50 states have return successors, (101), 78 states have call predecessors, (101), 72 states have call successors, (101) [2022-01-31 16:15:31,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 790 transitions. [2022-01-31 16:15:31,916 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 790 transitions. Word has length 31 [2022-01-31 16:15:31,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:31,916 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 790 transitions. [2022-01-31 16:15:31,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:15:31,916 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 790 transitions. [2022-01-31 16:15:31,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 16:15:31,918 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:31,918 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:31,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 16:15:31,918 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:31,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:31,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2004508172, now seen corresponding path program 1 times [2022-01-31 16:15:31,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:31,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681939684] [2022-01-31 16:15:31,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:31,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,049 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-31 16:15:32,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:32,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681939684] [2022-01-31 16:15:32,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681939684] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:32,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:32,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:15:32,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196551351] [2022-01-31 16:15:32,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:32,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:15:32,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:32,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:15:32,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:15:32,051 INFO L87 Difference]: Start difference. First operand 583 states and 790 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:15:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:32,926 INFO L93 Difference]: Finished difference Result 819 states and 1102 transitions. [2022-01-31 16:15:32,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:15:32,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-01-31 16:15:32,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:32,931 INFO L225 Difference]: With dead ends: 819 [2022-01-31 16:15:32,931 INFO L226 Difference]: Without dead ends: 819 [2022-01-31 16:15:32,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:32,932 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 832 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:32,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [840 Valid, 761 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:15:32,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-01-31 16:15:32,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 771. [2022-01-31 16:15:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 606 states have (on average 1.33993399339934) internal successors, (812), 616 states have internal predecessors, (812), 99 states have call successors, (99), 61 states have call predecessors, (99), 65 states have return successors, (136), 97 states have call predecessors, (136), 91 states have call successors, (136) [2022-01-31 16:15:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1047 transitions. [2022-01-31 16:15:32,971 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1047 transitions. Word has length 33 [2022-01-31 16:15:32,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:32,971 INFO L470 AbstractCegarLoop]: Abstraction has 771 states and 1047 transitions. [2022-01-31 16:15:32,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:15:32,971 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1047 transitions. [2022-01-31 16:15:32,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 16:15:32,977 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:32,977 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:32,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 16:15:32,978 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:32,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:32,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1331218314, now seen corresponding path program 1 times [2022-01-31 16:15:32,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:32,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965150538] [2022-01-31 16:15:32,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:32,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:33,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:33,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:33,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:33,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:33,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:33,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965150538] [2022-01-31 16:15:33,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965150538] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:33,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:33,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:15:33,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827846433] [2022-01-31 16:15:33,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:33,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:15:33,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:33,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:15:33,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:33,116 INFO L87 Difference]: Start difference. First operand 771 states and 1047 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:33,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:33,870 INFO L93 Difference]: Finished difference Result 860 states and 1157 transitions. [2022-01-31 16:15:33,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:15:33,871 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2022-01-31 16:15:33,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:33,874 INFO L225 Difference]: With dead ends: 860 [2022-01-31 16:15:33,874 INFO L226 Difference]: Without dead ends: 860 [2022-01-31 16:15:33,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:33,875 INFO L933 BasicCegarLoop]: 476 mSDtfsCounter, 839 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:33,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [840 Valid, 807 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 16:15:33,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-01-31 16:15:33,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 808. [2022-01-31 16:15:33,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 636 states have (on average 1.3333333333333333) internal successors, (848), 648 states have internal predecessors, (848), 99 states have call successors, (99), 61 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-01-31 16:15:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1090 transitions. [2022-01-31 16:15:33,906 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1090 transitions. Word has length 38 [2022-01-31 16:15:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:33,907 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 1090 transitions. [2022-01-31 16:15:33,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:33,907 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1090 transitions. [2022-01-31 16:15:33,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 16:15:33,908 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:33,908 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:33,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 16:15:33,909 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:33,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:33,910 INFO L85 PathProgramCache]: Analyzing trace with hash 528133378, now seen corresponding path program 1 times [2022-01-31 16:15:33,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:33,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735069482] [2022-01-31 16:15:33,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:33,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:33,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:34,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:34,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:34,042 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-31 16:15:34,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:34,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735069482] [2022-01-31 16:15:34,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735069482] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:34,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:34,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:15:34,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023107844] [2022-01-31 16:15:34,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:34,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:15:34,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:34,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:15:34,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:15:34,045 INFO L87 Difference]: Start difference. First operand 808 states and 1090 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:15:34,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:34,673 INFO L93 Difference]: Finished difference Result 839 states and 1128 transitions. [2022-01-31 16:15:34,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:15:34,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-01-31 16:15:34,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:34,677 INFO L225 Difference]: With dead ends: 839 [2022-01-31 16:15:34,678 INFO L226 Difference]: Without dead ends: 839 [2022-01-31 16:15:34,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 16:15:34,680 INFO L933 BasicCegarLoop]: 467 mSDtfsCounter, 488 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:34,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [492 Valid, 719 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 16:15:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-01-31 16:15:34,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 819. [2022-01-31 16:15:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3323029366306027) internal successors, (862), 658 states have internal predecessors, (862), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-01-31 16:15:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1104 transitions. [2022-01-31 16:15:34,701 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1104 transitions. Word has length 38 [2022-01-31 16:15:34,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:34,701 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1104 transitions. [2022-01-31 16:15:34,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:15:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1104 transitions. [2022-01-31 16:15:34,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 16:15:34,703 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:34,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] [2022-01-31 16:15:34,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 16:15:34,703 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:34,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:34,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1133526780, now seen corresponding path program 1 times [2022-01-31 16:15:34,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:34,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789898689] [2022-01-31 16:15:34,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:34,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:34,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:34,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:34,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:34,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 16:15:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:34,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:34,949 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-31 16:15:34,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:34,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789898689] [2022-01-31 16:15:34,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789898689] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:34,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:34,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:34,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120586621] [2022-01-31 16:15:34,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:34,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:34,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:34,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:34,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:34,950 INFO L87 Difference]: Start difference. First operand 819 states and 1104 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:15:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:36,344 INFO L93 Difference]: Finished difference Result 871 states and 1170 transitions. [2022-01-31 16:15:36,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:15:36,345 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-01-31 16:15:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:36,348 INFO L225 Difference]: With dead ends: 871 [2022-01-31 16:15:36,348 INFO L226 Difference]: Without dead ends: 871 [2022-01-31 16:15:36,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2022-01-31 16:15:36,351 INFO L933 BasicCegarLoop]: 455 mSDtfsCounter, 1244 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:36,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1259 Valid, 1048 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 16:15:36,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-01-31 16:15:36,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2022-01-31 16:15:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.330757341576507) internal successors, (861), 658 states have internal predecessors, (861), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-01-31 16:15:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1103 transitions. [2022-01-31 16:15:36,368 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1103 transitions. Word has length 40 [2022-01-31 16:15:36,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:36,369 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1103 transitions. [2022-01-31 16:15:36,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:15:36,369 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1103 transitions. [2022-01-31 16:15:36,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 16:15:36,370 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:36,370 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-31 16:15:36,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 16:15:36,371 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:36,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:36,371 INFO L85 PathProgramCache]: Analyzing trace with hash -174684695, now seen corresponding path program 1 times [2022-01-31 16:15:36,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:36,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230757647] [2022-01-31 16:15:36,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:36,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:36,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:36,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:36,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:36,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 16:15:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:36,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:36,546 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-31 16:15:36,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:36,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230757647] [2022-01-31 16:15:36,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230757647] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:36,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:36,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:36,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419628018] [2022-01-31 16:15:36,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:36,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:36,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:36,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:36,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:36,550 INFO L87 Difference]: Start difference. First operand 819 states and 1103 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:15:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:38,038 INFO L93 Difference]: Finished difference Result 871 states and 1169 transitions. [2022-01-31 16:15:38,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:15:38,039 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-01-31 16:15:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:38,041 INFO L225 Difference]: With dead ends: 871 [2022-01-31 16:15:38,041 INFO L226 Difference]: Without dead ends: 871 [2022-01-31 16:15:38,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2022-01-31 16:15:38,042 INFO L933 BasicCegarLoop]: 456 mSDtfsCounter, 1592 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 1834 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1607 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 2301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 1834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:38,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1607 Valid, 1123 Invalid, 2301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [467 Valid, 1834 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 16:15:38,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-01-31 16:15:38,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2022-01-31 16:15:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3292117465224111) internal successors, (860), 658 states have internal predecessors, (860), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-01-31 16:15:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1102 transitions. [2022-01-31 16:15:38,057 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1102 transitions. Word has length 41 [2022-01-31 16:15:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:38,057 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1102 transitions. [2022-01-31 16:15:38,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:15:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1102 transitions. [2022-01-31 16:15:38,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 16:15:38,059 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:38,059 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-31 16:15:38,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 16:15:38,060 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:38,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:38,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1390592098, now seen corresponding path program 1 times [2022-01-31 16:15:38,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:38,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132853813] [2022-01-31 16:15:38,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:38,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:38,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:38,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:38,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:38,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:38,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:38,207 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-31 16:15:38,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:38,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132853813] [2022-01-31 16:15:38,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132853813] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:38,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:38,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:15:38,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649100257] [2022-01-31 16:15:38,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:38,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:15:38,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:38,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:15:38,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:38,209 INFO L87 Difference]: Start difference. First operand 819 states and 1102 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:39,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:39,212 INFO L93 Difference]: Finished difference Result 879 states and 1177 transitions. [2022-01-31 16:15:39,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:15:39,212 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2022-01-31 16:15:39,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:39,215 INFO L225 Difference]: With dead ends: 879 [2022-01-31 16:15:39,215 INFO L226 Difference]: Without dead ends: 867 [2022-01-31 16:15:39,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:39,216 INFO L933 BasicCegarLoop]: 479 mSDtfsCounter, 475 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:39,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [484 Valid, 1371 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 16:15:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2022-01-31 16:15:39,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 817. [2022-01-31 16:15:39,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 646 states have (on average 1.328173374613003) internal successors, (858), 657 states have internal predecessors, (858), 98 states have call successors, (98), 62 states have call predecessors, (98), 72 states have return successors, (142), 99 states have call predecessors, (142), 90 states have call successors, (142) [2022-01-31 16:15:39,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1098 transitions. [2022-01-31 16:15:39,230 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1098 transitions. Word has length 41 [2022-01-31 16:15:39,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:39,230 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1098 transitions. [2022-01-31 16:15:39,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1098 transitions. [2022-01-31 16:15:39,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 16:15:39,231 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:39,231 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] [2022-01-31 16:15:39,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 16:15:39,231 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:39,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:39,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1816872397, now seen corresponding path program 1 times [2022-01-31 16:15:39,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:39,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094977092] [2022-01-31 16:15:39,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:39,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:39,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:39,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:39,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:39,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 16:15:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:39,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:39,381 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-31 16:15:39,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:39,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094977092] [2022-01-31 16:15:39,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094977092] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:39,381 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:39,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:15:39,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244436371] [2022-01-31 16:15:39,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:39,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:15:39,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:39,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:15:39,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:39,382 INFO L87 Difference]: Start difference. First operand 817 states and 1098 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:40,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:40,639 INFO L93 Difference]: Finished difference Result 877 states and 1173 transitions. [2022-01-31 16:15:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:15:40,643 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2022-01-31 16:15:40,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:40,646 INFO L225 Difference]: With dead ends: 877 [2022-01-31 16:15:40,646 INFO L226 Difference]: Without dead ends: 860 [2022-01-31 16:15:40,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:40,647 INFO L933 BasicCegarLoop]: 475 mSDtfsCounter, 319 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:40,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 1413 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2057 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 16:15:40,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-01-31 16:15:40,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 810. [2022-01-31 16:15:40,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 642 states have (on average 1.3286604361370717) internal successors, (853), 653 states have internal predecessors, (853), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140) [2022-01-31 16:15:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1089 transitions. [2022-01-31 16:15:40,662 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1089 transitions. Word has length 42 [2022-01-31 16:15:40,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:40,662 INFO L470 AbstractCegarLoop]: Abstraction has 810 states and 1089 transitions. [2022-01-31 16:15:40,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:40,663 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1089 transitions. [2022-01-31 16:15:40,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 16:15:40,663 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:40,663 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] [2022-01-31 16:15:40,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 16:15:40,664 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:40,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:40,664 INFO L85 PathProgramCache]: Analyzing trace with hash -4159802, now seen corresponding path program 1 times [2022-01-31 16:15:40,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:40,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283261138] [2022-01-31 16:15:40,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:40,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:40,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:40,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:40,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:40,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:40,817 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-31 16:15:40,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:40,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283261138] [2022-01-31 16:15:40,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283261138] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:40,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:40,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:15:40,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622089399] [2022-01-31 16:15:40,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:40,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:15:40,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:40,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:15:40,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:40,819 INFO L87 Difference]: Start difference. First operand 810 states and 1089 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 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-31 16:15:41,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:41,850 INFO L93 Difference]: Finished difference Result 835 states and 1118 transitions. [2022-01-31 16:15:41,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:15:41,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 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 42 [2022-01-31 16:15:41,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:41,853 INFO L225 Difference]: With dead ends: 835 [2022-01-31 16:15:41,853 INFO L226 Difference]: Without dead ends: 835 [2022-01-31 16:15:41,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:41,853 INFO L933 BasicCegarLoop]: 456 mSDtfsCounter, 547 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:41,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 1012 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 16:15:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-01-31 16:15:41,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 812. [2022-01-31 16:15:41,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 644 states have (on average 1.3276397515527951) internal successors, (855), 655 states have internal predecessors, (855), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140) [2022-01-31 16:15:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1091 transitions. [2022-01-31 16:15:41,866 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1091 transitions. Word has length 42 [2022-01-31 16:15:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:41,866 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1091 transitions. [2022-01-31 16:15:41,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 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-31 16:15:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1091 transitions. [2022-01-31 16:15:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 16:15:41,867 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:41,867 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-31 16:15:41,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 16:15:41,867 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:41,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:41,868 INFO L85 PathProgramCache]: Analyzing trace with hash 383655172, now seen corresponding path program 1 times [2022-01-31 16:15:41,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:41,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797007759] [2022-01-31 16:15:41,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:41,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 16:15:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,986 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-31 16:15:41,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:41,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797007759] [2022-01-31 16:15:41,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797007759] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:41,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:41,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 16:15:41,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860331762] [2022-01-31 16:15:41,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:41,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 16:15:41,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:41,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 16:15:41,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-31 16:15:41,988 INFO L87 Difference]: Start difference. First operand 812 states and 1091 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 16:15:42,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:42,984 INFO L93 Difference]: Finished difference Result 840 states and 1124 transitions. [2022-01-31 16:15:42,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:15:42,984 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-01-31 16:15:42,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:42,986 INFO L225 Difference]: With dead ends: 840 [2022-01-31 16:15:42,986 INFO L226 Difference]: Without dead ends: 840 [2022-01-31 16:15:42,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:42,987 INFO L933 BasicCegarLoop]: 432 mSDtfsCounter, 526 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:42,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [544 Valid, 912 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 16:15:42,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-01-31 16:15:42,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 816. [2022-01-31 16:15:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142) [2022-01-31 16:15:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2022-01-31 16:15:43,000 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 44 [2022-01-31 16:15:43,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:43,000 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2022-01-31 16:15:43,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 16:15:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2022-01-31 16:15:43,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 16:15:43,001 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:43,001 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-31 16:15:43,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 16:15:43,001 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:43,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:43,002 INFO L85 PathProgramCache]: Analyzing trace with hash -864015436, now seen corresponding path program 1 times [2022-01-31 16:15:43,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:43,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366875748] [2022-01-31 16:15:43,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:43,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,116 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-31 16:15:43,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:43,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366875748] [2022-01-31 16:15:43,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366875748] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:43,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:43,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:15:43,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953925420] [2022-01-31 16:15:43,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:43,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:15:43,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:43,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:15:43,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:43,117 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 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-31 16:15:44,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:44,134 INFO L93 Difference]: Finished difference Result 838 states and 1121 transitions. [2022-01-31 16:15:44,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 16:15:44,135 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 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 43 [2022-01-31 16:15:44,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:44,137 INFO L225 Difference]: With dead ends: 838 [2022-01-31 16:15:44,137 INFO L226 Difference]: Without dead ends: 838 [2022-01-31 16:15:44,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:15:44,138 INFO L933 BasicCegarLoop]: 461 mSDtfsCounter, 535 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:44,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [540 Valid, 1029 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:15:44,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-01-31 16:15:44,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 816. [2022-01-31 16:15:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142) [2022-01-31 16:15:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2022-01-31 16:15:44,151 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 43 [2022-01-31 16:15:44,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:44,152 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2022-01-31 16:15:44,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 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-31 16:15:44,152 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2022-01-31 16:15:44,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 16:15:44,152 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:44,153 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-31 16:15:44,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 16:15:44,153 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:44,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:44,153 INFO L85 PathProgramCache]: Analyzing trace with hash -392590886, now seen corresponding path program 1 times [2022-01-31 16:15:44,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:44,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399284360] [2022-01-31 16:15:44,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:44,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:44,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:44,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:44,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:44,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:44,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:44,308 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-31 16:15:44,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:44,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399284360] [2022-01-31 16:15:44,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399284360] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:44,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:44,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:15:44,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650245768] [2022-01-31 16:15:44,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:44,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:15:44,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:44,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:15:44,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:44,310 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:45,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:45,112 INFO L93 Difference]: Finished difference Result 858 states and 1146 transitions. [2022-01-31 16:15:45,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:15:45,112 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2022-01-31 16:15:45,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:45,115 INFO L225 Difference]: With dead ends: 858 [2022-01-31 16:15:45,115 INFO L226 Difference]: Without dead ends: 843 [2022-01-31 16:15:45,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:45,115 INFO L933 BasicCegarLoop]: 457 mSDtfsCounter, 689 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:45,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [693 Valid, 1265 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:15:45,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-01-31 16:15:45,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 814. [2022-01-31 16:15:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 646 states have (on average 1.325077399380805) internal successors, (856), 657 states have internal predecessors, (856), 95 states have call successors, (95), 61 states have call predecessors, (95), 72 states have return successors, (141), 97 states have call predecessors, (141), 87 states have call successors, (141) [2022-01-31 16:15:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1092 transitions. [2022-01-31 16:15:45,128 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1092 transitions. Word has length 45 [2022-01-31 16:15:45,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:45,128 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1092 transitions. [2022-01-31 16:15:45,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1092 transitions. [2022-01-31 16:15:45,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 16:15:45,129 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:45,129 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-31 16:15:45,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 16:15:45,130 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:45,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:45,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1509958495, now seen corresponding path program 1 times [2022-01-31 16:15:45,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:45,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476939326] [2022-01-31 16:15:45,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:45,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,270 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-31 16:15:45,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:45,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476939326] [2022-01-31 16:15:45,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476939326] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:45,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:45,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:15:45,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524205983] [2022-01-31 16:15:45,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:45,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:15:45,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:45,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:15:45,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:45,271 INFO L87 Difference]: Start difference. First operand 814 states and 1092 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:46,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:46,091 INFO L93 Difference]: Finished difference Result 855 states and 1136 transitions. [2022-01-31 16:15:46,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:15:46,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2022-01-31 16:15:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:46,094 INFO L225 Difference]: With dead ends: 855 [2022-01-31 16:15:46,094 INFO L226 Difference]: Without dead ends: 804 [2022-01-31 16:15:46,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-31 16:15:46,095 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 845 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:46,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [849 Valid, 827 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:15:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-01-31 16:15:46,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 775. [2022-01-31 16:15:46,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 616 states have (on average 1.3246753246753247) internal successors, (816), 628 states have internal predecessors, (816), 93 states have call successors, (93), 60 states have call predecessors, (93), 65 states have return successors, (132), 88 states have call predecessors, (132), 85 states have call successors, (132) [2022-01-31 16:15:46,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2022-01-31 16:15:46,108 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 46 [2022-01-31 16:15:46,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:46,108 INFO L470 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2022-01-31 16:15:46,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:46,108 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-01-31 16:15:46,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 16:15:46,109 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:46,109 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-31 16:15:46,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 16:15:46,109 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:46,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:46,110 INFO L85 PathProgramCache]: Analyzing trace with hash -214129706, now seen corresponding path program 1 times [2022-01-31 16:15:46,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:46,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72362599] [2022-01-31 16:15:46,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:46,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 16:15:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,220 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-31 16:15:46,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:46,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72362599] [2022-01-31 16:15:46,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72362599] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:46,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:46,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 16:15:46,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655290712] [2022-01-31 16:15:46,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:46,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 16:15:46,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:46,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 16:15:46,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 16:15:46,223 INFO L87 Difference]: Start difference. First operand 775 states and 1041 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 16:15:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:47,307 INFO L93 Difference]: Finished difference Result 1131 states and 1528 transitions. [2022-01-31 16:15:47,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:15:47,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2022-01-31 16:15:47,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:47,310 INFO L225 Difference]: With dead ends: 1131 [2022-01-31 16:15:47,310 INFO L226 Difference]: Without dead ends: 1131 [2022-01-31 16:15:47,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:47,312 INFO L933 BasicCegarLoop]: 533 mSDtfsCounter, 490 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:47,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [507 Valid, 766 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 16:15:47,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2022-01-31 16:15:47,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 888. [2022-01-31 16:15:47,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 707 states have (on average 1.3295615275813295) internal successors, (940), 721 states have internal predecessors, (940), 103 states have call successors, (103), 70 states have call predecessors, (103), 77 states have return successors, (152), 98 states have call predecessors, (152), 95 states have call successors, (152) [2022-01-31 16:15:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1195 transitions. [2022-01-31 16:15:47,331 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1195 transitions. Word has length 47 [2022-01-31 16:15:47,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:47,331 INFO L470 AbstractCegarLoop]: Abstraction has 888 states and 1195 transitions. [2022-01-31 16:15:47,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 16:15:47,332 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1195 transitions. [2022-01-31 16:15:47,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 16:15:47,332 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:47,332 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-31 16:15:47,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 16:15:47,333 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:47,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:47,333 INFO L85 PathProgramCache]: Analyzing trace with hash 530917733, now seen corresponding path program 1 times [2022-01-31 16:15:47,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:47,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279570463] [2022-01-31 16:15:47,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:47,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:15:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,468 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-31 16:15:47,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:47,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279570463] [2022-01-31 16:15:47,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279570463] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:47,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:47,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:15:47,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344740787] [2022-01-31 16:15:47,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:47,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:15:47,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:47,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:15:47,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:47,470 INFO L87 Difference]: Start difference. First operand 888 states and 1195 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:48,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:48,335 INFO L93 Difference]: Finished difference Result 930 states and 1245 transitions. [2022-01-31 16:15:48,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:15:48,336 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-01-31 16:15:48,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:48,338 INFO L225 Difference]: With dead ends: 930 [2022-01-31 16:15:48,339 INFO L226 Difference]: Without dead ends: 915 [2022-01-31 16:15:48,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:48,339 INFO L933 BasicCegarLoop]: 448 mSDtfsCounter, 556 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 1713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:48,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [560 Valid, 1276 Invalid, 1713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:15:48,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2022-01-31 16:15:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 886. [2022-01-31 16:15:48,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 706 states have (on average 1.3286118980169972) internal successors, (938), 720 states have internal predecessors, (938), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151) [2022-01-31 16:15:48,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1191 transitions. [2022-01-31 16:15:48,352 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1191 transitions. Word has length 47 [2022-01-31 16:15:48,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:48,352 INFO L470 AbstractCegarLoop]: Abstraction has 886 states and 1191 transitions. [2022-01-31 16:15:48,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:48,353 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1191 transitions. [2022-01-31 16:15:48,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 16:15:48,353 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:48,354 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-31 16:15:48,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 16:15:48,354 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:48,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:48,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1920468263, now seen corresponding path program 1 times [2022-01-31 16:15:48,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:48,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599888950] [2022-01-31 16:15:48,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:48,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 16:15:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:48,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:48,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599888950] [2022-01-31 16:15:48,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599888950] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:48,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:48,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:15:48,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145592597] [2022-01-31 16:15:48,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:48,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:15:48,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:48,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:15:48,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:48,542 INFO L87 Difference]: Start difference. First operand 886 states and 1191 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 16:15:49,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:49,729 INFO L93 Difference]: Finished difference Result 936 states and 1237 transitions. [2022-01-31 16:15:49,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:15:49,730 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2022-01-31 16:15:49,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:49,732 INFO L225 Difference]: With dead ends: 936 [2022-01-31 16:15:49,733 INFO L226 Difference]: Without dead ends: 936 [2022-01-31 16:15:49,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-01-31 16:15:49,734 INFO L933 BasicCegarLoop]: 556 mSDtfsCounter, 1467 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:49,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1479 Valid, 837 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 16:15:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2022-01-31 16:15:49,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 877. [2022-01-31 16:15:49,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 697 states have (on average 1.3156384505021521) internal successors, (917), 711 states have internal predecessors, (917), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151) [2022-01-31 16:15:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1170 transitions. [2022-01-31 16:15:49,757 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1170 transitions. Word has length 48 [2022-01-31 16:15:49,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:49,758 INFO L470 AbstractCegarLoop]: Abstraction has 877 states and 1170 transitions. [2022-01-31 16:15:49,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 16:15:49,758 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1170 transitions. [2022-01-31 16:15:49,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 16:15:49,758 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:49,759 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-31 16:15:49,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 16:15:49,759 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:49,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:49,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1683726876, now seen corresponding path program 1 times [2022-01-31 16:15:49,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:49,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444284790] [2022-01-31 16:15:49,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:49,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,905 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-31 16:15:49,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:49,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444284790] [2022-01-31 16:15:49,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444284790] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:49,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:49,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:49,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346625175] [2022-01-31 16:15:49,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:49,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:49,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:49,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:49,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:49,907 INFO L87 Difference]: Start difference. First operand 877 states and 1170 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 16:15:51,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:51,506 INFO L93 Difference]: Finished difference Result 1075 states and 1432 transitions. [2022-01-31 16:15:51,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 16:15:51,506 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-01-31 16:15:51,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:51,510 INFO L225 Difference]: With dead ends: 1075 [2022-01-31 16:15:51,510 INFO L226 Difference]: Without dead ends: 1075 [2022-01-31 16:15:51,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2022-01-31 16:15:51,510 INFO L933 BasicCegarLoop]: 545 mSDtfsCounter, 1391 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 2613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:51,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1394 Valid, 1457 Invalid, 2613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 16:15:51,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2022-01-31 16:15:51,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 932. [2022-01-31 16:15:51,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.3090418353576248) internal successors, (970), 757 states have internal predecessors, (970), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168) [2022-01-31 16:15:51,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1243 transitions. [2022-01-31 16:15:51,526 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1243 transitions. Word has length 50 [2022-01-31 16:15:51,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:51,527 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1243 transitions. [2022-01-31 16:15:51,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 16:15:51,527 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1243 transitions. [2022-01-31 16:15:51,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 16:15:51,530 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:51,530 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-31 16:15:51,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 16:15:51,530 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:51,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:51,530 INFO L85 PathProgramCache]: Analyzing trace with hash -415030459, now seen corresponding path program 1 times [2022-01-31 16:15:51,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:51,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2459937] [2022-01-31 16:15:51,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:51,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:51,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:51,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:51,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:51,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:51,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 16:15:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:51,722 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-31 16:15:51,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:51,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2459937] [2022-01-31 16:15:51,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2459937] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:51,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:51,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 16:15:51,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434046663] [2022-01-31 16:15:51,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:51,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 16:15:51,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:51,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 16:15:51,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:15:51,724 INFO L87 Difference]: Start difference. First operand 932 states and 1243 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:15:52,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:52,713 INFO L93 Difference]: Finished difference Result 976 states and 1293 transitions. [2022-01-31 16:15:52,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:15:52,713 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-01-31 16:15:52,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:52,716 INFO L225 Difference]: With dead ends: 976 [2022-01-31 16:15:52,716 INFO L226 Difference]: Without dead ends: 959 [2022-01-31 16:15:52,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:15:52,717 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 478 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:52,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [482 Valid, 1462 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1694 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 16:15:52,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-01-31 16:15:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 932. [2022-01-31 16:15:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.2928475033738192) internal successors, (958), 757 states have internal predecessors, (958), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168) [2022-01-31 16:15:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1231 transitions. [2022-01-31 16:15:52,731 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1231 transitions. Word has length 50 [2022-01-31 16:15:52,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:52,731 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1231 transitions. [2022-01-31 16:15:52,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:15:52,731 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1231 transitions. [2022-01-31 16:15:52,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 16:15:52,732 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:52,732 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-31 16:15:52,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 16:15:52,733 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:52,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:52,733 INFO L85 PathProgramCache]: Analyzing trace with hash 527542300, now seen corresponding path program 1 times [2022-01-31 16:15:52,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:52,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755226040] [2022-01-31 16:15:52,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:52,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 16:15:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,861 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-31 16:15:52,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:52,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755226040] [2022-01-31 16:15:52,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755226040] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:52,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:52,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:15:52,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384586542] [2022-01-31 16:15:52,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:52,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:15:52,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:52,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:15:52,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:52,862 INFO L87 Difference]: Start difference. First operand 932 states and 1231 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 16:15:53,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:53,718 INFO L93 Difference]: Finished difference Result 685 states and 869 transitions. [2022-01-31 16:15:53,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:15:53,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2022-01-31 16:15:53,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:53,720 INFO L225 Difference]: With dead ends: 685 [2022-01-31 16:15:53,720 INFO L226 Difference]: Without dead ends: 685 [2022-01-31 16:15:53,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:15:53,721 INFO L933 BasicCegarLoop]: 470 mSDtfsCounter, 850 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:53,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [859 Valid, 830 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 16:15:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-01-31 16:15:53,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 623. [2022-01-31 16:15:53,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 498 states have (on average 1.2751004016064258) internal successors, (635), 509 states have internal predecessors, (635), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 68 states have call predecessors, (85), 63 states have call successors, (85) [2022-01-31 16:15:53,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 791 transitions. [2022-01-31 16:15:53,734 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 791 transitions. Word has length 52 [2022-01-31 16:15:53,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:53,735 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 791 transitions. [2022-01-31 16:15:53,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 16:15:53,735 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 791 transitions. [2022-01-31 16:15:53,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 16:15:53,736 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:53,736 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-31 16:15:53,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 16:15:53,737 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:53,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:53,737 INFO L85 PathProgramCache]: Analyzing trace with hash 868088371, now seen corresponding path program 1 times [2022-01-31 16:15:53,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:53,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659441887] [2022-01-31 16:15:53,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:53,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:53,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:53,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:53,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:53,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:53,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:15:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:53,878 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-31 16:15:53,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:53,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659441887] [2022-01-31 16:15:53,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659441887] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:53,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:53,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 16:15:53,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335836751] [2022-01-31 16:15:53,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:53,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 16:15:53,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:53,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 16:15:53,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:15:53,880 INFO L87 Difference]: Start difference. First operand 623 states and 791 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:15:54,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:54,885 INFO L93 Difference]: Finished difference Result 670 states and 845 transitions. [2022-01-31 16:15:54,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:15:54,885 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-01-31 16:15:54,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:54,887 INFO L225 Difference]: With dead ends: 670 [2022-01-31 16:15:54,887 INFO L226 Difference]: Without dead ends: 645 [2022-01-31 16:15:54,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:15:54,888 INFO L933 BasicCegarLoop]: 439 mSDtfsCounter, 447 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:54,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [456 Valid, 1493 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 16:15:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-01-31 16:15:54,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 613. [2022-01-31 16:15:54,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 488 states have (on average 1.2704918032786885) internal successors, (620), 499 states have internal predecessors, (620), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 68 states have call predecessors, (85), 63 states have call successors, (85) [2022-01-31 16:15:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 776 transitions. [2022-01-31 16:15:54,895 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 776 transitions. Word has length 51 [2022-01-31 16:15:54,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:54,895 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 776 transitions. [2022-01-31 16:15:54,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:15:54,895 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 776 transitions. [2022-01-31 16:15:54,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 16:15:54,897 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:54,897 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-31 16:15:54,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 16:15:54,897 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:54,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:54,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1730699339, now seen corresponding path program 1 times [2022-01-31 16:15:54,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:54,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309996484] [2022-01-31 16:15:54,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:54,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:54,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:54,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:54,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:15:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,057 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-31 16:15:55,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:55,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309996484] [2022-01-31 16:15:55,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309996484] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:55,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:55,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 16:15:55,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598571465] [2022-01-31 16:15:55,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:55,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 16:15:55,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:55,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 16:15:55,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:15:55,059 INFO L87 Difference]: Start difference. First operand 613 states and 776 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:56,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:56,113 INFO L93 Difference]: Finished difference Result 647 states and 817 transitions. [2022-01-31 16:15:56,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 16:15:56,114 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2022-01-31 16:15:56,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:56,116 INFO L225 Difference]: With dead ends: 647 [2022-01-31 16:15:56,116 INFO L226 Difference]: Without dead ends: 647 [2022-01-31 16:15:56,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:15:56,116 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 469 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 2186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:56,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 1052 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 16:15:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-01-31 16:15:56,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 616. [2022-01-31 16:15:56,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 491 states have (on average 1.2688391038696538) internal successors, (623), 501 states have internal predecessors, (623), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2022-01-31 16:15:56,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 779 transitions. [2022-01-31 16:15:56,123 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 779 transitions. Word has length 51 [2022-01-31 16:15:56,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:56,123 INFO L470 AbstractCegarLoop]: Abstraction has 616 states and 779 transitions. [2022-01-31 16:15:56,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:56,123 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 779 transitions. [2022-01-31 16:15:56,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 16:15:56,124 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:56,124 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-31 16:15:56,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 16:15:56,124 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:56,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:56,125 INFO L85 PathProgramCache]: Analyzing trace with hash -585236833, now seen corresponding path program 1 times [2022-01-31 16:15:56,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:56,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806465689] [2022-01-31 16:15:56,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:56,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,323 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-31 16:15:56,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:56,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806465689] [2022-01-31 16:15:56,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806465689] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:56,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:56,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:15:56,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112798142] [2022-01-31 16:15:56,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:56,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:15:56,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:56,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:15:56,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:56,325 INFO L87 Difference]: Start difference. First operand 616 states and 779 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:15:57,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:57,084 INFO L93 Difference]: Finished difference Result 677 states and 864 transitions. [2022-01-31 16:15:57,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:15:57,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-01-31 16:15:57,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:57,086 INFO L225 Difference]: With dead ends: 677 [2022-01-31 16:15:57,086 INFO L226 Difference]: Without dead ends: 676 [2022-01-31 16:15:57,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:15:57,087 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 1159 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:57,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1175 Valid, 800 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 16:15:57,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-01-31 16:15:57,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 627. [2022-01-31 16:15:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 502 states have (on average 1.2729083665338645) internal successors, (639), 512 states have internal predecessors, (639), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2022-01-31 16:15:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 795 transitions. [2022-01-31 16:15:57,095 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 795 transitions. Word has length 52 [2022-01-31 16:15:57,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:57,095 INFO L470 AbstractCegarLoop]: Abstraction has 627 states and 795 transitions. [2022-01-31 16:15:57,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:15:57,095 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 795 transitions. [2022-01-31 16:15:57,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 16:15:57,096 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:57,096 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-31 16:15:57,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 16:15:57,096 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:57,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:57,096 INFO L85 PathProgramCache]: Analyzing trace with hash 768072864, now seen corresponding path program 1 times [2022-01-31 16:15:57,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:57,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814855832] [2022-01-31 16:15:57,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:57,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,322 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-31 16:15:57,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:57,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814855832] [2022-01-31 16:15:57,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814855832] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:57,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:57,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 16:15:57,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724580542] [2022-01-31 16:15:57,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:57,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 16:15:57,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:57,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 16:15:57,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:15:57,324 INFO L87 Difference]: Start difference. First operand 627 states and 795 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 16:15:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:58,576 INFO L93 Difference]: Finished difference Result 670 states and 844 transitions. [2022-01-31 16:15:58,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 16:15:58,577 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2022-01-31 16:15:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:58,578 INFO L225 Difference]: With dead ends: 670 [2022-01-31 16:15:58,579 INFO L226 Difference]: Without dead ends: 670 [2022-01-31 16:15:58,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-01-31 16:15:58,579 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 766 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:58,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [774 Valid, 1152 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1824 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 16:15:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-01-31 16:15:58,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 620. [2022-01-31 16:15:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 495 states have (on average 1.2686868686868686) internal successors, (628), 505 states have internal predecessors, (628), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2022-01-31 16:15:58,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 784 transitions. [2022-01-31 16:15:58,586 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 784 transitions. Word has length 52 [2022-01-31 16:15:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:58,586 INFO L470 AbstractCegarLoop]: Abstraction has 620 states and 784 transitions. [2022-01-31 16:15:58,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 16:15:58,587 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 784 transitions. [2022-01-31 16:15:58,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 16:15:58,587 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:58,587 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-31 16:15:58,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 16:15:58,588 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:58,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:58,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1124310208, now seen corresponding path program 1 times [2022-01-31 16:15:58,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:58,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700433459] [2022-01-31 16:15:58,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:58,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,886 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-31 16:15:58,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:58,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700433459] [2022-01-31 16:15:58,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700433459] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:58,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:58,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:15:58,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014588064] [2022-01-31 16:15:58,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:58,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:15:58,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:58,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:15:58,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:58,888 INFO L87 Difference]: Start difference. First operand 620 states and 784 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:59,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:59,554 INFO L93 Difference]: Finished difference Result 800 states and 1032 transitions. [2022-01-31 16:15:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:15:59,555 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2022-01-31 16:15:59,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:59,557 INFO L225 Difference]: With dead ends: 800 [2022-01-31 16:15:59,557 INFO L226 Difference]: Without dead ends: 738 [2022-01-31 16:15:59,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:59,557 INFO L933 BasicCegarLoop]: 556 mSDtfsCounter, 640 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:59,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [650 Valid, 908 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 16:15:59,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-01-31 16:15:59,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 575. [2022-01-31 16:15:59,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 455 states have (on average 1.2747252747252746) internal successors, (580), 465 states have internal predecessors, (580), 69 states have call successors, (69), 44 states have call predecessors, (69), 50 states have return successors, (82), 66 states have call predecessors, (82), 61 states have call successors, (82) [2022-01-31 16:15:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 731 transitions. [2022-01-31 16:15:59,565 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 731 transitions. Word has length 52 [2022-01-31 16:15:59,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:59,565 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 731 transitions. [2022-01-31 16:15:59,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 731 transitions. [2022-01-31 16:15:59,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 16:15:59,565 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:59,566 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-31 16:15:59,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 16:15:59,566 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:59,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:59,566 INFO L85 PathProgramCache]: Analyzing trace with hash 525399217, now seen corresponding path program 1 times [2022-01-31 16:15:59,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:59,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166008709] [2022-01-31 16:15:59,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:59,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:59,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:59,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:59,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:59,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:59,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:59,743 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-31 16:15:59,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:59,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166008709] [2022-01-31 16:15:59,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166008709] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:59,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:59,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 16:15:59,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974901396] [2022-01-31 16:15:59,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:59,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 16:15:59,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:59,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 16:15:59,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:15:59,744 INFO L87 Difference]: Start difference. First operand 575 states and 731 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:16:00,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:00,942 INFO L93 Difference]: Finished difference Result 635 states and 815 transitions. [2022-01-31 16:16:00,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:16:00,943 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2022-01-31 16:16:00,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:00,952 INFO L225 Difference]: With dead ends: 635 [2022-01-31 16:16:00,952 INFO L226 Difference]: Without dead ends: 634 [2022-01-31 16:16:00,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:16:00,954 INFO L933 BasicCegarLoop]: 410 mSDtfsCounter, 270 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 2447 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 2522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:00,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 1778 Invalid, 2522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2447 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 16:16:00,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-01-31 16:16:00,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 592. [2022-01-31 16:16:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 470 states have (on average 1.2659574468085106) internal successors, (595), 480 states have internal predecessors, (595), 69 states have call successors, (69), 44 states have call predecessors, (69), 52 states have return successors, (91), 68 states have call predecessors, (91), 61 states have call successors, (91) [2022-01-31 16:16:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 755 transitions. [2022-01-31 16:16:00,961 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 755 transitions. Word has length 53 [2022-01-31 16:16:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:00,963 INFO L470 AbstractCegarLoop]: Abstraction has 592 states and 755 transitions. [2022-01-31 16:16:00,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:16:00,963 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 755 transitions. [2022-01-31 16:16:00,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 16:16:00,964 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:00,964 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-31 16:16:00,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 16:16:00,964 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:00,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:00,964 INFO L85 PathProgramCache]: Analyzing trace with hash 525430961, now seen corresponding path program 1 times [2022-01-31 16:16:00,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:00,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807996782] [2022-01-31 16:16:00,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:00,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:01,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:01,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:01,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:01,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:16:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:01,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:01,112 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-31 16:16:01,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:01,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807996782] [2022-01-31 16:16:01,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807996782] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:01,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:01,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 16:16:01,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78958971] [2022-01-31 16:16:01,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:01,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 16:16:01,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:01,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 16:16:01,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:16:01,114 INFO L87 Difference]: Start difference. First operand 592 states and 755 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:16:02,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:02,126 INFO L93 Difference]: Finished difference Result 623 states and 791 transitions. [2022-01-31 16:16:02,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:16:02,127 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2022-01-31 16:16:02,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:02,128 INFO L225 Difference]: With dead ends: 623 [2022-01-31 16:16:02,128 INFO L226 Difference]: Without dead ends: 611 [2022-01-31 16:16:02,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:16:02,129 INFO L933 BasicCegarLoop]: 414 mSDtfsCounter, 378 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 2327 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 2456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:02,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 1676 Invalid, 2456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 2327 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 16:16:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-01-31 16:16:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 589. [2022-01-31 16:16:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 467 states have (on average 1.2676659528907923) internal successors, (592), 478 states have internal predecessors, (592), 69 states have call successors, (69), 44 states have call predecessors, (69), 52 states have return successors, (90), 67 states have call predecessors, (90), 61 states have call successors, (90) [2022-01-31 16:16:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 751 transitions. [2022-01-31 16:16:02,135 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 751 transitions. Word has length 53 [2022-01-31 16:16:02,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:02,135 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 751 transitions. [2022-01-31 16:16:02,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:16:02,135 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 751 transitions. [2022-01-31 16:16:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 16:16:02,136 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:02,136 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-31 16:16:02,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 16:16:02,136 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:02,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:02,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1791629129, now seen corresponding path program 1 times [2022-01-31 16:16:02,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:02,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711433396] [2022-01-31 16:16:02,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:02,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:02,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:02,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:02,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:02,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:16:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:02,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:16:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:02,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:16:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:02,327 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-31 16:16:02,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:02,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711433396] [2022-01-31 16:16:02,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711433396] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:02,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:02,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 16:16:02,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764385566] [2022-01-31 16:16:02,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:02,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 16:16:02,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:02,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 16:16:02,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:16:02,328 INFO L87 Difference]: Start difference. First operand 589 states and 751 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:16:03,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:03,391 INFO L93 Difference]: Finished difference Result 621 states and 787 transitions. [2022-01-31 16:16:03,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:16:03,396 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55 [2022-01-31 16:16:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:03,397 INFO L225 Difference]: With dead ends: 621 [2022-01-31 16:16:03,397 INFO L226 Difference]: Without dead ends: 596 [2022-01-31 16:16:03,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:16:03,401 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 365 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 2504 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 2622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:03,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 1728 Invalid, 2622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2504 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 16:16:03,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-01-31 16:16:03,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 577. [2022-01-31 16:16:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 458 states have (on average 1.2663755458515285) internal successors, (580), 469 states have internal predecessors, (580), 67 states have call successors, (67), 43 states have call predecessors, (67), 51 states have return successors, (88), 65 states have call predecessors, (88), 59 states have call successors, (88) [2022-01-31 16:16:03,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 735 transitions. [2022-01-31 16:16:03,408 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 735 transitions. Word has length 55 [2022-01-31 16:16:03,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:03,408 INFO L470 AbstractCegarLoop]: Abstraction has 577 states and 735 transitions. [2022-01-31 16:16:03,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:16:03,408 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 735 transitions. [2022-01-31 16:16:03,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 16:16:03,409 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:03,409 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-31 16:16:03,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 16:16:03,409 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:03,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:03,410 INFO L85 PathProgramCache]: Analyzing trace with hash 310114016, now seen corresponding path program 1 times [2022-01-31 16:16:03,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:03,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538308186] [2022-01-31 16:16:03,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:03,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:03,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:03,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:03,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:03,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:16:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:03,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:03,567 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-31 16:16:03,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:03,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538308186] [2022-01-31 16:16:03,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538308186] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:03,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:03,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:16:03,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586389787] [2022-01-31 16:16:03,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:03,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:16:03,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:03,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:16:03,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:16:03,568 INFO L87 Difference]: Start difference. First operand 577 states and 735 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:16:05,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:05,116 INFO L93 Difference]: Finished difference Result 742 states and 964 transitions. [2022-01-31 16:16:05,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 16:16:05,116 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2022-01-31 16:16:05,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:05,118 INFO L225 Difference]: With dead ends: 742 [2022-01-31 16:16:05,118 INFO L226 Difference]: Without dead ends: 728 [2022-01-31 16:16:05,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2022-01-31 16:16:05,119 INFO L933 BasicCegarLoop]: 503 mSDtfsCounter, 879 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 2105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:05,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [894 Valid, 972 Invalid, 2105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 16:16:05,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-01-31 16:16:05,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 561. [2022-01-31 16:16:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 445 states have (on average 1.2719101123595506) internal successors, (566), 455 states have internal predecessors, (566), 66 states have call successors, (66), 43 states have call predecessors, (66), 49 states have return successors, (79), 63 states have call predecessors, (79), 58 states have call successors, (79) [2022-01-31 16:16:05,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 711 transitions. [2022-01-31 16:16:05,125 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 711 transitions. Word has length 54 [2022-01-31 16:16:05,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:05,126 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 711 transitions. [2022-01-31 16:16:05,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:16:05,126 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 711 transitions. [2022-01-31 16:16:05,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 16:16:05,126 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:05,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, 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-31 16:16:05,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 16:16:05,127 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:05,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1381037997, now seen corresponding path program 1 times [2022-01-31 16:16:05,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:05,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856209178] [2022-01-31 16:16:05,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:05,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 16:16:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 16:16:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,264 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-31 16:16:05,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:05,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856209178] [2022-01-31 16:16:05,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856209178] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:05,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:05,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:16:05,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986243668] [2022-01-31 16:16:05,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:05,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:16:05,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:05,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:16:05,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:16:05,266 INFO L87 Difference]: Start difference. First operand 561 states and 711 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:16:05,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:05,798 INFO L93 Difference]: Finished difference Result 589 states and 746 transitions. [2022-01-31 16:16:05,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 16:16:05,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2022-01-31 16:16:05,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:05,800 INFO L225 Difference]: With dead ends: 589 [2022-01-31 16:16:05,800 INFO L226 Difference]: Without dead ends: 589 [2022-01-31 16:16:05,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:16:05,800 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 624 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:05,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 772 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 16:16:05,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-01-31 16:16:05,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 566. [2022-01-31 16:16:05,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 449 states have (on average 1.265033407572383) internal successors, (568), 460 states have internal predecessors, (568), 66 states have call successors, (66), 43 states have call predecessors, (66), 50 states have return successors, (83), 63 states have call predecessors, (83), 58 states have call successors, (83) [2022-01-31 16:16:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 717 transitions. [2022-01-31 16:16:05,806 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 717 transitions. Word has length 61 [2022-01-31 16:16:05,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:05,806 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 717 transitions. [2022-01-31 16:16:05,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:16:05,806 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 717 transitions. [2022-01-31 16:16:05,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 16:16:05,807 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:05,807 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-31 16:16:05,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 16:16:05,807 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:05,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:05,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1616264812, now seen corresponding path program 1 times [2022-01-31 16:16:05,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:05,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97753469] [2022-01-31 16:16:05,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:05,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 16:16:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:06,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:06,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:06,041 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-31 16:16:06,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:06,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97753469] [2022-01-31 16:16:06,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97753469] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:06,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:06,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:16:06,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827672436] [2022-01-31 16:16:06,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:06,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:16:06,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:06,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:16:06,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:16:06,043 INFO L87 Difference]: Start difference. First operand 566 states and 717 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:16:06,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:06,767 INFO L93 Difference]: Finished difference Result 538 states and 675 transitions. [2022-01-31 16:16:06,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:16:06,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2022-01-31 16:16:06,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:06,769 INFO L225 Difference]: With dead ends: 538 [2022-01-31 16:16:06,769 INFO L226 Difference]: Without dead ends: 538 [2022-01-31 16:16:06,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:16:06,770 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 556 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:06,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [563 Valid, 1124 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 16:16:06,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-01-31 16:16:06,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 511. [2022-01-31 16:16:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 402 states have (on average 1.2537313432835822) internal successors, (504), 410 states have internal predecessors, (504), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (72), 59 states have call predecessors, (72), 56 states have call successors, (72) [2022-01-31 16:16:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 639 transitions. [2022-01-31 16:16:06,775 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 639 transitions. Word has length 64 [2022-01-31 16:16:06,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:06,775 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 639 transitions. [2022-01-31 16:16:06,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:16:06,775 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 639 transitions. [2022-01-31 16:16:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-31 16:16:06,776 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:06,776 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-31 16:16:06,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 16:16:06,777 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:06,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:06,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1336270132, now seen corresponding path program 1 times [2022-01-31 16:16:06,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:06,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100768611] [2022-01-31 16:16:06,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:06,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:06,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:06,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:06,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:06,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:16:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:06,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:16:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:06,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 16:16:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:06,968 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-31 16:16:06,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:06,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100768611] [2022-01-31 16:16:06,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100768611] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:06,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:06,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 16:16:06,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363326401] [2022-01-31 16:16:06,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:06,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 16:16:06,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:06,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 16:16:06,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:16:06,969 INFO L87 Difference]: Start difference. First operand 511 states and 639 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:16:08,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:08,115 INFO L93 Difference]: Finished difference Result 542 states and 675 transitions. [2022-01-31 16:16:08,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 16:16:08,115 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2022-01-31 16:16:08,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:08,117 INFO L225 Difference]: With dead ends: 542 [2022-01-31 16:16:08,117 INFO L226 Difference]: Without dead ends: 524 [2022-01-31 16:16:08,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:16:08,117 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 575 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 2588 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 2773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 2588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:08,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [588 Valid, 1192 Invalid, 2773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 2588 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 16:16:08,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-01-31 16:16:08,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 508. [2022-01-31 16:16:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 399 states have (on average 1.255639097744361) internal successors, (501), 408 states have internal predecessors, (501), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (71), 58 states have call predecessors, (71), 56 states have call successors, (71) [2022-01-31 16:16:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 635 transitions. [2022-01-31 16:16:08,125 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 635 transitions. Word has length 59 [2022-01-31 16:16:08,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:08,125 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 635 transitions. [2022-01-31 16:16:08,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:16:08,125 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 635 transitions. [2022-01-31 16:16:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 16:16:08,130 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:08,130 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-31 16:16:08,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-31 16:16:08,130 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:08,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:08,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1613674778, now seen corresponding path program 1 times [2022-01-31 16:16:08,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:08,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301703776] [2022-01-31 16:16:08,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:08,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:08,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:08,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:08,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:08,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:08,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 16:16:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:08,291 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-31 16:16:08,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:08,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301703776] [2022-01-31 16:16:08,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301703776] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:08,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:08,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 16:16:08,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525249666] [2022-01-31 16:16:08,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:08,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 16:16:08,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:08,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 16:16:08,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:16:08,293 INFO L87 Difference]: Start difference. First operand 508 states and 635 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:16:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:09,167 INFO L93 Difference]: Finished difference Result 535 states and 666 transitions. [2022-01-31 16:16:09,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 16:16:09,167 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2022-01-31 16:16:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:09,169 INFO L225 Difference]: With dead ends: 535 [2022-01-31 16:16:09,169 INFO L226 Difference]: Without dead ends: 520 [2022-01-31 16:16:09,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:16:09,169 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 487 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:09,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [491 Valid, 1547 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:16:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-01-31 16:16:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 504. [2022-01-31 16:16:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 396 states have (on average 1.255050505050505) internal successors, (497), 405 states have internal predecessors, (497), 62 states have call successors, (62), 42 states have call predecessors, (62), 45 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70) [2022-01-31 16:16:09,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 629 transitions. [2022-01-31 16:16:09,175 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 629 transitions. Word has length 58 [2022-01-31 16:16:09,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:09,175 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 629 transitions. [2022-01-31 16:16:09,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:16:09,175 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 629 transitions. [2022-01-31 16:16:09,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 16:16:09,176 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:09,176 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-31 16:16:09,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-31 16:16:09,176 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:09,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:09,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2114727091, now seen corresponding path program 1 times [2022-01-31 16:16:09,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:09,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969482212] [2022-01-31 16:16:09,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:09,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:09,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:09,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:09,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:09,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:09,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 16:16:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:09,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:16:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:09,397 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-31 16:16:09,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:09,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969482212] [2022-01-31 16:16:09,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969482212] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:09,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:09,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:16:09,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741209039] [2022-01-31 16:16:09,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:09,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:16:09,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:09,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:16:09,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:16:09,399 INFO L87 Difference]: Start difference. First operand 504 states and 629 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:16:10,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:10,423 INFO L93 Difference]: Finished difference Result 536 states and 666 transitions. [2022-01-31 16:16:10,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:16:10,424 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2022-01-31 16:16:10,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:10,425 INFO L225 Difference]: With dead ends: 536 [2022-01-31 16:16:10,425 INFO L226 Difference]: Without dead ends: 515 [2022-01-31 16:16:10,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:16:10,426 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 332 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 2113 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:10,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 877 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2113 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 16:16:10,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-01-31 16:16:10,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 499. [2022-01-31 16:16:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.251908396946565) internal successors, (492), 401 states have internal predecessors, (492), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2022-01-31 16:16:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 621 transitions. [2022-01-31 16:16:10,432 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 621 transitions. Word has length 60 [2022-01-31 16:16:10,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:10,432 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 621 transitions. [2022-01-31 16:16:10,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:16:10,432 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 621 transitions. [2022-01-31 16:16:10,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 16:16:10,433 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:10,433 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, 1, 1, 1, 1] [2022-01-31 16:16:10,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-31 16:16:10,433 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:10,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:10,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1861314870, now seen corresponding path program 1 times [2022-01-31 16:16:10,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:10,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509343011] [2022-01-31 16:16:10,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:10,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:10,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:10,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:10,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:10,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 16:16:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:10,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:10,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:10,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:10,604 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-31 16:16:10,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:10,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509343011] [2022-01-31 16:16:10,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509343011] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:10,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:10,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:16:10,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021716220] [2022-01-31 16:16:10,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:10,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:16:10,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:10,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:16:10,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:16:10,607 INFO L87 Difference]: Start difference. First operand 499 states and 621 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:16:11,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:11,478 INFO L93 Difference]: Finished difference Result 521 states and 649 transitions. [2022-01-31 16:16:11,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:16:11,478 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2022-01-31 16:16:11,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:11,480 INFO L225 Difference]: With dead ends: 521 [2022-01-31 16:16:11,482 INFO L226 Difference]: Without dead ends: 521 [2022-01-31 16:16:11,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-01-31 16:16:11,488 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 757 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:11,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 1011 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 16:16:11,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-01-31 16:16:11,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 499. [2022-01-31 16:16:11,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.2468193384223918) internal successors, (490), 401 states have internal predecessors, (490), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2022-01-31 16:16:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions. [2022-01-31 16:16:11,494 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 68 [2022-01-31 16:16:11,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:11,494 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions. [2022-01-31 16:16:11,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:16:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions. [2022-01-31 16:16:11,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 16:16:11,495 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:11,495 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-31 16:16:11,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-31 16:16:11,495 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:11,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:11,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1116193296, now seen corresponding path program 1 times [2022-01-31 16:16:11,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:11,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838099325] [2022-01-31 16:16:11,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:11,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:11,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:11,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:11,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:11,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:16:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:11,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:16:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:11,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:16:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:11,635 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-31 16:16:11,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:11,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838099325] [2022-01-31 16:16:11,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838099325] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:11,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:11,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:16:11,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645207277] [2022-01-31 16:16:11,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:11,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:16:11,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:11,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:16:11,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:16:11,638 INFO L87 Difference]: Start difference. First operand 499 states and 619 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:16:12,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:12,615 INFO L93 Difference]: Finished difference Result 519 states and 644 transitions. [2022-01-31 16:16:12,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:16:12,616 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2022-01-31 16:16:12,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:12,617 INFO L225 Difference]: With dead ends: 519 [2022-01-31 16:16:12,617 INFO L226 Difference]: Without dead ends: 519 [2022-01-31 16:16:12,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:16:12,618 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 321 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:12,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 754 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 16:16:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-01-31 16:16:12,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 503. [2022-01-31 16:16:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 396 states have (on average 1.244949494949495) internal successors, (493), 404 states have internal predecessors, (493), 61 states have call successors, (61), 42 states have call predecessors, (61), 45 states have return successors, (69), 57 states have call predecessors, (69), 54 states have call successors, (69) [2022-01-31 16:16:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 623 transitions. [2022-01-31 16:16:12,622 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 623 transitions. Word has length 63 [2022-01-31 16:16:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:12,623 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 623 transitions. [2022-01-31 16:16:12,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:16:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 623 transitions. [2022-01-31 16:16:12,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 16:16:12,623 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:16:12,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-31 16:16:12,624 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:12,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:12,624 INFO L85 PathProgramCache]: Analyzing trace with hash -929996240, now seen corresponding path program 1 times [2022-01-31 16:16:12,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:12,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595675575] [2022-01-31 16:16:12,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:12,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:12,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:12,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:12,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:12,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:16:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:12,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:16:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:12,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:16:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:12,783 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-31 16:16:12,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:12,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595675575] [2022-01-31 16:16:12,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595675575] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:12,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:12,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:16:12,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797102968] [2022-01-31 16:16:12,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:12,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:16:12,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:12,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:16:12,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:16:12,785 INFO L87 Difference]: Start difference. First operand 503 states and 623 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:16:13,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:13,812 INFO L93 Difference]: Finished difference Result 505 states and 625 transitions. [2022-01-31 16:16:13,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:16:13,812 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2022-01-31 16:16:13,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:13,813 INFO L225 Difference]: With dead ends: 505 [2022-01-31 16:16:13,813 INFO L226 Difference]: Without dead ends: 505 [2022-01-31 16:16:13,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-01-31 16:16:13,814 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 671 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 2096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:13,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [685 Valid, 972 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 2096 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:16:13,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-01-31 16:16:13,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 489. [2022-01-31 16:16:13,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 384 states have (on average 1.2395833333333333) internal successors, (476), 391 states have internal predecessors, (476), 60 states have call successors, (60), 42 states have call predecessors, (60), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2022-01-31 16:16:13,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 604 transitions. [2022-01-31 16:16:13,819 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 604 transitions. Word has length 63 [2022-01-31 16:16:13,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:13,819 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 604 transitions. [2022-01-31 16:16:13,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:16:13,819 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 604 transitions. [2022-01-31 16:16:13,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 16:16:13,833 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:13,833 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:16:13,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-31 16:16:13,833 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:13,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:13,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1704717596, now seen corresponding path program 1 times [2022-01-31 16:16:13,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:13,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529461873] [2022-01-31 16:16:13,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:13,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:13,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:13,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:13,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:13,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 16:16:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:13,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:13,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:13,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:13,998 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-31 16:16:13,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:13,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529461873] [2022-01-31 16:16:13,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529461873] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:13,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:13,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:16:13,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791204795] [2022-01-31 16:16:13,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:13,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:16:13,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:13,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:16:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:16:13,999 INFO L87 Difference]: Start difference. First operand 489 states and 604 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:16:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:14,721 INFO L93 Difference]: Finished difference Result 524 states and 652 transitions. [2022-01-31 16:16:14,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 16:16:14,721 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2022-01-31 16:16:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:14,723 INFO L225 Difference]: With dead ends: 524 [2022-01-31 16:16:14,723 INFO L226 Difference]: Without dead ends: 524 [2022-01-31 16:16:14,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:16:14,723 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 556 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:14,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 1315 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 16:16:14,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-01-31 16:16:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 489. [2022-01-31 16:16:14,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 384 states have (on average 1.234375) internal successors, (474), 391 states have internal predecessors, (474), 60 states have call successors, (60), 42 states have call predecessors, (60), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2022-01-31 16:16:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 602 transitions. [2022-01-31 16:16:14,728 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 602 transitions. Word has length 71 [2022-01-31 16:16:14,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:14,728 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 602 transitions. [2022-01-31 16:16:14,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:16:14,728 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 602 transitions. [2022-01-31 16:16:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 16:16:14,729 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:14,729 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-31 16:16:14,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-31 16:16:14,729 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:14,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1439851345, now seen corresponding path program 1 times [2022-01-31 16:16:14,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:14,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56707253] [2022-01-31 16:16:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:14,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:14,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:14,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:14,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:14,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:14,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:16:14,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:14,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56707253] [2022-01-31 16:16:14,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56707253] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:14,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:14,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 16:16:14,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258209859] [2022-01-31 16:16:14,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:14,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 16:16:14,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:14,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 16:16:14,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:16:14,904 INFO L87 Difference]: Start difference. First operand 489 states and 602 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:16:15,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:15,757 INFO L93 Difference]: Finished difference Result 519 states and 637 transitions. [2022-01-31 16:16:15,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:16:15,757 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2022-01-31 16:16:15,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:15,758 INFO L225 Difference]: With dead ends: 519 [2022-01-31 16:16:15,759 INFO L226 Difference]: Without dead ends: 501 [2022-01-31 16:16:15,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:16:15,759 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 357 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 2179 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 2289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:15,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 1611 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2179 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:16:15,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-01-31 16:16:15,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 485. [2022-01-31 16:16:15,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 381 states have (on average 1.2335958005249343) internal successors, (470), 388 states have internal predecessors, (470), 59 states have call successors, (59), 42 states have call predecessors, (59), 44 states have return successors, (67), 55 states have call predecessors, (67), 53 states have call successors, (67) [2022-01-31 16:16:15,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 596 transitions. [2022-01-31 16:16:15,764 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 596 transitions. Word has length 63 [2022-01-31 16:16:15,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:15,765 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 596 transitions. [2022-01-31 16:16:15,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:16:15,765 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 596 transitions. [2022-01-31 16:16:15,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 16:16:15,765 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:15,765 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-31 16:16:15,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-31 16:16:15,766 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:15,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:15,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1734732644, now seen corresponding path program 1 times [2022-01-31 16:16:15,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:15,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079539334] [2022-01-31 16:16:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:15,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:15,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:15,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:15,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:15,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:16:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:15,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 16:16:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:15,913 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-31 16:16:15,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:15,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079539334] [2022-01-31 16:16:15,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079539334] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:15,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:15,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 16:16:15,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683985929] [2022-01-31 16:16:15,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:15,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 16:16:15,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:15,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 16:16:15,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:16:15,915 INFO L87 Difference]: Start difference. First operand 485 states and 596 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:16:16,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:16,733 INFO L93 Difference]: Finished difference Result 509 states and 624 transitions. [2022-01-31 16:16:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:16:16,734 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2022-01-31 16:16:16,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:16,735 INFO L225 Difference]: With dead ends: 509 [2022-01-31 16:16:16,735 INFO L226 Difference]: Without dead ends: 490 [2022-01-31 16:16:16,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:16:16,736 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 315 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 1970 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:16,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 1452 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1970 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:16:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-01-31 16:16:16,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 474. [2022-01-31 16:16:16,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 372 states have (on average 1.2311827956989247) internal successors, (458), 379 states have internal predecessors, (458), 58 states have call successors, (58), 42 states have call predecessors, (58), 43 states have return successors, (65), 53 states have call predecessors, (65), 52 states have call successors, (65) [2022-01-31 16:16:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 581 transitions. [2022-01-31 16:16:16,746 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 581 transitions. Word has length 64 [2022-01-31 16:16:16,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:16,746 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 581 transitions. [2022-01-31 16:16:16,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:16:16,746 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 581 transitions. [2022-01-31 16:16:16,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 16:16:16,746 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:16,747 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-31 16:16:16,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-31 16:16:16,747 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:16,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:16,747 INFO L85 PathProgramCache]: Analyzing trace with hash -144637562, now seen corresponding path program 1 times [2022-01-31 16:16:16,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:16,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62201199] [2022-01-31 16:16:16,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:16,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:16,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:16,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:16,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:16,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:16,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:16,894 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-31 16:16:16,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:16,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62201199] [2022-01-31 16:16:16,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62201199] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:16,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:16,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 16:16:16,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751810436] [2022-01-31 16:16:16,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:16,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 16:16:16,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:16,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 16:16:16,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:16:16,896 INFO L87 Difference]: Start difference. First operand 474 states and 581 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:16:17,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:17,811 INFO L93 Difference]: Finished difference Result 504 states and 616 transitions. [2022-01-31 16:16:17,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:16:17,811 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2022-01-31 16:16:17,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:17,813 INFO L225 Difference]: With dead ends: 504 [2022-01-31 16:16:17,813 INFO L226 Difference]: Without dead ends: 485 [2022-01-31 16:16:17,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:16:17,813 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 293 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 2373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:17,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 1681 Invalid, 2373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 16:16:17,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-01-31 16:16:17,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2022-01-31 16:16:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 368 states have (on average 1.2309782608695652) internal successors, (453), 375 states have internal predecessors, (453), 57 states have call successors, (57), 42 states have call predecessors, (57), 43 states have return successors, (64), 52 states have call predecessors, (64), 51 states have call successors, (64) [2022-01-31 16:16:17,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 574 transitions. [2022-01-31 16:16:17,818 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 574 transitions. Word has length 64 [2022-01-31 16:16:17,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:17,819 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 574 transitions. [2022-01-31 16:16:17,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:16:17,819 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 574 transitions. [2022-01-31 16:16:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 16:16:17,819 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:17,819 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-31 16:16:17,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-31 16:16:17,820 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:17,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:17,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1120155272, now seen corresponding path program 1 times [2022-01-31 16:16:17,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:17,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056944512] [2022-01-31 16:16:17,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:17,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:17,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:17,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:17,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:17,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:18,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:18,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-31 16:16:18,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:18,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056944512] [2022-01-31 16:16:18,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056944512] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:18,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:18,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 16:16:18,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88010723] [2022-01-31 16:16:18,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:18,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 16:16:18,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:18,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 16:16:18,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:16:18,028 INFO L87 Difference]: Start difference. First operand 469 states and 574 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:16:18,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:18,776 INFO L93 Difference]: Finished difference Result 499 states and 609 transitions. [2022-01-31 16:16:18,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:16:18,776 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2022-01-31 16:16:18,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:18,777 INFO L225 Difference]: With dead ends: 499 [2022-01-31 16:16:18,777 INFO L226 Difference]: Without dead ends: 481 [2022-01-31 16:16:18,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:16:18,778 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 337 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 1946 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:18,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 1473 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1946 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 16:16:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-01-31 16:16:18,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 465. [2022-01-31 16:16:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2301369863013698) internal successors, (449), 372 states have internal predecessors, (449), 56 states have call successors, (56), 42 states have call predecessors, (56), 43 states have return successors, (63), 51 states have call predecessors, (63), 50 states have call successors, (63) [2022-01-31 16:16:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 568 transitions. [2022-01-31 16:16:18,782 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 568 transitions. Word has length 64 [2022-01-31 16:16:18,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:18,782 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 568 transitions. [2022-01-31 16:16:18,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:16:18,782 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 568 transitions. [2022-01-31 16:16:18,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-31 16:16:18,783 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:18,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, 1, 1, 1, 1, 1, 1] [2022-01-31 16:16:18,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-31 16:16:18,783 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:18,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:18,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1809242026, now seen corresponding path program 1 times [2022-01-31 16:16:18,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:18,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394816680] [2022-01-31 16:16:18,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:18,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:18,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:18,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:18,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:18,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 16:16:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:18,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:18,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:18,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:16:18,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:18,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394816680] [2022-01-31 16:16:18,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394816680] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:18,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:18,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 16:16:18,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48309568] [2022-01-31 16:16:18,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:18,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 16:16:18,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:18,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 16:16:18,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-31 16:16:18,948 INFO L87 Difference]: Start difference. First operand 465 states and 568 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:16:19,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:19,479 INFO L93 Difference]: Finished difference Result 625 states and 761 transitions. [2022-01-31 16:16:19,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 16:16:19,479 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2022-01-31 16:16:19,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:19,481 INFO L225 Difference]: With dead ends: 625 [2022-01-31 16:16:19,481 INFO L226 Difference]: Without dead ends: 625 [2022-01-31 16:16:19,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:16:19,481 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 879 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:19,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [891 Valid, 918 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 16:16:19,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-01-31 16:16:19,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 586. [2022-01-31 16:16:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 458 states have (on average 1.220524017467249) internal successors, (559), 467 states have internal predecessors, (559), 69 states have call successors, (69), 52 states have call predecessors, (69), 58 states have return successors, (88), 67 states have call predecessors, (88), 64 states have call successors, (88) [2022-01-31 16:16:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 716 transitions. [2022-01-31 16:16:19,487 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 716 transitions. Word has length 70 [2022-01-31 16:16:19,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:19,487 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 716 transitions. [2022-01-31 16:16:19,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:16:19,487 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 716 transitions. [2022-01-31 16:16:19,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 16:16:19,488 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:19,488 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, 1, 1, 1, 1] [2022-01-31 16:16:19,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-31 16:16:19,488 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:19,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:19,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1680266649, now seen corresponding path program 1 times [2022-01-31 16:16:19,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:19,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769393895] [2022-01-31 16:16:19,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:19,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:19,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:19,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:19,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:19,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:19,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-31 16:16:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:19,629 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-31 16:16:19,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:19,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769393895] [2022-01-31 16:16:19,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769393895] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:19,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:19,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 16:16:19,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917514655] [2022-01-31 16:16:19,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:19,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 16:16:19,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:19,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 16:16:19,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:16:19,630 INFO L87 Difference]: Start difference. First operand 586 states and 716 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:16:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:20,448 INFO L93 Difference]: Finished difference Result 616 states and 752 transitions. [2022-01-31 16:16:20,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:16:20,449 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 68 [2022-01-31 16:16:20,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:20,450 INFO L225 Difference]: With dead ends: 616 [2022-01-31 16:16:20,450 INFO L226 Difference]: Without dead ends: 576 [2022-01-31 16:16:20,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:16:20,451 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 402 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:20,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [408 Valid, 1438 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:16:20,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-01-31 16:16:20,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 560. [2022-01-31 16:16:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 437 states have (on average 1.2196796338672768) internal successors, (533), 446 states have internal predecessors, (533), 66 states have call successors, (66), 50 states have call predecessors, (66), 56 states have return successors, (85), 64 states have call predecessors, (85), 61 states have call successors, (85) [2022-01-31 16:16:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 684 transitions. [2022-01-31 16:16:20,456 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 684 transitions. Word has length 68 [2022-01-31 16:16:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:20,456 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 684 transitions. [2022-01-31 16:16:20,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:16:20,456 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 684 transitions. [2022-01-31 16:16:20,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 16:16:20,457 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:20,457 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:16:20,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-31 16:16:20,457 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:20,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:20,457 INFO L85 PathProgramCache]: Analyzing trace with hash -815860561, now seen corresponding path program 1 times [2022-01-31 16:16:20,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:20,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049364710] [2022-01-31 16:16:20,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:20,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:20,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:20,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:20,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:20,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:16:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:20,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:16:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:20,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:16:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:20,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 16:16:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:20,649 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-31 16:16:20,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:20,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049364710] [2022-01-31 16:16:20,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049364710] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:20,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:20,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 16:16:20,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220014254] [2022-01-31 16:16:20,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:20,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 16:16:20,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:20,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 16:16:20,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:16:20,650 INFO L87 Difference]: Start difference. First operand 560 states and 684 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:16:21,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:21,719 INFO L93 Difference]: Finished difference Result 586 states and 715 transitions. [2022-01-31 16:16:21,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 16:16:21,719 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2022-01-31 16:16:21,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:21,720 INFO L225 Difference]: With dead ends: 586 [2022-01-31 16:16:21,720 INFO L226 Difference]: Without dead ends: 535 [2022-01-31 16:16:21,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-01-31 16:16:21,721 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 488 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 2616 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 2760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:21,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 902 Invalid, 2760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2616 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 16:16:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-01-31 16:16:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 519. [2022-01-31 16:16:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 403 states have (on average 1.2133995037220844) internal successors, (489), 412 states have internal predecessors, (489), 62 states have call successors, (62), 47 states have call predecessors, (62), 53 states have return successors, (81), 60 states have call predecessors, (81), 57 states have call successors, (81) [2022-01-31 16:16:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 632 transitions. [2022-01-31 16:16:21,736 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 632 transitions. Word has length 71 [2022-01-31 16:16:21,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:21,736 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 632 transitions. [2022-01-31 16:16:21,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:16:21,736 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 632 transitions. [2022-01-31 16:16:21,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-31 16:16:21,737 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:21,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:16:21,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-31 16:16:21,737 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:21,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:21,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1160220987, now seen corresponding path program 1 times [2022-01-31 16:16:21,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:21,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771973579] [2022-01-31 16:16:21,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:21,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:21,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:21,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:21,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:21,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 16:16:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:21,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:21,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:21,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:21,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 16:16:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:21,864 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-31 16:16:21,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:21,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771973579] [2022-01-31 16:16:21,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771973579] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:21,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:21,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 16:16:21,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525396795] [2022-01-31 16:16:21,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:21,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 16:16:21,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:21,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 16:16:21,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:16:21,866 INFO L87 Difference]: Start difference. First operand 519 states and 632 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 16:16:22,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:22,779 INFO L93 Difference]: Finished difference Result 523 states and 631 transitions. [2022-01-31 16:16:22,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 16:16:22,779 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 82 [2022-01-31 16:16:22,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:22,780 INFO L225 Difference]: With dead ends: 523 [2022-01-31 16:16:22,781 INFO L226 Difference]: Without dead ends: 523 [2022-01-31 16:16:22,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-01-31 16:16:22,781 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 374 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:22,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 1095 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:16:22,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-01-31 16:16:22,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 501. [2022-01-31 16:16:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 389 states have (on average 1.2133676092544987) internal successors, (472), 397 states have internal predecessors, (472), 60 states have call successors, (60), 47 states have call predecessors, (60), 51 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70) [2022-01-31 16:16:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 602 transitions. [2022-01-31 16:16:22,786 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 602 transitions. Word has length 82 [2022-01-31 16:16:22,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:22,786 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 602 transitions. [2022-01-31 16:16:22,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 16:16:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 602 transitions. [2022-01-31 16:16:22,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-31 16:16:22,787 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:22,787 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:16:22,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-31 16:16:22,787 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:22,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:22,787 INFO L85 PathProgramCache]: Analyzing trace with hash 633938585, now seen corresponding path program 1 times [2022-01-31 16:16:22,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:22,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231140094] [2022-01-31 16:16:22,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:22,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:22,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:22,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:22,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:22,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 16:16:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:22,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:22,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:22,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:22,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-31 16:16:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:22,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:22,969 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-31 16:16:22,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:22,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231140094] [2022-01-31 16:16:22,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231140094] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:22,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:22,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 16:16:22,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025644713] [2022-01-31 16:16:22,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:22,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 16:16:22,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:22,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 16:16:22,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:16:22,970 INFO L87 Difference]: Start difference. First operand 501 states and 602 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 16:16:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:23,683 INFO L93 Difference]: Finished difference Result 585 states and 740 transitions. [2022-01-31 16:16:23,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 16:16:23,684 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2022-01-31 16:16:23,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:23,685 INFO L225 Difference]: With dead ends: 585 [2022-01-31 16:16:23,685 INFO L226 Difference]: Without dead ends: 585 [2022-01-31 16:16:23,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-01-31 16:16:23,692 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 453 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:23,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [464 Valid, 1652 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 16:16:23,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-01-31 16:16:23,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 465. [2022-01-31 16:16:23,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2136986301369863) internal successors, (443), 371 states have internal predecessors, (443), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60) [2022-01-31 16:16:23,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 556 transitions. [2022-01-31 16:16:23,702 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 556 transitions. Word has length 83 [2022-01-31 16:16:23,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:23,702 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 556 transitions. [2022-01-31 16:16:23,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 16:16:23,702 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 556 transitions. [2022-01-31 16:16:23,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-31 16:16:23,703 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:23,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 16:16:23,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-31 16:16:23,703 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:23,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:23,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1833243044, now seen corresponding path program 1 times [2022-01-31 16:16:23,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:23,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313804283] [2022-01-31 16:16:23,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:23,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:23,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:23,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:23,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:23,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:23,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:23,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:23,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:23,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:23,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 16:16:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:23,919 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-31 16:16:23,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:23,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313804283] [2022-01-31 16:16:23,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313804283] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:23,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:23,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 16:16:23,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897194898] [2022-01-31 16:16:23,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:23,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 16:16:23,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:23,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 16:16:23,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:16:23,920 INFO L87 Difference]: Start difference. First operand 465 states and 556 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 16:16:24,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:24,633 INFO L93 Difference]: Finished difference Result 523 states and 626 transitions. [2022-01-31 16:16:24,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 16:16:24,633 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2022-01-31 16:16:24,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:24,635 INFO L225 Difference]: With dead ends: 523 [2022-01-31 16:16:24,635 INFO L226 Difference]: Without dead ends: 505 [2022-01-31 16:16:24,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-01-31 16:16:24,635 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 571 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:24,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 1560 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 16:16:24,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-01-31 16:16:24,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 473. [2022-01-31 16:16:24,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 372 states have (on average 1.2096774193548387) internal successors, (450), 378 states have internal predecessors, (450), 53 states have call successors, (53), 41 states have call predecessors, (53), 47 states have return successors, (63), 54 states have call predecessors, (63), 49 states have call successors, (63) [2022-01-31 16:16:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 566 transitions. [2022-01-31 16:16:24,640 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 566 transitions. Word has length 88 [2022-01-31 16:16:24,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:24,640 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 566 transitions. [2022-01-31 16:16:24,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 16:16:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 566 transitions. [2022-01-31 16:16:24,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-31 16:16:24,641 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:24,641 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, 1, 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-31 16:16:24,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-31 16:16:24,641 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:24,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:24,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2018356459, now seen corresponding path program 1 times [2022-01-31 16:16:24,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:24,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127744024] [2022-01-31 16:16:24,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:24,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:24,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:24,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:24,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:24,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:24,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:24,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:24,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:24,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:24,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-31 16:16:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:24,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:16:24,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:24,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127744024] [2022-01-31 16:16:24,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127744024] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:24,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:24,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 16:16:24,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108642957] [2022-01-31 16:16:24,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:24,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 16:16:24,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:24,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 16:16:24,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:16:24,841 INFO L87 Difference]: Start difference. First operand 473 states and 566 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 16:16:25,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:25,686 INFO L93 Difference]: Finished difference Result 523 states and 625 transitions. [2022-01-31 16:16:25,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 16:16:25,687 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2022-01-31 16:16:25,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:25,688 INFO L225 Difference]: With dead ends: 523 [2022-01-31 16:16:25,688 INFO L226 Difference]: Without dead ends: 505 [2022-01-31 16:16:25,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-01-31 16:16:25,689 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 251 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 1845 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:25,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 1742 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1845 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:16:25,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-01-31 16:16:25,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 465. [2022-01-31 16:16:25,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.210958904109589) internal successors, (442), 371 states have internal predecessors, (442), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60) [2022-01-31 16:16:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 555 transitions. [2022-01-31 16:16:25,695 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 555 transitions. Word has length 89 [2022-01-31 16:16:25,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:25,695 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 555 transitions. [2022-01-31 16:16:25,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 16:16:25,695 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 555 transitions. [2022-01-31 16:16:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-01-31 16:16:25,696 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:25,696 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 16:16:25,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-31 16:16:25,696 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:25,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:25,697 INFO L85 PathProgramCache]: Analyzing trace with hash -72110269, now seen corresponding path program 1 times [2022-01-31 16:16:25,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:25,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716588594] [2022-01-31 16:16:25,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:25,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:25,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:25,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:25,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:25,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:25,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:25,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:25,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:25,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:26,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 16:16:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:26,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 16:16:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:26,008 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-31 16:16:26,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:26,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716588594] [2022-01-31 16:16:26,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716588594] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:26,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:26,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 16:16:26,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294418296] [2022-01-31 16:16:26,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:26,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 16:16:26,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:26,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 16:16:26,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:16:26,010 INFO L87 Difference]: Start difference. First operand 465 states and 555 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-31 16:16:26,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:26,624 INFO L93 Difference]: Finished difference Result 485 states and 577 transitions. [2022-01-31 16:16:26,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 16:16:26,624 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2022-01-31 16:16:26,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:26,625 INFO L225 Difference]: With dead ends: 485 [2022-01-31 16:16:26,625 INFO L226 Difference]: Without dead ends: 483 [2022-01-31 16:16:26,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:16:26,626 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 390 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:26,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 1161 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 16:16:26,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-01-31 16:16:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 459. [2022-01-31 16:16:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 361 states have (on average 1.2132963988919667) internal successors, (438), 367 states have internal predecessors, (438), 51 states have call successors, (51), 41 states have call predecessors, (51), 46 states have return successors, (57), 51 states have call predecessors, (57), 47 states have call successors, (57) [2022-01-31 16:16:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 546 transitions. [2022-01-31 16:16:26,630 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 546 transitions. Word has length 98 [2022-01-31 16:16:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:26,631 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 546 transitions. [2022-01-31 16:16:26,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-31 16:16:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 546 transitions. [2022-01-31 16:16:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-31 16:16:26,631 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:26,632 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, 1, 1, 1, 1, 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-31 16:16:26,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-31 16:16:26,632 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:26,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash 221001860, now seen corresponding path program 1 times [2022-01-31 16:16:26,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:26,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797936095] [2022-01-31 16:16:26,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:26,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:26,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:26,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:26,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:26,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:26,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 16:16:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:26,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:16:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:26,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:16:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:26,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 16:16:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:26,799 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-31 16:16:26,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:26,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797936095] [2022-01-31 16:16:26,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797936095] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:26,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:26,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 16:16:26,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742811586] [2022-01-31 16:16:26,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:26,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 16:16:26,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:26,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 16:16:26,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:16:26,801 INFO L87 Difference]: Start difference. First operand 459 states and 546 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 6 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-31 16:16:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:28,676 INFO L93 Difference]: Finished difference Result 1310 states and 1519 transitions. [2022-01-31 16:16:28,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 16:16:28,676 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 6 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2022-01-31 16:16:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:28,679 INFO L225 Difference]: With dead ends: 1310 [2022-01-31 16:16:28,679 INFO L226 Difference]: Without dead ends: 1310 [2022-01-31 16:16:28,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=374, Invalid=1108, Unknown=0, NotChecked=0, Total=1482 [2022-01-31 16:16:28,680 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 1541 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 2098 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 2672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 2098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:28,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1544 Valid, 839 Invalid, 2672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 2098 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 16:16:28,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2022-01-31 16:16:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1036. [2022-01-31 16:16:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 820 states have (on average 1.197560975609756) internal successors, (982), 833 states have internal predecessors, (982), 103 states have call successors, (103), 93 states have call predecessors, (103), 112 states have return successors, (128), 111 states have call predecessors, (128), 99 states have call successors, (128) [2022-01-31 16:16:28,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1213 transitions. [2022-01-31 16:16:28,712 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1213 transitions. Word has length 92 [2022-01-31 16:16:28,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:28,713 INFO L470 AbstractCegarLoop]: Abstraction has 1036 states and 1213 transitions. [2022-01-31 16:16:28,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 6 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-31 16:16:28,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1213 transitions. [2022-01-31 16:16:28,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-31 16:16:28,714 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:28,714 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 16:16:28,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-31 16:16:28,714 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:28,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:28,715 INFO L85 PathProgramCache]: Analyzing trace with hash 457485908, now seen corresponding path program 1 times [2022-01-31 16:16:28,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:28,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171649793] [2022-01-31 16:16:28,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:28,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:28,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:28,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:28,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:28,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:28,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:28,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:28,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:28,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:28,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 16:16:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:28,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 16:16:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:28,936 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-31 16:16:28,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:28,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171649793] [2022-01-31 16:16:28,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171649793] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:28,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:28,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 16:16:28,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546190930] [2022-01-31 16:16:28,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:28,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 16:16:28,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:28,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 16:16:28,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:16:28,938 INFO L87 Difference]: Start difference. First operand 1036 states and 1213 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-31 16:16:30,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:30,166 INFO L93 Difference]: Finished difference Result 1959 states and 2303 transitions. [2022-01-31 16:16:30,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 16:16:30,167 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 99 [2022-01-31 16:16:30,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:30,170 INFO L225 Difference]: With dead ends: 1959 [2022-01-31 16:16:30,170 INFO L226 Difference]: Without dead ends: 1897 [2022-01-31 16:16:30,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2022-01-31 16:16:30,172 INFO L933 BasicCegarLoop]: 461 mSDtfsCounter, 516 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 2167 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 2329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 2167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:30,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [529 Valid, 1950 Invalid, 2329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 2167 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 16:16:30,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2022-01-31 16:16:30,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1000. [2022-01-31 16:16:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 792 states have (on average 1.196969696969697) internal successors, (948), 803 states have internal predecessors, (948), 97 states have call successors, (97), 91 states have call predecessors, (97), 110 states have return successors, (122), 105 states have call predecessors, (122), 93 states have call successors, (122) [2022-01-31 16:16:30,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1167 transitions. [2022-01-31 16:16:30,182 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1167 transitions. Word has length 99 [2022-01-31 16:16:30,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:30,182 INFO L470 AbstractCegarLoop]: Abstraction has 1000 states and 1167 transitions. [2022-01-31 16:16:30,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-31 16:16:30,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1167 transitions. [2022-01-31 16:16:30,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-31 16:16:30,184 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:30,184 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, 1, 1, 1, 1, 1, 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-31 16:16:30,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-31 16:16:30,184 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:30,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:30,184 INFO L85 PathProgramCache]: Analyzing trace with hash 925491343, now seen corresponding path program 1 times [2022-01-31 16:16:30,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:30,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285072566] [2022-01-31 16:16:30,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:30,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:30,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:30,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:30,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:30,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:30,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 16:16:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:30,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:16:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:30,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:16:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:30,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 16:16:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:30,363 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-31 16:16:30,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:30,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285072566] [2022-01-31 16:16:30,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285072566] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:30,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:30,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 16:16:30,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488801342] [2022-01-31 16:16:30,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:30,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 16:16:30,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:30,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 16:16:30,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:16:30,364 INFO L87 Difference]: Start difference. First operand 1000 states and 1167 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-31 16:16:31,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:31,167 INFO L93 Difference]: Finished difference Result 1007 states and 1173 transitions. [2022-01-31 16:16:31,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 16:16:31,167 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 93 [2022-01-31 16:16:31,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:31,169 INFO L225 Difference]: With dead ends: 1007 [2022-01-31 16:16:31,169 INFO L226 Difference]: Without dead ends: 804 [2022-01-31 16:16:31,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-01-31 16:16:31,169 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 297 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 2216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:31,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 588 Invalid, 2216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 2131 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 16:16:31,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-01-31 16:16:31,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 796. [2022-01-31 16:16:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 624 states have (on average 1.2003205128205128) internal successors, (749), 633 states have internal predecessors, (749), 81 states have call successors, (81), 76 states have call predecessors, (81), 90 states have return successors, (100), 86 states have call predecessors, (100), 78 states have call successors, (100) [2022-01-31 16:16:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 930 transitions. [2022-01-31 16:16:31,176 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 930 transitions. Word has length 93 [2022-01-31 16:16:31,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:31,176 INFO L470 AbstractCegarLoop]: Abstraction has 796 states and 930 transitions. [2022-01-31 16:16:31,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-31 16:16:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 930 transitions. [2022-01-31 16:16:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-31 16:16:31,177 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:31,177 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 16:16:31,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-31 16:16:31,177 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:31,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:31,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1426092271, now seen corresponding path program 1 times [2022-01-31 16:16:31,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:31,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966768048] [2022-01-31 16:16:31,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:31,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:31,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:31,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:31,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:31,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:31,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:16:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:31,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:16:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:31,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:31,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:31,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:31,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 16:16:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:31,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:31,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 16:16:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:31,441 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-31 16:16:31,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:31,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966768048] [2022-01-31 16:16:31,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966768048] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:31,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:31,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 16:16:31,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313622825] [2022-01-31 16:16:31,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:31,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 16:16:31,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:31,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 16:16:31,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:16:31,442 INFO L87 Difference]: Start difference. First operand 796 states and 930 transitions. Second operand has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2022-01-31 16:16:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:31,917 INFO L93 Difference]: Finished difference Result 872 states and 1024 transitions. [2022-01-31 16:16:31,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 16:16:31,918 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2022-01-31 16:16:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:31,919 INFO L225 Difference]: With dead ends: 872 [2022-01-31 16:16:31,919 INFO L226 Difference]: Without dead ends: 834 [2022-01-31 16:16:31,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2022-01-31 16:16:31,920 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 163 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:31,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 1188 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 16:16:31,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-01-31 16:16:31,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 814. [2022-01-31 16:16:31,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 640 states have (on average 1.1859375) internal successors, (759), 651 states have internal predecessors, (759), 83 states have call successors, (83), 76 states have call predecessors, (83), 90 states have return successors, (100), 86 states have call predecessors, (100), 78 states have call successors, (100) [2022-01-31 16:16:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 942 transitions. [2022-01-31 16:16:31,927 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 942 transitions. Word has length 104 [2022-01-31 16:16:31,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:31,927 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 942 transitions. [2022-01-31 16:16:31,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2022-01-31 16:16:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 942 transitions. [2022-01-31 16:16:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-31 16:16:31,928 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:31,928 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:16:31,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-31 16:16:31,928 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:31,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1466232135, now seen corresponding path program 1 times [2022-01-31 16:16:31,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:31,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475230306] [2022-01-31 16:16:31,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:31,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:31,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 16:16:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-31 16:16:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:16:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-31 16:16:32,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:32,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475230306] [2022-01-31 16:16:32,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475230306] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:32,100 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:32,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 16:16:32,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894295649] [2022-01-31 16:16:32,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:32,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 16:16:32,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:32,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 16:16:32,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:16:32,101 INFO L87 Difference]: Start difference. First operand 814 states and 942 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-31 16:16:32,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:32,404 INFO L93 Difference]: Finished difference Result 717 states and 809 transitions. [2022-01-31 16:16:32,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 16:16:32,404 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) Word has length 113 [2022-01-31 16:16:32,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:32,405 INFO L225 Difference]: With dead ends: 717 [2022-01-31 16:16:32,405 INFO L226 Difference]: Without dead ends: 717 [2022-01-31 16:16:32,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-01-31 16:16:32,407 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 219 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:32,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 805 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 16:16:32,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-01-31 16:16:32,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 449. [2022-01-31 16:16:32,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 354 states have (on average 1.1440677966101696) internal successors, (405), 358 states have internal predecessors, (405), 46 states have call successors, (46), 46 states have call predecessors, (46), 48 states have return successors, (48), 44 states have call predecessors, (48), 44 states have call successors, (48) [2022-01-31 16:16:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 499 transitions. [2022-01-31 16:16:32,412 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 499 transitions. Word has length 113 [2022-01-31 16:16:32,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:32,412 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 499 transitions. [2022-01-31 16:16:32,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-31 16:16:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 499 transitions. [2022-01-31 16:16:32,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-31 16:16:32,413 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:32,413 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 16:16:32,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-31 16:16:32,413 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:32,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:32,414 INFO L85 PathProgramCache]: Analyzing trace with hash -165727650, now seen corresponding path program 1 times [2022-01-31 16:16:32,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:32,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692928619] [2022-01-31 16:16:32,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:32,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:16:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:16:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 16:16:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 16:16:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 16:16:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:32,636 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-31 16:16:32,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:32,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692928619] [2022-01-31 16:16:32,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692928619] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:32,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:32,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 16:16:32,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989594979] [2022-01-31 16:16:32,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:32,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 16:16:32,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:32,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 16:16:32,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:16:32,638 INFO L87 Difference]: Start difference. First operand 449 states and 499 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 16:16:32,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:32,981 INFO L93 Difference]: Finished difference Result 477 states and 531 transitions. [2022-01-31 16:16:32,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:16:32,981 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2022-01-31 16:16:32,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:32,982 INFO L225 Difference]: With dead ends: 477 [2022-01-31 16:16:32,982 INFO L226 Difference]: Without dead ends: 477 [2022-01-31 16:16:32,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:16:32,985 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 256 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:32,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 688 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 16:16:32,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-01-31 16:16:32,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 457. [2022-01-31 16:16:32,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 360 states have (on average 1.1416666666666666) internal successors, (411), 364 states have internal predecessors, (411), 46 states have call successors, (46), 46 states have call predecessors, (46), 50 states have return successors, (50), 46 states have call predecessors, (50), 44 states have call successors, (50) [2022-01-31 16:16:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 507 transitions. [2022-01-31 16:16:32,990 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 507 transitions. Word has length 120 [2022-01-31 16:16:32,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:32,991 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 507 transitions. [2022-01-31 16:16:32,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 16:16:32,991 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 507 transitions. [2022-01-31 16:16:32,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-31 16:16:32,992 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:32,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 16:16:32,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-31 16:16:32,992 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:32,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:32,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1709722050, now seen corresponding path program 1 times [2022-01-31 16:16:32,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:32,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997159524] [2022-01-31 16:16:32,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:32,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:16:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:16:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 16:16:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 16:16:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 16:16:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,202 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-31 16:16:33,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:33,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997159524] [2022-01-31 16:16:33,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997159524] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:33,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:33,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 16:16:33,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685581116] [2022-01-31 16:16:33,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:33,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 16:16:33,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:33,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 16:16:33,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:16:33,204 INFO L87 Difference]: Start difference. First operand 457 states and 507 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 16:16:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:33,751 INFO L93 Difference]: Finished difference Result 477 states and 527 transitions. [2022-01-31 16:16:33,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:16:33,752 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2022-01-31 16:16:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:33,753 INFO L225 Difference]: With dead ends: 477 [2022-01-31 16:16:33,753 INFO L226 Difference]: Without dead ends: 469 [2022-01-31 16:16:33,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:16:33,753 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 132 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:33,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 784 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 16:16:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-01-31 16:16:33,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 457. [2022-01-31 16:16:33,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 360 states have (on average 1.136111111111111) internal successors, (409), 364 states have internal predecessors, (409), 46 states have call successors, (46), 46 states have call predecessors, (46), 50 states have return successors, (50), 46 states have call predecessors, (50), 44 states have call successors, (50) [2022-01-31 16:16:33,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 505 transitions. [2022-01-31 16:16:33,760 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 505 transitions. Word has length 120 [2022-01-31 16:16:33,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:33,760 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 505 transitions. [2022-01-31 16:16:33,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 16:16:33,761 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 505 transitions. [2022-01-31 16:16:33,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-31 16:16:33,762 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:33,762 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 16:16:33,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-01-31 16:16:33,763 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:33,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:33,763 INFO L85 PathProgramCache]: Analyzing trace with hash -232533850, now seen corresponding path program 1 times [2022-01-31 16:16:33,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:33,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706657949] [2022-01-31 16:16:33,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:33,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:16:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:16:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:33,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:34,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:34,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 16:16:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:34,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:34,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:16:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:34,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:34,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:34,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:34,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 16:16:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:34,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-31 16:16:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:34,138 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-31 16:16:34,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:34,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706657949] [2022-01-31 16:16:34,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706657949] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:34,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:34,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 16:16:34,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834868442] [2022-01-31 16:16:34,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:34,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 16:16:34,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:34,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 16:16:34,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2022-01-31 16:16:34,139 INFO L87 Difference]: Start difference. First operand 457 states and 505 transitions. Second operand has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 16:16:34,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:34,953 INFO L93 Difference]: Finished difference Result 581 states and 661 transitions. [2022-01-31 16:16:34,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 16:16:34,954 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 150 [2022-01-31 16:16:34,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:34,955 INFO L225 Difference]: With dead ends: 581 [2022-01-31 16:16:34,955 INFO L226 Difference]: Without dead ends: 531 [2022-01-31 16:16:34,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 16:16:34,955 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 198 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 2099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:34,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 1461 Invalid, 2099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2018 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 16:16:34,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-01-31 16:16:34,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 491. [2022-01-31 16:16:34,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 390 states have (on average 1.146153846153846) internal successors, (447), 394 states have internal predecessors, (447), 46 states have call successors, (46), 46 states have call predecessors, (46), 54 states have return successors, (54), 50 states have call predecessors, (54), 44 states have call successors, (54) [2022-01-31 16:16:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 547 transitions. [2022-01-31 16:16:34,959 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 547 transitions. Word has length 150 [2022-01-31 16:16:34,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:34,960 INFO L470 AbstractCegarLoop]: Abstraction has 491 states and 547 transitions. [2022-01-31 16:16:34,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 16:16:34,960 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 547 transitions. [2022-01-31 16:16:34,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-01-31 16:16:34,960 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:34,961 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 16:16:34,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-01-31 16:16:34,961 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:34,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:34,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2130033855, now seen corresponding path program 1 times [2022-01-31 16:16:34,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:34,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829668414] [2022-01-31 16:16:34,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:34,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:16:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:16:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 16:16:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:16:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-31 16:16:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 16:16:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-31 16:16:35,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:35,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829668414] [2022-01-31 16:16:35,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829668414] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:35,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:35,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 16:16:35,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763940234] [2022-01-31 16:16:35,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:35,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 16:16:35,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:35,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 16:16:35,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:16:35,230 INFO L87 Difference]: Start difference. First operand 491 states and 547 transitions. Second operand has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 16:16:35,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:35,833 INFO L93 Difference]: Finished difference Result 529 states and 589 transitions. [2022-01-31 16:16:35,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 16:16:35,834 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) Word has length 151 [2022-01-31 16:16:35,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:35,835 INFO L225 Difference]: With dead ends: 529 [2022-01-31 16:16:35,835 INFO L226 Difference]: Without dead ends: 519 [2022-01-31 16:16:35,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2022-01-31 16:16:35,835 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 116 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:35,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 1250 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 16:16:35,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-01-31 16:16:35,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 491. [2022-01-31 16:16:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 390 states have (on average 1.141025641025641) internal successors, (445), 394 states have internal predecessors, (445), 46 states have call successors, (46), 46 states have call predecessors, (46), 54 states have return successors, (54), 50 states have call predecessors, (54), 44 states have call successors, (54) [2022-01-31 16:16:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 545 transitions. [2022-01-31 16:16:35,848 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 545 transitions. Word has length 151 [2022-01-31 16:16:35,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:35,848 INFO L470 AbstractCegarLoop]: Abstraction has 491 states and 545 transitions. [2022-01-31 16:16:35,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 16:16:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 545 transitions. [2022-01-31 16:16:35,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-01-31 16:16:35,849 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:35,849 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 16:16:35,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-01-31 16:16:35,849 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:35,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:35,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1959969322, now seen corresponding path program 1 times [2022-01-31 16:16:35,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:35,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217562084] [2022-01-31 16:16:35,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:35,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:35,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:16:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:16:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 16:16:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:16:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-01-31 16:16:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-01-31 16:16:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-31 16:16:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 16:16:36,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:36,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217562084] [2022-01-31 16:16:36,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217562084] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:36,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:36,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 16:16:36,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65664721] [2022-01-31 16:16:36,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:36,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 16:16:36,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:36,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 16:16:36,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-01-31 16:16:36,183 INFO L87 Difference]: Start difference. First operand 491 states and 545 transitions. Second operand has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-31 16:16:36,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:36,801 INFO L93 Difference]: Finished difference Result 553 states and 621 transitions. [2022-01-31 16:16:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 16:16:36,802 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) Word has length 153 [2022-01-31 16:16:36,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:36,803 INFO L225 Difference]: With dead ends: 553 [2022-01-31 16:16:36,803 INFO L226 Difference]: Without dead ends: 491 [2022-01-31 16:16:36,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-01-31 16:16:36,803 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 199 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:36,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 1113 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 16:16:36,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-01-31 16:16:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 479. [2022-01-31 16:16:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 382 states have (on average 1.1282722513089005) internal successors, (431), 386 states have internal predecessors, (431), 44 states have call successors, (44), 44 states have call predecessors, (44), 52 states have return successors, (52), 48 states have call predecessors, (52), 42 states have call successors, (52) [2022-01-31 16:16:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 527 transitions. [2022-01-31 16:16:36,807 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 527 transitions. Word has length 153 [2022-01-31 16:16:36,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:36,808 INFO L470 AbstractCegarLoop]: Abstraction has 479 states and 527 transitions. [2022-01-31 16:16:36,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-31 16:16:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 527 transitions. [2022-01-31 16:16:36,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-31 16:16:36,808 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:36,809 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 16:16:36,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-01-31 16:16:36,809 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:36,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:36,809 INFO L85 PathProgramCache]: Analyzing trace with hash -249606396, now seen corresponding path program 1 times [2022-01-31 16:16:36,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:36,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380782495] [2022-01-31 16:16:36,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:36,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:16:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:16:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:36,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 16:16:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:16:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 16:16:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 16:16:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-01-31 16:16:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 16:16:37,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:37,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380782495] [2022-01-31 16:16:37,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380782495] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:37,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:37,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 16:16:37,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352568473] [2022-01-31 16:16:37,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:37,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 16:16:37,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:37,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 16:16:37,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:16:37,032 INFO L87 Difference]: Start difference. First operand 479 states and 527 transitions. Second operand has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-01-31 16:16:37,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:37,454 INFO L93 Difference]: Finished difference Result 473 states and 515 transitions. [2022-01-31 16:16:37,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:16:37,454 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 158 [2022-01-31 16:16:37,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:37,455 INFO L225 Difference]: With dead ends: 473 [2022-01-31 16:16:37,455 INFO L226 Difference]: Without dead ends: 451 [2022-01-31 16:16:37,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2022-01-31 16:16:37,459 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 346 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:37,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 580 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 16:16:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-01-31 16:16:37,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 423. [2022-01-31 16:16:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 334 states have (on average 1.1107784431137724) internal successors, (371), 338 states have internal predecessors, (371), 42 states have call successors, (42), 42 states have call predecessors, (42), 46 states have return successors, (46), 42 states have call predecessors, (46), 40 states have call successors, (46) [2022-01-31 16:16:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 459 transitions. [2022-01-31 16:16:37,463 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 459 transitions. Word has length 158 [2022-01-31 16:16:37,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:37,463 INFO L470 AbstractCegarLoop]: Abstraction has 423 states and 459 transitions. [2022-01-31 16:16:37,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-01-31 16:16:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 459 transitions. [2022-01-31 16:16:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-31 16:16:37,465 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:37,465 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 16:16:37,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-01-31 16:16:37,466 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:37,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:37,466 INFO L85 PathProgramCache]: Analyzing trace with hash -2090831252, now seen corresponding path program 1 times [2022-01-31 16:16:37,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:37,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695333071] [2022-01-31 16:16:37,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:37,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:16:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:16:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 16:16:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:16:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 16:16:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-31 16:16:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-31 16:16:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:37,694 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-31 16:16:37,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:37,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695333071] [2022-01-31 16:16:37,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695333071] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:37,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:37,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 16:16:37,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770030029] [2022-01-31 16:16:37,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:37,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 16:16:37,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:37,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 16:16:37,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-01-31 16:16:37,696 INFO L87 Difference]: Start difference. First operand 423 states and 459 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-31 16:16:37,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:37,991 INFO L93 Difference]: Finished difference Result 401 states and 431 transitions. [2022-01-31 16:16:37,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:16:37,991 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 160 [2022-01-31 16:16:37,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:37,992 INFO L225 Difference]: With dead ends: 401 [2022-01-31 16:16:37,992 INFO L226 Difference]: Without dead ends: 381 [2022-01-31 16:16:37,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2022-01-31 16:16:37,995 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 217 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:37,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 732 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 16:16:37,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-01-31 16:16:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-01-31 16:16:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 298 states have (on average 1.0973154362416107) internal successors, (327), 300 states have internal predecessors, (327), 40 states have call successors, (40), 40 states have call predecessors, (40), 42 states have return successors, (42), 40 states have call predecessors, (42), 38 states have call successors, (42) [2022-01-31 16:16:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 409 transitions. [2022-01-31 16:16:37,998 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 409 transitions. Word has length 160 [2022-01-31 16:16:37,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:37,998 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 409 transitions. [2022-01-31 16:16:37,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-31 16:16:37,998 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 409 transitions. [2022-01-31 16:16:37,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-31 16:16:37,999 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:37,999 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 16:16:37,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-01-31 16:16:37,999 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:38,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:38,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1980774501, now seen corresponding path program 1 times [2022-01-31 16:16:38,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:38,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970585146] [2022-01-31 16:16:38,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:38,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:38,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:38,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:38,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:38,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:38,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:16:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:38,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:16:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:38,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:38,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:38,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:38,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 16:16:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:38,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:38,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:16:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:38,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:38,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:38,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:38,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 16:16:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:38,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 16:16:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:38,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-31 16:16:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 16:16:38,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:38,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970585146] [2022-01-31 16:16:38,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970585146] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:38,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:38,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 16:16:38,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604530726] [2022-01-31 16:16:38,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:38,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 16:16:38,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:38,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 16:16:38,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-01-31 16:16:38,289 INFO L87 Difference]: Start difference. First operand 381 states and 409 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-01-31 16:16:39,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:39,106 INFO L93 Difference]: Finished difference Result 661 states and 706 transitions. [2022-01-31 16:16:39,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-31 16:16:39,107 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 161 [2022-01-31 16:16:39,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:39,107 INFO L225 Difference]: With dead ends: 661 [2022-01-31 16:16:39,107 INFO L226 Difference]: Without dead ends: 387 [2022-01-31 16:16:39,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2022-01-31 16:16:39,108 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 555 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:39,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [556 Valid, 618 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 16:16:39,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-01-31 16:16:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 381. [2022-01-31 16:16:39,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 298 states have (on average 1.0939597315436242) internal successors, (326), 300 states have internal predecessors, (326), 40 states have call successors, (40), 40 states have call predecessors, (40), 42 states have return successors, (42), 40 states have call predecessors, (42), 38 states have call successors, (42) [2022-01-31 16:16:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 408 transitions. [2022-01-31 16:16:39,111 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 408 transitions. Word has length 161 [2022-01-31 16:16:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:39,111 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 408 transitions. [2022-01-31 16:16:39,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-01-31 16:16:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 408 transitions. [2022-01-31 16:16:39,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-31 16:16:39,112 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:39,112 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 16:16:39,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-01-31 16:16:39,112 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:39,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:39,113 INFO L85 PathProgramCache]: Analyzing trace with hash -628292860, now seen corresponding path program 1 times [2022-01-31 16:16:39,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:39,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458829337] [2022-01-31 16:16:39,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:39,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:39,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:39,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:39,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:39,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:16:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:39,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:16:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:39,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:16:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:39,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:39,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:39,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:39,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 16:16:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:39,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:39,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:16:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:39,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:39,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:16:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:39,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:39,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 16:16:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:39,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 16:16:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:39,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-31 16:16:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 16:16:39,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:39,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458829337] [2022-01-31 16:16:39,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458829337] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:39,465 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:39,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 16:16:39,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654631488] [2022-01-31 16:16:39,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:39,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 16:16:39,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:39,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 16:16:39,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-01-31 16:16:39,466 INFO L87 Difference]: Start difference. First operand 381 states and 408 transitions. Second operand has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2022-01-31 16:16:40,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:40,441 INFO L93 Difference]: Finished difference Result 384 states and 413 transitions. [2022-01-31 16:16:40,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 16:16:40,441 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 161 [2022-01-31 16:16:40,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:40,441 INFO L225 Difference]: With dead ends: 384 [2022-01-31 16:16:40,441 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 16:16:40,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2022-01-31 16:16:40,442 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 384 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:40,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 720 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 16:16:40,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 16:16:40,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 16:16:40,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-31 16:16:40,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 16:16:40,443 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2022-01-31 16:16:40,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:40,443 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 16:16:40,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2022-01-31 16:16:40,443 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 16:16:40,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 16:16:40,445 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 16:16:40,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-01-31 16:16:40,447 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] [2022-01-31 16:16:40,448 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 16:16:40,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:16:40 BasicIcfg [2022-01-31 16:16:40,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 16:16:40,449 INFO L158 Benchmark]: Toolchain (without parser) took 73309.11ms. Allocated memory was 185.6MB in the beginning and 307.2MB in the end (delta: 121.6MB). Free memory was 137.7MB in the beginning and 239.0MB in the end (delta: -101.3MB). Peak memory consumption was 20.7MB. Max. memory is 8.0GB. [2022-01-31 16:16:40,449 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 16:16:40,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.56ms. Allocated memory is still 185.6MB. Free memory was 137.6MB in the beginning and 150.1MB in the end (delta: -12.6MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-01-31 16:16:40,450 INFO L158 Benchmark]: Boogie Preprocessor took 86.62ms. Allocated memory is still 185.6MB. Free memory was 150.1MB in the beginning and 146.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-31 16:16:40,450 INFO L158 Benchmark]: RCFGBuilder took 797.90ms. Allocated memory is still 185.6MB. Free memory was 146.0MB in the beginning and 93.5MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. [2022-01-31 16:16:40,450 INFO L158 Benchmark]: IcfgTransformer took 49.17ms. Allocated memory is still 185.6MB. Free memory was 93.5MB in the beginning and 87.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-31 16:16:40,450 INFO L158 Benchmark]: TraceAbstraction took 71959.93ms. Allocated memory was 185.6MB in the beginning and 307.2MB in the end (delta: 121.6MB). Free memory was 86.7MB in the beginning and 239.0MB in the end (delta: -152.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 16:16:40,451 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 396.56ms. Allocated memory is still 185.6MB. Free memory was 137.6MB in the beginning and 150.1MB in the end (delta: -12.6MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 86.62ms. Allocated memory is still 185.6MB. Free memory was 150.1MB in the beginning and 146.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 797.90ms. Allocated memory is still 185.6MB. Free memory was 146.0MB in the beginning and 93.5MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. * IcfgTransformer took 49.17ms. Allocated memory is still 185.6MB. Free memory was 93.5MB in the beginning and 87.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * TraceAbstraction took 71959.93ms. Allocated memory was 185.6MB in the beginning and 307.2MB in the end (delta: 121.6MB). Free memory was 86.7MB in the beginning and 239.0MB in the end (delta: -152.3MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 29 procedures, 389 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.9s, OverallIterations: 65, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 58.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37391 SdHoareTripleChecker+Valid, 49.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36907 mSDsluCounter, 72268 SdHoareTripleChecker+Invalid, 42.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47602 mSDsCounter, 11352 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95262 IncrementalHoareTripleChecker+Invalid, 106614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11352 mSolverCounterUnsat, 24666 mSDtfsCounter, 95262 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1854 GetRequests, 818 SyntacticMatches, 7 SemanticMatches, 1029 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3339 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1036occurred in iteration=52, InterpolantAutomatonStates: 863, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 65 MinimizatonAttempts, 3956 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 4642 NumberOfCodeBlocks, 4642 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 4577 ConstructedInterpolants, 0 QuantifiedInterpolants, 19819 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 65 InterpolantComputations, 65 PerfectInterpolantSequences, 204/204 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-01-31 16:16:40,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...