./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1648e097-5e18-489c-b034-cc5a39d82ace/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1648e097-5e18-489c-b034-cc5a39d82ace/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1648e097-5e18-489c-b034-cc5a39d82ace/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1648e097-5e18-489c-b034-cc5a39d82ace/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1648e097-5e18-489c-b034-cc5a39d82ace/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1648e097-5e18-489c-b034-cc5a39d82ace/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a9a20f3f691c8614da828fa262b8d39a0b290d1ce7d7bab1e11653a91cb5fcdd --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:21:14,180 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:21:14,262 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1648e097-5e18-489c-b034-cc5a39d82ace/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-12 02:21:14,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:21:14,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:21:14,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:21:14,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:21:14,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:21:14,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:21:14,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:21:14,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:21:14,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:21:14,309 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:21:14,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:21:14,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:21:14,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:21:14,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:21:14,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:21:14,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:21:14,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:21:14,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:21:14,316 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:21:14,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:21:14,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:21:14,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:21:14,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:21:14,320 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:21:14,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:21:14,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:21:14,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:21:14,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:21:14,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:21:14,325 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:21:14,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:21:14,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:21:14,327 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:21:14,327 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1648e097-5e18-489c-b034-cc5a39d82ace/bin/uautomizer-verify-uTZkv6EMXl/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1648e097-5e18-489c-b034-cc5a39d82ace/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9a20f3f691c8614da828fa262b8d39a0b290d1ce7d7bab1e11653a91cb5fcdd [2023-11-12 02:21:14,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:21:14,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:21:14,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:21:14,664 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:21:14,666 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:21:14,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1648e097-5e18-489c-b034-cc5a39d82ace/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i [2023-11-12 02:21:18,147 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:21:18,766 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:21:18,767 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1648e097-5e18-489c-b034-cc5a39d82ace/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i [2023-11-12 02:21:18,811 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1648e097-5e18-489c-b034-cc5a39d82ace/bin/uautomizer-verify-uTZkv6EMXl/data/88f1f39da/6296126e416043f6b1e147b06e64e355/FLAG773cc1c53 [2023-11-12 02:21:18,826 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1648e097-5e18-489c-b034-cc5a39d82ace/bin/uautomizer-verify-uTZkv6EMXl/data/88f1f39da/6296126e416043f6b1e147b06e64e355 [2023-11-12 02:21:18,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:21:18,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:21:18,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:21:18,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:21:18,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:21:18,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:21:18" (1/1) ... [2023-11-12 02:21:18,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dce98fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:18, skipping insertion in model container [2023-11-12 02:21:18,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:21:18" (1/1) ... [2023-11-12 02:21:18,994 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:21:19,911 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1648e097-5e18-489c-b034-cc5a39d82ace/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i[161908,161921] [2023-11-12 02:21:20,333 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:21:20,379 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:21:20,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; decl %0; sete %1": "+m" (v->counter), "=qm" (c): : "memory"); [5496-5497] [2023-11-12 02:21:20,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddb %b0, %1\n": "+q" (__ret), "+m" (v->counter): : "memory", "cc"); [5508-5509] [2023-11-12 02:21:20,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddw %w0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [5512-5513] [2023-11-12 02:21:20,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddl %0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [5516-5517] [2023-11-12 02:21:20,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddq %q0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [5520-5521] [2023-11-12 02:21:20,526 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1648e097-5e18-489c-b034-cc5a39d82ace/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i[161908,161921] [2023-11-12 02:21:20,778 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:21:20,818 WARN L672 CHandler]: The function __xadd_wrong_size is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:21:20,826 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:21:20,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:20 WrapperNode [2023-11-12 02:21:20,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:21:20,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:21:20,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:21:20,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:21:20,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:20" (1/1) ... [2023-11-12 02:21:20,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:20" (1/1) ... [2023-11-12 02:21:20,981 INFO L138 Inliner]: procedures = 139, calls = 579, calls flagged for inlining = 61, calls inlined = 61, statements flattened = 1894 [2023-11-12 02:21:20,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:21:20,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:21:20,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:21:20,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:21:20,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:20" (1/1) ... [2023-11-12 02:21:20,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:20" (1/1) ... [2023-11-12 02:21:21,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:20" (1/1) ... [2023-11-12 02:21:21,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:20" (1/1) ... [2023-11-12 02:21:21,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:20" (1/1) ... [2023-11-12 02:21:21,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:20" (1/1) ... [2023-11-12 02:21:21,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:20" (1/1) ... [2023-11-12 02:21:21,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:20" (1/1) ... [2023-11-12 02:21:21,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:21:21,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:21:21,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:21:21,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:21:21,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:20" (1/1) ... [2023-11-12 02:21:21,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:21:21,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1648e097-5e18-489c-b034-cc5a39d82ace/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:21:21,257 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1648e097-5e18-489c-b034-cc5a39d82ace/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:21:21,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1648e097-5e18-489c-b034-cc5a39d82ace/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:21:21,315 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_resume [2023-11-12 02:21:21,316 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_resume [2023-11-12 02:21:21,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-12 02:21:21,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-12 02:21:21,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-12 02:21:21,318 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-12 02:21:21,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-12 02:21:21,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:21:21,320 INFO L130 BoogieDeclarations]: Found specification of procedure skb_headroom [2023-11-12 02:21:21,320 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_headroom [2023-11-12 02:21:21,321 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2023-11-12 02:21:21,321 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2023-11-12 02:21:21,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2023-11-12 02:21:21,321 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2023-11-12 02:21:21,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-12 02:21:21,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-12 02:21:21,322 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2023-11-12 02:21:21,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2023-11-12 02:21:21,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:21:21,322 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_suspend [2023-11-12 02:21:21,323 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_suspend [2023-11-12 02:21:21,324 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-12 02:21:21,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-12 02:21:21,324 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_resume [2023-11-12 02:21:21,324 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_resume [2023-11-12 02:21:21,325 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-12 02:21:21,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-12 02:21:21,326 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2023-11-12 02:21:21,326 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2023-11-12 02:21:21,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-11-12 02:21:21,326 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-11-12 02:21:21,327 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:21:21,328 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:21:21,328 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_tx_fixup [2023-11-12 02:21:21,328 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_tx_fixup [2023-11-12 02:21:21,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 02:21:21,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2023-11-12 02:21:21,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2023-11-12 02:21:21,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_4 [2023-11-12 02:21:21,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_4 [2023-11-12 02:21:21,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:21:21,329 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_netdev_dbg [2023-11-12 02:21:21,329 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_netdev_dbg [2023-11-12 02:21:21,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-11-12 02:21:21,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-11-12 02:21:21,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 02:21:21,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:21:21,330 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-11-12 02:21:21,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-11-12 02:21:21,331 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_bind [2023-11-12 02:21:21,331 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_bind [2023-11-12 02:21:21,331 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_manage_power [2023-11-12 02:21:21,331 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_manage_power [2023-11-12 02:21:21,331 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2023-11-12 02:21:21,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2023-11-12 02:21:21,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 02:21:21,332 INFO L130 BoogieDeclarations]: Found specification of procedure __xadd_wrong_size [2023-11-12 02:21:21,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:21:21,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 02:21:21,333 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2023-11-12 02:21:21,333 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2023-11-12 02:21:21,333 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_rx_fixup [2023-11-12 02:21:21,333 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_rx_fixup [2023-11-12 02:21:21,333 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2023-11-12 02:21:21,334 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2023-11-12 02:21:21,335 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_ncm_unbind [2023-11-12 02:21:21,335 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_ncm_unbind [2023-11-12 02:21:21,336 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_unbind [2023-11-12 02:21:21,336 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_unbind [2023-11-12 02:21:21,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:21:21,336 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2023-11-12 02:21:21,337 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2023-11-12 02:21:21,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2023-11-12 02:21:21,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2023-11-12 02:21:21,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2023-11-12 02:21:21,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:21:21,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:21:21,338 INFO L130 BoogieDeclarations]: Found specification of procedure eth_hdr [2023-11-12 02:21:21,339 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_hdr [2023-11-12 02:21:21,339 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2023-11-12 02:21:21,339 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2023-11-12 02:21:21,871 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:21:21,879 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:21:22,938 INFO L770 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-12 02:21:23,393 INFO L770 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2023-11-12 02:21:23,816 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:21:23,830 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:21:23,830 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:21:23,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:21:23 BoogieIcfgContainer [2023-11-12 02:21:23,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:21:23,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:21:23,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:21:23,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:21:23,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:21:18" (1/3) ... [2023-11-12 02:21:23,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5426d853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:21:23, skipping insertion in model container [2023-11-12 02:21:23,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:20" (2/3) ... [2023-11-12 02:21:23,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5426d853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:21:23, skipping insertion in model container [2023-11-12 02:21:23,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:21:23" (3/3) ... [2023-11-12 02:21:23,845 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i [2023-11-12 02:21:23,868 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:21:23,868 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:21:23,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:21:23,947 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b084ca9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:21:23,948 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:21:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 571 states, 443 states have (on average 1.4334085778781038) internal successors, (635), 457 states have internal predecessors, (635), 96 states have call successors, (96), 32 states have call predecessors, (96), 30 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2023-11-12 02:21:23,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-12 02:21:23,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:23,971 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:23,971 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:23,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:23,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1477324994, now seen corresponding path program 1 times [2023-11-12 02:21:23,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:23,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542862055] [2023-11-12 02:21:23,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:23,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:24,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:21:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:24,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-12 02:21:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:24,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:21:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:24,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:21:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 02:21:24,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:24,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542862055] [2023-11-12 02:21:24,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542862055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:24,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:24,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:21:24,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079400631] [2023-11-12 02:21:24,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:24,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:21:24,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:24,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:21:24,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:21:24,870 INFO L87 Difference]: Start difference. First operand has 571 states, 443 states have (on average 1.4334085778781038) internal successors, (635), 457 states have internal predecessors, (635), 96 states have call successors, (96), 32 states have call predecessors, (96), 30 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-12 02:21:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:21:27,493 INFO L93 Difference]: Finished difference Result 1830 states and 2737 transitions. [2023-11-12 02:21:27,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:21:27,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2023-11-12 02:21:27,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:21:27,528 INFO L225 Difference]: With dead ends: 1830 [2023-11-12 02:21:27,528 INFO L226 Difference]: Without dead ends: 1242 [2023-11-12 02:21:27,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:21:27,555 INFO L413 NwaCegarLoop]: 692 mSDtfsCounter, 1314 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:21:27,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1372 Valid, 2272 Invalid, 1074 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [432 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-12 02:21:27,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2023-11-12 02:21:27,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1065. [2023-11-12 02:21:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 843 states have (on average 1.4175563463819691) internal successors, (1195), 850 states have internal predecessors, (1195), 163 states have call successors, (163), 59 states have call predecessors, (163), 58 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2023-11-12 02:21:27,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1515 transitions. [2023-11-12 02:21:27,738 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1515 transitions. Word has length 40 [2023-11-12 02:21:27,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:21:27,739 INFO L495 AbstractCegarLoop]: Abstraction has 1065 states and 1515 transitions. [2023-11-12 02:21:27,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-12 02:21:27,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1515 transitions. [2023-11-12 02:21:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-12 02:21:27,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:27,747 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-12 02:21:27,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:21:27,747 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:27,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:27,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2058805364, now seen corresponding path program 1 times [2023-11-12 02:21:27,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:27,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118069536] [2023-11-12 02:21:27,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:27,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:28,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:21:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:28,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-12 02:21:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:28,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:21:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:28,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:21:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:28,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:21:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-12 02:21:28,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:28,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118069536] [2023-11-12 02:21:28,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118069536] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:28,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:28,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:21:28,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454618444] [2023-11-12 02:21:28,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:28,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:21:28,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:28,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:21:28,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:21:28,241 INFO L87 Difference]: Start difference. First operand 1065 states and 1515 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-12 02:21:29,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:21:29,830 INFO L93 Difference]: Finished difference Result 1241 states and 1809 transitions. [2023-11-12 02:21:29,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:21:29,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 50 [2023-11-12 02:21:29,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:21:29,844 INFO L225 Difference]: With dead ends: 1241 [2023-11-12 02:21:29,844 INFO L226 Difference]: Without dead ends: 1238 [2023-11-12 02:21:29,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:21:29,848 INFO L413 NwaCegarLoop]: 667 mSDtfsCounter, 1084 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:21:29,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 1598 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-12 02:21:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2023-11-12 02:21:29,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1064. [2023-11-12 02:21:29,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 843 states have (on average 1.416370106761566) internal successors, (1194), 849 states have internal predecessors, (1194), 162 states have call successors, (162), 59 states have call predecessors, (162), 58 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2023-11-12 02:21:29,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1513 transitions. [2023-11-12 02:21:29,936 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1513 transitions. Word has length 50 [2023-11-12 02:21:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:21:29,937 INFO L495 AbstractCegarLoop]: Abstraction has 1064 states and 1513 transitions. [2023-11-12 02:21:29,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-12 02:21:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1513 transitions. [2023-11-12 02:21:29,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-12 02:21:29,941 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:29,941 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-12 02:21:29,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:21:29,942 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:29,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:29,942 INFO L85 PathProgramCache]: Analyzing trace with hash 601325284, now seen corresponding path program 1 times [2023-11-12 02:21:29,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:29,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804940147] [2023-11-12 02:21:29,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:29,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:30,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:21:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:30,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-12 02:21:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:30,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:21:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:30,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:21:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:30,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:21:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-12 02:21:30,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:30,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804940147] [2023-11-12 02:21:30,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804940147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:30,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:30,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:21:30,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196140325] [2023-11-12 02:21:30,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:30,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:21:30,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:30,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:21:30,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:21:30,358 INFO L87 Difference]: Start difference. First operand 1064 states and 1513 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-12 02:21:31,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:21:31,971 INFO L93 Difference]: Finished difference Result 1240 states and 1807 transitions. [2023-11-12 02:21:31,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:21:31,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2023-11-12 02:21:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:21:31,983 INFO L225 Difference]: With dead ends: 1240 [2023-11-12 02:21:31,983 INFO L226 Difference]: Without dead ends: 1237 [2023-11-12 02:21:31,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:21:31,992 INFO L413 NwaCegarLoop]: 665 mSDtfsCounter, 1081 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:21:31,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 1594 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-12 02:21:31,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2023-11-12 02:21:32,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1063. [2023-11-12 02:21:32,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 843 states have (on average 1.4151838671411625) internal successors, (1193), 848 states have internal predecessors, (1193), 161 states have call successors, (161), 59 states have call predecessors, (161), 58 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2023-11-12 02:21:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1511 transitions. [2023-11-12 02:21:32,103 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1511 transitions. Word has length 51 [2023-11-12 02:21:32,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:21:32,110 INFO L495 AbstractCegarLoop]: Abstraction has 1063 states and 1511 transitions. [2023-11-12 02:21:32,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-12 02:21:32,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1511 transitions. [2023-11-12 02:21:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-12 02:21:32,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:32,115 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-12 02:21:32,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:21:32,116 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:32,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:32,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1461001615, now seen corresponding path program 1 times [2023-11-12 02:21:32,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:32,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642703940] [2023-11-12 02:21:32,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:32,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:32,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:21:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:32,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-12 02:21:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:32,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:21:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:32,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:21:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:32,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:21:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-12 02:21:32,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:32,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642703940] [2023-11-12 02:21:32,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642703940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:32,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:32,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:21:32,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877774074] [2023-11-12 02:21:32,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:32,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:21:32,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:32,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:21:32,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:21:32,413 INFO L87 Difference]: Start difference. First operand 1063 states and 1511 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-12 02:21:34,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:21:34,093 INFO L93 Difference]: Finished difference Result 1239 states and 1805 transitions. [2023-11-12 02:21:34,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:21:34,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2023-11-12 02:21:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:21:34,106 INFO L225 Difference]: With dead ends: 1239 [2023-11-12 02:21:34,106 INFO L226 Difference]: Without dead ends: 1236 [2023-11-12 02:21:34,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:21:34,109 INFO L413 NwaCegarLoop]: 663 mSDtfsCounter, 1078 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:21:34,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 1590 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-12 02:21:34,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2023-11-12 02:21:34,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1062. [2023-11-12 02:21:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 843 states have (on average 1.4139976275207593) internal successors, (1192), 847 states have internal predecessors, (1192), 160 states have call successors, (160), 59 states have call predecessors, (160), 58 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2023-11-12 02:21:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1509 transitions. [2023-11-12 02:21:34,200 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1509 transitions. Word has length 52 [2023-11-12 02:21:34,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:21:34,201 INFO L495 AbstractCegarLoop]: Abstraction has 1062 states and 1509 transitions. [2023-11-12 02:21:34,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-12 02:21:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1509 transitions. [2023-11-12 02:21:34,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-12 02:21:34,205 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:34,205 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-12 02:21:34,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:21:34,206 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:34,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:34,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1953798329, now seen corresponding path program 1 times [2023-11-12 02:21:34,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:34,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126628019] [2023-11-12 02:21:34,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:34,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:34,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:21:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:34,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-12 02:21:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:34,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:21:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:34,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:21:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:34,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:21:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:34,549 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-12 02:21:34,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:34,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126628019] [2023-11-12 02:21:34,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126628019] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:34,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:34,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:21:34,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779226554] [2023-11-12 02:21:34,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:34,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:21:34,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:34,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:21:34,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:21:34,553 INFO L87 Difference]: Start difference. First operand 1062 states and 1509 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-12 02:21:36,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:21:36,684 INFO L93 Difference]: Finished difference Result 3503 states and 5086 transitions. [2023-11-12 02:21:36,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:21:36,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2023-11-12 02:21:36,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:21:36,706 INFO L225 Difference]: With dead ends: 3503 [2023-11-12 02:21:36,706 INFO L226 Difference]: Without dead ends: 2452 [2023-11-12 02:21:36,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:21:36,714 INFO L413 NwaCegarLoop]: 695 mSDtfsCounter, 1342 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-12 02:21:36,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1405 Valid, 2266 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-12 02:21:36,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2023-11-12 02:21:36,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2100. [2023-11-12 02:21:36,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 1670 states have (on average 1.4161676646706587) internal successors, (2365), 1676 states have internal predecessors, (2365), 313 states have call successors, (313), 117 states have call predecessors, (313), 116 states have return successors, (318), 310 states have call predecessors, (318), 310 states have call successors, (318) [2023-11-12 02:21:36,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2996 transitions. [2023-11-12 02:21:36,945 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2996 transitions. Word has length 53 [2023-11-12 02:21:36,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:21:36,946 INFO L495 AbstractCegarLoop]: Abstraction has 2100 states and 2996 transitions. [2023-11-12 02:21:36,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-12 02:21:36,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2996 transitions. [2023-11-12 02:21:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-12 02:21:36,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:36,952 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-12 02:21:36,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:21:36,952 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:36,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:36,953 INFO L85 PathProgramCache]: Analyzing trace with hash -438409326, now seen corresponding path program 1 times [2023-11-12 02:21:36,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:36,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468051716] [2023-11-12 02:21:36,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:36,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:21:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-12 02:21:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:21:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:21:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:21:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,197 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-12 02:21:37,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:37,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468051716] [2023-11-12 02:21:37,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468051716] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:37,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:37,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:21:37,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990995747] [2023-11-12 02:21:37,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:37,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:21:37,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:37,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:21:37,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:21:37,206 INFO L87 Difference]: Start difference. First operand 2100 states and 2996 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-12 02:21:38,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:21:38,752 INFO L93 Difference]: Finished difference Result 2450 states and 3579 transitions. [2023-11-12 02:21:38,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:21:38,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 54 [2023-11-12 02:21:38,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:21:38,773 INFO L225 Difference]: With dead ends: 2450 [2023-11-12 02:21:38,773 INFO L226 Difference]: Without dead ends: 2438 [2023-11-12 02:21:38,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:21:38,780 INFO L413 NwaCegarLoop]: 662 mSDtfsCounter, 1074 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:21:38,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1128 Valid, 1589 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-12 02:21:38,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2438 states. [2023-11-12 02:21:38,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2438 to 2090. [2023-11-12 02:21:38,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2090 states, 1661 states have (on average 1.416014449127032) internal successors, (2352), 1666 states have internal predecessors, (2352), 312 states have call successors, (312), 117 states have call predecessors, (312), 116 states have return successors, (318), 310 states have call predecessors, (318), 310 states have call successors, (318) [2023-11-12 02:21:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 2982 transitions. [2023-11-12 02:21:39,006 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 2982 transitions. Word has length 54 [2023-11-12 02:21:39,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:21:39,007 INFO L495 AbstractCegarLoop]: Abstraction has 2090 states and 2982 transitions. [2023-11-12 02:21:39,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-12 02:21:39,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2982 transitions. [2023-11-12 02:21:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-12 02:21:39,013 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:39,013 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:39,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:21:39,014 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:39,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:39,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1715172358, now seen corresponding path program 1 times [2023-11-12 02:21:39,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:39,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979861229] [2023-11-12 02:21:39,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:39,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:39,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:21:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:39,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-12 02:21:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:39,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:21:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:39,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:21:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:39,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-12 02:21:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:39,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-12 02:21:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:39,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 02:21:39,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:39,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979861229] [2023-11-12 02:21:39,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979861229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:39,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:39,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:21:39,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868575084] [2023-11-12 02:21:39,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:39,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:21:39,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:39,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:21:39,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:21:39,219 INFO L87 Difference]: Start difference. First operand 2090 states and 2982 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-12 02:21:41,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:21:41,635 INFO L93 Difference]: Finished difference Result 6800 states and 9811 transitions. [2023-11-12 02:21:41,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:21:41,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2023-11-12 02:21:41,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:21:41,669 INFO L225 Difference]: With dead ends: 6800 [2023-11-12 02:21:41,669 INFO L226 Difference]: Without dead ends: 4721 [2023-11-12 02:21:41,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:21:41,682 INFO L413 NwaCegarLoop]: 666 mSDtfsCounter, 1304 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1366 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-12 02:21:41,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1366 Valid, 2182 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-12 02:21:41,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4721 states. [2023-11-12 02:21:41,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4721 to 4008. [2023-11-12 02:21:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4008 states, 3195 states have (on average 1.4134585289514867) internal successors, (4516), 3206 states have internal predecessors, (4516), 580 states have call successors, (580), 233 states have call predecessors, (580), 232 states have return successors, (590), 576 states have call predecessors, (590), 578 states have call successors, (590) [2023-11-12 02:21:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 5686 transitions. [2023-11-12 02:21:42,002 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 5686 transitions. Word has length 65 [2023-11-12 02:21:42,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:21:42,003 INFO L495 AbstractCegarLoop]: Abstraction has 4008 states and 5686 transitions. [2023-11-12 02:21:42,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-12 02:21:42,003 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 5686 transitions. [2023-11-12 02:21:42,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-12 02:21:42,006 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:42,007 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:42,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:21:42,007 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:42,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:42,008 INFO L85 PathProgramCache]: Analyzing trace with hash -671838944, now seen corresponding path program 1 times [2023-11-12 02:21:42,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:42,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568262844] [2023-11-12 02:21:42,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:42,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:42,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:21:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:42,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-12 02:21:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:42,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:21:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:42,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:21:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:42,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:21:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:42,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-12 02:21:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:42,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 02:21:42,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:42,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568262844] [2023-11-12 02:21:42,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568262844] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:42,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:42,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:21:42,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005048031] [2023-11-12 02:21:42,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:42,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:21:42,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:42,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:21:42,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:21:42,301 INFO L87 Difference]: Start difference. First operand 4008 states and 5686 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-12 02:21:45,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:21:45,434 INFO L93 Difference]: Finished difference Result 11501 states and 16480 transitions. [2023-11-12 02:21:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:21:45,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2023-11-12 02:21:45,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:21:45,487 INFO L225 Difference]: With dead ends: 11501 [2023-11-12 02:21:45,487 INFO L226 Difference]: Without dead ends: 7504 [2023-11-12 02:21:45,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:21:45,505 INFO L413 NwaCegarLoop]: 1012 mSDtfsCounter, 1117 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 2991 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:21:45,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 2991 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-12 02:21:45,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7504 states. [2023-11-12 02:21:46,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7504 to 6394. [2023-11-12 02:21:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6394 states, 5100 states have (on average 1.4111764705882353) internal successors, (7197), 5115 states have internal predecessors, (7197), 906 states have call successors, (906), 388 states have call predecessors, (906), 387 states have return successors, (920), 902 states have call predecessors, (920), 904 states have call successors, (920) [2023-11-12 02:21:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6394 states to 6394 states and 9023 transitions. [2023-11-12 02:21:46,086 INFO L78 Accepts]: Start accepts. Automaton has 6394 states and 9023 transitions. Word has length 66 [2023-11-12 02:21:46,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:21:46,088 INFO L495 AbstractCegarLoop]: Abstraction has 6394 states and 9023 transitions. [2023-11-12 02:21:46,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-12 02:21:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 6394 states and 9023 transitions. [2023-11-12 02:21:46,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-12 02:21:46,105 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:46,105 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 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] [2023-11-12 02:21:46,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:21:46,106 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:46,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:46,106 INFO L85 PathProgramCache]: Analyzing trace with hash -675928240, now seen corresponding path program 1 times [2023-11-12 02:21:46,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:46,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45203385] [2023-11-12 02:21:46,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:46,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:46,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:21:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:46,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-12 02:21:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:46,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:21:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:46,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:21:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:46,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:21:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:46,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:21:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:46,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-12 02:21:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:46,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:21:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:46,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-12 02:21:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:46,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:21:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:46,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:21:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:46,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:21:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:46,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-12 02:21:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:46,684 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-11-12 02:21:46,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:46,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45203385] [2023-11-12 02:21:46,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45203385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:46,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:46,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:21:46,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294390926] [2023-11-12 02:21:46,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:46,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:21:46,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:46,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:21:46,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:21:46,688 INFO L87 Difference]: Start difference. First operand 6394 states and 9023 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-12 02:21:51,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:21:51,009 INFO L93 Difference]: Finished difference Result 11220 states and 16192 transitions. [2023-11-12 02:21:51,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:21:51,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 123 [2023-11-12 02:21:51,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:21:51,090 INFO L225 Difference]: With dead ends: 11220 [2023-11-12 02:21:51,091 INFO L226 Difference]: Without dead ends: 11217 [2023-11-12 02:21:51,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:21:51,098 INFO L413 NwaCegarLoop]: 1288 mSDtfsCounter, 2382 mSDsluCounter, 2819 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 649 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2492 SdHoareTripleChecker+Valid, 4107 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 649 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:21:51,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2492 Valid, 4107 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [649 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-12 02:21:51,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11217 states. [2023-11-12 02:21:52,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11217 to 9560. [2023-11-12 02:21:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9560 states, 7627 states have (on average 1.4124819719417858) internal successors, (10773), 7649 states have internal predecessors, (10773), 1354 states have call successors, (1354), 579 states have call predecessors, (1354), 578 states have return successors, (1400), 1349 states have call predecessors, (1400), 1352 states have call successors, (1400) [2023-11-12 02:21:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9560 states to 9560 states and 13527 transitions. [2023-11-12 02:21:52,063 INFO L78 Accepts]: Start accepts. Automaton has 9560 states and 13527 transitions. Word has length 123 [2023-11-12 02:21:52,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:21:52,063 INFO L495 AbstractCegarLoop]: Abstraction has 9560 states and 13527 transitions. [2023-11-12 02:21:52,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-12 02:21:52,064 INFO L276 IsEmpty]: Start isEmpty. Operand 9560 states and 13527 transitions. [2023-11-12 02:21:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-12 02:21:52,074 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:52,075 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 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] [2023-11-12 02:21:52,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:21:52,075 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:52,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1736977812, now seen corresponding path program 1 times [2023-11-12 02:21:52,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:52,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922886032] [2023-11-12 02:21:52,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:52,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:52,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:21:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:52,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-12 02:21:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:52,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:21:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:52,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:21:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:52,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:21:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:52,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:21:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:52,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-12 02:21:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:52,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:21:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:52,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-12 02:21:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:52,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:21:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:52,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:21:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:52,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-12 02:21:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:52,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-12 02:21:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-11-12 02:21:52,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:52,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922886032] [2023-11-12 02:21:52,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922886032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:52,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:52,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-12 02:21:52,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182391468] [2023-11-12 02:21:52,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:52,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:21:52,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:52,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:21:52,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:21:52,967 INFO L87 Difference]: Start difference. First operand 9560 states and 13527 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-12 02:21:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:21:56,032 INFO L93 Difference]: Finished difference Result 14543 states and 20917 transitions. [2023-11-12 02:21:56,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:21:56,033 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 122 [2023-11-12 02:21:56,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:21:56,087 INFO L225 Difference]: With dead ends: 14543 [2023-11-12 02:21:56,087 INFO L226 Difference]: Without dead ends: 11340 [2023-11-12 02:21:56,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:21:56,102 INFO L413 NwaCegarLoop]: 669 mSDtfsCounter, 286 mSDsluCounter, 4041 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 4710 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:21:56,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 4710 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-12 02:21:56,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11340 states. [2023-11-12 02:21:56,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11340 to 9643. [2023-11-12 02:21:56,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9643 states, 7698 states have (on average 1.4078981553650298) internal successors, (10838), 7732 states have internal predecessors, (10838), 1354 states have call successors, (1354), 579 states have call predecessors, (1354), 590 states have return successors, (1432), 1349 states have call predecessors, (1432), 1352 states have call successors, (1432) [2023-11-12 02:21:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9643 states to 9643 states and 13624 transitions. [2023-11-12 02:21:56,869 INFO L78 Accepts]: Start accepts. Automaton has 9643 states and 13624 transitions. Word has length 122 [2023-11-12 02:21:56,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:21:56,870 INFO L495 AbstractCegarLoop]: Abstraction has 9643 states and 13624 transitions. [2023-11-12 02:21:56,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-12 02:21:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 9643 states and 13624 transitions. [2023-11-12 02:21:56,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-11-12 02:21:56,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:56,893 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:56,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:21:56,893 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:56,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:56,894 INFO L85 PathProgramCache]: Analyzing trace with hash 995836539, now seen corresponding path program 1 times [2023-11-12 02:21:56,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:56,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221001488] [2023-11-12 02:21:56,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:56,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:57,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:21:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:57,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-12 02:21:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:57,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:21:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:57,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:21:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:57,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:21:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:57,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:21:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:57,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-12 02:21:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:57,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:21:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:57,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-12 02:21:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:57,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:21:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:57,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:21:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:57,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-12 02:21:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:57,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:21:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:57,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:21:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:57,262 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-12 02:21:57,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:57,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221001488] [2023-11-12 02:21:57,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221001488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:57,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:57,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:21:57,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537345227] [2023-11-12 02:21:57,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:57,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:21:57,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:57,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:21:57,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:21:57,265 INFO L87 Difference]: Start difference. First operand 9643 states and 13624 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14)