/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 21:55:43,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 21:55:43,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 21:55:43,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 21:55:43,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 21:55:43,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 21:55:43,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 21:55:43,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 21:55:43,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 21:55:43,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 21:55:43,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 21:55:43,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 21:55:43,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 21:55:43,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 21:55:43,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 21:55:43,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 21:55:43,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 21:55:43,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 21:55:43,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 21:55:43,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 21:55:43,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 21:55:43,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 21:55:43,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 21:55:43,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 21:55:43,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 21:55:43,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 21:55:43,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 21:55:43,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 21:55:43,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 21:55:43,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 21:55:43,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 21:55:43,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 21:55:43,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 21:55:43,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 21:55:43,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 21:55:43,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 21:55:43,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 21:55:43,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 21:55:43,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 21:55:43,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 21:55:43,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 21:55:43,281 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 21:55:43,290 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 21:55:43,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 21:55:43,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 21:55:43,291 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 21:55:43,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 21:55:43,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 21:55:43,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 21:55:43,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 21:55:43,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 21:55:43,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 21:55:43,292 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 21:55:43,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 21:55:43,292 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 21:55:43,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 21:55:43,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 21:55:43,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 21:55:43,293 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 21:55:43,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 21:55:43,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:55:43,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 21:55:43,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 21:55:43,294 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 21:55:43,294 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 21:55:43,294 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 21:55:43,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 21:55:43,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 21:55:43,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 21:55:43,485 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 21:55:43,489 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 21:55:43,490 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-01-31 21:55:43,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1dcfea11/5bcca010f6be44b3940d88c59ff76f55/FLAG1e2040aee [2022-01-31 21:55:43,948 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 21:55:43,948 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-01-31 21:55:43,956 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1dcfea11/5bcca010f6be44b3940d88c59ff76f55/FLAG1e2040aee [2022-01-31 21:55:43,964 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1dcfea11/5bcca010f6be44b3940d88c59ff76f55 [2022-01-31 21:55:43,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 21:55:43,967 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 21:55:43,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 21:55:43,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 21:55:43,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 21:55:43,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:55:43" (1/1) ... [2022-01-31 21:55:43,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a170981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:43, skipping insertion in model container [2022-01-31 21:55:43,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:55:43" (1/1) ... [2022-01-31 21:55:43,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 21:55:44,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 21:55:44,132 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/diskperf_simpl1.cil.c[2072,2085] [2022-01-31 21:55:44,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:55:44,236 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 21:55:44,244 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/diskperf_simpl1.cil.c[2072,2085] [2022-01-31 21:55:44,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:55:44,295 INFO L208 MainTranslator]: Completed translation [2022-01-31 21:55:44,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:44 WrapperNode [2022-01-31 21:55:44,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 21:55:44,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 21:55:44,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 21:55:44,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 21:55:44,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:44" (1/1) ... [2022-01-31 21:55:44,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:44" (1/1) ... [2022-01-31 21:55:44,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:44" (1/1) ... [2022-01-31 21:55:44,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:44" (1/1) ... [2022-01-31 21:55:44,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:44" (1/1) ... [2022-01-31 21:55:44,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:44" (1/1) ... [2022-01-31 21:55:44,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:44" (1/1) ... [2022-01-31 21:55:44,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 21:55:44,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 21:55:44,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 21:55:44,392 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 21:55:44,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:44" (1/1) ... [2022-01-31 21:55:44,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:55:44,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 21:55:44,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 21:55:44,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 21:55:44,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 21:55:44,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 21:55:44,518 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 21:55:44,518 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-01-31 21:55:44,519 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-01-31 21:55:44,519 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2022-01-31 21:55:44,519 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2022-01-31 21:55:44,519 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2022-01-31 21:55:44,519 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2022-01-31 21:55:44,519 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2022-01-31 21:55:44,519 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2022-01-31 21:55:44,519 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2022-01-31 21:55:44,520 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2022-01-31 21:55:44,520 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2022-01-31 21:55:44,520 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2022-01-31 21:55:44,522 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2022-01-31 21:55:44,522 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2022-01-31 21:55:44,522 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2022-01-31 21:55:44,522 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2022-01-31 21:55:44,522 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-01-31 21:55:44,522 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 21:55:44,522 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-01-31 21:55:44,522 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-01-31 21:55:44,522 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-01-31 21:55:44,522 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-01-31 21:55:44,522 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-01-31 21:55:44,522 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-01-31 21:55:44,522 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-01-31 21:55:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 21:55:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 21:55:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 21:55:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 21:55:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-01-31 21:55:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 21:55:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-01-31 21:55:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2022-01-31 21:55:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2022-01-31 21:55:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2022-01-31 21:55:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2022-01-31 21:55:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2022-01-31 21:55:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2022-01-31 21:55:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2022-01-31 21:55:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2022-01-31 21:55:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2022-01-31 21:55:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2022-01-31 21:55:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2022-01-31 21:55:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2022-01-31 21:55:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-01-31 21:55:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-01-31 21:55:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-01-31 21:55:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-01-31 21:55:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-01-31 21:55:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-01-31 21:55:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-01-31 21:55:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-01-31 21:55:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2022-01-31 21:55:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2022-01-31 21:55:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-01-31 21:55:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 21:55:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-01-31 21:55:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 21:55:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 21:55:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 21:55:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 21:55:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 21:55:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 21:55:44,671 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 21:55:44,679 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 21:55:44,721 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:44,802 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-01-31 21:55:44,802 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-01-31 21:55:44,807 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:44,854 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-01-31 21:55:44,855 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-01-31 21:55:44,869 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:44,879 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-01-31 21:55:44,880 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-01-31 21:55:44,882 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:44,893 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 21:55:44,893 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 21:55:45,055 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:45,083 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-01-31 21:55:45,083 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-01-31 21:55:45,101 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:45,112 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2022-01-31 21:55:45,112 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2022-01-31 21:55:45,147 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 21:55:45,156 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 21:55:45,156 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 21:55:45,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:55:45 BoogieIcfgContainer [2022-01-31 21:55:45,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 21:55:45,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 21:55:45,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 21:55:45,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 21:55:45,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:55:43" (1/3) ... [2022-01-31 21:55:45,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe75fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:55:45, skipping insertion in model container [2022-01-31 21:55:45,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:44" (2/3) ... [2022-01-31 21:55:45,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe75fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:55:45, skipping insertion in model container [2022-01-31 21:55:45,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:55:45" (3/3) ... [2022-01-31 21:55:45,163 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2022-01-31 21:55:45,166 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 21:55:45,166 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 21:55:45,194 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 21:55:45,198 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=JORDAN [2022-01-31 21:55:45,198 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 21:55:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 295 states, 206 states have (on average 1.4271844660194175) internal successors, (294), 224 states have internal predecessors, (294), 61 states have call successors, (61), 26 states have call predecessors, (61), 26 states have return successors, (61), 57 states have call predecessors, (61), 61 states have call successors, (61) [2022-01-31 21:55:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 21:55:45,228 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:45,228 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:45,228 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:45,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:45,232 INFO L85 PathProgramCache]: Analyzing trace with hash 717651403, now seen corresponding path program 1 times [2022-01-31 21:55:45,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:45,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1862878667] [2022-01-31 21:55:45,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:45,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:45,282 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:45,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:45,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:45,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:55:45,544 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:45,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1862878667] [2022-01-31 21:55:45,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1862878667] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:45,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:45,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 21:55:45,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130210945] [2022-01-31 21:55:45,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:45,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 21:55:45,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:45,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 21:55:45,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 21:55:45,574 INFO L87 Difference]: Start difference. First operand has 295 states, 206 states have (on average 1.4271844660194175) internal successors, (294), 224 states have internal predecessors, (294), 61 states have call successors, (61), 26 states have call predecessors, (61), 26 states have return successors, (61), 57 states have call predecessors, (61), 61 states have call successors, (61) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 21:55:46,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:46,401 INFO L93 Difference]: Finished difference Result 576 states and 845 transitions. [2022-01-31 21:55:46,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:55:46,403 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), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-01-31 21:55:46,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:46,411 INFO L225 Difference]: With dead ends: 576 [2022-01-31 21:55:46,411 INFO L226 Difference]: Without dead ends: 326 [2022-01-31 21:55:46,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:46,417 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 234 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:46,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 597 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:55:46,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-01-31 21:55:46,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 287. [2022-01-31 21:55:46,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 201 states have (on average 1.373134328358209) internal successors, (276), 217 states have internal predecessors, (276), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-01-31 21:55:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2022-01-31 21:55:46,468 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2022-01-31 21:55:46,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:46,468 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2022-01-31 21:55:46,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 21:55:46,468 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2022-01-31 21:55:46,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 21:55:46,469 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:46,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:46,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 21:55:46,470 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:46,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:46,470 INFO L85 PathProgramCache]: Analyzing trace with hash -524387518, now seen corresponding path program 1 times [2022-01-31 21:55:46,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:46,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [307927027] [2022-01-31 21:55:46,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:46,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:46,473 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:46,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:46,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:46,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:55:46,595 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:46,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [307927027] [2022-01-31 21:55:46,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [307927027] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:46,596 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:46,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:55:46,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707018610] [2022-01-31 21:55:46,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:46,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:55:46,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:46,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:55:46,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:46,597 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:47,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:47,442 INFO L93 Difference]: Finished difference Result 690 states and 962 transitions. [2022-01-31 21:55:47,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:55:47,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-01-31 21:55:47,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:47,446 INFO L225 Difference]: With dead ends: 690 [2022-01-31 21:55:47,446 INFO L226 Difference]: Without dead ends: 507 [2022-01-31 21:55:47,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:55:47,448 INFO L933 BasicCegarLoop]: 490 mSDtfsCounter, 573 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:47,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [575 Valid, 682 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:55:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-01-31 21:55:47,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 440. [2022-01-31 21:55:47,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 318 states have (on average 1.3459119496855345) internal successors, (428), 329 states have internal predecessors, (428), 80 states have call successors, (80), 37 states have call predecessors, (80), 41 states have return successors, (100), 77 states have call predecessors, (100), 68 states have call successors, (100) [2022-01-31 21:55:47,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 608 transitions. [2022-01-31 21:55:47,504 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 608 transitions. Word has length 25 [2022-01-31 21:55:47,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:47,504 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 608 transitions. [2022-01-31 21:55:47,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:47,505 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 608 transitions. [2022-01-31 21:55:47,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 21:55:47,506 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:47,507 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:47,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 21:55:47,507 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:47,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:47,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1283608137, now seen corresponding path program 1 times [2022-01-31 21:55:47,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:47,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [559061734] [2022-01-31 21:55:47,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:47,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:47,512 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:47,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:47,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:47,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:55:47,662 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:47,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [559061734] [2022-01-31 21:55:47,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [559061734] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:47,662 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:47,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:55:47,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764141178] [2022-01-31 21:55:47,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:47,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:55:47,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:47,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:55:47,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:47,664 INFO L87 Difference]: Start difference. First operand 440 states and 608 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:48,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:48,420 INFO L93 Difference]: Finished difference Result 1013 states and 1458 transitions. [2022-01-31 21:55:48,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:55:48,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-01-31 21:55:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:48,425 INFO L225 Difference]: With dead ends: 1013 [2022-01-31 21:55:48,425 INFO L226 Difference]: Without dead ends: 690 [2022-01-31 21:55:48,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:55:48,427 INFO L933 BasicCegarLoop]: 402 mSDtfsCounter, 504 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:48,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [506 Valid, 586 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:55:48,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-01-31 21:55:48,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 618. [2022-01-31 21:55:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 455 states have (on average 1.3560439560439561) internal successors, (617), 466 states have internal predecessors, (617), 109 states have call successors, (109), 49 states have call predecessors, (109), 53 states have return successors, (162), 105 states have call predecessors, (162), 98 states have call successors, (162) [2022-01-31 21:55:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 888 transitions. [2022-01-31 21:55:48,480 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 888 transitions. Word has length 31 [2022-01-31 21:55:48,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:48,481 INFO L470 AbstractCegarLoop]: Abstraction has 618 states and 888 transitions. [2022-01-31 21:55:48,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:48,481 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 888 transitions. [2022-01-31 21:55:48,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 21:55:48,487 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:48,487 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:48,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 21:55:48,488 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:48,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:48,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1553760270, now seen corresponding path program 1 times [2022-01-31 21:55:48,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:48,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [974402193] [2022-01-31 21:55:48,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:48,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:48,491 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:48,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:48,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:48,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:48,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:55:48,600 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:48,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [974402193] [2022-01-31 21:55:48,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [974402193] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:48,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:48,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:55:48,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738873757] [2022-01-31 21:55:48,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:48,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:55:48,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:48,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:55:48,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:48,601 INFO L87 Difference]: Start difference. First operand 618 states and 888 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:49,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:49,410 INFO L93 Difference]: Finished difference Result 665 states and 952 transitions. [2022-01-31 21:55:49,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:55:49,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 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 36 [2022-01-31 21:55:49,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:49,413 INFO L225 Difference]: With dead ends: 665 [2022-01-31 21:55:49,413 INFO L226 Difference]: Without dead ends: 661 [2022-01-31 21:55:49,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 21:55:49,415 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 126 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:49,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 590 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:55:49,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-01-31 21:55:49,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 628. [2022-01-31 21:55:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 466 states have (on average 1.354077253218884) internal successors, (631), 475 states have internal predecessors, (631), 108 states have call successors, (108), 50 states have call predecessors, (108), 53 states have return successors, (162), 105 states have call predecessors, (162), 98 states have call successors, (162) [2022-01-31 21:55:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 901 transitions. [2022-01-31 21:55:49,449 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 901 transitions. Word has length 36 [2022-01-31 21:55:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:49,449 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 901 transitions. [2022-01-31 21:55:49,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 901 transitions. [2022-01-31 21:55:49,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 21:55:49,450 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:49,450 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:49,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 21:55:49,450 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:49,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:49,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1988078361, now seen corresponding path program 1 times [2022-01-31 21:55:49,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:49,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1563628699] [2022-01-31 21:55:49,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:49,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:49,453 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:55:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:55:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,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-01-31 21:55:49,623 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:49,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1563628699] [2022-01-31 21:55:49,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1563628699] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:49,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:49,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:55:49,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798936811] [2022-01-31 21:55:49,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:49,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:55:49,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:49,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:55:49,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:55:49,624 INFO L87 Difference]: Start difference. First operand 628 states and 901 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:55:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:50,694 INFO L93 Difference]: Finished difference Result 716 states and 1015 transitions. [2022-01-31 21:55:50,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:55:50,694 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 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 39 [2022-01-31 21:55:50,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:50,697 INFO L225 Difference]: With dead ends: 716 [2022-01-31 21:55:50,697 INFO L226 Difference]: Without dead ends: 705 [2022-01-31 21:55:50,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:55:50,699 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 1044 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 386 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 386 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:50,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1053 Valid, 750 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [386 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:55:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-01-31 21:55:50,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2022-01-31 21:55:50,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 488 states have (on average 1.348360655737705) internal successors, (658), 502 states have internal predecessors, (658), 109 states have call successors, (109), 51 states have call predecessors, (109), 60 states have return successors, (169), 108 states have call predecessors, (169), 99 states have call successors, (169) [2022-01-31 21:55:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 936 transitions. [2022-01-31 21:55:50,758 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 936 transitions. Word has length 39 [2022-01-31 21:55:50,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:50,759 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 936 transitions. [2022-01-31 21:55:50,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:55:50,759 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 936 transitions. [2022-01-31 21:55:50,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 21:55:50,760 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:50,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:50,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 21:55:50,760 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:50,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:50,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1064338611, now seen corresponding path program 1 times [2022-01-31 21:55:50,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:50,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [127954768] [2022-01-31 21:55:50,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:50,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:50,762 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:50,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:50,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:50,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:50,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:55:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:50,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:55:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:55:50,925 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:50,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [127954768] [2022-01-31 21:55:50,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [127954768] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:50,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:50,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:55:50,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717728636] [2022-01-31 21:55:50,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:50,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:55:50,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:50,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:55:50,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:55:50,926 INFO L87 Difference]: Start difference. First operand 658 states and 936 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:55:51,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:51,785 INFO L93 Difference]: Finished difference Result 713 states and 1008 transitions. [2022-01-31 21:55:51,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:55:51,786 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-01-31 21:55:51,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:51,789 INFO L225 Difference]: With dead ends: 713 [2022-01-31 21:55:51,789 INFO L226 Difference]: Without dead ends: 705 [2022-01-31 21:55:51,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:55:51,790 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 787 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:51,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [796 Valid, 653 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:55:51,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-01-31 21:55:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2022-01-31 21:55:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 488 states have (on average 1.346311475409836) internal successors, (657), 502 states have internal predecessors, (657), 109 states have call successors, (109), 51 states have call predecessors, (109), 60 states have return successors, (169), 108 states have call predecessors, (169), 99 states have call successors, (169) [2022-01-31 21:55:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 935 transitions. [2022-01-31 21:55:51,842 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 935 transitions. Word has length 40 [2022-01-31 21:55:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:51,842 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 935 transitions. [2022-01-31 21:55:51,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:55:51,842 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 935 transitions. [2022-01-31 21:55:51,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 21:55:51,843 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:51,843 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:51,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 21:55:51,843 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:51,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:51,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1632785520, now seen corresponding path program 1 times [2022-01-31 21:55:51,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:51,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [212829608] [2022-01-31 21:55:51,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:51,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:51,845 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:51,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:51,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:51,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:51,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:55:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:51,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:55:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:55:51,963 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:51,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [212829608] [2022-01-31 21:55:51,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [212829608] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:51,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:51,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:55:51,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83472581] [2022-01-31 21:55:51,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:51,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:55:51,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:51,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:55:51,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:55:51,964 INFO L87 Difference]: Start difference. First operand 658 states and 935 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:55:52,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:52,785 INFO L93 Difference]: Finished difference Result 1215 states and 1783 transitions. [2022-01-31 21:55:52,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:55:52,786 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2022-01-31 21:55:52,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:52,791 INFO L225 Difference]: With dead ends: 1215 [2022-01-31 21:55:52,791 INFO L226 Difference]: Without dead ends: 1186 [2022-01-31 21:55:52,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:55:52,793 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 995 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:52,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1000 Valid, 798 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:55:52,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-01-31 21:55:52,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1085. [2022-01-31 21:55:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 817 states have (on average 1.3635250917992656) internal successors, (1114), 835 states have internal predecessors, (1114), 173 states have call successors, (173), 79 states have call predecessors, (173), 94 states have return successors, (315), 175 states have call predecessors, (315), 163 states have call successors, (315) [2022-01-31 21:55:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1602 transitions. [2022-01-31 21:55:52,876 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1602 transitions. Word has length 41 [2022-01-31 21:55:52,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:52,877 INFO L470 AbstractCegarLoop]: Abstraction has 1085 states and 1602 transitions. [2022-01-31 21:55:52,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:55:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1602 transitions. [2022-01-31 21:55:52,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 21:55:52,878 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:52,878 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:52,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 21:55:52,878 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:52,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:52,879 INFO L85 PathProgramCache]: Analyzing trace with hash 931290683, now seen corresponding path program 1 times [2022-01-31 21:55:52,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:52,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1142516692] [2022-01-31 21:55:52,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:52,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:52,882 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:55:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:55:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:55:53,003 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:53,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1142516692] [2022-01-31 21:55:53,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1142516692] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:53,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:53,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:55:53,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468180100] [2022-01-31 21:55:53,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:53,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:55:53,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:53,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:55:53,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:55:53,005 INFO L87 Difference]: Start difference. First operand 1085 states and 1602 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:55:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:53,580 INFO L93 Difference]: Finished difference Result 1170 states and 1724 transitions. [2022-01-31 21:55:53,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:55:53,581 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2022-01-31 21:55:53,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:53,585 INFO L225 Difference]: With dead ends: 1170 [2022-01-31 21:55:53,585 INFO L226 Difference]: Without dead ends: 1148 [2022-01-31 21:55:53,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:55:53,587 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 458 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:53,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 1018 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:55:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2022-01-31 21:55:53,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1078. [2022-01-31 21:55:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 813 states have (on average 1.3640836408364083) internal successors, (1109), 831 states have internal predecessors, (1109), 171 states have call successors, (171), 78 states have call predecessors, (171), 93 states have return successors, (313), 173 states have call predecessors, (313), 161 states have call successors, (313) [2022-01-31 21:55:53,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1593 transitions. [2022-01-31 21:55:53,677 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1593 transitions. Word has length 42 [2022-01-31 21:55:53,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:53,677 INFO L470 AbstractCegarLoop]: Abstraction has 1078 states and 1593 transitions. [2022-01-31 21:55:53,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:55:53,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1593 transitions. [2022-01-31 21:55:53,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 21:55:53,678 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:53,678 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:53,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 21:55:53,679 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:53,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:53,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1303038604, now seen corresponding path program 1 times [2022-01-31 21:55:53,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:53,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1028365459] [2022-01-31 21:55:53,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:53,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:53,681 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:55:53,764 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:53,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1028365459] [2022-01-31 21:55:53,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1028365459] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:53,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:53,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:55:53,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191235683] [2022-01-31 21:55:53,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:53,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:55:53,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:53,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:55:53,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:53,765 INFO L87 Difference]: Start difference. First operand 1078 states and 1593 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:54,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:54,405 INFO L93 Difference]: Finished difference Result 1507 states and 2275 transitions. [2022-01-31 21:55:54,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:55:54,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-01-31 21:55:54,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:54,408 INFO L225 Difference]: With dead ends: 1507 [2022-01-31 21:55:54,409 INFO L226 Difference]: Without dead ends: 599 [2022-01-31 21:55:54,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:55:54,414 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 370 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:54,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 340 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:55:54,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-01-31 21:55:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 598. [2022-01-31 21:55:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 443 states have (on average 1.327313769751693) internal successors, (588), 455 states have internal predecessors, (588), 102 states have call successors, (102), 47 states have call predecessors, (102), 52 states have return successors, (160), 98 states have call predecessors, (160), 94 states have call successors, (160) [2022-01-31 21:55:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 850 transitions. [2022-01-31 21:55:54,459 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 850 transitions. Word has length 45 [2022-01-31 21:55:54,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:54,460 INFO L470 AbstractCegarLoop]: Abstraction has 598 states and 850 transitions. [2022-01-31 21:55:54,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 850 transitions. [2022-01-31 21:55:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 21:55:54,460 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:54,460 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:54,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 21:55:54,461 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:54,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:54,463 INFO L85 PathProgramCache]: Analyzing trace with hash -66301101, now seen corresponding path program 1 times [2022-01-31 21:55:54,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:54,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1619392234] [2022-01-31 21:55:54,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:54,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:54,465 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 21:55:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:55:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:55:54,593 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:54,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1619392234] [2022-01-31 21:55:54,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1619392234] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:54,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:54,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:55:54,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20035966] [2022-01-31 21:55:54,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:54,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:55:54,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:54,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:55:54,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:55:54,594 INFO L87 Difference]: Start difference. First operand 598 states and 850 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:55:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:55,480 INFO L93 Difference]: Finished difference Result 633 states and 893 transitions. [2022-01-31 21:55:55,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:55:55,481 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 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 46 [2022-01-31 21:55:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:55,483 INFO L225 Difference]: With dead ends: 633 [2022-01-31 21:55:55,483 INFO L226 Difference]: Without dead ends: 608 [2022-01-31 21:55:55,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:55:55,485 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 112 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:55,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 1208 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:55:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-01-31 21:55:55,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 596. [2022-01-31 21:55:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 442 states have (on average 1.3235294117647058) internal successors, (585), 454 states have internal predecessors, (585), 101 states have call successors, (101), 47 states have call predecessors, (101), 52 states have return successors, (159), 97 states have call predecessors, (159), 93 states have call successors, (159) [2022-01-31 21:55:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 845 transitions. [2022-01-31 21:55:55,529 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 845 transitions. Word has length 46 [2022-01-31 21:55:55,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:55,529 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 845 transitions. [2022-01-31 21:55:55,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:55:55,530 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 845 transitions. [2022-01-31 21:55:55,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 21:55:55,531 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:55,531 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:55,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 21:55:55,531 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:55,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:55,532 INFO L85 PathProgramCache]: Analyzing trace with hash -12862173, now seen corresponding path program 1 times [2022-01-31 21:55:55,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:55,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1007316919] [2022-01-31 21:55:55,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:55,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:55,534 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 21:55:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:55:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:55:55,674 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:55,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1007316919] [2022-01-31 21:55:55,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1007316919] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:55,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:55,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:55:55,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614656046] [2022-01-31 21:55:55,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:55,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:55:55,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:55,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:55:55,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:55:55,676 INFO L87 Difference]: Start difference. First operand 596 states and 845 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:55:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:56,599 INFO L93 Difference]: Finished difference Result 834 states and 1234 transitions. [2022-01-31 21:55:56,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:55:56,600 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2022-01-31 21:55:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:56,604 INFO L225 Difference]: With dead ends: 834 [2022-01-31 21:55:56,604 INFO L226 Difference]: Without dead ends: 826 [2022-01-31 21:55:56,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:55:56,605 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 498 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:56,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [503 Valid, 703 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:55:56,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2022-01-31 21:55:56,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 665. [2022-01-31 21:55:56,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 495 states have (on average 1.3232323232323233) internal successors, (655), 508 states have internal predecessors, (655), 109 states have call successors, (109), 50 states have call predecessors, (109), 60 states have return successors, (184), 110 states have call predecessors, (184), 101 states have call successors, (184) [2022-01-31 21:55:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 948 transitions. [2022-01-31 21:55:56,678 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 948 transitions. Word has length 46 [2022-01-31 21:55:56,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:56,678 INFO L470 AbstractCegarLoop]: Abstraction has 665 states and 948 transitions. [2022-01-31 21:55:56,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:55:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 948 transitions. [2022-01-31 21:55:56,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 21:55:56,680 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:56,680 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:56,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 21:55:56,680 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:56,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:56,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1099213797, now seen corresponding path program 1 times [2022-01-31 21:55:56,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:56,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [555019209] [2022-01-31 21:55:56,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:56,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:56,683 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:56,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:56,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:56,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:56,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 21:55:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:56,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-01-31 21:55:56,785 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:56,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [555019209] [2022-01-31 21:55:56,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [555019209] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:56,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:56,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:55:56,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142638969] [2022-01-31 21:55:56,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:56,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:55:56,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:56,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:55:56,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:55:56,786 INFO L87 Difference]: Start difference. First operand 665 states and 948 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 21:55:57,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:57,388 INFO L93 Difference]: Finished difference Result 739 states and 1021 transitions. [2022-01-31 21:55:57,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:55:57,388 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2022-01-31 21:55:57,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:57,390 INFO L225 Difference]: With dead ends: 739 [2022-01-31 21:55:57,390 INFO L226 Difference]: Without dead ends: 462 [2022-01-31 21:55:57,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:55:57,392 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 549 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:57,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [556 Valid, 651 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:55:57,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-01-31 21:55:57,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 441. [2022-01-31 21:55:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 327 states have (on average 1.27217125382263) internal successors, (416), 338 states have internal predecessors, (416), 69 states have call successors, (69), 38 states have call predecessors, (69), 44 states have return successors, (93), 68 states have call predecessors, (93), 61 states have call successors, (93) [2022-01-31 21:55:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 578 transitions. [2022-01-31 21:55:57,430 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 578 transitions. Word has length 50 [2022-01-31 21:55:57,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:57,431 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 578 transitions. [2022-01-31 21:55:57,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 21:55:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 578 transitions. [2022-01-31 21:55:57,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 21:55:57,431 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:57,431 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:57,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 21:55:57,432 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:57,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:57,432 INFO L85 PathProgramCache]: Analyzing trace with hash 54275897, now seen corresponding path program 1 times [2022-01-31 21:55:57,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:57,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1195417494] [2022-01-31 21:55:57,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:57,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:57,433 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 21:55:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:55:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:55:57,586 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:57,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1195417494] [2022-01-31 21:55:57,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1195417494] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:57,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:57,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:55:57,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651374599] [2022-01-31 21:55:57,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:57,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:55:57,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:57,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:55:57,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:55:57,587 INFO L87 Difference]: Start difference. First operand 441 states and 578 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:55:58,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:58,512 INFO L93 Difference]: Finished difference Result 457 states and 597 transitions. [2022-01-31 21:55:58,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:55:58,513 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 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 47 [2022-01-31 21:55:58,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:58,514 INFO L225 Difference]: With dead ends: 457 [2022-01-31 21:55:58,514 INFO L226 Difference]: Without dead ends: 453 [2022-01-31 21:55:58,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:55:58,515 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 91 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 1844 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:58,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 1490 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1844 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:55:58,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-01-31 21:55:58,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 449. [2022-01-31 21:55:58,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 334 states have (on average 1.2724550898203593) internal successors, (425), 346 states have internal predecessors, (425), 70 states have call successors, (70), 38 states have call predecessors, (70), 44 states have return successors, (94), 69 states have call predecessors, (94), 62 states have call successors, (94) [2022-01-31 21:55:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2022-01-31 21:55:58,561 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2022-01-31 21:55:58,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:58,561 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2022-01-31 21:55:58,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:55:58,561 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2022-01-31 21:55:58,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 21:55:58,562 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:58,562 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:58,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 21:55:58,562 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:58,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:58,562 INFO L85 PathProgramCache]: Analyzing trace with hash 53999067, now seen corresponding path program 1 times [2022-01-31 21:55:58,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:58,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1819810984] [2022-01-31 21:55:58,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:58,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:58,564 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 21:55:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:55:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:55:58,782 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:58,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1819810984] [2022-01-31 21:55:58,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1819810984] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:58,782 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:58,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:55:58,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048873900] [2022-01-31 21:55:58,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:58,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:55:58,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:58,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:55:58,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:55:58,783 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:55:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:59,483 INFO L93 Difference]: Finished difference Result 780 states and 1069 transitions. [2022-01-31 21:55:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:55:59,483 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 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 47 [2022-01-31 21:55:59,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:59,485 INFO L225 Difference]: With dead ends: 780 [2022-01-31 21:55:59,485 INFO L226 Difference]: Without dead ends: 472 [2022-01-31 21:55:59,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:55:59,487 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 188 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:59,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 1502 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:55:59,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-01-31 21:55:59,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 459. [2022-01-31 21:55:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 343 states have (on average 1.2769679300291545) internal successors, (438), 356 states have internal predecessors, (438), 70 states have call successors, (70), 38 states have call predecessors, (70), 45 states have return successors, (96), 69 states have call predecessors, (96), 62 states have call successors, (96) [2022-01-31 21:55:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 604 transitions. [2022-01-31 21:55:59,531 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 604 transitions. Word has length 47 [2022-01-31 21:55:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:59,531 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 604 transitions. [2022-01-31 21:55:59,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:55:59,532 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 604 transitions. [2022-01-31 21:55:59,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 21:55:59,532 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:59,532 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:59,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 21:55:59,532 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:59,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:59,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1706472498, now seen corresponding path program 1 times [2022-01-31 21:55:59,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:59,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [712119432] [2022-01-31 21:55:59,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:59,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:59,535 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 21:55:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:55:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:55:59,710 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:59,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [712119432] [2022-01-31 21:55:59,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [712119432] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:59,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:59,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:55:59,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059689388] [2022-01-31 21:55:59,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:59,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:55:59,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:59,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:55:59,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:55:59,711 INFO L87 Difference]: Start difference. First operand 459 states and 604 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:00,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:00,664 INFO L93 Difference]: Finished difference Result 594 states and 812 transitions. [2022-01-31 21:56:00,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:56:00,664 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 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 48 [2022-01-31 21:56:00,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:00,667 INFO L225 Difference]: With dead ends: 594 [2022-01-31 21:56:00,667 INFO L226 Difference]: Without dead ends: 575 [2022-01-31 21:56:00,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:56:00,667 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 1048 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:00,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1062 Valid, 700 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:56:00,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-01-31 21:56:00,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 444. [2022-01-31 21:56:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 332 states have (on average 1.2771084337349397) internal successors, (424), 343 states have internal predecessors, (424), 68 states have call successors, (68), 38 states have call predecessors, (68), 43 states have return successors, (91), 66 states have call predecessors, (91), 60 states have call successors, (91) [2022-01-31 21:56:00,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 583 transitions. [2022-01-31 21:56:00,713 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 583 transitions. Word has length 48 [2022-01-31 21:56:00,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:00,713 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 583 transitions. [2022-01-31 21:56:00,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:00,713 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 583 transitions. [2022-01-31 21:56:00,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 21:56:00,713 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:00,714 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:00,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 21:56:00,714 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:00,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:00,714 INFO L85 PathProgramCache]: Analyzing trace with hash 537684808, now seen corresponding path program 1 times [2022-01-31 21:56:00,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:00,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [322076352] [2022-01-31 21:56:00,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:00,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:00,716 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 21:56:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:00,876 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:00,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [322076352] [2022-01-31 21:56:00,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [322076352] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:00,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:00,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:00,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759796040] [2022-01-31 21:56:00,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:00,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:00,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:00,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:00,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:00,877 INFO L87 Difference]: Start difference. First operand 444 states and 583 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:01,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:01,551 INFO L93 Difference]: Finished difference Result 458 states and 599 transitions. [2022-01-31 21:56:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:56:01,551 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (7), 6 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 49 [2022-01-31 21:56:01,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:01,553 INFO L225 Difference]: With dead ends: 458 [2022-01-31 21:56:01,553 INFO L226 Difference]: Without dead ends: 427 [2022-01-31 21:56:01,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:01,554 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 231 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:01,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 1515 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:56:01,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-01-31 21:56:01,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2022-01-31 21:56:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 318 states have (on average 1.279874213836478) internal successors, (407), 330 states have internal predecessors, (407), 66 states have call successors, (66), 36 states have call predecessors, (66), 42 states have return successors, (89), 64 states have call predecessors, (89), 58 states have call successors, (89) [2022-01-31 21:56:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 562 transitions. [2022-01-31 21:56:01,599 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 562 transitions. Word has length 49 [2022-01-31 21:56:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:01,599 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 562 transitions. [2022-01-31 21:56:01,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 562 transitions. [2022-01-31 21:56:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 21:56:01,600 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:01,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:01,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 21:56:01,600 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:01,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1134618754, now seen corresponding path program 1 times [2022-01-31 21:56:01,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:01,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [65641860] [2022-01-31 21:56:01,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:01,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:01,603 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 21:56:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:56:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:01,758 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:01,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [65641860] [2022-01-31 21:56:01,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [65641860] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:01,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:01,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:56:01,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115393946] [2022-01-31 21:56:01,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:01,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:56:01,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:01,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:56:01,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:56:01,759 INFO L87 Difference]: Start difference. First operand 427 states and 562 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:02,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:02,593 INFO L93 Difference]: Finished difference Result 456 states and 600 transitions. [2022-01-31 21:56:02,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:56:02,594 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-01-31 21:56:02,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:02,595 INFO L225 Difference]: With dead ends: 456 [2022-01-31 21:56:02,595 INFO L226 Difference]: Without dead ends: 423 [2022-01-31 21:56:02,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:02,596 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 174 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:02,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 1146 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:02,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-01-31 21:56:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 409. [2022-01-31 21:56:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 304 states have (on average 1.2861842105263157) internal successors, (391), 316 states have internal predecessors, (391), 64 states have call successors, (64), 34 states have call predecessors, (64), 40 states have return successors, (87), 62 states have call predecessors, (87), 56 states have call successors, (87) [2022-01-31 21:56:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 542 transitions. [2022-01-31 21:56:02,637 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 542 transitions. Word has length 50 [2022-01-31 21:56:02,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:02,637 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 542 transitions. [2022-01-31 21:56:02,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 542 transitions. [2022-01-31 21:56:02,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 21:56:02,637 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:02,638 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:02,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 21:56:02,638 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:02,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:02,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1095396871, now seen corresponding path program 1 times [2022-01-31 21:56:02,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:02,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1872636372] [2022-01-31 21:56:02,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:02,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:02,640 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:02,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:02,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:02,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:02,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:02,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:02,761 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:02,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1872636372] [2022-01-31 21:56:02,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1872636372] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:02,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:02,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:56:02,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230281091] [2022-01-31 21:56:02,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:02,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:56:02,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:02,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:56:02,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:56:02,762 INFO L87 Difference]: Start difference. First operand 409 states and 542 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 21:56:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:04,177 INFO L93 Difference]: Finished difference Result 634 states and 905 transitions. [2022-01-31 21:56:04,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:56:04,177 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-01-31 21:56:04,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:04,194 INFO L225 Difference]: With dead ends: 634 [2022-01-31 21:56:04,195 INFO L226 Difference]: Without dead ends: 600 [2022-01-31 21:56:04,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:56:04,195 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 624 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 1811 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 2096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:04,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [634 Valid, 1378 Invalid, 2096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1811 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 21:56:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-01-31 21:56:04,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 534. [2022-01-31 21:56:04,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 399 states have (on average 1.3433583959899749) internal successors, (536), 410 states have internal predecessors, (536), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2022-01-31 21:56:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 769 transitions. [2022-01-31 21:56:04,270 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 769 transitions. Word has length 50 [2022-01-31 21:56:04,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:04,270 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 769 transitions. [2022-01-31 21:56:04,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 21:56:04,270 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 769 transitions. [2022-01-31 21:56:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 21:56:04,275 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:04,275 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:04,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 21:56:04,276 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:04,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:04,276 INFO L85 PathProgramCache]: Analyzing trace with hash -891835120, now seen corresponding path program 1 times [2022-01-31 21:56:04,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:04,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1601185221] [2022-01-31 21:56:04,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:04,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:04,278 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:04,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:04,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:04,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:04,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:04,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:04,451 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:04,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1601185221] [2022-01-31 21:56:04,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1601185221] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:04,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:04,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:56:04,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282516894] [2022-01-31 21:56:04,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:04,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:56:04,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:04,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:56:04,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:04,452 INFO L87 Difference]: Start difference. First operand 534 states and 769 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:05,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:05,130 INFO L93 Difference]: Finished difference Result 587 states and 833 transitions. [2022-01-31 21:56:05,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:56:05,134 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (7), 6 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 51 [2022-01-31 21:56:05,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:05,144 INFO L225 Difference]: With dead ends: 587 [2022-01-31 21:56:05,144 INFO L226 Difference]: Without dead ends: 555 [2022-01-31 21:56:05,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:56:05,146 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 616 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:05,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [625 Valid, 730 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:56:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-01-31 21:56:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 537. [2022-01-31 21:56:05,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 402 states have (on average 1.3432835820895523) internal successors, (540), 413 states have internal predecessors, (540), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2022-01-31 21:56:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 773 transitions. [2022-01-31 21:56:05,225 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 773 transitions. Word has length 51 [2022-01-31 21:56:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:05,225 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 773 transitions. [2022-01-31 21:56:05,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 773 transitions. [2022-01-31 21:56:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 21:56:05,226 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:05,226 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:05,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 21:56:05,226 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:05,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:05,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1408987470, now seen corresponding path program 1 times [2022-01-31 21:56:05,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:05,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1701027929] [2022-01-31 21:56:05,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:05,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:05,228 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:05,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:05,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:05,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:05,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:05,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:05,369 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:05,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1701027929] [2022-01-31 21:56:05,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1701027929] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:05,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:05,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:05,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583455242] [2022-01-31 21:56:05,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:05,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:05,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:05,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:05,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:05,370 INFO L87 Difference]: Start difference. First operand 537 states and 773 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 21:56:06,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:06,209 INFO L93 Difference]: Finished difference Result 670 states and 993 transitions. [2022-01-31 21:56:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:06,211 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (7), 6 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 51 [2022-01-31 21:56:06,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:06,213 INFO L225 Difference]: With dead ends: 670 [2022-01-31 21:56:06,213 INFO L226 Difference]: Without dead ends: 624 [2022-01-31 21:56:06,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:56:06,214 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 788 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:06,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [794 Valid, 1040 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:56:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-01-31 21:56:06,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 529. [2022-01-31 21:56:06,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 394 states have (on average 1.3350253807106598) internal successors, (526), 405 states have internal predecessors, (526), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2022-01-31 21:56:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 759 transitions. [2022-01-31 21:56:06,275 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 759 transitions. Word has length 51 [2022-01-31 21:56:06,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:06,276 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 759 transitions. [2022-01-31 21:56:06,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 21:56:06,276 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 759 transitions. [2022-01-31 21:56:06,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 21:56:06,276 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:06,276 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:06,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 21:56:06,276 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:06,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:06,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1555680272, now seen corresponding path program 1 times [2022-01-31 21:56:06,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:06,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [132110635] [2022-01-31 21:56:06,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:06,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:06,279 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:06,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:06,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:06,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:06,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:06,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:06,396 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:06,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [132110635] [2022-01-31 21:56:06,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [132110635] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:06,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:06,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 21:56:06,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410069796] [2022-01-31 21:56:06,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:06,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 21:56:06,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:06,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 21:56:06,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 21:56:06,397 INFO L87 Difference]: Start difference. First operand 529 states and 759 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:07,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:07,046 INFO L93 Difference]: Finished difference Result 714 states and 1095 transitions. [2022-01-31 21:56:07,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 21:56:07,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 6 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 51 [2022-01-31 21:56:07,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:07,049 INFO L225 Difference]: With dead ends: 714 [2022-01-31 21:56:07,049 INFO L226 Difference]: Without dead ends: 701 [2022-01-31 21:56:07,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:56:07,050 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 367 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:07,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 716 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:56:07,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2022-01-31 21:56:07,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 524. [2022-01-31 21:56:07,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 390 states have (on average 1.3307692307692307) internal successors, (519), 400 states have internal predecessors, (519), 91 states have call successors, (91), 37 states have call predecessors, (91), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2022-01-31 21:56:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 751 transitions. [2022-01-31 21:56:07,115 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 751 transitions. Word has length 51 [2022-01-31 21:56:07,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:07,115 INFO L470 AbstractCegarLoop]: Abstraction has 524 states and 751 transitions. [2022-01-31 21:56:07,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:07,115 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 751 transitions. [2022-01-31 21:56:07,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 21:56:07,116 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:07,116 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:07,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 21:56:07,116 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:07,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:07,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1434451436, now seen corresponding path program 1 times [2022-01-31 21:56:07,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:07,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2089133464] [2022-01-31 21:56:07,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:07,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:07,118 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:07,268 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:07,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2089133464] [2022-01-31 21:56:07,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2089133464] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:07,268 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:07,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:07,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25542473] [2022-01-31 21:56:07,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:07,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:07,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:07,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:07,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:07,269 INFO L87 Difference]: Start difference. First operand 524 states and 751 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:07,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:07,948 INFO L93 Difference]: Finished difference Result 547 states and 781 transitions. [2022-01-31 21:56:07,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:56:07,950 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 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 52 [2022-01-31 21:56:07,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:07,952 INFO L225 Difference]: With dead ends: 547 [2022-01-31 21:56:07,952 INFO L226 Difference]: Without dead ends: 543 [2022-01-31 21:56:07,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:07,953 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 76 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:07,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 1341 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:56:07,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-01-31 21:56:08,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 531. [2022-01-31 21:56:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 396 states have (on average 1.3282828282828283) internal successors, (526), 407 states have internal predecessors, (526), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2022-01-31 21:56:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 760 transitions. [2022-01-31 21:56:08,017 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 760 transitions. Word has length 52 [2022-01-31 21:56:08,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:08,017 INFO L470 AbstractCegarLoop]: Abstraction has 531 states and 760 transitions. [2022-01-31 21:56:08,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 760 transitions. [2022-01-31 21:56:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 21:56:08,018 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:08,018 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:08,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 21:56:08,018 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:08,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:08,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1434174606, now seen corresponding path program 1 times [2022-01-31 21:56:08,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:08,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1287984188] [2022-01-31 21:56:08,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:08,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:08,020 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:08,155 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:08,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1287984188] [2022-01-31 21:56:08,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1287984188] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:08,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:08,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:08,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112747072] [2022-01-31 21:56:08,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:08,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:08,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:08,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:08,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:08,156 INFO L87 Difference]: Start difference. First operand 531 states and 760 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:08,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:08,653 INFO L93 Difference]: Finished difference Result 562 states and 797 transitions. [2022-01-31 21:56:08,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:56:08,653 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 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 52 [2022-01-31 21:56:08,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:08,655 INFO L225 Difference]: With dead ends: 562 [2022-01-31 21:56:08,655 INFO L226 Difference]: Without dead ends: 538 [2022-01-31 21:56:08,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:08,656 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 138 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:08,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 1410 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:56:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-01-31 21:56:08,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 530. [2022-01-31 21:56:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 395 states have (on average 1.3265822784810126) internal successors, (524), 406 states have internal predecessors, (524), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2022-01-31 21:56:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 758 transitions. [2022-01-31 21:56:08,720 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 758 transitions. Word has length 52 [2022-01-31 21:56:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:08,720 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 758 transitions. [2022-01-31 21:56:08,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:08,721 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 758 transitions. [2022-01-31 21:56:08,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 21:56:08,721 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:08,721 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:08,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 21:56:08,721 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:08,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:08,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1015972043, now seen corresponding path program 1 times [2022-01-31 21:56:08,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:08,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1635793981] [2022-01-31 21:56:08,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:08,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:08,723 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:56:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 21:56:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:08,815 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:08,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1635793981] [2022-01-31 21:56:08,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1635793981] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:08,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:08,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:56:08,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030138361] [2022-01-31 21:56:08,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:08,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:56:08,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:08,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:56:08,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:56:08,817 INFO L87 Difference]: Start difference. First operand 530 states and 758 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, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:09,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:09,351 INFO L93 Difference]: Finished difference Result 955 states and 1439 transitions. [2022-01-31 21:56:09,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:56:09,351 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, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-01-31 21:56:09,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:09,353 INFO L225 Difference]: With dead ends: 955 [2022-01-31 21:56:09,353 INFO L226 Difference]: Without dead ends: 549 [2022-01-31 21:56:09,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:09,356 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 298 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:09,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 652 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:56:09,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-01-31 21:56:09,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 529. [2022-01-31 21:56:09,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 394 states have (on average 1.3197969543147208) internal successors, (520), 405 states have internal predecessors, (520), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2022-01-31 21:56:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 754 transitions. [2022-01-31 21:56:09,421 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 754 transitions. Word has length 58 [2022-01-31 21:56:09,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:09,421 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 754 transitions. [2022-01-31 21:56:09,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:09,421 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 754 transitions. [2022-01-31 21:56:09,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 21:56:09,422 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:09,422 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:09,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 21:56:09,422 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:09,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:09,422 INFO L85 PathProgramCache]: Analyzing trace with hash -72634305, now seen corresponding path program 1 times [2022-01-31 21:56:09,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:09,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1728662457] [2022-01-31 21:56:09,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:09,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:09,424 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:09,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:09,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:09,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:09,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:09,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:09,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:09,541 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:09,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1728662457] [2022-01-31 21:56:09,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1728662457] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:09,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:09,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:56:09,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461844078] [2022-01-31 21:56:09,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:09,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:56:09,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:09,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:56:09,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:56:09,542 INFO L87 Difference]: Start difference. First operand 529 states and 754 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:10,260 INFO L93 Difference]: Finished difference Result 675 states and 1000 transitions. [2022-01-31 21:56:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:10,261 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (7), 6 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 53 [2022-01-31 21:56:10,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:10,263 INFO L225 Difference]: With dead ends: 675 [2022-01-31 21:56:10,263 INFO L226 Difference]: Without dead ends: 639 [2022-01-31 21:56:10,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:10,264 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 756 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:10,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [768 Valid, 693 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:56:10,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-01-31 21:56:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 560. [2022-01-31 21:56:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 415 states have (on average 1.344578313253012) internal successors, (558), 426 states have internal predecessors, (558), 101 states have call successors, (101), 37 states have call predecessors, (101), 43 states have return successors, (165), 98 states have call predecessors, (165), 94 states have call successors, (165) [2022-01-31 21:56:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 824 transitions. [2022-01-31 21:56:10,358 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 824 transitions. Word has length 53 [2022-01-31 21:56:10,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:10,358 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 824 transitions. [2022-01-31 21:56:10,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 824 transitions. [2022-01-31 21:56:10,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-31 21:56:10,358 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:10,359 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:10,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 21:56:10,359 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:10,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:10,359 INFO L85 PathProgramCache]: Analyzing trace with hash -960639770, now seen corresponding path program 1 times [2022-01-31 21:56:10,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:10,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1875805179] [2022-01-31 21:56:10,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:10,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:10,361 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:10,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:10,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:10,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:10,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 21:56:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:10,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:10,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:10,561 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:10,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1875805179] [2022-01-31 21:56:10,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1875805179] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:10,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:10,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:56:10,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890737677] [2022-01-31 21:56:10,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:10,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:56:10,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:10,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:56:10,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:10,562 INFO L87 Difference]: Start difference. First operand 560 states and 824 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:10,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:10,996 INFO L93 Difference]: Finished difference Result 856 states and 1268 transitions. [2022-01-31 21:56:10,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:56:10,996 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2022-01-31 21:56:10,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:11,000 INFO L225 Difference]: With dead ends: 856 [2022-01-31 21:56:11,000 INFO L226 Difference]: Without dead ends: 390 [2022-01-31 21:56:11,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:11,003 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 200 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:11,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 1417 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:56:11,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-01-31 21:56:11,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 338. [2022-01-31 21:56:11,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 246 states have (on average 1.2560975609756098) internal successors, (309), 254 states have internal predecessors, (309), 59 states have call successors, (59), 31 states have call predecessors, (59), 32 states have return successors, (74), 54 states have call predecessors, (74), 53 states have call successors, (74) [2022-01-31 21:56:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 442 transitions. [2022-01-31 21:56:11,068 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 442 transitions. Word has length 62 [2022-01-31 21:56:11,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:11,068 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 442 transitions. [2022-01-31 21:56:11,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:11,068 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 442 transitions. [2022-01-31 21:56:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 21:56:11,069 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:11,069 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:11,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 21:56:11,069 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:11,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:11,069 INFO L85 PathProgramCache]: Analyzing trace with hash -293536386, now seen corresponding path program 1 times [2022-01-31 21:56:11,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:11,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1788391175] [2022-01-31 21:56:11,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:11,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:11,071 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:11,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:11,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:11,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:11,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:11,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:11,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:11,263 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:11,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1788391175] [2022-01-31 21:56:11,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1788391175] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:11,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:11,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:56:11,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327821615] [2022-01-31 21:56:11,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:11,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:56:11,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:11,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:56:11,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:11,264 INFO L87 Difference]: Start difference. First operand 338 states and 442 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:11,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:11,924 INFO L93 Difference]: Finished difference Result 346 states and 454 transitions. [2022-01-31 21:56:11,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:11,925 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-01-31 21:56:11,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:11,926 INFO L225 Difference]: With dead ends: 346 [2022-01-31 21:56:11,926 INFO L226 Difference]: Without dead ends: 304 [2022-01-31 21:56:11,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:11,927 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 155 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:11,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 1486 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:56:11,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-01-31 21:56:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 298. [2022-01-31 21:56:11,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 214 states have (on average 1.2757009345794392) internal successors, (273), 220 states have internal predecessors, (273), 55 states have call successors, (55), 28 states have call predecessors, (55), 28 states have return successors, (70), 50 states have call predecessors, (70), 50 states have call successors, (70) [2022-01-31 21:56:11,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 398 transitions. [2022-01-31 21:56:11,979 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 398 transitions. Word has length 58 [2022-01-31 21:56:11,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:11,979 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 398 transitions. [2022-01-31 21:56:11,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:11,980 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 398 transitions. [2022-01-31 21:56:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 21:56:11,980 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:11,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:11,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 21:56:11,981 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:11,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:11,981 INFO L85 PathProgramCache]: Analyzing trace with hash 476480639, now seen corresponding path program 1 times [2022-01-31 21:56:11,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:11,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1771494815] [2022-01-31 21:56:11,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:11,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:11,983 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:12,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:12,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:12,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:12,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 21:56:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:12,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:12,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:12,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:12,118 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:12,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1771494815] [2022-01-31 21:56:12,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1771494815] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:12,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:12,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:12,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2904297] [2022-01-31 21:56:12,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:12,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:12,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:12,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:12,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:12,119 INFO L87 Difference]: Start difference. First operand 298 states and 398 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:56:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:12,868 INFO L93 Difference]: Finished difference Result 576 states and 798 transitions. [2022-01-31 21:56:12,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:12,868 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-01-31 21:56:12,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:12,870 INFO L225 Difference]: With dead ends: 576 [2022-01-31 21:56:12,870 INFO L226 Difference]: Without dead ends: 316 [2022-01-31 21:56:12,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:56:12,872 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 252 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:12,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 830 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:56:12,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-01-31 21:56:12,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 298. [2022-01-31 21:56:12,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 214 states have (on average 1.266355140186916) internal successors, (271), 220 states have internal predecessors, (271), 55 states have call successors, (55), 28 states have call predecessors, (55), 28 states have return successors, (70), 50 states have call predecessors, (70), 50 states have call successors, (70) [2022-01-31 21:56:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 396 transitions. [2022-01-31 21:56:12,915 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 396 transitions. Word has length 66 [2022-01-31 21:56:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:12,915 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 396 transitions. [2022-01-31 21:56:12,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:56:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 396 transitions. [2022-01-31 21:56:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-31 21:56:12,916 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:12,916 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:12,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 21:56:12,916 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:12,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:12,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1991566019, now seen corresponding path program 1 times [2022-01-31 21:56:12,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:12,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [543312221] [2022-01-31 21:56:12,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:12,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:12,918 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:12,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:12,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 21:56:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:13,045 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:13,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [543312221] [2022-01-31 21:56:13,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [543312221] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:13,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:13,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:13,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218756745] [2022-01-31 21:56:13,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:13,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:13,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:13,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:13,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:13,046 INFO L87 Difference]: Start difference. First operand 298 states and 396 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:56:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:13,377 INFO L93 Difference]: Finished difference Result 591 states and 822 transitions. [2022-01-31 21:56:13,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:56:13,377 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 69 [2022-01-31 21:56:13,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:13,379 INFO L225 Difference]: With dead ends: 591 [2022-01-31 21:56:13,379 INFO L226 Difference]: Without dead ends: 330 [2022-01-31 21:56:13,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:13,384 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 183 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:13,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 1025 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:56:13,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-01-31 21:56:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 303. [2022-01-31 21:56:13,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 218 states have (on average 1.261467889908257) internal successors, (275), 224 states have internal predecessors, (275), 55 states have call successors, (55), 28 states have call predecessors, (55), 29 states have return successors, (79), 51 states have call predecessors, (79), 50 states have call successors, (79) [2022-01-31 21:56:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 409 transitions. [2022-01-31 21:56:13,429 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 409 transitions. Word has length 69 [2022-01-31 21:56:13,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:13,430 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 409 transitions. [2022-01-31 21:56:13,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:56:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 409 transitions. [2022-01-31 21:56:13,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-31 21:56:13,430 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:13,430 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:13,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 21:56:13,430 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:13,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash 437736013, now seen corresponding path program 1 times [2022-01-31 21:56:13,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:13,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [901517240] [2022-01-31 21:56:13,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:13,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:13,432 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 21:56:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:13,542 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:13,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [901517240] [2022-01-31 21:56:13,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [901517240] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:13,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:13,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:56:13,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047608438] [2022-01-31 21:56:13,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:13,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:56:13,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:13,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:56:13,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:56:13,544 INFO L87 Difference]: Start difference. First operand 303 states and 409 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:56:13,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:13,902 INFO L93 Difference]: Finished difference Result 477 states and 678 transitions. [2022-01-31 21:56:13,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:56:13,903 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 69 [2022-01-31 21:56:13,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:13,906 INFO L225 Difference]: With dead ends: 477 [2022-01-31 21:56:13,906 INFO L226 Difference]: Without dead ends: 474 [2022-01-31 21:56:13,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:13,906 INFO L933 BasicCegarLoop]: 306 mSDtfsCounter, 283 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:13,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 755 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:56:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-01-31 21:56:13,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 307. [2022-01-31 21:56:13,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 222 states have (on average 1.2657657657657657) internal successors, (281), 228 states have internal predecessors, (281), 55 states have call successors, (55), 28 states have call predecessors, (55), 29 states have return successors, (79), 51 states have call predecessors, (79), 50 states have call successors, (79) [2022-01-31 21:56:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 415 transitions. [2022-01-31 21:56:13,988 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 415 transitions. Word has length 69 [2022-01-31 21:56:13,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:13,988 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 415 transitions. [2022-01-31 21:56:13,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:56:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 415 transitions. [2022-01-31 21:56:13,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-31 21:56:13,989 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:13,989 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:13,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 21:56:13,989 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:13,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:13,989 INFO L85 PathProgramCache]: Analyzing trace with hash 447050566, now seen corresponding path program 1 times [2022-01-31 21:56:13,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:13,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [320335897] [2022-01-31 21:56:13,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:13,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:13,991 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:14,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:14,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:14,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:14,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 21:56:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:14,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:14,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:14,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:14,164 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:14,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [320335897] [2022-01-31 21:56:14,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [320335897] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:14,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:14,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:56:14,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239134809] [2022-01-31 21:56:14,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:14,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:56:14,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:14,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:56:14,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:56:14,165 INFO L87 Difference]: Start difference. First operand 307 states and 415 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:56:14,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:14,608 INFO L93 Difference]: Finished difference Result 793 states and 1161 transitions. [2022-01-31 21:56:14,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:56:14,608 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2022-01-31 21:56:14,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:14,611 INFO L225 Difference]: With dead ends: 793 [2022-01-31 21:56:14,611 INFO L226 Difference]: Without dead ends: 529 [2022-01-31 21:56:14,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:14,613 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 493 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:14,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 584 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:56:14,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-01-31 21:56:14,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 490. [2022-01-31 21:56:14,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 357 states have (on average 1.2913165266106443) internal successors, (461), 366 states have internal predecessors, (461), 89 states have call successors, (89), 35 states have call predecessors, (89), 43 states have return successors, (153), 89 states have call predecessors, (153), 85 states have call successors, (153) [2022-01-31 21:56:14,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 703 transitions. [2022-01-31 21:56:14,697 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 703 transitions. Word has length 70 [2022-01-31 21:56:14,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:14,697 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 703 transitions. [2022-01-31 21:56:14,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:56:14,698 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 703 transitions. [2022-01-31 21:56:14,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-31 21:56:14,698 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:14,698 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:14,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 21:56:14,698 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:14,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:14,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1436145557, now seen corresponding path program 1 times [2022-01-31 21:56:14,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:14,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1672375237] [2022-01-31 21:56:14,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:14,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:14,700 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:14,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:14,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:14,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:14,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-31 21:56:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:14,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:14,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:14,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:14,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:14,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:14,864 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:14,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1672375237] [2022-01-31 21:56:14,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1672375237] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:14,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:14,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:56:14,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111016690] [2022-01-31 21:56:14,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:14,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:56:14,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:14,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:56:14,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:14,865 INFO L87 Difference]: Start difference. First operand 490 states and 703 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-31 21:56:15,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:15,345 INFO L93 Difference]: Finished difference Result 942 states and 1393 transitions. [2022-01-31 21:56:15,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:56:15,345 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2022-01-31 21:56:15,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:15,348 INFO L225 Difference]: With dead ends: 942 [2022-01-31 21:56:15,349 INFO L226 Difference]: Without dead ends: 493 [2022-01-31 21:56:15,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:15,351 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 107 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:15,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 1126 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:56:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-01-31 21:56:15,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 484. [2022-01-31 21:56:15,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 353 states have (on average 1.2832861189801699) internal successors, (453), 361 states have internal predecessors, (453), 88 states have call successors, (88), 35 states have call predecessors, (88), 42 states have return successors, (146), 88 states have call predecessors, (146), 84 states have call successors, (146) [2022-01-31 21:56:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 687 transitions. [2022-01-31 21:56:15,457 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 687 transitions. Word has length 72 [2022-01-31 21:56:15,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:15,457 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 687 transitions. [2022-01-31 21:56:15,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-31 21:56:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 687 transitions. [2022-01-31 21:56:15,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-31 21:56:15,458 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:15,458 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:15,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 21:56:15,458 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:15,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:15,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1927869214, now seen corresponding path program 1 times [2022-01-31 21:56:15,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:15,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1940282677] [2022-01-31 21:56:15,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:15,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:15,460 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-31 21:56:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 21:56:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:15,621 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:15,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1940282677] [2022-01-31 21:56:15,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1940282677] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:15,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:15,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:15,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787563566] [2022-01-31 21:56:15,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:15,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:15,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:15,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:15,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:15,622 INFO L87 Difference]: Start difference. First operand 484 states and 687 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 21:56:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:16,112 INFO L93 Difference]: Finished difference Result 869 states and 1255 transitions. [2022-01-31 21:56:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:16,112 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2022-01-31 21:56:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:16,114 INFO L225 Difference]: With dead ends: 869 [2022-01-31 21:56:16,115 INFO L226 Difference]: Without dead ends: 450 [2022-01-31 21:56:16,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:56:16,116 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 337 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:16,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 956 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:56:16,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-01-31 21:56:16,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 436. [2022-01-31 21:56:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 320 states have (on average 1.296875) internal successors, (415), 329 states have internal predecessors, (415), 79 states have call successors, (79), 33 states have call predecessors, (79), 36 states have return successors, (110), 74 states have call predecessors, (110), 75 states have call successors, (110) [2022-01-31 21:56:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 604 transitions. [2022-01-31 21:56:16,185 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 604 transitions. Word has length 83 [2022-01-31 21:56:16,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:16,185 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 604 transitions. [2022-01-31 21:56:16,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 21:56:16,186 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 604 transitions. [2022-01-31 21:56:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-31 21:56:16,186 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:16,186 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:16,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-31 21:56:16,187 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:16,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:16,187 INFO L85 PathProgramCache]: Analyzing trace with hash -770629812, now seen corresponding path program 1 times [2022-01-31 21:56:16,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:16,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1719069430] [2022-01-31 21:56:16,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:16,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:16,188 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 21:56:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:16,514 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:16,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1719069430] [2022-01-31 21:56:16,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1719069430] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:16,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:16,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 21:56:16,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566580904] [2022-01-31 21:56:16,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:16,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 21:56:16,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:16,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 21:56:16,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:56:16,516 INFO L87 Difference]: Start difference. First operand 436 states and 604 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-31 21:56:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:17,176 INFO L93 Difference]: Finished difference Result 486 states and 681 transitions. [2022-01-31 21:56:17,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 21:56:17,177 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) Word has length 92 [2022-01-31 21:56:17,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:17,179 INFO L225 Difference]: With dead ends: 486 [2022-01-31 21:56:17,179 INFO L226 Difference]: Without dead ends: 461 [2022-01-31 21:56:17,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-01-31 21:56:17,179 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 147 mSDsluCounter, 2433 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:17,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 2670 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:56:17,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-01-31 21:56:17,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2022-01-31 21:56:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 329 states have (on average 1.2887537993920972) internal successors, (424), 339 states have internal predecessors, (424), 79 states have call successors, (79), 33 states have call predecessors, (79), 38 states have return successors, (116), 75 states have call predecessors, (116), 75 states have call successors, (116) [2022-01-31 21:56:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 619 transitions. [2022-01-31 21:56:17,248 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 619 transitions. Word has length 92 [2022-01-31 21:56:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:17,248 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 619 transitions. [2022-01-31 21:56:17,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-31 21:56:17,249 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 619 transitions. [2022-01-31 21:56:17,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-31 21:56:17,249 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:17,250 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:17,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-31 21:56:17,250 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:17,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:17,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1033506351, now seen corresponding path program 1 times [2022-01-31 21:56:17,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:17,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1702900642] [2022-01-31 21:56:17,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:17,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:17,252 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:17,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:17,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:17,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:17,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:17,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:17,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:17,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:17,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:17,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:17,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:17,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 21:56:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:17,610 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:17,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1702900642] [2022-01-31 21:56:17,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1702900642] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:17,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:17,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 21:56:17,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575870792] [2022-01-31 21:56:17,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:17,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 21:56:17,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:17,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 21:56:17,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:56:17,611 INFO L87 Difference]: Start difference. First operand 447 states and 619 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-31 21:56:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:18,319 INFO L93 Difference]: Finished difference Result 484 states and 677 transitions. [2022-01-31 21:56:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 21:56:18,320 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2022-01-31 21:56:18,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:18,322 INFO L225 Difference]: With dead ends: 484 [2022-01-31 21:56:18,322 INFO L226 Difference]: Without dead ends: 459 [2022-01-31 21:56:18,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-01-31 21:56:18,322 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 121 mSDsluCounter, 2577 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 2822 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:18,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 2822 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:56:18,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-01-31 21:56:18,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 434. [2022-01-31 21:56:18,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 319 states have (on average 1.297805642633229) internal successors, (414), 328 states have internal predecessors, (414), 78 states have call successors, (78), 33 states have call predecessors, (78), 36 states have return successors, (108), 73 states have call predecessors, (108), 74 states have call successors, (108) [2022-01-31 21:56:18,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 600 transitions. [2022-01-31 21:56:18,388 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 600 transitions. Word has length 93 [2022-01-31 21:56:18,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:18,388 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 600 transitions. [2022-01-31 21:56:18,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-31 21:56:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 600 transitions. [2022-01-31 21:56:18,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-31 21:56:18,389 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:18,389 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:18,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-31 21:56:18,389 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:18,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:18,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1724660735, now seen corresponding path program 1 times [2022-01-31 21:56:18,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:18,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1552817345] [2022-01-31 21:56:18,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:18,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:18,391 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 21:56:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-01-31 21:56:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:18,734 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:18,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1552817345] [2022-01-31 21:56:18,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1552817345] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:18,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:18,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 21:56:18,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407087443] [2022-01-31 21:56:18,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:18,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 21:56:18,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:18,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 21:56:18,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:56:18,735 INFO L87 Difference]: Start difference. First operand 434 states and 600 transitions. Second operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2022-01-31 21:56:20,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:20,158 INFO L93 Difference]: Finished difference Result 470 states and 642 transitions. [2022-01-31 21:56:20,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 21:56:20,159 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2022-01-31 21:56:20,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:20,160 INFO L225 Difference]: With dead ends: 470 [2022-01-31 21:56:20,160 INFO L226 Difference]: Without dead ends: 434 [2022-01-31 21:56:20,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2022-01-31 21:56:20,161 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 395 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 2919 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 3168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 2919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:20,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 810 Invalid, 3168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 2919 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 21:56:20,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-01-31 21:56:20,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 424. [2022-01-31 21:56:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 313 states have (on average 1.3003194888178913) internal successors, (407), 322 states have internal predecessors, (407), 75 states have call successors, (75), 32 states have call predecessors, (75), 35 states have return successors, (105), 70 states have call predecessors, (105), 71 states have call successors, (105) [2022-01-31 21:56:20,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 587 transitions. [2022-01-31 21:56:20,228 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 587 transitions. Word has length 103 [2022-01-31 21:56:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:20,228 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 587 transitions. [2022-01-31 21:56:20,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2022-01-31 21:56:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 587 transitions. [2022-01-31 21:56:20,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-31 21:56:20,229 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:20,229 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:20,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-31 21:56:20,229 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:20,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:20,229 INFO L85 PathProgramCache]: Analyzing trace with hash 56143006, now seen corresponding path program 1 times [2022-01-31 21:56:20,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:20,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1187517339] [2022-01-31 21:56:20,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:20,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:20,231 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 21:56:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-31 21:56:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-31 21:56:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:20,598 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:20,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1187517339] [2022-01-31 21:56:20,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1187517339] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:20,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:20,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 21:56:20,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839868027] [2022-01-31 21:56:20,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:20,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 21:56:20,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:20,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 21:56:20,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:56:20,600 INFO L87 Difference]: Start difference. First operand 424 states and 587 transitions. Second operand has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 21:56:21,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:21,633 INFO L93 Difference]: Finished difference Result 481 states and 679 transitions. [2022-01-31 21:56:21,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 21:56:21,634 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 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 108 [2022-01-31 21:56:21,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:21,637 INFO L225 Difference]: With dead ends: 481 [2022-01-31 21:56:21,637 INFO L226 Difference]: Without dead ends: 454 [2022-01-31 21:56:21,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2022-01-31 21:56:21,638 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 121 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 2158 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:21,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 2146 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2158 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:56:21,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-01-31 21:56:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 440. [2022-01-31 21:56:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 324 states have (on average 1.2901234567901234) internal successors, (418), 334 states have internal predecessors, (418), 78 states have call successors, (78), 32 states have call predecessors, (78), 37 states have return successors, (114), 74 states have call predecessors, (114), 73 states have call successors, (114) [2022-01-31 21:56:21,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 610 transitions. [2022-01-31 21:56:21,735 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 610 transitions. Word has length 108 [2022-01-31 21:56:21,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:21,735 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 610 transitions. [2022-01-31 21:56:21,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 21:56:21,735 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 610 transitions. [2022-01-31 21:56:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-31 21:56:21,736 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:21,736 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:21,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-31 21:56:21,736 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:21,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:21,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1819064313, now seen corresponding path program 1 times [2022-01-31 21:56:21,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:21,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [188256936] [2022-01-31 21:56:21,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:21,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:21,738 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:21,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:21,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:21,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:21,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:21,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:21,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:21,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 21:56:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 21:56:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 21:56:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:22,088 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:22,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [188256936] [2022-01-31 21:56:22,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [188256936] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:22,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:22,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 21:56:22,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605642257] [2022-01-31 21:56:22,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:22,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 21:56:22,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:22,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 21:56:22,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:56:22,089 INFO L87 Difference]: Start difference. First operand 440 states and 610 transitions. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 21:56:22,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:22,965 INFO L93 Difference]: Finished difference Result 483 states and 677 transitions. [2022-01-31 21:56:22,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 21:56:22,966 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 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 109 [2022-01-31 21:56:22,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:22,968 INFO L225 Difference]: With dead ends: 483 [2022-01-31 21:56:22,968 INFO L226 Difference]: Without dead ends: 443 [2022-01-31 21:56:22,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2022-01-31 21:56:22,969 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 199 mSDsluCounter, 2305 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 2543 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:22,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 2543 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:22,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-01-31 21:56:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 413. [2022-01-31 21:56:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 304 states have (on average 1.2664473684210527) internal successors, (385), 312 states have internal predecessors, (385), 75 states have call successors, (75), 32 states have call predecessors, (75), 33 states have return successors, (97), 69 states have call predecessors, (97), 70 states have call successors, (97) [2022-01-31 21:56:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 557 transitions. [2022-01-31 21:56:23,054 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 557 transitions. Word has length 109 [2022-01-31 21:56:23,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:23,054 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 557 transitions. [2022-01-31 21:56:23,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 21:56:23,054 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 557 transitions. [2022-01-31 21:56:23,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-31 21:56:23,055 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:23,055 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:23,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-31 21:56:23,056 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:23,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:23,056 INFO L85 PathProgramCache]: Analyzing trace with hash -636706815, now seen corresponding path program 1 times [2022-01-31 21:56:23,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:23,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1773680991] [2022-01-31 21:56:23,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:23,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:23,058 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 21:56:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 21:56:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 21:56:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-31 21:56:23,239 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:23,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1773680991] [2022-01-31 21:56:23,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1773680991] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:23,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:23,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:56:23,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498479703] [2022-01-31 21:56:23,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:23,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:56:23,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:23,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:56:23,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:23,240 INFO L87 Difference]: Start difference. First operand 413 states and 557 transitions. Second operand has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-01-31 21:56:23,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:23,833 INFO L93 Difference]: Finished difference Result 734 states and 984 transitions. [2022-01-31 21:56:23,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:23,834 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2022-01-31 21:56:23,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:23,836 INFO L225 Difference]: With dead ends: 734 [2022-01-31 21:56:23,836 INFO L226 Difference]: Without dead ends: 420 [2022-01-31 21:56:23,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:56:23,837 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 99 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:23,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 1131 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:56:23,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-01-31 21:56:23,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 408. [2022-01-31 21:56:23,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 302 states have (on average 1.2483443708609272) internal successors, (377), 309 states have internal predecessors, (377), 71 states have call successors, (71), 32 states have call predecessors, (71), 34 states have return successors, (92), 67 states have call predecessors, (92), 66 states have call successors, (92) [2022-01-31 21:56:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 540 transitions. [2022-01-31 21:56:23,907 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 540 transitions. Word has length 121 [2022-01-31 21:56:23,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:23,907 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 540 transitions. [2022-01-31 21:56:23,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-01-31 21:56:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 540 transitions. [2022-01-31 21:56:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-31 21:56:23,908 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:23,909 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:23,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-31 21:56:23,909 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:23,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:23,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1406877123, now seen corresponding path program 1 times [2022-01-31 21:56:23,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:23,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1435805068] [2022-01-31 21:56:23,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:23,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:23,911 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 21:56:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 21:56:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 21:56:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-31 21:56:24,106 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:24,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1435805068] [2022-01-31 21:56:24,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1435805068] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:24,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:24,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:56:24,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316359306] [2022-01-31 21:56:24,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:24,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:56:24,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:24,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:56:24,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:24,107 INFO L87 Difference]: Start difference. First operand 408 states and 540 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-01-31 21:56:24,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:24,581 INFO L93 Difference]: Finished difference Result 592 states and 836 transitions. [2022-01-31 21:56:24,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:24,581 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2022-01-31 21:56:24,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:24,584 INFO L225 Difference]: With dead ends: 592 [2022-01-31 21:56:24,584 INFO L226 Difference]: Without dead ends: 547 [2022-01-31 21:56:24,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:56:24,585 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 217 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:24,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 1249 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:56:24,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-01-31 21:56:24,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 399. [2022-01-31 21:56:24,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 294 states have (on average 1.248299319727891) internal successors, (367), 301 states have internal predecessors, (367), 71 states have call successors, (71), 32 states have call predecessors, (71), 33 states have return successors, (91), 66 states have call predecessors, (91), 66 states have call successors, (91) [2022-01-31 21:56:24,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 529 transitions. [2022-01-31 21:56:24,651 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 529 transitions. Word has length 122 [2022-01-31 21:56:24,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:24,652 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 529 transitions. [2022-01-31 21:56:24,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-01-31 21:56:24,652 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 529 transitions. [2022-01-31 21:56:24,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-01-31 21:56:24,652 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:24,653 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:24,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-31 21:56:24,653 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:24,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:24,653 INFO L85 PathProgramCache]: Analyzing trace with hash 359745241, now seen corresponding path program 1 times [2022-01-31 21:56:24,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:24,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1941843282] [2022-01-31 21:56:24,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:24,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:24,654 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 21:56:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-01-31 21:56:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:25,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-31 21:56:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:25,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:25,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 21:56:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:25,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-01-31 21:56:25,044 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:25,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1941843282] [2022-01-31 21:56:25,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1941843282] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:25,044 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:25,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 21:56:25,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654487280] [2022-01-31 21:56:25,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:25,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 21:56:25,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:25,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 21:56:25,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:56:25,048 INFO L87 Difference]: Start difference. First operand 399 states and 529 transitions. Second operand has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-01-31 21:56:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:26,314 INFO L93 Difference]: Finished difference Result 416 states and 551 transitions. [2022-01-31 21:56:26,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 21:56:26,314 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 119 [2022-01-31 21:56:26,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:26,316 INFO L225 Difference]: With dead ends: 416 [2022-01-31 21:56:26,316 INFO L226 Difference]: Without dead ends: 354 [2022-01-31 21:56:26,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=1718, Unknown=0, NotChecked=0, Total=1980 [2022-01-31 21:56:26,317 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 476 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 2616 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 2616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:26,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 481 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 2616 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:56:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-01-31 21:56:26,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 341. [2022-01-31 21:56:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 250 states have (on average 1.18) internal successors, (295), 255 states have internal predecessors, (295), 64 states have call successors, (64), 29 states have call predecessors, (64), 26 states have return successors, (77), 56 states have call predecessors, (77), 58 states have call successors, (77) [2022-01-31 21:56:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 436 transitions. [2022-01-31 21:56:26,376 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 436 transitions. Word has length 119 [2022-01-31 21:56:26,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:26,377 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 436 transitions. [2022-01-31 21:56:26,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-01-31 21:56:26,377 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 436 transitions. [2022-01-31 21:56:26,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-31 21:56:26,378 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:26,378 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-31 21:56:26,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-31 21:56:26,378 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:26,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:26,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1772031017, now seen corresponding path program 1 times [2022-01-31 21:56:26,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:26,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [584093878] [2022-01-31 21:56:26,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:26,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:26,380 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 21:56:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 21:56:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 21:56:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 21:56:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-01-31 21:56:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,580 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-01-31 21:56:26,580 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:26,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [584093878] [2022-01-31 21:56:26,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [584093878] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:26,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:26,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:56:26,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98616933] [2022-01-31 21:56:26,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:26,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:56:26,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:26,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:56:26,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:26,582 INFO L87 Difference]: Start difference. First operand 341 states and 436 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 21:56:27,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:27,120 INFO L93 Difference]: Finished difference Result 636 states and 834 transitions. [2022-01-31 21:56:27,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:27,121 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 163 [2022-01-31 21:56:27,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:27,123 INFO L225 Difference]: With dead ends: 636 [2022-01-31 21:56:27,123 INFO L226 Difference]: Without dead ends: 378 [2022-01-31 21:56:27,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:56:27,124 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 130 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:27,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 883 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:56:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-01-31 21:56:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 361. [2022-01-31 21:56:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 268 states have (on average 1.1679104477611941) internal successors, (313), 273 states have internal predecessors, (313), 64 states have call successors, (64), 29 states have call predecessors, (64), 28 states have return successors, (88), 58 states have call predecessors, (88), 58 states have call successors, (88) [2022-01-31 21:56:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 465 transitions. [2022-01-31 21:56:27,211 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 465 transitions. Word has length 163 [2022-01-31 21:56:27,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:27,211 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 465 transitions. [2022-01-31 21:56:27,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 21:56:27,211 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 465 transitions. [2022-01-31 21:56:27,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-31 21:56:27,212 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:27,212 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-31 21:56:27,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-31 21:56:27,213 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:27,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:27,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1922888438, now seen corresponding path program 1 times [2022-01-31 21:56:27,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:27,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1788274083] [2022-01-31 21:56:27,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:27,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:27,214 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 21:56:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 21:56:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 21:56:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 21:56:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 21:56:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-01-31 21:56:27,418 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:27,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1788274083] [2022-01-31 21:56:27,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1788274083] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:27,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:27,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:56:27,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921574950] [2022-01-31 21:56:27,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:27,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:56:27,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:27,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:56:27,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:27,419 INFO L87 Difference]: Start difference. First operand 361 states and 465 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2022-01-31 21:56:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:27,969 INFO L93 Difference]: Finished difference Result 655 states and 843 transitions. [2022-01-31 21:56:27,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:27,970 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) Word has length 164 [2022-01-31 21:56:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:27,972 INFO L225 Difference]: With dead ends: 655 [2022-01-31 21:56:27,972 INFO L226 Difference]: Without dead ends: 428 [2022-01-31 21:56:27,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:56:27,973 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 142 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:27,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 1227 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:56:27,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-01-31 21:56:28,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 345. [2022-01-31 21:56:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 256 states have (on average 1.14453125) internal successors, (293), 260 states have internal predecessors, (293), 60 states have call successors, (60), 29 states have call predecessors, (60), 28 states have return successors, (80), 55 states have call predecessors, (80), 54 states have call successors, (80) [2022-01-31 21:56:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 433 transitions. [2022-01-31 21:56:28,042 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 433 transitions. Word has length 164 [2022-01-31 21:56:28,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:28,042 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 433 transitions. [2022-01-31 21:56:28,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2022-01-31 21:56:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 433 transitions. [2022-01-31 21:56:28,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-01-31 21:56:28,043 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:28,044 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-01-31 21:56:28,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-31 21:56:28,044 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:28,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:28,044 INFO L85 PathProgramCache]: Analyzing trace with hash -793320098, now seen corresponding path program 1 times [2022-01-31 21:56:28,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:28,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1397024454] [2022-01-31 21:56:28,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:28,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:28,046 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 21:56:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 21:56:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 21:56:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 21:56:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 21:56:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 21:56:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 21:56:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-01-31 21:56:28,295 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:28,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1397024454] [2022-01-31 21:56:28,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1397024454] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:28,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:28,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:56:28,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127809306] [2022-01-31 21:56:28,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:28,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:56:28,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:28,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:56:28,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:28,296 INFO L87 Difference]: Start difference. First operand 345 states and 433 transitions. Second operand has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2022-01-31 21:56:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:28,918 INFO L93 Difference]: Finished difference Result 443 states and 558 transitions. [2022-01-31 21:56:28,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:28,918 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) Word has length 204 [2022-01-31 21:56:28,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:28,919 INFO L225 Difference]: With dead ends: 443 [2022-01-31 21:56:28,920 INFO L226 Difference]: Without dead ends: 354 [2022-01-31 21:56:28,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:56:28,920 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 110 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:28,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 991 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:56:28,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-01-31 21:56:28,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 309. [2022-01-31 21:56:28,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 231 states have (on average 1.1255411255411256) internal successors, (260), 234 states have internal predecessors, (260), 52 states have call successors, (52), 24 states have call predecessors, (52), 25 states have return successors, (73), 50 states have call predecessors, (73), 47 states have call successors, (73) [2022-01-31 21:56:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 385 transitions. [2022-01-31 21:56:28,976 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 385 transitions. Word has length 204 [2022-01-31 21:56:28,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:28,976 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 385 transitions. [2022-01-31 21:56:28,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2022-01-31 21:56:28,976 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 385 transitions. [2022-01-31 21:56:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-01-31 21:56:28,978 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:28,978 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-01-31 21:56:28,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-31 21:56:28,978 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:28,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:28,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1596093442, now seen corresponding path program 1 times [2022-01-31 21:56:28,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:28,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [746321247] [2022-01-31 21:56:28,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:28,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:28,980 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 21:56:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 21:56:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 21:56:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 21:56:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 21:56:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 21:56:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 21:56:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-01-31 21:56:29,201 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:29,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [746321247] [2022-01-31 21:56:29,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [746321247] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:29,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:29,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:56:29,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176387872] [2022-01-31 21:56:29,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:29,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:56:29,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:29,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:56:29,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:29,203 INFO L87 Difference]: Start difference. First operand 309 states and 385 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2022-01-31 21:56:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:29,573 INFO L93 Difference]: Finished difference Result 315 states and 397 transitions. [2022-01-31 21:56:29,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:29,573 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) Word has length 207 [2022-01-31 21:56:29,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:29,573 INFO L225 Difference]: With dead ends: 315 [2022-01-31 21:56:29,573 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 21:56:29,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:56:29,575 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 186 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:29,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 663 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:56:29,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 21:56:29,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 21:56:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-31 21:56:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 21:56:29,587 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2022-01-31 21:56:29,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:29,587 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 21:56:29,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2022-01-31 21:56:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 21:56:29,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 21:56:29,589 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 21:56:29,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-31 21:56:29,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 21:57:03,648 WARN L228 SmtUtils]: Spent 34.03s on a formula simplification. DAG size of input: 162 DAG size of output: 159 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-31 22:01:23,580 WARN L228 SmtUtils]: Spent 4.33m on a formula simplification. DAG size of input: 164 DAG size of output: 161 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-31 22:04:26,260 WARN L228 SmtUtils]: Spent 3.04m on a formula simplification. DAG size of input: 164 DAG size of output: 161 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-31 22:04:59,993 WARN L228 SmtUtils]: Spent 33.73s on a formula simplification. DAG size of input: 162 DAG size of output: 159 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-31 22:05:33,792 WARN L228 SmtUtils]: Spent 33.78s on a formula simplification. DAG size of input: 162 DAG size of output: 159 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)