/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-b030c9e [2022-03-20 07:26:32,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 07:26:32,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 07:26:32,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 07:26:32,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 07:26:32,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 07:26:32,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 07:26:32,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 07:26:32,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 07:26:32,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 07:26:32,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 07:26:32,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 07:26:32,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 07:26:32,973 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 07:26:32,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 07:26:32,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 07:26:32,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 07:26:32,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 07:26:32,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 07:26:32,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 07:26:32,978 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 07:26:32,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 07:26:32,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 07:26:32,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 07:26:32,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 07:26:32,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 07:26:32,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 07:26:32,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 07:26:32,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 07:26:32,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 07:26:32,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 07:26:32,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 07:26:32,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 07:26:32,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 07:26:32,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 07:26:32,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 07:26:32,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 07:26:32,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 07:26:32,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 07:26:32,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 07:26:32,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 07:26:32,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 07:26:32,988 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-20 07:26:32,994 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 07:26:32,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 07:26:32,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 07:26:32,995 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 07:26:32,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 07:26:32,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 07:26:32,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 07:26:32,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 07:26:32,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 07:26:32,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 07:26:32,996 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 07:26:32,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 07:26:32,996 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 07:26:32,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 07:26:32,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 07:26:32,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 07:26:32,996 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 07:26:32,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 07:26:32,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 07:26:32,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 07:26:32,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 07:26:32,997 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 07:26:32,997 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-20 07:26:33,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 07:26:33,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 07:26:33,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 07:26:33,192 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 07:26:33,192 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 07:26:33,194 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-03-20 07:26:33,263 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7419c0daf/90c509892be34ca7867ce3e359d3b690/FLAG30d13d15e [2022-03-20 07:26:33,607 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 07:26:33,608 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-03-20 07:26:33,620 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7419c0daf/90c509892be34ca7867ce3e359d3b690/FLAG30d13d15e [2022-03-20 07:26:33,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7419c0daf/90c509892be34ca7867ce3e359d3b690 [2022-03-20 07:26:33,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 07:26:33,981 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 07:26:33,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 07:26:33,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 07:26:33,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 07:26:33,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 07:26:33" (1/1) ... [2022-03-20 07:26:33,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59bea149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:33, skipping insertion in model container [2022-03-20 07:26:33,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 07:26:33" (1/1) ... [2022-03-20 07:26:33,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 07:26:34,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 07:26:34,345 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-03-20 07:26:34,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 07:26:34,365 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 07:26:34,474 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-03-20 07:26:34,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 07:26:34,492 INFO L208 MainTranslator]: Completed translation [2022-03-20 07:26:34,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:34 WrapperNode [2022-03-20 07:26:34,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 07:26:34,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 07:26:34,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 07:26:34,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 07:26:34,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:34" (1/1) ... [2022-03-20 07:26:34,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:34" (1/1) ... [2022-03-20 07:26:34,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:34" (1/1) ... [2022-03-20 07:26:34,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:34" (1/1) ... [2022-03-20 07:26:34,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:34" (1/1) ... [2022-03-20 07:26:34,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:34" (1/1) ... [2022-03-20 07:26:34,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:34" (1/1) ... [2022-03-20 07:26:34,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 07:26:34,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 07:26:34,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 07:26:34,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 07:26:34,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:34" (1/1) ... [2022-03-20 07:26:34,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 07:26:34,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 07:26:34,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-20 07:26:34,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-20 07:26:34,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 07:26:34,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 07:26:34,670 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 07:26:34,670 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-03-20 07:26:34,670 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2022-03-20 07:26:34,671 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2022-03-20 07:26:34,671 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2022-03-20 07:26:34,671 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2022-03-20 07:26:34,671 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2022-03-20 07:26:34,671 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2022-03-20 07:26:34,671 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2022-03-20 07:26:34,671 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-03-20 07:26:34,672 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 07:26:34,672 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-03-20 07:26:34,672 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-03-20 07:26:34,674 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-03-20 07:26:34,674 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-03-20 07:26:34,674 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-03-20 07:26:34,674 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-03-20 07:26:34,674 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-03-20 07:26:34,674 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-03-20 07:26:34,674 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-03-20 07:26:34,674 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-03-20 07:26:34,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-03-20 07:26:34,674 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-03-20 07:26:34,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-03-20 07:26:34,675 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2022-03-20 07:26:34,675 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2022-03-20 07:26:34,675 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2022-03-20 07:26:34,675 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2022-03-20 07:26:34,675 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-03-20 07:26:34,675 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 07:26:34,675 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 07:26:34,675 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 07:26:34,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 07:26:34,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-03-20 07:26:34,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 07:26:34,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-03-20 07:26:34,675 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2022-03-20 07:26:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2022-03-20 07:26:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2022-03-20 07:26:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2022-03-20 07:26:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2022-03-20 07:26:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2022-03-20 07:26:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-03-20 07:26:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-03-20 07:26:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-03-20 07:26:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-03-20 07:26:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-03-20 07:26:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-03-20 07:26:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-03-20 07:26:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-03-20 07:26:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-03-20 07:26:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-03-20 07:26:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-03-20 07:26:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2022-03-20 07:26:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2022-03-20 07:26:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2022-03-20 07:26:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2022-03-20 07:26:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-03-20 07:26:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-03-20 07:26:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-03-20 07:26:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2022-03-20 07:26:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-03-20 07:26:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 07:26:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-03-20 07:26:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 07:26:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 07:26:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 07:26:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 07:26:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 07:26:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 07:26:34,898 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 07:26:34,899 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 07:26:34,933 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 07:26:34,954 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-20 07:26:34,954 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-20 07:26:34,960 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 07:26:34,965 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-20 07:26:34,965 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-20 07:26:34,968 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 07:26:35,078 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-03-20 07:26:35,078 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-03-20 07:26:35,080 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 07:26:35,157 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2022-03-20 07:26:35,157 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2022-03-20 07:26:35,165 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 07:26:35,179 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-03-20 07:26:35,179 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-03-20 07:26:35,247 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 07:26:35,252 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-20 07:26:35,252 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-20 07:26:35,253 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 07:26:35,265 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-20 07:26:35,265 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-20 07:26:35,266 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 07:26:35,275 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-20 07:26:35,275 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-20 07:26:35,302 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 07:26:35,342 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-03-20 07:26:35,343 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-03-20 07:26:35,344 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 07:26:35,417 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-03-20 07:26:35,417 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-03-20 07:26:35,458 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 07:26:35,461 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-20 07:26:35,461 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-20 07:26:35,462 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 07:26:35,466 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-20 07:26:35,466 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-20 07:26:35,466 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 07:26:35,470 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-20 07:26:35,470 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-20 07:26:35,478 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 07:26:35,486 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 07:26:35,486 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-20 07:26:35,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 07:26:35 BoogieIcfgContainer [2022-03-20 07:26:35,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 07:26:35,489 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 07:26:35,489 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 07:26:35,490 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 07:26:35,492 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 07:26:35" (1/1) ... [2022-03-20 07:26:35,494 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-03-20 07:26:35,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 07:26:35 BasicIcfg [2022-03-20 07:26:35,523 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 07:26:35,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 07:26:35,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 07:26:35,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 07:26:35,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 07:26:33" (1/4) ... [2022-03-20 07:26:35,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22041708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 07:26:35, skipping insertion in model container [2022-03-20 07:26:35,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:26:34" (2/4) ... [2022-03-20 07:26:35,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22041708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 07:26:35, skipping insertion in model container [2022-03-20 07:26:35,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 07:26:35" (3/4) ... [2022-03-20 07:26:35,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22041708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 07:26:35, skipping insertion in model container [2022-03-20 07:26:35,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 07:26:35" (4/4) ... [2022-03-20 07:26:35,529 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.cJordan [2022-03-20 07:26:35,532 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-20 07:26:35,533 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 07:26:35,561 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 07:26:35,566 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-20 07:26:35,566 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 07:26:35,602 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-03-20 07:26:35,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 07:26:35,617 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:35,617 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:35,618 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:35,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:35,623 INFO L85 PathProgramCache]: Analyzing trace with hash 871879161, now seen corresponding path program 1 times [2022-03-20 07:26:35,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:35,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435515654] [2022-03-20 07:26:35,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:35,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:35,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:35,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:35,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:35,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435515654] [2022-03-20 07:26:35,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435515654] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:35,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:35,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 07:26:35,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614777621] [2022-03-20 07:26:35,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:35,982 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 07:26:35,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:36,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 07:26:36,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 07:26:36,009 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-03-20 07:26:36,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:36,966 INFO L93 Difference]: Finished difference Result 430 states and 602 transitions. [2022-03-20 07:26:36,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 07:26:36,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-03-20 07:26:36,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:36,977 INFO L225 Difference]: With dead ends: 430 [2022-03-20 07:26:36,978 INFO L226 Difference]: Without dead ends: 422 [2022-03-20 07:26:36,979 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 07:26:36,981 INFO L913 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-03-20 07:26:36,981 INFO L914 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-03-20 07:26:36,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-03-20 07:26:37,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2022-03-20 07:26:37,021 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-03-20 07:26:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2022-03-20 07:26:37,024 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2022-03-20 07:26:37,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:37,024 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2022-03-20 07:26:37,024 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 07:26:37,024 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2022-03-20 07:26:37,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-20 07:26:37,025 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:37,025 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:37,026 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 07:26:37,026 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:37,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:37,026 INFO L85 PathProgramCache]: Analyzing trace with hash 291212257, now seen corresponding path program 1 times [2022-03-20 07:26:37,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:37,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867876437] [2022-03-20 07:26:37,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:37,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:37,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:37,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:37,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:37,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:37,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:37,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867876437] [2022-03-20 07:26:37,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867876437] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:37,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:37,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 07:26:37,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954960093] [2022-03-20 07:26:37,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:37,161 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 07:26:37,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:37,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 07:26:37,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 07:26:37,162 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-03-20 07:26:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:37,960 INFO L93 Difference]: Finished difference Result 585 states and 798 transitions. [2022-03-20 07:26:37,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 07:26:37,961 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-03-20 07:26:37,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:37,964 INFO L225 Difference]: With dead ends: 585 [2022-03-20 07:26:37,964 INFO L226 Difference]: Without dead ends: 584 [2022-03-20 07:26:37,965 INFO L912 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-03-20 07:26:37,966 INFO L913 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-03-20 07:26:37,966 INFO L914 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-03-20 07:26:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-03-20 07:26:37,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 525. [2022-03-20 07:26:37,985 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-03-20 07:26:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 716 transitions. [2022-03-20 07:26:38,005 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 716 transitions. Word has length 25 [2022-03-20 07:26:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:38,005 INFO L478 AbstractCegarLoop]: Abstraction has 525 states and 716 transitions. [2022-03-20 07:26:38,005 INFO L479 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-03-20 07:26:38,005 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 716 transitions. [2022-03-20 07:26:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-20 07:26:38,006 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:38,006 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:38,006 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 07:26:38,007 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:38,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:38,007 INFO L85 PathProgramCache]: Analyzing trace with hash 525888156, now seen corresponding path program 1 times [2022-03-20 07:26:38,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:38,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529940501] [2022-03-20 07:26:38,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:38,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:38,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:38,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:38,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:38,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:38,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529940501] [2022-03-20 07:26:38,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529940501] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:38,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:38,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 07:26:38,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235406497] [2022-03-20 07:26:38,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:38,150 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 07:26:38,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:38,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 07:26:38,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 07:26:38,151 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-03-20 07:26:38,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:38,767 INFO L93 Difference]: Finished difference Result 676 states and 906 transitions. [2022-03-20 07:26:38,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 07:26:38,768 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-03-20 07:26:38,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:38,771 INFO L225 Difference]: With dead ends: 676 [2022-03-20 07:26:38,771 INFO L226 Difference]: Without dead ends: 676 [2022-03-20 07:26:38,771 INFO L912 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-03-20 07:26:38,772 INFO L913 BasicCegarLoop]: 459 mSDtfsCounter, 946 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-03-20 07:26:38,772 INFO L914 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-03-20 07:26:38,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-03-20 07:26:38,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 583. [2022-03-20 07:26:38,785 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-03-20 07:26:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 790 transitions. [2022-03-20 07:26:38,788 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 790 transitions. Word has length 31 [2022-03-20 07:26:38,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:38,788 INFO L478 AbstractCegarLoop]: Abstraction has 583 states and 790 transitions. [2022-03-20 07:26:38,788 INFO L479 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-03-20 07:26:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 790 transitions. [2022-03-20 07:26:38,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-20 07:26:38,789 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:38,789 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:38,790 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 07:26:38,790 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:38,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:38,790 INFO L85 PathProgramCache]: Analyzing trace with hash -2004508172, now seen corresponding path program 1 times [2022-03-20 07:26:38,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:38,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242807109] [2022-03-20 07:26:38,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:38,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:38,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:38,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:38,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:38,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:38,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242807109] [2022-03-20 07:26:38,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242807109] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:38,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:38,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 07:26:38,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874973248] [2022-03-20 07:26:38,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:38,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 07:26:38,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:38,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 07:26:38,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 07:26:38,918 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-03-20 07:26:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:39,861 INFO L93 Difference]: Finished difference Result 819 states and 1102 transitions. [2022-03-20 07:26:39,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 07:26:39,862 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-03-20 07:26:39,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:39,866 INFO L225 Difference]: With dead ends: 819 [2022-03-20 07:26:39,867 INFO L226 Difference]: Without dead ends: 819 [2022-03-20 07:26:39,867 INFO L912 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-03-20 07:26:39,868 INFO L913 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-03-20 07:26:39,868 INFO L914 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-03-20 07:26:39,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-03-20 07:26:39,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 771. [2022-03-20 07:26:39,892 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-03-20 07:26:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1047 transitions. [2022-03-20 07:26:39,900 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1047 transitions. Word has length 33 [2022-03-20 07:26:39,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:39,900 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 1047 transitions. [2022-03-20 07:26:39,900 INFO L479 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-03-20 07:26:39,900 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1047 transitions. [2022-03-20 07:26:39,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-20 07:26:39,908 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:39,908 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:39,908 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 07:26:39,909 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:39,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:39,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1331218314, now seen corresponding path program 1 times [2022-03-20 07:26:39,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:39,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253933409] [2022-03-20 07:26:39,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:39,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:39,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-03-20 07:26:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:26:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:40,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:40,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253933409] [2022-03-20 07:26:40,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253933409] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:40,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:40,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 07:26:40,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751893528] [2022-03-20 07:26:40,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:40,045 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 07:26:40,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:40,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 07:26:40,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-20 07:26:40,046 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-03-20 07:26:40,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:40,761 INFO L93 Difference]: Finished difference Result 860 states and 1157 transitions. [2022-03-20 07:26:40,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 07:26:40,761 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-03-20 07:26:40,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:40,764 INFO L225 Difference]: With dead ends: 860 [2022-03-20 07:26:40,764 INFO L226 Difference]: Without dead ends: 860 [2022-03-20 07:26:40,765 INFO L912 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-03-20 07:26:40,765 INFO L913 BasicCegarLoop]: 476 mSDtfsCounter, 839 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:40,765 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [840 Valid, 807 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-20 07:26:40,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-03-20 07:26:40,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 808. [2022-03-20 07:26:40,780 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-03-20 07:26:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1090 transitions. [2022-03-20 07:26:40,783 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1090 transitions. Word has length 38 [2022-03-20 07:26:40,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:40,784 INFO L478 AbstractCegarLoop]: Abstraction has 808 states and 1090 transitions. [2022-03-20 07:26:40,784 INFO L479 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-03-20 07:26:40,784 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1090 transitions. [2022-03-20 07:26:40,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-20 07:26:40,785 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:40,785 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:40,785 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-20 07:26:40,785 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:40,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:40,785 INFO L85 PathProgramCache]: Analyzing trace with hash 528133378, now seen corresponding path program 1 times [2022-03-20 07:26:40,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:40,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743557477] [2022-03-20 07:26:40,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:40,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:40,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:40,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:40,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743557477] [2022-03-20 07:26:40,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743557477] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:40,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:40,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 07:26:40,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614207511] [2022-03-20 07:26:40,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:40,911 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 07:26:40,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:40,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 07:26:40,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 07:26:40,912 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-03-20 07:26:41,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:41,558 INFO L93 Difference]: Finished difference Result 839 states and 1128 transitions. [2022-03-20 07:26:41,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 07:26:41,559 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-03-20 07:26:41,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:41,562 INFO L225 Difference]: With dead ends: 839 [2022-03-20 07:26:41,562 INFO L226 Difference]: Without dead ends: 839 [2022-03-20 07:26:41,562 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-20 07:26:41,563 INFO L913 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-03-20 07:26:41,563 INFO L914 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-03-20 07:26:41,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-03-20 07:26:41,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 819. [2022-03-20 07:26:41,576 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-03-20 07:26:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1104 transitions. [2022-03-20 07:26:41,579 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1104 transitions. Word has length 38 [2022-03-20 07:26:41,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:41,579 INFO L478 AbstractCegarLoop]: Abstraction has 819 states and 1104 transitions. [2022-03-20 07:26:41,579 INFO L479 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-03-20 07:26:41,579 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1104 transitions. [2022-03-20 07:26:41,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-20 07:26:41,580 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:41,580 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:41,580 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-20 07:26:41,580 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:41,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:41,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1133526780, now seen corresponding path program 1 times [2022-03-20 07:26:41,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:41,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157298326] [2022-03-20 07:26:41,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:41,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-20 07:26:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:26:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:41,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:41,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157298326] [2022-03-20 07:26:41,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157298326] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:41,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:41,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 07:26:41,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481464690] [2022-03-20 07:26:41,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:41,785 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 07:26:41,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:41,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 07:26:41,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-20 07:26:41,786 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-03-20 07:26:43,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:43,069 INFO L93 Difference]: Finished difference Result 871 states and 1170 transitions. [2022-03-20 07:26:43,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 07:26:43,070 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-03-20 07:26:43,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:43,073 INFO L225 Difference]: With dead ends: 871 [2022-03-20 07:26:43,073 INFO L226 Difference]: Without dead ends: 871 [2022-03-20 07:26:43,073 INFO L912 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-03-20 07:26:43,074 INFO L913 BasicCegarLoop]: 455 mSDtfsCounter, 1244 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:43,074 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1259 Valid, 1048 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-20 07:26:43,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-03-20 07:26:43,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2022-03-20 07:26:43,087 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-03-20 07:26:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1103 transitions. [2022-03-20 07:26:43,090 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1103 transitions. Word has length 40 [2022-03-20 07:26:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:43,090 INFO L478 AbstractCegarLoop]: Abstraction has 819 states and 1103 transitions. [2022-03-20 07:26:43,090 INFO L479 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-03-20 07:26:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1103 transitions. [2022-03-20 07:26:43,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-20 07:26:43,091 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:43,091 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:43,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-20 07:26:43,091 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:43,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:43,091 INFO L85 PathProgramCache]: Analyzing trace with hash -174684695, now seen corresponding path program 1 times [2022-03-20 07:26:43,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:43,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404089870] [2022-03-20 07:26:43,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:43,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-20 07:26:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:26:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:43,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:43,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404089870] [2022-03-20 07:26:43,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404089870] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:43,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:43,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 07:26:43,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807288394] [2022-03-20 07:26:43,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:43,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 07:26:43,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:43,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 07:26:43,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-20 07:26:43,347 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-03-20 07:26:44,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:44,805 INFO L93 Difference]: Finished difference Result 871 states and 1169 transitions. [2022-03-20 07:26:44,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 07:26:44,806 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-03-20 07:26:44,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:44,808 INFO L225 Difference]: With dead ends: 871 [2022-03-20 07:26:44,808 INFO L226 Difference]: Without dead ends: 871 [2022-03-20 07:26:44,809 INFO L912 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-03-20 07:26:44,809 INFO L913 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.1s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:44,809 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1607 Valid, 1123 Invalid, 2301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [467 Valid, 1834 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-20 07:26:44,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-03-20 07:26:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2022-03-20 07:26:44,821 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-03-20 07:26:44,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1102 transitions. [2022-03-20 07:26:44,824 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1102 transitions. Word has length 41 [2022-03-20 07:26:44,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:44,825 INFO L478 AbstractCegarLoop]: Abstraction has 819 states and 1102 transitions. [2022-03-20 07:26:44,825 INFO L479 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-03-20 07:26:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1102 transitions. [2022-03-20 07:26:44,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-20 07:26:44,827 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:44,827 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:44,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-20 07:26:44,827 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:44,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:44,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1390592098, now seen corresponding path program 1 times [2022-03-20 07:26:44,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:44,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264061650] [2022-03-20 07:26:44,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:44,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:44,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:44,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:44,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:44,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-03-20 07:26:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:44,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:26:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:44,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:44,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264061650] [2022-03-20 07:26:44,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264061650] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:44,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:44,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 07:26:44,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085152908] [2022-03-20 07:26:44,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:44,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 07:26:44,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:44,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 07:26:44,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-20 07:26:44,980 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-03-20 07:26:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:45,984 INFO L93 Difference]: Finished difference Result 879 states and 1177 transitions. [2022-03-20 07:26:45,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 07:26:45,985 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-03-20 07:26:45,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:45,988 INFO L225 Difference]: With dead ends: 879 [2022-03-20 07:26:45,988 INFO L226 Difference]: Without dead ends: 867 [2022-03-20 07:26:45,989 INFO L912 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-03-20 07:26:45,990 INFO L913 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-03-20 07:26:45,990 INFO L914 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-03-20 07:26:45,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2022-03-20 07:26:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 817. [2022-03-20 07:26:46,022 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-03-20 07:26:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1098 transitions. [2022-03-20 07:26:46,024 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1098 transitions. Word has length 41 [2022-03-20 07:26:46,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:46,024 INFO L478 AbstractCegarLoop]: Abstraction has 817 states and 1098 transitions. [2022-03-20 07:26:46,024 INFO L479 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-03-20 07:26:46,025 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1098 transitions. [2022-03-20 07:26:46,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-20 07:26:46,025 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:46,025 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:46,025 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-20 07:26:46,025 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:46,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:46,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1816872397, now seen corresponding path program 1 times [2022-03-20 07:26:46,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:46,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060771936] [2022-03-20 07:26:46,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:46,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:46,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:46,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:46,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:46,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-20 07:26:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:46,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:26:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:46,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:46,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:46,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060771936] [2022-03-20 07:26:46,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060771936] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:46,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:46,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 07:26:46,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211276417] [2022-03-20 07:26:46,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:46,185 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 07:26:46,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:46,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 07:26:46,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-20 07:26:46,186 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-03-20 07:26:47,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:47,482 INFO L93 Difference]: Finished difference Result 877 states and 1173 transitions. [2022-03-20 07:26:47,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 07:26:47,483 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-03-20 07:26:47,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:47,485 INFO L225 Difference]: With dead ends: 877 [2022-03-20 07:26:47,485 INFO L226 Difference]: Without dead ends: 860 [2022-03-20 07:26:47,485 INFO L912 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-03-20 07:26:47,486 INFO L913 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-03-20 07:26:47,486 INFO L914 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-03-20 07:26:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-03-20 07:26:47,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 810. [2022-03-20 07:26:47,497 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-03-20 07:26:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1089 transitions. [2022-03-20 07:26:47,499 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1089 transitions. Word has length 42 [2022-03-20 07:26:47,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:47,499 INFO L478 AbstractCegarLoop]: Abstraction has 810 states and 1089 transitions. [2022-03-20 07:26:47,500 INFO L479 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-03-20 07:26:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1089 transitions. [2022-03-20 07:26:47,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-20 07:26:47,500 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:47,500 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:47,500 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-20 07:26:47,501 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:47,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:47,501 INFO L85 PathProgramCache]: Analyzing trace with hash -4159802, now seen corresponding path program 1 times [2022-03-20 07:26:47,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:47,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877148120] [2022-03-20 07:26:47,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:47,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:47,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:47,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:47,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:47,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:26:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:47,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:47,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877148120] [2022-03-20 07:26:47,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877148120] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:47,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:47,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 07:26:47,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841256717] [2022-03-20 07:26:47,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:47,629 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 07:26:47,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:47,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 07:26:47,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-20 07:26:47,630 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-03-20 07:26:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:48,601 INFO L93 Difference]: Finished difference Result 835 states and 1118 transitions. [2022-03-20 07:26:48,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 07:26:48,602 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-03-20 07:26:48,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:48,604 INFO L225 Difference]: With dead ends: 835 [2022-03-20 07:26:48,604 INFO L226 Difference]: Without dead ends: 835 [2022-03-20 07:26:48,605 INFO L912 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-03-20 07:26:48,605 INFO L913 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.8s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:48,605 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 1012 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-20 07:26:48,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-03-20 07:26:48,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 812. [2022-03-20 07:26:48,616 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-03-20 07:26:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1091 transitions. [2022-03-20 07:26:48,618 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1091 transitions. Word has length 42 [2022-03-20 07:26:48,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:48,618 INFO L478 AbstractCegarLoop]: Abstraction has 812 states and 1091 transitions. [2022-03-20 07:26:48,619 INFO L479 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-03-20 07:26:48,619 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1091 transitions. [2022-03-20 07:26:48,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-20 07:26:48,619 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:48,619 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:48,619 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-20 07:26:48,620 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:48,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:48,620 INFO L85 PathProgramCache]: Analyzing trace with hash 383655172, now seen corresponding path program 1 times [2022-03-20 07:26:48,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:48,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413099805] [2022-03-20 07:26:48,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:48,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:48,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:48,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:48,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:48,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-03-20 07:26:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:48,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:48,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413099805] [2022-03-20 07:26:48,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413099805] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:48,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:48,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 07:26:48,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479797949] [2022-03-20 07:26:48,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:48,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 07:26:48,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:48,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 07:26:48,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-03-20 07:26:48,766 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-03-20 07:26:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:49,780 INFO L93 Difference]: Finished difference Result 840 states and 1124 transitions. [2022-03-20 07:26:49,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 07:26:49,780 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-03-20 07:26:49,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:49,783 INFO L225 Difference]: With dead ends: 840 [2022-03-20 07:26:49,783 INFO L226 Difference]: Without dead ends: 840 [2022-03-20 07:26:49,783 INFO L912 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-03-20 07:26:49,783 INFO L913 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-03-20 07:26:49,783 INFO L914 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-03-20 07:26:49,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-03-20 07:26:49,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 816. [2022-03-20 07:26:49,794 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-03-20 07:26:49,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2022-03-20 07:26:49,796 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 44 [2022-03-20 07:26:49,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:49,797 INFO L478 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2022-03-20 07:26:49,797 INFO L479 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-03-20 07:26:49,797 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2022-03-20 07:26:49,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-20 07:26:49,797 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:49,797 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:49,797 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-20 07:26:49,798 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:49,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:49,798 INFO L85 PathProgramCache]: Analyzing trace with hash -864015436, now seen corresponding path program 1 times [2022-03-20 07:26:49,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:49,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193019696] [2022-03-20 07:26:49,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:49,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:49,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:49,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:49,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:49,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:26:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:49,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:49,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193019696] [2022-03-20 07:26:49,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193019696] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:49,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:49,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 07:26:49,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585960418] [2022-03-20 07:26:49,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:49,923 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 07:26:49,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:49,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 07:26:49,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-20 07:26:49,924 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-03-20 07:26:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:50,925 INFO L93 Difference]: Finished difference Result 838 states and 1121 transitions. [2022-03-20 07:26:50,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 07:26:50,925 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-03-20 07:26:50,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:50,928 INFO L225 Difference]: With dead ends: 838 [2022-03-20 07:26:50,928 INFO L226 Difference]: Without dead ends: 838 [2022-03-20 07:26:50,928 INFO L912 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-03-20 07:26:50,928 INFO L913 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-03-20 07:26:50,929 INFO L914 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-03-20 07:26:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-03-20 07:26:50,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 816. [2022-03-20 07:26:50,942 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-03-20 07:26:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2022-03-20 07:26:50,944 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 43 [2022-03-20 07:26:50,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:50,945 INFO L478 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2022-03-20 07:26:50,945 INFO L479 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-03-20 07:26:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2022-03-20 07:26:50,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-20 07:26:50,946 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:50,946 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:50,946 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-20 07:26:50,946 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:50,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:50,946 INFO L85 PathProgramCache]: Analyzing trace with hash -392590886, now seen corresponding path program 1 times [2022-03-20 07:26:50,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:50,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975532288] [2022-03-20 07:26:50,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:50,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:51,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:51,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:51,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:51,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:26:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:51,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-03-20 07:26:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:51,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:51,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975532288] [2022-03-20 07:26:51,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975532288] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:51,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:51,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 07:26:51,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778401237] [2022-03-20 07:26:51,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:51,127 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 07:26:51,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:51,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 07:26:51,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-20 07:26:51,128 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-03-20 07:26:51,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:51,950 INFO L93 Difference]: Finished difference Result 858 states and 1146 transitions. [2022-03-20 07:26:51,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 07:26:51,950 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-03-20 07:26:51,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:51,952 INFO L225 Difference]: With dead ends: 858 [2022-03-20 07:26:51,953 INFO L226 Difference]: Without dead ends: 843 [2022-03-20 07:26:51,953 INFO L912 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-03-20 07:26:51,953 INFO L913 BasicCegarLoop]: 457 mSDtfsCounter, 689 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-03-20 07:26:51,953 INFO L914 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-03-20 07:26:51,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-03-20 07:26:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 814. [2022-03-20 07:26:51,976 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-03-20 07:26:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1092 transitions. [2022-03-20 07:26:51,978 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1092 transitions. Word has length 45 [2022-03-20 07:26:51,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:51,978 INFO L478 AbstractCegarLoop]: Abstraction has 814 states and 1092 transitions. [2022-03-20 07:26:51,979 INFO L479 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-03-20 07:26:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1092 transitions. [2022-03-20 07:26:51,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-20 07:26:51,981 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:51,981 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:51,981 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-20 07:26:51,981 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:51,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:51,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1509958495, now seen corresponding path program 1 times [2022-03-20 07:26:51,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:51,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397642222] [2022-03-20 07:26:51,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:51,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:52,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:52,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:52,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:52,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:26:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:52,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-03-20 07:26:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:52,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:52,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397642222] [2022-03-20 07:26:52,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397642222] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:52,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:52,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 07:26:52,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787095037] [2022-03-20 07:26:52,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:52,127 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 07:26:52,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:52,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 07:26:52,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-03-20 07:26:52,128 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-03-20 07:26:53,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:53,000 INFO L93 Difference]: Finished difference Result 855 states and 1136 transitions. [2022-03-20 07:26:53,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 07:26:53,001 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-03-20 07:26:53,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:53,003 INFO L225 Difference]: With dead ends: 855 [2022-03-20 07:26:53,003 INFO L226 Difference]: Without dead ends: 804 [2022-03-20 07:26:53,004 INFO L912 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-03-20 07:26:53,004 INFO L913 BasicCegarLoop]: 486 mSDtfsCounter, 845 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-03-20 07:26:53,004 INFO L914 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-03-20 07:26:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-03-20 07:26:53,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 775. [2022-03-20 07:26:53,018 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-03-20 07:26:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2022-03-20 07:26:53,020 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 46 [2022-03-20 07:26:53,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:53,020 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2022-03-20 07:26:53,021 INFO L479 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-03-20 07:26:53,021 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-03-20 07:26:53,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-03-20 07:26:53,022 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:53,022 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:53,022 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-20 07:26:53,022 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:53,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:53,022 INFO L85 PathProgramCache]: Analyzing trace with hash -214129706, now seen corresponding path program 1 times [2022-03-20 07:26:53,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:53,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104220964] [2022-03-20 07:26:53,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:53,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:53,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:53,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:53,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:53,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-03-20 07:26:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:53,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:53,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104220964] [2022-03-20 07:26:53,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104220964] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:53,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:53,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-20 07:26:53,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449116261] [2022-03-20 07:26:53,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:53,146 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 07:26:53,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:53,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 07:26:53,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-20 07:26:53,147 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-03-20 07:26:54,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:54,289 INFO L93 Difference]: Finished difference Result 1131 states and 1528 transitions. [2022-03-20 07:26:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 07:26:54,289 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-03-20 07:26:54,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:54,292 INFO L225 Difference]: With dead ends: 1131 [2022-03-20 07:26:54,293 INFO L226 Difference]: Without dead ends: 1131 [2022-03-20 07:26:54,293 INFO L912 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-03-20 07:26:54,293 INFO L913 BasicCegarLoop]: 533 mSDtfsCounter, 490 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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-03-20 07:26:54,293 INFO L914 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-03-20 07:26:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2022-03-20 07:26:54,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 888. [2022-03-20 07:26:54,309 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-03-20 07:26:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1195 transitions. [2022-03-20 07:26:54,316 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1195 transitions. Word has length 47 [2022-03-20 07:26:54,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:54,316 INFO L478 AbstractCegarLoop]: Abstraction has 888 states and 1195 transitions. [2022-03-20 07:26:54,317 INFO L479 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-03-20 07:26:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1195 transitions. [2022-03-20 07:26:54,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-03-20 07:26:54,317 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:54,317 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:54,318 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-20 07:26:54,318 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:54,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:54,318 INFO L85 PathProgramCache]: Analyzing trace with hash 530917733, now seen corresponding path program 1 times [2022-03-20 07:26:54,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:54,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995882668] [2022-03-20 07:26:54,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:54,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:54,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:54,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:54,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:54,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:26:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:54,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 07:26:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:54,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:54,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:54,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995882668] [2022-03-20 07:26:54,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995882668] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:54,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:54,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 07:26:54,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534513566] [2022-03-20 07:26:54,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:54,473 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 07:26:54,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:54,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 07:26:54,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-20 07:26:54,474 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-03-20 07:26:55,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:55,470 INFO L93 Difference]: Finished difference Result 930 states and 1245 transitions. [2022-03-20 07:26:55,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 07:26:55,470 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-03-20 07:26:55,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:55,473 INFO L225 Difference]: With dead ends: 930 [2022-03-20 07:26:55,473 INFO L226 Difference]: Without dead ends: 915 [2022-03-20 07:26:55,473 INFO L912 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-03-20 07:26:55,474 INFO L913 BasicCegarLoop]: 448 mSDtfsCounter, 556 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-03-20 07:26:55,474 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [560 Valid, 1276 Invalid, 1713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-20 07:26:55,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2022-03-20 07:26:55,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 886. [2022-03-20 07:26:55,486 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-03-20 07:26:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1191 transitions. [2022-03-20 07:26:55,488 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1191 transitions. Word has length 47 [2022-03-20 07:26:55,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:55,488 INFO L478 AbstractCegarLoop]: Abstraction has 886 states and 1191 transitions. [2022-03-20 07:26:55,488 INFO L479 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-03-20 07:26:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1191 transitions. [2022-03-20 07:26:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-20 07:26:55,489 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:55,489 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:55,489 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-20 07:26:55,489 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:55,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:55,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1920468263, now seen corresponding path program 1 times [2022-03-20 07:26:55,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:55,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870535841] [2022-03-20 07:26:55,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:55,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:55,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:55,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:55,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:55,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-03-20 07:26:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:55,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:55,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870535841] [2022-03-20 07:26:55,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870535841] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:55,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:55,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 07:26:55,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427874377] [2022-03-20 07:26:55,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:55,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 07:26:55,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:55,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 07:26:55,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-03-20 07:26:55,688 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-03-20 07:26:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:56,912 INFO L93 Difference]: Finished difference Result 936 states and 1237 transitions. [2022-03-20 07:26:56,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 07:26:56,913 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-03-20 07:26:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:56,915 INFO L225 Difference]: With dead ends: 936 [2022-03-20 07:26:56,915 INFO L226 Difference]: Without dead ends: 936 [2022-03-20 07:26:56,916 INFO L912 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-03-20 07:26:56,916 INFO L913 BasicCegarLoop]: 556 mSDtfsCounter, 1467 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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-03-20 07:26:56,916 INFO L914 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-03-20 07:26:56,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2022-03-20 07:26:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 877. [2022-03-20 07:26:56,927 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-03-20 07:26:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1170 transitions. [2022-03-20 07:26:56,928 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1170 transitions. Word has length 48 [2022-03-20 07:26:56,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:56,929 INFO L478 AbstractCegarLoop]: Abstraction has 877 states and 1170 transitions. [2022-03-20 07:26:56,929 INFO L479 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-03-20 07:26:56,929 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1170 transitions. [2022-03-20 07:26:56,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-20 07:26:56,930 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:56,930 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:56,930 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-20 07:26:56,930 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:56,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:56,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1683726876, now seen corresponding path program 1 times [2022-03-20 07:26:56,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:56,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072430498] [2022-03-20 07:26:56,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:56,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:56,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:57,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:57,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:57,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:26:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:57,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:57,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:57,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072430498] [2022-03-20 07:26:57,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072430498] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:57,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:57,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 07:26:57,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871828147] [2022-03-20 07:26:57,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:57,093 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 07:26:57,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:57,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 07:26:57,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-03-20 07:26:57,093 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-03-20 07:26:58,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:58,711 INFO L93 Difference]: Finished difference Result 1075 states and 1432 transitions. [2022-03-20 07:26:58,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-20 07:26:58,711 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-03-20 07:26:58,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:58,714 INFO L225 Difference]: With dead ends: 1075 [2022-03-20 07:26:58,714 INFO L226 Difference]: Without dead ends: 1075 [2022-03-20 07:26:58,715 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2022-03-20 07:26:58,715 INFO L913 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-03-20 07:26:58,715 INFO L914 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-03-20 07:26:58,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2022-03-20 07:26:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 932. [2022-03-20 07:26:58,731 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-03-20 07:26:58,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1243 transitions. [2022-03-20 07:26:58,733 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1243 transitions. Word has length 50 [2022-03-20 07:26:58,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:58,733 INFO L478 AbstractCegarLoop]: Abstraction has 932 states and 1243 transitions. [2022-03-20 07:26:58,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 07:26:58,733 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1243 transitions. [2022-03-20 07:26:58,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-20 07:26:58,736 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:58,736 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:58,737 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-20 07:26:58,737 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:58,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:58,737 INFO L85 PathProgramCache]: Analyzing trace with hash -415030459, now seen corresponding path program 1 times [2022-03-20 07:26:58,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:58,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447944713] [2022-03-20 07:26:58,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:58,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:58,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:58,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:26:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:58,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:26:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:58,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:26:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:58,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-20 07:26:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:26:58,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:26:58,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447944713] [2022-03-20 07:26:58,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447944713] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:26:58,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:26:58,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 07:26:58,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627352103] [2022-03-20 07:26:58,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:26:58,899 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 07:26:58,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:26:58,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 07:26:58,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-20 07:26:58,900 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-03-20 07:26:59,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:26:59,877 INFO L93 Difference]: Finished difference Result 976 states and 1293 transitions. [2022-03-20 07:26:59,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 07:26:59,877 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-03-20 07:26:59,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:26:59,881 INFO L225 Difference]: With dead ends: 976 [2022-03-20 07:26:59,881 INFO L226 Difference]: Without dead ends: 959 [2022-03-20 07:26:59,881 INFO L912 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-03-20 07:26:59,882 INFO L913 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-03-20 07:26:59,882 INFO L914 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-03-20 07:26:59,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-03-20 07:26:59,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 932. [2022-03-20 07:26:59,907 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-03-20 07:26:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1231 transitions. [2022-03-20 07:26:59,909 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1231 transitions. Word has length 50 [2022-03-20 07:26:59,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:26:59,909 INFO L478 AbstractCegarLoop]: Abstraction has 932 states and 1231 transitions. [2022-03-20 07:26:59,909 INFO L479 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-03-20 07:26:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1231 transitions. [2022-03-20 07:26:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-20 07:26:59,910 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:26:59,910 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:26:59,910 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-20 07:26:59,910 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:26:59,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:26:59,911 INFO L85 PathProgramCache]: Analyzing trace with hash 527542300, now seen corresponding path program 1 times [2022-03-20 07:26:59,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:26:59,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125464263] [2022-03-20 07:26:59,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:26:59,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:26:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:26:59,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:26:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:00,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:00,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:00,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-03-20 07:27:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:00,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:00,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125464263] [2022-03-20 07:27:00,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125464263] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:00,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:00,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 07:27:00,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993107204] [2022-03-20 07:27:00,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:00,049 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 07:27:00,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:00,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 07:27:00,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-03-20 07:27:00,050 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-03-20 07:27:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:01,008 INFO L93 Difference]: Finished difference Result 685 states and 869 transitions. [2022-03-20 07:27:01,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 07:27:01,008 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-03-20 07:27:01,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:01,010 INFO L225 Difference]: With dead ends: 685 [2022-03-20 07:27:01,010 INFO L226 Difference]: Without dead ends: 685 [2022-03-20 07:27:01,010 INFO L912 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-03-20 07:27:01,011 INFO L913 BasicCegarLoop]: 470 mSDtfsCounter, 850 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:01,011 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [859 Valid, 830 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-20 07:27:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-03-20 07:27:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 623. [2022-03-20 07:27:01,019 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-03-20 07:27:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 791 transitions. [2022-03-20 07:27:01,020 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 791 transitions. Word has length 52 [2022-03-20 07:27:01,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:01,021 INFO L478 AbstractCegarLoop]: Abstraction has 623 states and 791 transitions. [2022-03-20 07:27:01,021 INFO L479 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-03-20 07:27:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 791 transitions. [2022-03-20 07:27:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-20 07:27:01,021 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:01,022 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:01,022 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-20 07:27:01,022 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:01,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:01,022 INFO L85 PathProgramCache]: Analyzing trace with hash 868088371, now seen corresponding path program 1 times [2022-03-20 07:27:01,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:01,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611663555] [2022-03-20 07:27:01,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:01,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:01,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:01,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:01,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:01,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:27:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:01,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 07:27:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:01,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:01,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:01,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611663555] [2022-03-20 07:27:01,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611663555] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:01,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:01,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 07:27:01,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794870600] [2022-03-20 07:27:01,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:01,321 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 07:27:01,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:01,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 07:27:01,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-20 07:27:01,321 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-03-20 07:27:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:02,287 INFO L93 Difference]: Finished difference Result 670 states and 845 transitions. [2022-03-20 07:27:02,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 07:27:02,289 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-03-20 07:27:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:02,291 INFO L225 Difference]: With dead ends: 670 [2022-03-20 07:27:02,291 INFO L226 Difference]: Without dead ends: 645 [2022-03-20 07:27:02,291 INFO L912 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-03-20 07:27:02,292 INFO L913 BasicCegarLoop]: 439 mSDtfsCounter, 447 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-03-20 07:27:02,292 INFO L914 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-03-20 07:27:02,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-03-20 07:27:02,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 613. [2022-03-20 07:27:02,299 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-03-20 07:27:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 776 transitions. [2022-03-20 07:27:02,300 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 776 transitions. Word has length 51 [2022-03-20 07:27:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:02,300 INFO L478 AbstractCegarLoop]: Abstraction has 613 states and 776 transitions. [2022-03-20 07:27:02,300 INFO L479 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-03-20 07:27:02,300 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 776 transitions. [2022-03-20 07:27:02,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-20 07:27:02,301 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:02,301 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:02,301 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-20 07:27:02,301 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:02,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:02,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1730699339, now seen corresponding path program 1 times [2022-03-20 07:27:02,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:02,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050351799] [2022-03-20 07:27:02,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:02,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:02,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:02,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:02,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:02,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:27:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:02,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 07:27:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:02,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:02,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:02,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050351799] [2022-03-20 07:27:02,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050351799] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:02,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:02,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 07:27:02,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9827847] [2022-03-20 07:27:02,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:02,461 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 07:27:02,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:02,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 07:27:02,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-20 07:27:02,461 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-03-20 07:27:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:03,306 INFO L93 Difference]: Finished difference Result 647 states and 817 transitions. [2022-03-20 07:27:03,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 07:27:03,306 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-03-20 07:27:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:03,309 INFO L225 Difference]: With dead ends: 647 [2022-03-20 07:27:03,309 INFO L226 Difference]: Without dead ends: 647 [2022-03-20 07:27:03,310 INFO L912 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-03-20 07:27:03,311 INFO L913 BasicCegarLoop]: 400 mSDtfsCounter, 469 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:03,311 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 1052 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-20 07:27:03,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-03-20 07:27:03,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 616. [2022-03-20 07:27:03,318 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-03-20 07:27:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 779 transitions. [2022-03-20 07:27:03,319 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 779 transitions. Word has length 51 [2022-03-20 07:27:03,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:03,319 INFO L478 AbstractCegarLoop]: Abstraction has 616 states and 779 transitions. [2022-03-20 07:27:03,319 INFO L479 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-03-20 07:27:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 779 transitions. [2022-03-20 07:27:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-20 07:27:03,320 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:03,320 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:03,320 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-20 07:27:03,320 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:03,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:03,320 INFO L85 PathProgramCache]: Analyzing trace with hash -585236833, now seen corresponding path program 1 times [2022-03-20 07:27:03,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:03,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065300146] [2022-03-20 07:27:03,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:03,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:03,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:03,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:03,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:03,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:27:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:03,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:03,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:03,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:03,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065300146] [2022-03-20 07:27:03,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065300146] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:03,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:03,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 07:27:03,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815466010] [2022-03-20 07:27:03,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:03,473 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 07:27:03,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:03,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 07:27:03,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-20 07:27:03,474 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-03-20 07:27:04,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:04,283 INFO L93 Difference]: Finished difference Result 677 states and 864 transitions. [2022-03-20 07:27:04,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 07:27:04,283 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-03-20 07:27:04,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:04,285 INFO L225 Difference]: With dead ends: 677 [2022-03-20 07:27:04,285 INFO L226 Difference]: Without dead ends: 676 [2022-03-20 07:27:04,285 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-03-20 07:27:04,285 INFO L913 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-03-20 07:27:04,285 INFO L914 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-03-20 07:27:04,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-03-20 07:27:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 627. [2022-03-20 07:27:04,293 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-03-20 07:27:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 795 transitions. [2022-03-20 07:27:04,294 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 795 transitions. Word has length 52 [2022-03-20 07:27:04,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:04,294 INFO L478 AbstractCegarLoop]: Abstraction has 627 states and 795 transitions. [2022-03-20 07:27:04,294 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 07:27:04,295 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 795 transitions. [2022-03-20 07:27:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-20 07:27:04,295 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:04,295 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:04,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-20 07:27:04,296 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:04,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:04,296 INFO L85 PathProgramCache]: Analyzing trace with hash 768072864, now seen corresponding path program 1 times [2022-03-20 07:27:04,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:04,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662998126] [2022-03-20 07:27:04,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:04,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:04,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:04,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:04,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:04,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:27:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:04,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:04,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:04,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662998126] [2022-03-20 07:27:04,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662998126] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:04,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:04,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 07:27:04,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074830503] [2022-03-20 07:27:04,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:04,484 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 07:27:04,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:04,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 07:27:04,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-03-20 07:27:04,485 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-03-20 07:27:05,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:05,770 INFO L93 Difference]: Finished difference Result 670 states and 844 transitions. [2022-03-20 07:27:05,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 07:27:05,771 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2022-03-20 07:27:05,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:05,772 INFO L225 Difference]: With dead ends: 670 [2022-03-20 07:27:05,772 INFO L226 Difference]: Without dead ends: 670 [2022-03-20 07:27:05,773 INFO L912 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-03-20 07:27:05,773 INFO L913 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-03-20 07:27:05,774 INFO L914 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-03-20 07:27:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-03-20 07:27:05,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 620. [2022-03-20 07:27:05,781 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-03-20 07:27:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 784 transitions. [2022-03-20 07:27:05,782 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 784 transitions. Word has length 52 [2022-03-20 07:27:05,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:05,782 INFO L478 AbstractCegarLoop]: Abstraction has 620 states and 784 transitions. [2022-03-20 07:27:05,782 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 07:27:05,782 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 784 transitions. [2022-03-20 07:27:05,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-20 07:27:05,783 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:05,783 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:05,783 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-20 07:27:05,783 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:05,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:05,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1124310208, now seen corresponding path program 1 times [2022-03-20 07:27:05,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:05,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227054747] [2022-03-20 07:27:05,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:05,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:05,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:05,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:05,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:05,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:27:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:05,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:05,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-03-20 07:27:05,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:05,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227054747] [2022-03-20 07:27:05,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227054747] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:05,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:05,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 07:27:05,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90101973] [2022-03-20 07:27:05,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:05,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 07:27:05,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:05,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 07:27:05,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-20 07:27:05,921 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-03-20 07:27:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:06,619 INFO L93 Difference]: Finished difference Result 800 states and 1032 transitions. [2022-03-20 07:27:06,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 07:27:06,620 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-03-20 07:27:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:06,622 INFO L225 Difference]: With dead ends: 800 [2022-03-20 07:27:06,622 INFO L226 Difference]: Without dead ends: 738 [2022-03-20 07:27:06,622 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-03-20 07:27:06,623 INFO L913 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-03-20 07:27:06,623 INFO L914 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-03-20 07:27:06,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-03-20 07:27:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 575. [2022-03-20 07:27:06,630 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-03-20 07:27:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 731 transitions. [2022-03-20 07:27:06,631 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 731 transitions. Word has length 52 [2022-03-20 07:27:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:06,631 INFO L478 AbstractCegarLoop]: Abstraction has 575 states and 731 transitions. [2022-03-20 07:27:06,631 INFO L479 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-03-20 07:27:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 731 transitions. [2022-03-20 07:27:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-03-20 07:27:06,632 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:06,632 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:06,632 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-20 07:27:06,632 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:06,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:06,633 INFO L85 PathProgramCache]: Analyzing trace with hash 525399217, now seen corresponding path program 1 times [2022-03-20 07:27:06,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:06,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105775330] [2022-03-20 07:27:06,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:06,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:06,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:06,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:06,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:06,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:27:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:06,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:06,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:06,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105775330] [2022-03-20 07:27:06,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105775330] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:06,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:06,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 07:27:06,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742189921] [2022-03-20 07:27:06,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:06,808 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 07:27:06,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:06,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 07:27:06,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-03-20 07:27:06,808 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-03-20 07:27:08,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:08,021 INFO L93 Difference]: Finished difference Result 635 states and 815 transitions. [2022-03-20 07:27:08,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 07:27:08,022 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-03-20 07:27:08,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:08,024 INFO L225 Difference]: With dead ends: 635 [2022-03-20 07:27:08,024 INFO L226 Difference]: Without dead ends: 634 [2022-03-20 07:27:08,024 INFO L912 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-03-20 07:27:08,024 INFO L913 BasicCegarLoop]: 410 mSDtfsCounter, 270 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 2447 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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-03-20 07:27:08,024 INFO L914 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-03-20 07:27:08,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-03-20 07:27:08,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 592. [2022-03-20 07:27:08,031 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-03-20 07:27:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 755 transitions. [2022-03-20 07:27:08,032 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 755 transitions. Word has length 53 [2022-03-20 07:27:08,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:08,033 INFO L478 AbstractCegarLoop]: Abstraction has 592 states and 755 transitions. [2022-03-20 07:27:08,033 INFO L479 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-03-20 07:27:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 755 transitions. [2022-03-20 07:27:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-03-20 07:27:08,033 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:08,034 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:08,034 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-20 07:27:08,034 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:08,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:08,034 INFO L85 PathProgramCache]: Analyzing trace with hash 525430961, now seen corresponding path program 1 times [2022-03-20 07:27:08,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:08,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981127482] [2022-03-20 07:27:08,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:08,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:08,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:08,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:08,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:08,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:27:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:08,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:08,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:08,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981127482] [2022-03-20 07:27:08,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981127482] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:08,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:08,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 07:27:08,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683580257] [2022-03-20 07:27:08,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:08,205 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 07:27:08,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:08,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 07:27:08,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-03-20 07:27:08,205 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-03-20 07:27:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:09,262 INFO L93 Difference]: Finished difference Result 623 states and 791 transitions. [2022-03-20 07:27:09,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 07:27:09,263 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-03-20 07:27:09,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:09,277 INFO L225 Difference]: With dead ends: 623 [2022-03-20 07:27:09,277 INFO L226 Difference]: Without dead ends: 611 [2022-03-20 07:27:09,277 INFO L912 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-03-20 07:27:09,287 INFO L913 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-03-20 07:27:09,288 INFO L914 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-03-20 07:27:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-03-20 07:27:09,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 589. [2022-03-20 07:27:09,296 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-03-20 07:27:09,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 751 transitions. [2022-03-20 07:27:09,297 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 751 transitions. Word has length 53 [2022-03-20 07:27:09,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:09,298 INFO L478 AbstractCegarLoop]: Abstraction has 589 states and 751 transitions. [2022-03-20 07:27:09,298 INFO L479 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-03-20 07:27:09,298 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 751 transitions. [2022-03-20 07:27:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-03-20 07:27:09,299 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:09,299 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:09,299 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-20 07:27:09,299 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:09,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:09,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1791629129, now seen corresponding path program 1 times [2022-03-20 07:27:09,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:09,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506305525] [2022-03-20 07:27:09,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:09,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:09,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:09,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:09,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:09,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:27:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:09,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-03-20 07:27:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:09,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-03-20 07:27:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:09,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:09,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506305525] [2022-03-20 07:27:09,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506305525] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:09,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:09,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 07:27:09,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706669421] [2022-03-20 07:27:09,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:09,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 07:27:09,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:09,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 07:27:09,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-03-20 07:27:09,556 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-03-20 07:27:10,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:10,493 INFO L93 Difference]: Finished difference Result 621 states and 787 transitions. [2022-03-20 07:27:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 07:27:10,494 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-03-20 07:27:10,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:10,495 INFO L225 Difference]: With dead ends: 621 [2022-03-20 07:27:10,495 INFO L226 Difference]: Without dead ends: 596 [2022-03-20 07:27:10,496 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-03-20 07:27:10,496 INFO L913 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, 0.9s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:10,496 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 1728 Invalid, 2622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2504 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-20 07:27:10,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-03-20 07:27:10,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 577. [2022-03-20 07:27:10,558 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-03-20 07:27:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 735 transitions. [2022-03-20 07:27:10,560 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 735 transitions. Word has length 55 [2022-03-20 07:27:10,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:10,560 INFO L478 AbstractCegarLoop]: Abstraction has 577 states and 735 transitions. [2022-03-20 07:27:10,560 INFO L479 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-03-20 07:27:10,560 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 735 transitions. [2022-03-20 07:27:10,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-03-20 07:27:10,561 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:10,561 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:10,561 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-20 07:27:10,561 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:10,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:10,562 INFO L85 PathProgramCache]: Analyzing trace with hash 310114016, now seen corresponding path program 1 times [2022-03-20 07:27:10,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:10,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490387204] [2022-03-20 07:27:10,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:10,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:10,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:10,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:10,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:10,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:27:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:10,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:10,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:10,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490387204] [2022-03-20 07:27:10,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490387204] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:10,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:10,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 07:27:10,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403546763] [2022-03-20 07:27:10,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:10,725 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 07:27:10,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:10,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 07:27:10,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-20 07:27:10,725 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-03-20 07:27:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:12,386 INFO L93 Difference]: Finished difference Result 742 states and 964 transitions. [2022-03-20 07:27:12,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 07:27:12,387 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-03-20 07:27:12,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:12,389 INFO L225 Difference]: With dead ends: 742 [2022-03-20 07:27:12,389 INFO L226 Difference]: Without dead ends: 728 [2022-03-20 07:27:12,389 INFO L912 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-03-20 07:27:12,390 INFO L913 BasicCegarLoop]: 503 mSDtfsCounter, 879 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:12,390 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [894 Valid, 972 Invalid, 2105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-20 07:27:12,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-03-20 07:27:12,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 561. [2022-03-20 07:27:12,400 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-03-20 07:27:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 711 transitions. [2022-03-20 07:27:12,401 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 711 transitions. Word has length 54 [2022-03-20 07:27:12,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:12,401 INFO L478 AbstractCegarLoop]: Abstraction has 561 states and 711 transitions. [2022-03-20 07:27:12,401 INFO L479 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-03-20 07:27:12,401 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 711 transitions. [2022-03-20 07:27:12,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-20 07:27:12,402 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:12,402 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:12,402 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-20 07:27:12,402 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:12,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:12,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1381037997, now seen corresponding path program 1 times [2022-03-20 07:27:12,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:12,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921177605] [2022-03-20 07:27:12,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:12,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:12,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:12,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:12,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:12,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 07:27:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:12,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:12,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-03-20 07:27:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:12,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:12,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921177605] [2022-03-20 07:27:12,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921177605] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:12,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:12,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 07:27:12,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494779076] [2022-03-20 07:27:12,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:12,548 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 07:27:12,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:12,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 07:27:12,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-20 07:27:12,548 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-03-20 07:27:13,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:13,110 INFO L93 Difference]: Finished difference Result 589 states and 746 transitions. [2022-03-20 07:27:13,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 07:27:13,110 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-03-20 07:27:13,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:13,112 INFO L225 Difference]: With dead ends: 589 [2022-03-20 07:27:13,112 INFO L226 Difference]: Without dead ends: 589 [2022-03-20 07:27:13,112 INFO L912 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-03-20 07:27:13,112 INFO L913 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-03-20 07:27:13,113 INFO L914 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-03-20 07:27:13,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-03-20 07:27:13,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 566. [2022-03-20 07:27:13,118 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-03-20 07:27:13,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 717 transitions. [2022-03-20 07:27:13,119 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 717 transitions. Word has length 61 [2022-03-20 07:27:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:13,119 INFO L478 AbstractCegarLoop]: Abstraction has 566 states and 717 transitions. [2022-03-20 07:27:13,119 INFO L479 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-03-20 07:27:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 717 transitions. [2022-03-20 07:27:13,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-20 07:27:13,120 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:13,120 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:13,120 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-20 07:27:13,120 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:13,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:13,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1616264812, now seen corresponding path program 1 times [2022-03-20 07:27:13,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:13,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394679603] [2022-03-20 07:27:13,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:13,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:13,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:13,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:13,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:13,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-20 07:27:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:13,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:13,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:13,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:13,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394679603] [2022-03-20 07:27:13,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394679603] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:13,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:13,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 07:27:13,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078598803] [2022-03-20 07:27:13,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:13,289 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 07:27:13,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:13,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 07:27:13,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-03-20 07:27:13,289 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-03-20 07:27:14,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:14,014 INFO L93 Difference]: Finished difference Result 538 states and 675 transitions. [2022-03-20 07:27:14,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 07:27:14,014 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-03-20 07:27:14,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:14,016 INFO L225 Difference]: With dead ends: 538 [2022-03-20 07:27:14,016 INFO L226 Difference]: Without dead ends: 538 [2022-03-20 07:27:14,016 INFO L912 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-03-20 07:27:14,016 INFO L913 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-03-20 07:27:14,016 INFO L914 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-03-20 07:27:14,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-03-20 07:27:14,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 511. [2022-03-20 07:27:14,024 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-03-20 07:27:14,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 639 transitions. [2022-03-20 07:27:14,025 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 639 transitions. Word has length 64 [2022-03-20 07:27:14,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:14,025 INFO L478 AbstractCegarLoop]: Abstraction has 511 states and 639 transitions. [2022-03-20 07:27:14,025 INFO L479 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-03-20 07:27:14,025 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 639 transitions. [2022-03-20 07:27:14,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-03-20 07:27:14,027 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:14,027 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:14,027 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-20 07:27:14,027 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:14,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:14,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1336270132, now seen corresponding path program 1 times [2022-03-20 07:27:14,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:14,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395106578] [2022-03-20 07:27:14,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:14,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:14,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:14,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:14,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:14,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:27:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:14,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 07:27:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:14,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 07:27:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:14,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:14,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395106578] [2022-03-20 07:27:14,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395106578] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:14,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:14,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 07:27:14,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852380271] [2022-03-20 07:27:14,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:14,261 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 07:27:14,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:14,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 07:27:14,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-03-20 07:27:14,261 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-03-20 07:27:15,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:15,339 INFO L93 Difference]: Finished difference Result 542 states and 675 transitions. [2022-03-20 07:27:15,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 07:27:15,340 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-03-20 07:27:15,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:15,341 INFO L225 Difference]: With dead ends: 542 [2022-03-20 07:27:15,341 INFO L226 Difference]: Without dead ends: 524 [2022-03-20 07:27:15,342 INFO L912 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-03-20 07:27:15,343 INFO L913 BasicCegarLoop]: 377 mSDtfsCounter, 575 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 2588 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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-03-20 07:27:15,343 INFO L914 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-03-20 07:27:15,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-03-20 07:27:15,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 508. [2022-03-20 07:27:15,348 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-03-20 07:27:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 635 transitions. [2022-03-20 07:27:15,348 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 635 transitions. Word has length 59 [2022-03-20 07:27:15,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:15,348 INFO L478 AbstractCegarLoop]: Abstraction has 508 states and 635 transitions. [2022-03-20 07:27:15,349 INFO L479 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-03-20 07:27:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 635 transitions. [2022-03-20 07:27:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-20 07:27:15,349 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:15,349 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:15,349 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-20 07:27:15,350 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:15,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:15,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1613674778, now seen corresponding path program 1 times [2022-03-20 07:27:15,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:15,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605680645] [2022-03-20 07:27:15,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:15,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:15,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:15,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:15,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:15,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:15,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-03-20 07:27:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:15,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:15,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:15,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605680645] [2022-03-20 07:27:15,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605680645] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:15,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:15,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 07:27:15,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338270002] [2022-03-20 07:27:15,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:15,498 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 07:27:15,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:15,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 07:27:15,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-03-20 07:27:15,499 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-03-20 07:27:16,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:16,431 INFO L93 Difference]: Finished difference Result 535 states and 666 transitions. [2022-03-20 07:27:16,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 07:27:16,433 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-03-20 07:27:16,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:16,434 INFO L225 Difference]: With dead ends: 535 [2022-03-20 07:27:16,434 INFO L226 Difference]: Without dead ends: 520 [2022-03-20 07:27:16,434 INFO L912 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-03-20 07:27:16,435 INFO L913 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.9s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:16,435 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [491 Valid, 1547 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-20 07:27:16,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-03-20 07:27:16,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 504. [2022-03-20 07:27:16,440 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-03-20 07:27:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 629 transitions. [2022-03-20 07:27:16,444 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 629 transitions. Word has length 58 [2022-03-20 07:27:16,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:16,444 INFO L478 AbstractCegarLoop]: Abstraction has 504 states and 629 transitions. [2022-03-20 07:27:16,444 INFO L479 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-03-20 07:27:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 629 transitions. [2022-03-20 07:27:16,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-03-20 07:27:16,446 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:16,446 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:16,446 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-20 07:27:16,446 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:16,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:16,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2114727091, now seen corresponding path program 1 times [2022-03-20 07:27:16,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:16,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84088080] [2022-03-20 07:27:16,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:16,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:16,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:16,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:16,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:16,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:16,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-20 07:27:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:16,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-03-20 07:27:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:16,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:16,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:16,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84088080] [2022-03-20 07:27:16,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84088080] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:16,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:16,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 07:27:16,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396078297] [2022-03-20 07:27:16,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:16,613 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 07:27:16,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:16,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 07:27:16,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-20 07:27:16,614 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-03-20 07:27:17,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:17,543 INFO L93 Difference]: Finished difference Result 536 states and 666 transitions. [2022-03-20 07:27:17,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 07:27:17,544 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-03-20 07:27:17,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:17,545 INFO L225 Difference]: With dead ends: 536 [2022-03-20 07:27:17,545 INFO L226 Difference]: Without dead ends: 515 [2022-03-20 07:27:17,546 INFO L912 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-03-20 07:27:17,546 INFO L913 BasicCegarLoop]: 362 mSDtfsCounter, 332 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 2113 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:17,546 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 877 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2113 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-20 07:27:17,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-03-20 07:27:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 499. [2022-03-20 07:27:17,551 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-03-20 07:27:17,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 621 transitions. [2022-03-20 07:27:17,553 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 621 transitions. Word has length 60 [2022-03-20 07:27:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:17,553 INFO L478 AbstractCegarLoop]: Abstraction has 499 states and 621 transitions. [2022-03-20 07:27:17,553 INFO L479 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-03-20 07:27:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 621 transitions. [2022-03-20 07:27:17,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-03-20 07:27:17,554 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:17,554 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:17,554 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-20 07:27:17,554 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:17,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:17,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1861314870, now seen corresponding path program 1 times [2022-03-20 07:27:17,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:17,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996595793] [2022-03-20 07:27:17,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:17,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:17,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:17,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:17,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:17,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-20 07:27:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:17,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:17,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:17,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:17,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:17,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996595793] [2022-03-20 07:27:17,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996595793] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:17,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:17,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 07:27:17,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792891883] [2022-03-20 07:27:17,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:17,752 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 07:27:17,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:17,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 07:27:17,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-20 07:27:17,752 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-03-20 07:27:18,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:18,666 INFO L93 Difference]: Finished difference Result 521 states and 649 transitions. [2022-03-20 07:27:18,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 07:27:18,667 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-03-20 07:27:18,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:18,668 INFO L225 Difference]: With dead ends: 521 [2022-03-20 07:27:18,668 INFO L226 Difference]: Without dead ends: 521 [2022-03-20 07:27:18,668 INFO L912 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-03-20 07:27:18,669 INFO L913 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-03-20 07:27:18,669 INFO L914 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-03-20 07:27:18,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-03-20 07:27:18,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 499. [2022-03-20 07:27:18,674 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-03-20 07:27:18,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions. [2022-03-20 07:27:18,682 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 68 [2022-03-20 07:27:18,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:18,683 INFO L478 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions. [2022-03-20 07:27:18,683 INFO L479 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-03-20 07:27:18,683 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions. [2022-03-20 07:27:18,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-20 07:27:18,684 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:18,684 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:18,684 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-20 07:27:18,684 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:18,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:18,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1116193296, now seen corresponding path program 1 times [2022-03-20 07:27:18,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:18,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521258317] [2022-03-20 07:27:18,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:18,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:18,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:18,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:18,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:18,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:27:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:18,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 07:27:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:18,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 07:27:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:18,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:18,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:18,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521258317] [2022-03-20 07:27:18,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521258317] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:18,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:18,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 07:27:18,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776877787] [2022-03-20 07:27:18,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:18,846 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 07:27:18,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:18,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 07:27:18,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-03-20 07:27:18,847 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-03-20 07:27:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:19,851 INFO L93 Difference]: Finished difference Result 519 states and 644 transitions. [2022-03-20 07:27:19,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 07:27:19,852 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-03-20 07:27:19,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:19,853 INFO L225 Difference]: With dead ends: 519 [2022-03-20 07:27:19,853 INFO L226 Difference]: Without dead ends: 519 [2022-03-20 07:27:19,853 INFO L912 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-03-20 07:27:19,854 INFO L913 BasicCegarLoop]: 359 mSDtfsCounter, 321 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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-03-20 07:27:19,854 INFO L914 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-03-20 07:27:19,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-03-20 07:27:19,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 503. [2022-03-20 07:27:19,863 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-03-20 07:27:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 623 transitions. [2022-03-20 07:27:19,864 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 623 transitions. Word has length 63 [2022-03-20 07:27:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:19,864 INFO L478 AbstractCegarLoop]: Abstraction has 503 states and 623 transitions. [2022-03-20 07:27:19,865 INFO L479 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-03-20 07:27:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 623 transitions. [2022-03-20 07:27:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-20 07:27:19,865 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:19,865 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:19,866 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-20 07:27:19,866 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:19,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:19,866 INFO L85 PathProgramCache]: Analyzing trace with hash -929996240, now seen corresponding path program 1 times [2022-03-20 07:27:19,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:19,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226347382] [2022-03-20 07:27:19,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:19,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:19,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:19,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:19,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:19,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:27:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:20,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 07:27:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:20,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 07:27:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:20,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:20,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226347382] [2022-03-20 07:27:20,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226347382] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:20,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:20,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 07:27:20,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631730002] [2022-03-20 07:27:20,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:20,045 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 07:27:20,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:20,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 07:27:20,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-03-20 07:27:20,045 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-03-20 07:27:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:21,145 INFO L93 Difference]: Finished difference Result 505 states and 625 transitions. [2022-03-20 07:27:21,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 07:27:21,145 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-03-20 07:27:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:21,147 INFO L225 Difference]: With dead ends: 505 [2022-03-20 07:27:21,147 INFO L226 Difference]: Without dead ends: 505 [2022-03-20 07:27:21,147 INFO L912 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-03-20 07:27:21,148 INFO L913 BasicCegarLoop]: 352 mSDtfsCounter, 671 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:21,148 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [685 Valid, 972 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 2096 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-20 07:27:21,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-03-20 07:27:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 489. [2022-03-20 07:27:21,154 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-03-20 07:27:21,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 604 transitions. [2022-03-20 07:27:21,155 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 604 transitions. Word has length 63 [2022-03-20 07:27:21,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:21,155 INFO L478 AbstractCegarLoop]: Abstraction has 489 states and 604 transitions. [2022-03-20 07:27:21,155 INFO L479 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-03-20 07:27:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 604 transitions. [2022-03-20 07:27:21,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-03-20 07:27:21,156 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:21,156 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:21,156 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-20 07:27:21,156 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:21,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:21,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1704717596, now seen corresponding path program 1 times [2022-03-20 07:27:21,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:21,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326020404] [2022-03-20 07:27:21,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:21,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:21,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:21,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:21,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:21,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-20 07:27:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:21,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:21,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:21,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:21,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:21,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326020404] [2022-03-20 07:27:21,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326020404] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:21,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:21,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 07:27:21,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512084246] [2022-03-20 07:27:21,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:21,355 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 07:27:21,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:21,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 07:27:21,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-20 07:27:21,355 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-03-20 07:27:22,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:22,148 INFO L93 Difference]: Finished difference Result 524 states and 652 transitions. [2022-03-20 07:27:22,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-20 07:27:22,148 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-03-20 07:27:22,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:22,150 INFO L225 Difference]: With dead ends: 524 [2022-03-20 07:27:22,150 INFO L226 Difference]: Without dead ends: 524 [2022-03-20 07:27:22,150 INFO L912 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-03-20 07:27:22,150 INFO L913 BasicCegarLoop]: 375 mSDtfsCounter, 556 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:22,150 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 1315 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-20 07:27:22,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-03-20 07:27:22,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 489. [2022-03-20 07:27:22,155 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-03-20 07:27:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 602 transitions. [2022-03-20 07:27:22,155 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 602 transitions. Word has length 71 [2022-03-20 07:27:22,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:22,155 INFO L478 AbstractCegarLoop]: Abstraction has 489 states and 602 transitions. [2022-03-20 07:27:22,156 INFO L479 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-03-20 07:27:22,156 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 602 transitions. [2022-03-20 07:27:22,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-20 07:27:22,156 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:22,156 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:22,156 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-20 07:27:22,157 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:22,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1439851345, now seen corresponding path program 1 times [2022-03-20 07:27:22,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:22,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320033269] [2022-03-20 07:27:22,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:22,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:22,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:22,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:22,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:22,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:22,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:22,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:22,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320033269] [2022-03-20 07:27:22,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320033269] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:22,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:22,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 07:27:22,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976174335] [2022-03-20 07:27:22,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:22,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 07:27:22,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:22,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 07:27:22,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-20 07:27:22,328 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-03-20 07:27:23,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:23,252 INFO L93 Difference]: Finished difference Result 519 states and 637 transitions. [2022-03-20 07:27:23,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 07:27:23,253 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-03-20 07:27:23,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:23,254 INFO L225 Difference]: With dead ends: 519 [2022-03-20 07:27:23,254 INFO L226 Difference]: Without dead ends: 501 [2022-03-20 07:27:23,255 INFO L912 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-03-20 07:27:23,255 INFO L913 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.9s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:23,255 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 1611 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2179 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-20 07:27:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-03-20 07:27:23,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 485. [2022-03-20 07:27:23,259 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-03-20 07:27:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 596 transitions. [2022-03-20 07:27:23,260 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 596 transitions. Word has length 63 [2022-03-20 07:27:23,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:23,260 INFO L478 AbstractCegarLoop]: Abstraction has 485 states and 596 transitions. [2022-03-20 07:27:23,260 INFO L479 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-03-20 07:27:23,260 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 596 transitions. [2022-03-20 07:27:23,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-20 07:27:23,261 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:23,261 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:23,261 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-20 07:27:23,261 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:23,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:23,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1734732644, now seen corresponding path program 1 times [2022-03-20 07:27:23,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:23,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405125978] [2022-03-20 07:27:23,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:23,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:23,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:23,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:23,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:23,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:27:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:23,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 07:27:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:23,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:23,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:23,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405125978] [2022-03-20 07:27:23,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405125978] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:23,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:23,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 07:27:23,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163930358] [2022-03-20 07:27:23,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:23,437 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 07:27:23,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:23,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 07:27:23,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-03-20 07:27:23,437 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-03-20 07:27:24,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:24,193 INFO L93 Difference]: Finished difference Result 509 states and 624 transitions. [2022-03-20 07:27:24,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 07:27:24,194 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-03-20 07:27:24,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:24,195 INFO L225 Difference]: With dead ends: 509 [2022-03-20 07:27:24,195 INFO L226 Difference]: Without dead ends: 490 [2022-03-20 07:27:24,196 INFO L912 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-03-20 07:27:24,196 INFO L913 BasicCegarLoop]: 375 mSDtfsCounter, 315 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 1970 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:24,196 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 1452 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1970 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-20 07:27:24,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-03-20 07:27:24,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 474. [2022-03-20 07:27:24,204 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-03-20 07:27:24,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 581 transitions. [2022-03-20 07:27:24,204 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 581 transitions. Word has length 64 [2022-03-20 07:27:24,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:24,204 INFO L478 AbstractCegarLoop]: Abstraction has 474 states and 581 transitions. [2022-03-20 07:27:24,204 INFO L479 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-03-20 07:27:24,204 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 581 transitions. [2022-03-20 07:27:24,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-20 07:27:24,206 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:24,206 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:24,206 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-20 07:27:24,206 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:24,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:24,207 INFO L85 PathProgramCache]: Analyzing trace with hash -144637562, now seen corresponding path program 1 times [2022-03-20 07:27:24,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:24,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937737278] [2022-03-20 07:27:24,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:24,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:24,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:24,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:24,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:24,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:24,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:24,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:24,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937737278] [2022-03-20 07:27:24,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937737278] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:24,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:24,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 07:27:24,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800522919] [2022-03-20 07:27:24,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:24,365 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 07:27:24,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:24,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 07:27:24,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-20 07:27:24,365 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-03-20 07:27:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:25,364 INFO L93 Difference]: Finished difference Result 504 states and 616 transitions. [2022-03-20 07:27:25,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 07:27:25,364 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-03-20 07:27:25,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:25,366 INFO L225 Difference]: With dead ends: 504 [2022-03-20 07:27:25,366 INFO L226 Difference]: Without dead ends: 485 [2022-03-20 07:27:25,366 INFO L912 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-03-20 07:27:25,367 INFO L913 BasicCegarLoop]: 367 mSDtfsCounter, 293 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:25,367 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 1681 Invalid, 2373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-20 07:27:25,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-03-20 07:27:25,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2022-03-20 07:27:25,371 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-03-20 07:27:25,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 574 transitions. [2022-03-20 07:27:25,371 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 574 transitions. Word has length 64 [2022-03-20 07:27:25,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:25,371 INFO L478 AbstractCegarLoop]: Abstraction has 469 states and 574 transitions. [2022-03-20 07:27:25,372 INFO L479 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-03-20 07:27:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 574 transitions. [2022-03-20 07:27:25,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-20 07:27:25,372 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:25,372 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:25,372 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-20 07:27:25,373 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:25,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:25,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1120155272, now seen corresponding path program 1 times [2022-03-20 07:27:25,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:25,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028164261] [2022-03-20 07:27:25,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:25,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:25,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:25,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:25,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:25,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:25,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:25,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:25,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028164261] [2022-03-20 07:27:25,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028164261] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:25,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:25,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 07:27:25,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61062108] [2022-03-20 07:27:25,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:25,553 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 07:27:25,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:25,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 07:27:25,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-20 07:27:25,554 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-03-20 07:27:26,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:26,378 INFO L93 Difference]: Finished difference Result 499 states and 609 transitions. [2022-03-20 07:27:26,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 07:27:26,378 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-03-20 07:27:26,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:26,379 INFO L225 Difference]: With dead ends: 499 [2022-03-20 07:27:26,379 INFO L226 Difference]: Without dead ends: 481 [2022-03-20 07:27:26,380 INFO L912 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-03-20 07:27:26,380 INFO L913 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.8s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:26,380 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 1473 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1946 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-20 07:27:26,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-03-20 07:27:26,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 465. [2022-03-20 07:27:26,384 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-03-20 07:27:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 568 transitions. [2022-03-20 07:27:26,384 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 568 transitions. Word has length 64 [2022-03-20 07:27:26,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:26,384 INFO L478 AbstractCegarLoop]: Abstraction has 465 states and 568 transitions. [2022-03-20 07:27:26,385 INFO L479 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-03-20 07:27:26,385 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 568 transitions. [2022-03-20 07:27:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-03-20 07:27:26,385 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:26,385 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:26,385 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-03-20 07:27:26,386 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:26,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:26,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1809242026, now seen corresponding path program 1 times [2022-03-20 07:27:26,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:26,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490262917] [2022-03-20 07:27:26,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:26,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:26,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:26,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:26,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:26,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-03-20 07:27:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:26,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:26,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:26,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:26,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:26,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:26,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490262917] [2022-03-20 07:27:26,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490262917] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:26,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:26,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 07:27:26,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853831781] [2022-03-20 07:27:26,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:26,545 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 07:27:26,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:26,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 07:27:26,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 07:27:26,545 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-03-20 07:27:27,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:27,135 INFO L93 Difference]: Finished difference Result 625 states and 761 transitions. [2022-03-20 07:27:27,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 07:27:27,135 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-03-20 07:27:27,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:27,137 INFO L225 Difference]: With dead ends: 625 [2022-03-20 07:27:27,137 INFO L226 Difference]: Without dead ends: 625 [2022-03-20 07:27:27,137 INFO L912 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-03-20 07:27:27,137 INFO L913 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-03-20 07:27:27,137 INFO L914 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-03-20 07:27:27,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-03-20 07:27:27,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 586. [2022-03-20 07:27:27,143 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-03-20 07:27:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 716 transitions. [2022-03-20 07:27:27,144 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 716 transitions. Word has length 70 [2022-03-20 07:27:27,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:27,144 INFO L478 AbstractCegarLoop]: Abstraction has 586 states and 716 transitions. [2022-03-20 07:27:27,144 INFO L479 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-03-20 07:27:27,144 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 716 transitions. [2022-03-20 07:27:27,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-03-20 07:27:27,145 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:27,145 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:27,145 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-03-20 07:27:27,145 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:27,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:27,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1680266649, now seen corresponding path program 1 times [2022-03-20 07:27:27,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:27,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234303702] [2022-03-20 07:27:27,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:27,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:27,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:27,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:27,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:27,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:27,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-03-20 07:27:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:27,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:27,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:27,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234303702] [2022-03-20 07:27:27,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234303702] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:27,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:27,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 07:27:27,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967502094] [2022-03-20 07:27:27,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:27,329 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 07:27:27,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:27,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 07:27:27,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-20 07:27:27,329 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-03-20 07:27:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:28,072 INFO L93 Difference]: Finished difference Result 616 states and 752 transitions. [2022-03-20 07:27:28,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 07:27:28,072 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-03-20 07:27:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:28,074 INFO L225 Difference]: With dead ends: 616 [2022-03-20 07:27:28,074 INFO L226 Difference]: Without dead ends: 576 [2022-03-20 07:27:28,074 INFO L912 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-03-20 07:27:28,074 INFO L913 BasicCegarLoop]: 339 mSDtfsCounter, 402 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:28,074 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [408 Valid, 1438 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-20 07:27:28,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-03-20 07:27:28,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 560. [2022-03-20 07:27:28,079 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-03-20 07:27:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 684 transitions. [2022-03-20 07:27:28,080 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 684 transitions. Word has length 68 [2022-03-20 07:27:28,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:28,080 INFO L478 AbstractCegarLoop]: Abstraction has 560 states and 684 transitions. [2022-03-20 07:27:28,080 INFO L479 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-03-20 07:27:28,080 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 684 transitions. [2022-03-20 07:27:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-03-20 07:27:28,081 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:28,081 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:28,081 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-03-20 07:27:28,081 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:28,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:28,081 INFO L85 PathProgramCache]: Analyzing trace with hash -815860561, now seen corresponding path program 1 times [2022-03-20 07:27:28,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:28,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65023776] [2022-03-20 07:27:28,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:28,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:28,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:28,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:28,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:28,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 07:27:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:28,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 07:27:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:28,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 07:27:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:28,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-03-20 07:27:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:28,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:28,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65023776] [2022-03-20 07:27:28,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65023776] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:28,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:28,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-20 07:27:28,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477523549] [2022-03-20 07:27:28,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:28,289 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-20 07:27:28,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:28,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-20 07:27:28,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-03-20 07:27:28,289 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-03-20 07:27:29,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:29,450 INFO L93 Difference]: Finished difference Result 586 states and 715 transitions. [2022-03-20 07:27:29,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-20 07:27:29,450 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-03-20 07:27:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:29,452 INFO L225 Difference]: With dead ends: 586 [2022-03-20 07:27:29,452 INFO L226 Difference]: Without dead ends: 535 [2022-03-20 07:27:29,452 INFO L912 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-03-20 07:27:29,452 INFO L913 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, 1.0s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:29,452 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 902 Invalid, 2760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2616 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-20 07:27:29,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-03-20 07:27:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 519. [2022-03-20 07:27:29,457 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-03-20 07:27:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 632 transitions. [2022-03-20 07:27:29,457 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 632 transitions. Word has length 71 [2022-03-20 07:27:29,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:29,457 INFO L478 AbstractCegarLoop]: Abstraction has 519 states and 632 transitions. [2022-03-20 07:27:29,458 INFO L479 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-03-20 07:27:29,458 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 632 transitions. [2022-03-20 07:27:29,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-03-20 07:27:29,458 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:29,459 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:29,460 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-03-20 07:27:29,460 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:29,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:29,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1160220987, now seen corresponding path program 1 times [2022-03-20 07:27:29,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:29,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863463484] [2022-03-20 07:27:29,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:29,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:29,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:29,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:29,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:29,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-20 07:27:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:29,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:29,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:29,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:29,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-03-20 07:27:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:29,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:29,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:29,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863463484] [2022-03-20 07:27:29,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863463484] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:29,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:29,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 07:27:29,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851655077] [2022-03-20 07:27:29,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:29,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 07:27:29,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:29,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 07:27:29,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-03-20 07:27:29,620 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-03-20 07:27:30,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:30,403 INFO L93 Difference]: Finished difference Result 523 states and 631 transitions. [2022-03-20 07:27:30,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 07:27:30,403 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-03-20 07:27:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:30,404 INFO L225 Difference]: With dead ends: 523 [2022-03-20 07:27:30,404 INFO L226 Difference]: Without dead ends: 523 [2022-03-20 07:27:30,405 INFO L912 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-03-20 07:27:30,405 INFO L913 BasicCegarLoop]: 388 mSDtfsCounter, 374 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:30,405 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 1095 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-20 07:27:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-03-20 07:27:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 501. [2022-03-20 07:27:30,410 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-03-20 07:27:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 602 transitions. [2022-03-20 07:27:30,410 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 602 transitions. Word has length 82 [2022-03-20 07:27:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:30,411 INFO L478 AbstractCegarLoop]: Abstraction has 501 states and 602 transitions. [2022-03-20 07:27:30,411 INFO L479 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-03-20 07:27:30,411 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 602 transitions. [2022-03-20 07:27:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-03-20 07:27:30,411 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:30,411 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:30,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-03-20 07:27:30,412 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:30,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:30,412 INFO L85 PathProgramCache]: Analyzing trace with hash 633938585, now seen corresponding path program 1 times [2022-03-20 07:27:30,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:30,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268740742] [2022-03-20 07:27:30,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:30,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:30,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:30,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:30,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:30,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-03-20 07:27:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:30,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:30,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:30,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:30,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-03-20 07:27:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:30,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:30,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:30,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268740742] [2022-03-20 07:27:30,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268740742] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:30,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:30,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 07:27:30,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221401913] [2022-03-20 07:27:30,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:30,623 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 07:27:30,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:30,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 07:27:30,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-03-20 07:27:30,623 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-03-20 07:27:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:31,370 INFO L93 Difference]: Finished difference Result 585 states and 740 transitions. [2022-03-20 07:27:31,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-20 07:27:31,370 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-03-20 07:27:31,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:31,372 INFO L225 Difference]: With dead ends: 585 [2022-03-20 07:27:31,372 INFO L226 Difference]: Without dead ends: 585 [2022-03-20 07:27:31,373 INFO L912 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-03-20 07:27:31,374 INFO L913 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-03-20 07:27:31,374 INFO L914 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-03-20 07:27:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-03-20 07:27:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 465. [2022-03-20 07:27:31,381 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-03-20 07:27:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 556 transitions. [2022-03-20 07:27:31,381 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 556 transitions. Word has length 83 [2022-03-20 07:27:31,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:31,382 INFO L478 AbstractCegarLoop]: Abstraction has 465 states and 556 transitions. [2022-03-20 07:27:31,382 INFO L479 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-03-20 07:27:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 556 transitions. [2022-03-20 07:27:31,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-20 07:27:31,382 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:31,383 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:31,383 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-03-20 07:27:31,383 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:31,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:31,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1833243044, now seen corresponding path program 1 times [2022-03-20 07:27:31,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:31,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98857974] [2022-03-20 07:27:31,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:31,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:31,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:31,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:31,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:31,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:31,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:31,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:31,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:31,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:31,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-03-20 07:27:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:31,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:31,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:31,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98857974] [2022-03-20 07:27:31,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98857974] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:31,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:31,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-20 07:27:31,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333983965] [2022-03-20 07:27:31,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:31,606 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-20 07:27:31,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:31,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-20 07:27:31,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-03-20 07:27:31,606 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-03-20 07:27:32,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:32,384 INFO L93 Difference]: Finished difference Result 523 states and 626 transitions. [2022-03-20 07:27:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-20 07:27:32,385 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-03-20 07:27:32,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:32,386 INFO L225 Difference]: With dead ends: 523 [2022-03-20 07:27:32,386 INFO L226 Difference]: Without dead ends: 505 [2022-03-20 07:27:32,387 INFO L912 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-03-20 07:27:32,387 INFO L913 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-03-20 07:27:32,387 INFO L914 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-03-20 07:27:32,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-03-20 07:27:32,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 473. [2022-03-20 07:27:32,391 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-03-20 07:27:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 566 transitions. [2022-03-20 07:27:32,391 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 566 transitions. Word has length 88 [2022-03-20 07:27:32,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:32,392 INFO L478 AbstractCegarLoop]: Abstraction has 473 states and 566 transitions. [2022-03-20 07:27:32,392 INFO L479 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-03-20 07:27:32,392 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 566 transitions. [2022-03-20 07:27:32,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-03-20 07:27:32,392 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:32,392 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:32,393 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-03-20 07:27:32,393 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:32,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:32,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2018356459, now seen corresponding path program 1 times [2022-03-20 07:27:32,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:32,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750719505] [2022-03-20 07:27:32,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:32,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:32,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:32,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:32,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:32,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:32,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:32,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:32,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:32,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:32,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-03-20 07:27:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:32,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:32,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750719505] [2022-03-20 07:27:32,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750719505] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:32,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:32,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-20 07:27:32,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812433113] [2022-03-20 07:27:32,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:32,597 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-20 07:27:32,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:32,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-20 07:27:32,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-03-20 07:27:32,598 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-03-20 07:27:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:33,384 INFO L93 Difference]: Finished difference Result 523 states and 625 transitions. [2022-03-20 07:27:33,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-20 07:27:33,385 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-03-20 07:27:33,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:33,386 INFO L225 Difference]: With dead ends: 523 [2022-03-20 07:27:33,386 INFO L226 Difference]: Without dead ends: 505 [2022-03-20 07:27:33,386 INFO L912 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-03-20 07:27:33,386 INFO L913 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.7s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:33,387 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 1742 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1845 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-20 07:27:33,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-03-20 07:27:33,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 465. [2022-03-20 07:27:33,390 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-03-20 07:27:33,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 555 transitions. [2022-03-20 07:27:33,391 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 555 transitions. Word has length 89 [2022-03-20 07:27:33,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:33,391 INFO L478 AbstractCegarLoop]: Abstraction has 465 states and 555 transitions. [2022-03-20 07:27:33,391 INFO L479 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-03-20 07:27:33,391 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 555 transitions. [2022-03-20 07:27:33,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-03-20 07:27:33,392 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:33,392 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:33,392 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-03-20 07:27:33,392 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:33,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:33,392 INFO L85 PathProgramCache]: Analyzing trace with hash -72110269, now seen corresponding path program 1 times [2022-03-20 07:27:33,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:33,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544406107] [2022-03-20 07:27:33,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:33,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:33,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:33,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:33,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:33,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:33,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:33,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:33,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:33,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:33,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-03-20 07:27:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:33,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-03-20 07:27:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:33,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:33,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544406107] [2022-03-20 07:27:33,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544406107] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:33,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:33,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 07:27:33,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374731572] [2022-03-20 07:27:33,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:33,575 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 07:27:33,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:33,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 07:27:33,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-03-20 07:27:33,575 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-03-20 07:27:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:34,191 INFO L93 Difference]: Finished difference Result 485 states and 577 transitions. [2022-03-20 07:27:34,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 07:27:34,191 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-03-20 07:27:34,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:34,192 INFO L225 Difference]: With dead ends: 485 [2022-03-20 07:27:34,193 INFO L226 Difference]: Without dead ends: 483 [2022-03-20 07:27:34,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-03-20 07:27:34,193 INFO L913 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-03-20 07:27:34,193 INFO L914 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-03-20 07:27:34,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-03-20 07:27:34,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 459. [2022-03-20 07:27:34,197 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-03-20 07:27:34,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 546 transitions. [2022-03-20 07:27:34,197 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 546 transitions. Word has length 98 [2022-03-20 07:27:34,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:34,197 INFO L478 AbstractCegarLoop]: Abstraction has 459 states and 546 transitions. [2022-03-20 07:27:34,198 INFO L479 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-03-20 07:27:34,198 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 546 transitions. [2022-03-20 07:27:34,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-03-20 07:27:34,198 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:34,198 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:34,198 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-03-20 07:27:34,199 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:34,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:34,199 INFO L85 PathProgramCache]: Analyzing trace with hash 221001860, now seen corresponding path program 1 times [2022-03-20 07:27:34,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:34,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763185921] [2022-03-20 07:27:34,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:34,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:34,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:34,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:34,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:34,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:34,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-20 07:27:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:34,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 07:27:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:34,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 07:27:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:34,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-03-20 07:27:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:34,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:34,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763185921] [2022-03-20 07:27:34,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763185921] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:34,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:34,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 07:27:34,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873781995] [2022-03-20 07:27:34,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:34,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 07:27:34,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:34,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 07:27:34,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-20 07:27:34,390 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-03-20 07:27:36,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:36,411 INFO L93 Difference]: Finished difference Result 1310 states and 1519 transitions. [2022-03-20 07:27:36,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-20 07:27:36,411 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-03-20 07:27:36,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:36,413 INFO L225 Difference]: With dead ends: 1310 [2022-03-20 07:27:36,414 INFO L226 Difference]: Without dead ends: 1310 [2022-03-20 07:27:36,414 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=374, Invalid=1108, Unknown=0, NotChecked=0, Total=1482 [2022-03-20 07:27:36,414 INFO L913 BasicCegarLoop]: 577 mSDtfsCounter, 1541 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 2098 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:36,414 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1544 Valid, 839 Invalid, 2672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 2098 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-20 07:27:36,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2022-03-20 07:27:36,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1036. [2022-03-20 07:27:36,429 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-03-20 07:27:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1213 transitions. [2022-03-20 07:27:36,430 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1213 transitions. Word has length 92 [2022-03-20 07:27:36,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:36,430 INFO L478 AbstractCegarLoop]: Abstraction has 1036 states and 1213 transitions. [2022-03-20 07:27:36,430 INFO L479 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-03-20 07:27:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1213 transitions. [2022-03-20 07:27:36,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-20 07:27:36,431 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:36,431 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:36,431 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-03-20 07:27:36,432 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:36,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:36,432 INFO L85 PathProgramCache]: Analyzing trace with hash 457485908, now seen corresponding path program 1 times [2022-03-20 07:27:36,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:36,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163178214] [2022-03-20 07:27:36,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:36,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:36,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:36,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:36,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:36,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:36,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:36,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:36,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:36,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:36,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-03-20 07:27:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:36,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-03-20 07:27:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:36,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:36,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163178214] [2022-03-20 07:27:36,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163178214] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:36,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:36,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-20 07:27:36,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399447619] [2022-03-20 07:27:36,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:36,638 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-20 07:27:36,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:36,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-20 07:27:36,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-03-20 07:27:36,638 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-03-20 07:27:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:37,834 INFO L93 Difference]: Finished difference Result 1959 states and 2303 transitions. [2022-03-20 07:27:37,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-20 07:27:37,835 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-03-20 07:27:37,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:37,841 INFO L225 Difference]: With dead ends: 1959 [2022-03-20 07:27:37,841 INFO L226 Difference]: Without dead ends: 1897 [2022-03-20 07:27:37,842 INFO L912 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-03-20 07:27:37,846 INFO L913 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-03-20 07:27:37,846 INFO L914 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-03-20 07:27:37,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2022-03-20 07:27:37,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1000. [2022-03-20 07:27:37,871 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-03-20 07:27:37,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1167 transitions. [2022-03-20 07:27:37,872 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1167 transitions. Word has length 99 [2022-03-20 07:27:37,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:37,872 INFO L478 AbstractCegarLoop]: Abstraction has 1000 states and 1167 transitions. [2022-03-20 07:27:37,873 INFO L479 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-03-20 07:27:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1167 transitions. [2022-03-20 07:27:37,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-20 07:27:37,892 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:37,892 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:37,892 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-03-20 07:27:37,892 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:37,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:37,892 INFO L85 PathProgramCache]: Analyzing trace with hash 925491343, now seen corresponding path program 1 times [2022-03-20 07:27:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:37,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191992864] [2022-03-20 07:27:37,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:37,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:37,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:38,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:38,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:38,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:38,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-20 07:27:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:38,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 07:27:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:38,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 07:27:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:38,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-03-20 07:27:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:38,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:38,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191992864] [2022-03-20 07:27:38,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191992864] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:38,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:38,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-20 07:27:38,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333212311] [2022-03-20 07:27:38,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:38,129 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-20 07:27:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:38,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-20 07:27:38,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-03-20 07:27:38,129 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-03-20 07:27:38,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:38,976 INFO L93 Difference]: Finished difference Result 1007 states and 1173 transitions. [2022-03-20 07:27:38,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-20 07:27:38,976 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-03-20 07:27:38,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:38,978 INFO L225 Difference]: With dead ends: 1007 [2022-03-20 07:27:38,978 INFO L226 Difference]: Without dead ends: 804 [2022-03-20 07:27:38,979 INFO L912 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-03-20 07:27:38,979 INFO L913 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.8s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:38,979 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 588 Invalid, 2216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 2131 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-20 07:27:38,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-03-20 07:27:38,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 796. [2022-03-20 07:27:38,987 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-03-20 07:27:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 930 transitions. [2022-03-20 07:27:38,988 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 930 transitions. Word has length 93 [2022-03-20 07:27:38,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:38,988 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 930 transitions. [2022-03-20 07:27:38,989 INFO L479 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-03-20 07:27:38,989 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 930 transitions. [2022-03-20 07:27:38,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-03-20 07:27:38,990 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:38,990 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:38,990 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-03-20 07:27:38,990 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:38,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:38,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1426092271, now seen corresponding path program 1 times [2022-03-20 07:27:38,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:38,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586483925] [2022-03-20 07:27:38,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:38,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 07:27:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 07:27:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 07:27:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-03-20 07:27:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:39,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:39,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586483925] [2022-03-20 07:27:39,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586483925] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:39,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:39,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-03-20 07:27:39,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330944243] [2022-03-20 07:27:39,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:39,279 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-20 07:27:39,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:39,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-20 07:27:39,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-03-20 07:27:39,280 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-03-20 07:27:39,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:39,803 INFO L93 Difference]: Finished difference Result 872 states and 1024 transitions. [2022-03-20 07:27:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-20 07:27:39,803 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-03-20 07:27:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:39,804 INFO L225 Difference]: With dead ends: 872 [2022-03-20 07:27:39,804 INFO L226 Difference]: Without dead ends: 834 [2022-03-20 07:27:39,805 INFO L912 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-03-20 07:27:39,805 INFO L913 BasicCegarLoop]: 179 mSDtfsCounter, 163 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-03-20 07:27:39,805 INFO L914 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-03-20 07:27:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-03-20 07:27:39,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 814. [2022-03-20 07:27:39,812 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-03-20 07:27:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 942 transitions. [2022-03-20 07:27:39,812 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 942 transitions. Word has length 104 [2022-03-20 07:27:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:39,813 INFO L478 AbstractCegarLoop]: Abstraction has 814 states and 942 transitions. [2022-03-20 07:27:39,813 INFO L479 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-03-20 07:27:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 942 transitions. [2022-03-20 07:27:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-03-20 07:27:39,814 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:39,814 INFO L499 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-03-20 07:27:39,814 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-03-20 07:27:39,814 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:39,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:39,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1466232135, now seen corresponding path program 1 times [2022-03-20 07:27:39,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:39,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229456408] [2022-03-20 07:27:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:39,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-03-20 07:27:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-03-20 07:27:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:39,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 07:27:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:40,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:40,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:40,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-03-20 07:27:40,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:40,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229456408] [2022-03-20 07:27:40,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229456408] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:40,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:40,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 07:27:40,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371572159] [2022-03-20 07:27:40,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:40,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 07:27:40,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:40,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 07:27:40,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-03-20 07:27:40,008 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-03-20 07:27:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:40,362 INFO L93 Difference]: Finished difference Result 717 states and 809 transitions. [2022-03-20 07:27:40,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-20 07:27:40,362 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-03-20 07:27:40,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:40,364 INFO L225 Difference]: With dead ends: 717 [2022-03-20 07:27:40,364 INFO L226 Difference]: Without dead ends: 717 [2022-03-20 07:27:40,364 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-03-20 07:27:40,364 INFO L913 BasicCegarLoop]: 181 mSDtfsCounter, 219 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-03-20 07:27:40,364 INFO L914 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-03-20 07:27:40,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-03-20 07:27:40,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 449. [2022-03-20 07:27:40,369 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-03-20 07:27:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 499 transitions. [2022-03-20 07:27:40,369 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 499 transitions. Word has length 113 [2022-03-20 07:27:40,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:40,370 INFO L478 AbstractCegarLoop]: Abstraction has 449 states and 499 transitions. [2022-03-20 07:27:40,370 INFO L479 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-03-20 07:27:40,370 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 499 transitions. [2022-03-20 07:27:40,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-03-20 07:27:40,370 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:40,371 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:40,371 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-03-20 07:27:40,371 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:40,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:40,371 INFO L85 PathProgramCache]: Analyzing trace with hash -165727650, now seen corresponding path program 1 times [2022-03-20 07:27:40,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:40,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328389234] [2022-03-20 07:27:40,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:40,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:40,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:40,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:40,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:40,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:40,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 07:27:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:40,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 07:27:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:40,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:40,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:40,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:40,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 07:27:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:40,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:40,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-03-20 07:27:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:40,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-03-20 07:27:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:40,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:40,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328389234] [2022-03-20 07:27:40,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328389234] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:40,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:40,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-20 07:27:40,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095733138] [2022-03-20 07:27:40,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:40,584 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-20 07:27:40,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:40,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-20 07:27:40,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-03-20 07:27:40,584 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-03-20 07:27:40,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:40,944 INFO L93 Difference]: Finished difference Result 477 states and 531 transitions. [2022-03-20 07:27:40,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 07:27:40,944 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-03-20 07:27:40,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:40,945 INFO L225 Difference]: With dead ends: 477 [2022-03-20 07:27:40,945 INFO L226 Difference]: Without dead ends: 477 [2022-03-20 07:27:40,945 INFO L912 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-03-20 07:27:40,946 INFO L913 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-03-20 07:27:40,946 INFO L914 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-03-20 07:27:40,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-03-20 07:27:40,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 457. [2022-03-20 07:27:40,949 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-03-20 07:27:40,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 507 transitions. [2022-03-20 07:27:40,950 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 507 transitions. Word has length 120 [2022-03-20 07:27:40,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:40,950 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 507 transitions. [2022-03-20 07:27:40,950 INFO L479 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-03-20 07:27:40,950 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 507 transitions. [2022-03-20 07:27:40,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-03-20 07:27:40,951 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:40,951 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 07:27:40,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-03-20 07:27:40,951 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:40,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1709722050, now seen corresponding path program 1 times [2022-03-20 07:27:40,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:40,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033693285] [2022-03-20 07:27:40,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 07:27:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 07:27:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 07:27:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-03-20 07:27:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-03-20 07:27:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 07:27:41,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:41,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033693285] [2022-03-20 07:27:41,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033693285] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:41,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:41,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-20 07:27:41,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413389763] [2022-03-20 07:27:41,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:41,166 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-20 07:27:41,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:41,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-20 07:27:41,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-03-20 07:27:41,167 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-03-20 07:27:41,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:41,680 INFO L93 Difference]: Finished difference Result 477 states and 527 transitions. [2022-03-20 07:27:41,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 07:27:41,680 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-03-20 07:27:41,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:41,681 INFO L225 Difference]: With dead ends: 477 [2022-03-20 07:27:41,681 INFO L226 Difference]: Without dead ends: 469 [2022-03-20 07:27:41,681 INFO L912 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-03-20 07:27:41,681 INFO L913 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-03-20 07:27:41,681 INFO L914 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-03-20 07:27:41,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-03-20 07:27:41,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 457. [2022-03-20 07:27:41,685 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-03-20 07:27:41,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 505 transitions. [2022-03-20 07:27:41,685 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 505 transitions. Word has length 120 [2022-03-20 07:27:41,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:41,685 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 505 transitions. [2022-03-20 07:27:41,685 INFO L479 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-03-20 07:27:41,686 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 505 transitions. [2022-03-20 07:27:41,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-03-20 07:27:41,686 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:41,686 INFO L499 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-03-20 07:27:41,686 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-03-20 07:27:41,687 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:41,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:41,687 INFO L85 PathProgramCache]: Analyzing trace with hash -232533850, now seen corresponding path program 1 times [2022-03-20 07:27:41,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:41,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863097813] [2022-03-20 07:27:41,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:41,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 07:27:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 07:27:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:41,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 07:27:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:42,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:42,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 07:27:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:42,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:42,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:42,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:42,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-03-20 07:27:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:42,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-03-20 07:27:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-03-20 07:27:42,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:42,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863097813] [2022-03-20 07:27:42,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863097813] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:42,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:42,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-03-20 07:27:42,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734374841] [2022-03-20 07:27:42,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:42,071 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-20 07:27:42,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:42,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-20 07:27:42,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2022-03-20 07:27:42,072 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-03-20 07:27:42,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:42,996 INFO L93 Difference]: Finished difference Result 581 states and 661 transitions. [2022-03-20 07:27:42,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-20 07:27:42,996 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-03-20 07:27:42,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:42,997 INFO L225 Difference]: With dead ends: 581 [2022-03-20 07:27:42,997 INFO L226 Difference]: Without dead ends: 531 [2022-03-20 07:27:42,997 INFO L912 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-03-20 07:27:42,998 INFO L913 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.8s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:42,998 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 1461 Invalid, 2099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2018 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-20 07:27:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-03-20 07:27:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 491. [2022-03-20 07:27:43,003 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-03-20 07:27:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 547 transitions. [2022-03-20 07:27:43,003 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 547 transitions. Word has length 150 [2022-03-20 07:27:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:43,005 INFO L478 AbstractCegarLoop]: Abstraction has 491 states and 547 transitions. [2022-03-20 07:27:43,005 INFO L479 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-03-20 07:27:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 547 transitions. [2022-03-20 07:27:43,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-03-20 07:27:43,006 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:43,006 INFO L499 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-03-20 07:27:43,006 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-03-20 07:27:43,006 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:43,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:43,007 INFO L85 PathProgramCache]: Analyzing trace with hash 2130033855, now seen corresponding path program 1 times [2022-03-20 07:27:43,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:43,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293431938] [2022-03-20 07:27:43,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:43,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:43,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:43,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:43,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:43,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:43,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 07:27:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:43,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 07:27:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:43,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:43,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:43,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:43,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 07:27:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:43,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:43,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 07:27:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:43,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:43,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:43,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:43,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-03-20 07:27:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:43,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-03-20 07:27:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-03-20 07:27:43,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:43,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293431938] [2022-03-20 07:27:43,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293431938] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:43,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:43,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-03-20 07:27:43,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557533458] [2022-03-20 07:27:43,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:43,266 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-20 07:27:43,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:43,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-20 07:27:43,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-03-20 07:27:43,267 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-03-20 07:27:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:43,924 INFO L93 Difference]: Finished difference Result 529 states and 589 transitions. [2022-03-20 07:27:43,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-20 07:27:43,924 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-03-20 07:27:43,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:43,926 INFO L225 Difference]: With dead ends: 529 [2022-03-20 07:27:43,926 INFO L226 Difference]: Without dead ends: 519 [2022-03-20 07:27:43,926 INFO L912 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-03-20 07:27:43,926 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 116 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:43,926 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 1250 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-20 07:27:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-03-20 07:27:43,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 491. [2022-03-20 07:27:43,930 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-03-20 07:27:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 545 transitions. [2022-03-20 07:27:43,930 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 545 transitions. Word has length 151 [2022-03-20 07:27:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:43,931 INFO L478 AbstractCegarLoop]: Abstraction has 491 states and 545 transitions. [2022-03-20 07:27:43,931 INFO L479 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-03-20 07:27:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 545 transitions. [2022-03-20 07:27:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-03-20 07:27:43,932 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:43,932 INFO L499 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-03-20 07:27:43,932 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-03-20 07:27:43,932 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:43,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:43,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1959969322, now seen corresponding path program 1 times [2022-03-20 07:27:43,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:43,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056535020] [2022-03-20 07:27:43,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:43,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:43,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 07:27:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 07:27:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 07:27:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 07:27:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-03-20 07:27:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-03-20 07:27:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-03-20 07:27:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,247 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-20 07:27:44,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:44,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056535020] [2022-03-20 07:27:44,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056535020] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:44,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:44,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-03-20 07:27:44,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80388092] [2022-03-20 07:27:44,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:44,247 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-20 07:27:44,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:44,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-20 07:27:44,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-03-20 07:27:44,248 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-03-20 07:27:44,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:44,647 INFO L93 Difference]: Finished difference Result 553 states and 621 transitions. [2022-03-20 07:27:44,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-20 07:27:44,648 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-03-20 07:27:44,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:44,649 INFO L225 Difference]: With dead ends: 553 [2022-03-20 07:27:44,649 INFO L226 Difference]: Without dead ends: 491 [2022-03-20 07:27:44,649 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-03-20 07:27:44,649 INFO L913 BasicCegarLoop]: 167 mSDtfsCounter, 199 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:44,649 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 1113 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 07:27:44,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-03-20 07:27:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 479. [2022-03-20 07:27:44,653 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-03-20 07:27:44,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 527 transitions. [2022-03-20 07:27:44,653 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 527 transitions. Word has length 153 [2022-03-20 07:27:44,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:44,654 INFO L478 AbstractCegarLoop]: Abstraction has 479 states and 527 transitions. [2022-03-20 07:27:44,654 INFO L479 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-03-20 07:27:44,654 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 527 transitions. [2022-03-20 07:27:44,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-03-20 07:27:44,655 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:44,655 INFO L499 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-03-20 07:27:44,655 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-03-20 07:27:44,655 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:44,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:44,655 INFO L85 PathProgramCache]: Analyzing trace with hash -249606396, now seen corresponding path program 1 times [2022-03-20 07:27:44,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:44,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782868713] [2022-03-20 07:27:44,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:44,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 07:27:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 07:27:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 07:27:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 07:27:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-03-20 07:27:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-03-20 07:27:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-03-20 07:27:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:44,915 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-20 07:27:44,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:44,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782868713] [2022-03-20 07:27:44,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782868713] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:44,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:44,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-20 07:27:44,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635230471] [2022-03-20 07:27:44,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:44,916 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-20 07:27:44,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:44,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-20 07:27:44,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-03-20 07:27:44,917 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-03-20 07:27:45,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:45,248 INFO L93 Difference]: Finished difference Result 473 states and 515 transitions. [2022-03-20 07:27:45,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 07:27:45,248 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-03-20 07:27:45,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:45,249 INFO L225 Difference]: With dead ends: 473 [2022-03-20 07:27:45,249 INFO L226 Difference]: Without dead ends: 451 [2022-03-20 07:27:45,249 INFO L912 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-03-20 07:27:45,257 INFO L913 BasicCegarLoop]: 146 mSDtfsCounter, 346 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:45,258 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 580 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 07:27:45,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-03-20 07:27:45,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 423. [2022-03-20 07:27:45,261 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-03-20 07:27:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 459 transitions. [2022-03-20 07:27:45,262 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 459 transitions. Word has length 158 [2022-03-20 07:27:45,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:45,268 INFO L478 AbstractCegarLoop]: Abstraction has 423 states and 459 transitions. [2022-03-20 07:27:45,269 INFO L479 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-03-20 07:27:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 459 transitions. [2022-03-20 07:27:45,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-03-20 07:27:45,270 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:45,270 INFO L499 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-03-20 07:27:45,270 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-03-20 07:27:45,283 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:45,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:45,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2090831252, now seen corresponding path program 1 times [2022-03-20 07:27:45,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:45,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558950435] [2022-03-20 07:27:45,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:45,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 07:27:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 07:27:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 07:27:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 07:27:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 07:27:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-03-20 07:27:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-03-20 07:27:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-03-20 07:27:45,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:45,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558950435] [2022-03-20 07:27:45,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558950435] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:45,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:45,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-03-20 07:27:45,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455397698] [2022-03-20 07:27:45,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:45,594 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-20 07:27:45,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:45,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-20 07:27:45,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-03-20 07:27:45,595 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-03-20 07:27:45,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:45,861 INFO L93 Difference]: Finished difference Result 401 states and 431 transitions. [2022-03-20 07:27:45,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 07:27:45,861 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-03-20 07:27:45,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:45,862 INFO L225 Difference]: With dead ends: 401 [2022-03-20 07:27:45,862 INFO L226 Difference]: Without dead ends: 381 [2022-03-20 07:27:45,862 INFO L912 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-03-20 07:27:45,863 INFO L913 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-03-20 07:27:45,863 INFO L914 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-03-20 07:27:45,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-03-20 07:27:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-03-20 07:27:45,867 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-03-20 07:27:45,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 409 transitions. [2022-03-20 07:27:45,868 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 409 transitions. Word has length 160 [2022-03-20 07:27:45,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:45,868 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 409 transitions. [2022-03-20 07:27:45,887 INFO L479 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-03-20 07:27:45,887 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 409 transitions. [2022-03-20 07:27:45,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-03-20 07:27:45,888 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:45,888 INFO L499 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-03-20 07:27:45,889 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-03-20 07:27:45,889 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:45,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:45,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1980774501, now seen corresponding path program 1 times [2022-03-20 07:27:45,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:45,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43365457] [2022-03-20 07:27:45,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:45,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:45,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:46,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:46,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:46,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:46,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 07:27:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:46,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 07:27:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:46,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:46,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:46,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:46,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 07:27:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:46,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:46,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 07:27:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:46,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:46,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:46,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:46,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-03-20 07:27:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:46,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-03-20 07:27:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:46,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-03-20 07:27:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-20 07:27:46,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:46,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43365457] [2022-03-20 07:27:46,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43365457] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:46,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:46,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-03-20 07:27:46,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906469227] [2022-03-20 07:27:46,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:46,212 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-20 07:27:46,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:46,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-20 07:27:46,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-03-20 07:27:46,214 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-03-20 07:27:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:46,997 INFO L93 Difference]: Finished difference Result 661 states and 706 transitions. [2022-03-20 07:27:46,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-20 07:27:46,998 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-03-20 07:27:46,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:46,999 INFO L225 Difference]: With dead ends: 661 [2022-03-20 07:27:46,999 INFO L226 Difference]: Without dead ends: 387 [2022-03-20 07:27:47,000 INFO L912 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-03-20 07:27:47,000 INFO L913 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.4s IncrementalHoareTripleChecker+Time [2022-03-20 07:27:47,006 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [556 Valid, 618 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 07:27:47,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-03-20 07:27:47,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 381. [2022-03-20 07:27:47,012 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-03-20 07:27:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 408 transitions. [2022-03-20 07:27:47,013 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 408 transitions. Word has length 161 [2022-03-20 07:27:47,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:47,013 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 408 transitions. [2022-03-20 07:27:47,013 INFO L479 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-03-20 07:27:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 408 transitions. [2022-03-20 07:27:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-03-20 07:27:47,014 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 07:27:47,015 INFO L499 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-03-20 07:27:47,015 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-03-20 07:27:47,015 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 07:27:47,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 07:27:47,015 INFO L85 PathProgramCache]: Analyzing trace with hash -628292860, now seen corresponding path program 1 times [2022-03-20 07:27:47,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 07:27:47,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031978604] [2022-03-20 07:27:47,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 07:27:47,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 07:27:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:47,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 07:27:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:47,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 07:27:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:47,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 07:27:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:47,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 07:27:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:47,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 07:27:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:47,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 07:27:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:47,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:47,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:47,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:47,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 07:27:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:47,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:47,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 07:27:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:47,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 07:27:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:47,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 07:27:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:47,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 07:27:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:47,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-03-20 07:27:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:47,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-03-20 07:27:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:47,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-03-20 07:27:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 07:27:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-20 07:27:47,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 07:27:47,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031978604] [2022-03-20 07:27:47,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031978604] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 07:27:47,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 07:27:47,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-03-20 07:27:47,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473446257] [2022-03-20 07:27:47,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 07:27:47,417 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-20 07:27:47,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 07:27:47,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-20 07:27:47,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-03-20 07:27:47,417 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-03-20 07:27:48,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 07:27:48,428 INFO L93 Difference]: Finished difference Result 384 states and 413 transitions. [2022-03-20 07:27:48,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-20 07:27:48,429 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-03-20 07:27:48,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 07:27:48,429 INFO L225 Difference]: With dead ends: 384 [2022-03-20 07:27:48,429 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 07:27:48,429 INFO L912 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-03-20 07:27:48,430 INFO L913 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-03-20 07:27:48,430 INFO L914 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-03-20 07:27:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 07:27:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 07:27:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-20 07:27:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 07:27:48,430 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2022-03-20 07:27:48,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 07:27:48,430 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 07:27:48,430 INFO L479 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-03-20 07:27:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 07:27:48,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 07:27:48,432 INFO L788 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 07:27:48,433 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-03-20 07:27:48,435 INFO L719 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-03-20 07:27:48,436 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 07:27:48,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 07:27:48 BasicIcfg [2022-03-20 07:27:48,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 07:27:48,438 INFO L158 Benchmark]: Toolchain (without parser) took 74456.74ms. Allocated memory was 182.5MB in the beginning and 459.3MB in the end (delta: 276.8MB). Free memory was 122.5MB in the beginning and 237.4MB in the end (delta: -114.9MB). Peak memory consumption was 162.5MB. Max. memory is 8.0GB. [2022-03-20 07:27:48,438 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 07:27:48,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.21ms. Allocated memory was 182.5MB in the beginning and 259.0MB in the end (delta: 76.5MB). Free memory was 122.2MB in the beginning and 217.5MB in the end (delta: -95.3MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-03-20 07:27:48,438 INFO L158 Benchmark]: Boogie Preprocessor took 101.90ms. Allocated memory is still 259.0MB. Free memory was 217.5MB in the beginning and 213.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-03-20 07:27:48,438 INFO L158 Benchmark]: RCFGBuilder took 893.14ms. Allocated memory is still 259.0MB. Free memory was 213.5MB in the beginning and 160.5MB in the end (delta: 53.0MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. [2022-03-20 07:27:48,438 INFO L158 Benchmark]: IcfgTransformer took 33.97ms. Allocated memory is still 259.0MB. Free memory was 160.0MB in the beginning and 154.2MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-03-20 07:27:48,438 INFO L158 Benchmark]: TraceAbstraction took 72913.47ms. Allocated memory was 259.0MB in the beginning and 459.3MB in the end (delta: 200.3MB). Free memory was 153.7MB in the beginning and 237.4MB in the end (delta: -83.7MB). Peak memory consumption was 117.1MB. Max. memory is 8.0GB. [2022-03-20 07:27:48,439 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 182.5MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 506.21ms. Allocated memory was 182.5MB in the beginning and 259.0MB in the end (delta: 76.5MB). Free memory was 122.2MB in the beginning and 217.5MB in the end (delta: -95.3MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 101.90ms. Allocated memory is still 259.0MB. Free memory was 217.5MB in the beginning and 213.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 893.14ms. Allocated memory is still 259.0MB. Free memory was 213.5MB in the beginning and 160.5MB in the end (delta: 53.0MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. * IcfgTransformer took 33.97ms. Allocated memory is still 259.0MB. Free memory was 160.0MB in the beginning and 154.2MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * TraceAbstraction took 72913.47ms. Allocated memory was 259.0MB in the beginning and 459.3MB in the end (delta: 200.3MB). Free memory was 153.7MB in the beginning and 237.4MB in the end (delta: -83.7MB). Peak memory consumption was 117.1MB. 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: 72.9s, OverallIterations: 65, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 59.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37391 SdHoareTripleChecker+Valid, 50.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36907 mSDsluCounter, 72268 SdHoareTripleChecker+Invalid, 42.4s 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.8s AutomataMinimizationTime, 65 MinimizatonAttempts, 3956 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.5s 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-03-20 07:27:48,466 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...