./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 32bit --witnessprinter.graph.data.programhash ce176716d91d866602a372020396224af9fcf4c5f81c6adcdcc0f1d83b0d658f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:57:33,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:57:33,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:57:33,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:57:33,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:57:33,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:57:33,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:57:33,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:57:33,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:57:33,960 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:57:33,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:57:33,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:57:33,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:57:33,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:57:33,964 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:57:33,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:57:33,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:57:33,965 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:57:33,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:57:33,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:57:33,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:57:33,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:57:33,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:57:33,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:57:33,971 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:57:33,971 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:57:33,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:57:33,972 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:57:33,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:57:33,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:57:33,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:57:33,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:57:33,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:57:33,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:57:33,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:57:33,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:57:33,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:57:33,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:57:33,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:57:33,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:57:33,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:57:33,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:57:33,978 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce176716d91d866602a372020396224af9fcf4c5f81c6adcdcc0f1d83b0d658f [2024-11-11 22:57:34,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:57:34,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:57:34,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:57:34,247 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:57:34,248 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:57:34,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c [2024-11-11 22:57:35,758 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:57:36,002 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:57:36,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c [2024-11-11 22:57:36,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11eb3c5d1/dc311c3cc14a412985b4ae7ddbafb1a0/FLAG1f9a31d9d [2024-11-11 22:57:36,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11eb3c5d1/dc311c3cc14a412985b4ae7ddbafb1a0 [2024-11-11 22:57:36,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:57:36,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:57:36,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:57:36,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:57:36,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:57:36,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:57:36" (1/1) ... [2024-11-11 22:57:36,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d132ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:57:36, skipping insertion in model container [2024-11-11 22:57:36,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:57:36" (1/1) ... [2024-11-11 22:57:36,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:57:36,604 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c[914,927] [2024-11-11 22:57:36,682 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c[7115,7128] [2024-11-11 22:57:36,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:57:36,861 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:57:36,874 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c[914,927] [2024-11-11 22:57:36,897 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c[7115,7128] [2024-11-11 22:57:36,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:57:37,001 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:57:37,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:57:37 WrapperNode [2024-11-11 22:57:37,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:57:37,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:57:37,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:57:37,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:57:37,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:57:37" (1/1) ... [2024-11-11 22:57:37,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:57:37" (1/1) ... [2024-11-11 22:57:37,089 INFO L138 Inliner]: procedures = 79, calls = 97, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1134 [2024-11-11 22:57:37,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:57:37,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:57:37,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:57:37,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:57:37,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:57:37" (1/1) ... [2024-11-11 22:57:37,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:57:37" (1/1) ... [2024-11-11 22:57:37,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:57:37" (1/1) ... [2024-11-11 22:57:37,142 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 22:57:37,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:57:37" (1/1) ... [2024-11-11 22:57:37,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:57:37" (1/1) ... [2024-11-11 22:57:37,164 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:57:37" (1/1) ... [2024-11-11 22:57:37,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:57:37" (1/1) ... [2024-11-11 22:57:37,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:57:37" (1/1) ... [2024-11-11 22:57:37,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:57:37" (1/1) ... [2024-11-11 22:57:37,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:57:37,221 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:57:37,221 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:57:37,221 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:57:37,222 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:57:37" (1/1) ... [2024-11-11 22:57:37,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:57:37,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:57:37,257 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 22:57:37,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 22:57:37,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:57:37,311 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:57:37,311 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:57:37,311 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-11 22:57:37,311 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-11 22:57:37,312 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-11 22:57:37,312 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-11 22:57:37,312 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-11 22:57:37,313 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-11 22:57:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-11 22:57:37,313 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-11 22:57:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-11 22:57:37,313 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-11 22:57:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-11 22:57:37,313 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-11 22:57:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-11 22:57:37,314 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-11 22:57:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-11 22:57:37,314 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-11 22:57:37,315 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-11 22:57:37,315 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-11 22:57:37,315 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-11 22:57:37,315 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-11 22:57:37,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:57:37,316 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-11 22:57:37,316 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-11 22:57:37,316 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-11 22:57:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-11 22:57:37,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:57:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:57:37,318 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-11 22:57:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-11 22:57:37,318 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-11 22:57:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-11 22:57:37,489 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:57:37,491 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:57:38,624 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-11-11 22:57:38,624 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:57:38,655 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:57:38,655 INFO L316 CfgBuilder]: Removed 20 assume(true) statements. [2024-11-11 22:57:38,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:57:38 BoogieIcfgContainer [2024-11-11 22:57:38,656 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:57:38,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:57:38,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:57:38,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:57:38,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:57:36" (1/3) ... [2024-11-11 22:57:38,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3b5fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:57:38, skipping insertion in model container [2024-11-11 22:57:38,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:57:37" (2/3) ... [2024-11-11 22:57:38,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3b5fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:57:38, skipping insertion in model container [2024-11-11 22:57:38,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:57:38" (3/3) ... [2024-11-11 22:57:38,665 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.13.cil-1.c [2024-11-11 22:57:38,681 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:57:38,681 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:57:38,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:57:38,773 INFO L333 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, 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;@235faec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:57:38,773 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:57:38,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 530 states, 469 states have (on average 1.628997867803838) internal successors, (764), 477 states have internal predecessors, (764), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-11 22:57:38,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:57:38,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:57:38,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:57:38,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:57:38,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:57:38,811 INFO L85 PathProgramCache]: Analyzing trace with hash 778583530, now seen corresponding path program 1 times [2024-11-11 22:57:38,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:57:38,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680241879] [2024-11-11 22:57:38,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:38,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:57:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:39,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:57:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:39,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:57:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:39,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:57:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:39,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:57:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:39,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:57:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:39,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:57:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:39,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:57:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:39,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:57:39,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:57:39,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680241879] [2024-11-11 22:57:39,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680241879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:57:39,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:57:39,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:57:39,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441881460] [2024-11-11 22:57:39,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:57:39,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:57:39,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:57:39,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:57:39,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:57:39,445 INFO L87 Difference]: Start difference. First operand has 530 states, 469 states have (on average 1.628997867803838) internal successors, (764), 477 states have internal predecessors, (764), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:57:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:57:41,085 INFO L93 Difference]: Finished difference Result 1165 states and 1856 transitions. [2024-11-11 22:57:41,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:57:41,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-11 22:57:41,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:57:41,110 INFO L225 Difference]: With dead ends: 1165 [2024-11-11 22:57:41,111 INFO L226 Difference]: Without dead ends: 654 [2024-11-11 22:57:41,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:57:41,127 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 908 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 2758 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:57:41,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 2758 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 22:57:41,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-11-11 22:57:41,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 615. [2024-11-11 22:57:41,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 537 states have (on average 1.5214152700186219) internal successors, (817), 544 states have internal predecessors, (817), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-11-11 22:57:41,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 926 transitions. [2024-11-11 22:57:41,266 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 926 transitions. Word has length 65 [2024-11-11 22:57:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:57:41,267 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 926 transitions. [2024-11-11 22:57:41,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:57:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 926 transitions. [2024-11-11 22:57:41,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:57:41,273 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:57:41,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:57:41,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:57:41,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:57:41,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:57:41,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1837495126, now seen corresponding path program 1 times [2024-11-11 22:57:41,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:57:41,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860406426] [2024-11-11 22:57:41,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:41,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:57:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:41,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:57:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:41,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:57:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:41,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:57:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:41,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:57:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:41,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:57:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:41,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:57:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:41,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:57:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:57:41,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:57:41,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860406426] [2024-11-11 22:57:41,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860406426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:57:41,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:57:41,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:57:41,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280036186] [2024-11-11 22:57:41,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:57:41,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:57:41,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:57:41,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:57:41,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:57:41,529 INFO L87 Difference]: Start difference. First operand 615 states and 926 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:57:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:57:42,952 INFO L93 Difference]: Finished difference Result 827 states and 1217 transitions. [2024-11-11 22:57:42,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:57:42,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-11 22:57:42,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:57:42,957 INFO L225 Difference]: With dead ends: 827 [2024-11-11 22:57:42,958 INFO L226 Difference]: Without dead ends: 650 [2024-11-11 22:57:42,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:57:42,961 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 692 mSDsluCounter, 2745 mSDsCounter, 0 mSdLazyCounter, 2092 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 3197 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:57:42,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 3197 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2092 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:57:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-11 22:57:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 620. [2024-11-11 22:57:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 541 states have (on average 1.5157116451016637) internal successors, (820), 548 states have internal predecessors, (820), 54 states have call successors, (54), 22 states have call predecessors, (54), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2024-11-11 22:57:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 930 transitions. [2024-11-11 22:57:43,015 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 930 transitions. Word has length 65 [2024-11-11 22:57:43,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:57:43,015 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 930 transitions. [2024-11-11 22:57:43,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:57:43,016 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 930 transitions. [2024-11-11 22:57:43,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:57:43,022 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:57:43,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:57:43,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:57:43,022 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:57:43,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:57:43,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1428112872, now seen corresponding path program 1 times [2024-11-11 22:57:43,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:57:43,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343645431] [2024-11-11 22:57:43,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:43,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:57:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:43,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:57:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:43,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:57:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:43,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:57:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:43,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:57:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:43,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:57:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:43,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:57:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:43,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:57:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:43,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:57:43,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:57:43,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343645431] [2024-11-11 22:57:43,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343645431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:57:43,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:57:43,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:57:43,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260256318] [2024-11-11 22:57:43,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:57:43,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:57:43,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:57:43,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:57:43,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:57:43,224 INFO L87 Difference]: Start difference. First operand 620 states and 930 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-11 22:57:45,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:57:45,380 INFO L93 Difference]: Finished difference Result 1794 states and 2522 transitions. [2024-11-11 22:57:45,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-11 22:57:45,381 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-11-11 22:57:45,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:57:45,395 INFO L225 Difference]: With dead ends: 1794 [2024-11-11 22:57:45,395 INFO L226 Difference]: Without dead ends: 1612 [2024-11-11 22:57:45,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-11 22:57:45,398 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 3220 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 2043 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3238 SdHoareTripleChecker+Valid, 2424 SdHoareTripleChecker+Invalid, 2545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 2043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:57:45,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3238 Valid, 2424 Invalid, 2545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 2043 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 22:57:45,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2024-11-11 22:57:45,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1370. [2024-11-11 22:57:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1134 states have (on average 1.4162257495590829) internal successors, (1606), 1151 states have internal predecessors, (1606), 132 states have call successors, (132), 90 states have call predecessors, (132), 102 states have return successors, (169), 131 states have call predecessors, (169), 128 states have call successors, (169) [2024-11-11 22:57:45,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1907 transitions. [2024-11-11 22:57:45,504 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1907 transitions. Word has length 65 [2024-11-11 22:57:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:57:45,505 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1907 transitions. [2024-11-11 22:57:45,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-11 22:57:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1907 transitions. [2024-11-11 22:57:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:57:45,508 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:57:45,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:57:45,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:57:45,508 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:57:45,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:57:45,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1815405335, now seen corresponding path program 1 times [2024-11-11 22:57:45,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:57:45,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543634737] [2024-11-11 22:57:45,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:45,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:57:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:45,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:57:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:45,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:57:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:45,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:57:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:45,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:57:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:57:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:45,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:57:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:45,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:57:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:57:45,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:57:45,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543634737] [2024-11-11 22:57:45,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543634737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:57:45,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:57:45,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:57:45,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314849238] [2024-11-11 22:57:45,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:57:45,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:57:45,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:57:45,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:57:45,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:57:45,746 INFO L87 Difference]: Start difference. First operand 1370 states and 1907 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:57:47,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:57:47,131 INFO L93 Difference]: Finished difference Result 2496 states and 3394 transitions. [2024-11-11 22:57:47,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 22:57:47,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-11 22:57:47,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:57:47,141 INFO L225 Difference]: With dead ends: 2496 [2024-11-11 22:57:47,142 INFO L226 Difference]: Without dead ends: 1564 [2024-11-11 22:57:47,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:57:47,147 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 1033 mSDsluCounter, 2377 mSDsCounter, 0 mSdLazyCounter, 2013 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:57:47,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 2826 Invalid, 2153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2013 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:57:47,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2024-11-11 22:57:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1400. [2024-11-11 22:57:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1158 states have (on average 1.4024179620034543) internal successors, (1624), 1175 states have internal predecessors, (1624), 132 states have call successors, (132), 90 states have call predecessors, (132), 108 states have return successors, (177), 137 states have call predecessors, (177), 128 states have call successors, (177) [2024-11-11 22:57:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1933 transitions. [2024-11-11 22:57:47,248 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1933 transitions. Word has length 65 [2024-11-11 22:57:47,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:57:47,249 INFO L471 AbstractCegarLoop]: Abstraction has 1400 states and 1933 transitions. [2024-11-11 22:57:47,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:57:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1933 transitions. [2024-11-11 22:57:47,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:57:47,250 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:57:47,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:57:47,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:57:47,250 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:57:47,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:57:47,251 INFO L85 PathProgramCache]: Analyzing trace with hash -429201941, now seen corresponding path program 1 times [2024-11-11 22:57:47,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:57:47,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268772773] [2024-11-11 22:57:47,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:47,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:57:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:47,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:57:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:47,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:57:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:47,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:57:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:47,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:57:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:47,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:57:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:47,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:57:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:47,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:57:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:57:47,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:57:47,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268772773] [2024-11-11 22:57:47,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268772773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:57:47,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:57:47,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:57:47,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195524924] [2024-11-11 22:57:47,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:57:47,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:57:47,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:57:47,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:57:47,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:57:47,389 INFO L87 Difference]: Start difference. First operand 1400 states and 1933 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:57:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:57:48,377 INFO L93 Difference]: Finished difference Result 3588 states and 4768 transitions. [2024-11-11 22:57:48,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 22:57:48,378 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-11 22:57:48,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:57:48,391 INFO L225 Difference]: With dead ends: 3588 [2024-11-11 22:57:48,392 INFO L226 Difference]: Without dead ends: 2628 [2024-11-11 22:57:48,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:57:48,396 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 2284 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2319 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:57:48,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2319 Valid, 1212 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:57:48,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2628 states. [2024-11-11 22:57:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2628 to 2324. [2024-11-11 22:57:48,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 1875 states have (on average 1.3456) internal successors, (2523), 1906 states have internal predecessors, (2523), 234 states have call successors, (234), 172 states have call predecessors, (234), 213 states have return successors, (358), 250 states have call predecessors, (358), 230 states have call successors, (358) [2024-11-11 22:57:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3115 transitions. [2024-11-11 22:57:48,564 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3115 transitions. Word has length 65 [2024-11-11 22:57:48,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:57:48,564 INFO L471 AbstractCegarLoop]: Abstraction has 2324 states and 3115 transitions. [2024-11-11 22:57:48,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:57:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3115 transitions. [2024-11-11 22:57:48,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 22:57:48,566 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:57:48,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:57:48,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:57:48,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:57:48,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:57:48,567 INFO L85 PathProgramCache]: Analyzing trace with hash 262059244, now seen corresponding path program 1 times [2024-11-11 22:57:48,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:57:48,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779786224] [2024-11-11 22:57:48,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:48,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:57:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:48,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:57:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:48,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:57:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:48,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:57:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:48,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:57:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:48,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:57:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:48,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:57:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:48,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:57:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:57:48,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:57:48,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779786224] [2024-11-11 22:57:48,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779786224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:57:48,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:57:48,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:57:48,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788773648] [2024-11-11 22:57:48,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:57:48,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:57:48,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:57:48,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:57:48,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:57:48,674 INFO L87 Difference]: Start difference. First operand 2324 states and 3115 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:57:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:57:49,793 INFO L93 Difference]: Finished difference Result 6092 states and 8026 transitions. [2024-11-11 22:57:49,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:57:49,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-11 22:57:49,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:57:49,840 INFO L225 Difference]: With dead ends: 6092 [2024-11-11 22:57:49,841 INFO L226 Difference]: Without dead ends: 4194 [2024-11-11 22:57:49,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:57:49,849 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 876 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:57:49,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 1965 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:57:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4194 states. [2024-11-11 22:57:50,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4194 to 3700. [2024-11-11 22:57:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3700 states, 2928 states have (on average 1.3155737704918034) internal successors, (3852), 2969 states have internal predecessors, (3852), 392 states have call successors, (392), 308 states have call predecessors, (392), 378 states have return successors, (631), 427 states have call predecessors, (631), 388 states have call successors, (631) [2024-11-11 22:57:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3700 states to 3700 states and 4875 transitions. [2024-11-11 22:57:50,148 INFO L78 Accepts]: Start accepts. Automaton has 3700 states and 4875 transitions. Word has length 66 [2024-11-11 22:57:50,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:57:50,148 INFO L471 AbstractCegarLoop]: Abstraction has 3700 states and 4875 transitions. [2024-11-11 22:57:50,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:57:50,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3700 states and 4875 transitions. [2024-11-11 22:57:50,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-11 22:57:50,151 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:57:50,151 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:57:50,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:57:50,151 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:57:50,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:57:50,152 INFO L85 PathProgramCache]: Analyzing trace with hash 73739401, now seen corresponding path program 1 times [2024-11-11 22:57:50,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:57:50,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79864032] [2024-11-11 22:57:50,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:50,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:57:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:50,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:57:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:50,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:57:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:50,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:57:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:50,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:57:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:50,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:57:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:50,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:57:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:50,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:57:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:57:50,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:57:50,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79864032] [2024-11-11 22:57:50,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79864032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:57:50,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:57:50,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:57:50,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287827424] [2024-11-11 22:57:50,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:57:50,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:57:50,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:57:50,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:57:50,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:57:50,286 INFO L87 Difference]: Start difference. First operand 3700 states and 4875 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-11 22:57:51,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:57:51,424 INFO L93 Difference]: Finished difference Result 4996 states and 6475 transitions. [2024-11-11 22:57:51,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 22:57:51,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2024-11-11 22:57:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:57:51,452 INFO L225 Difference]: With dead ends: 4996 [2024-11-11 22:57:51,452 INFO L226 Difference]: Without dead ends: 4993 [2024-11-11 22:57:51,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:57:51,456 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 2277 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2286 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:57:51,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2286 Valid, 1611 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:57:51,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4993 states. [2024-11-11 22:57:51,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4993 to 4436. [2024-11-11 22:57:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4436 states, 3491 states have (on average 1.301059868232598) internal successors, (4542), 3541 states have internal predecessors, (4542), 476 states have call successors, (476), 384 states have call predecessors, (476), 467 states have return successors, (765), 515 states have call predecessors, (765), 473 states have call successors, (765) [2024-11-11 22:57:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4436 states to 4436 states and 5783 transitions. [2024-11-11 22:57:51,826 INFO L78 Accepts]: Start accepts. Automaton has 4436 states and 5783 transitions. Word has length 73 [2024-11-11 22:57:51,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:57:51,826 INFO L471 AbstractCegarLoop]: Abstraction has 4436 states and 5783 transitions. [2024-11-11 22:57:51,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-11 22:57:51,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4436 states and 5783 transitions. [2024-11-11 22:57:51,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 22:57:51,833 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:57:51,833 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:57:51,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:57:51,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:57:51,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:57:51,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2010594219, now seen corresponding path program 1 times [2024-11-11 22:57:51,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:57:51,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014325738] [2024-11-11 22:57:51,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:51,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:57:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:51,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:57:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:51,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:57:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:51,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:57:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:51,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:57:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:51,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:57:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:51,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:57:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:51,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:57:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:52,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:57:52,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:57:52,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014325738] [2024-11-11 22:57:52,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014325738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:57:52,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335840782] [2024-11-11 22:57:52,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:52,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:57:52,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:57:52,005 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:57:52,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 22:57:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:52,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 22:57:52,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:57:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:57:52,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:57:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:57:52,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335840782] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:57:52,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:57:52,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-11-11 22:57:52,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580853906] [2024-11-11 22:57:52,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:57:52,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 22:57:52,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:57:52,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 22:57:52,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:57:52,555 INFO L87 Difference]: Start difference. First operand 4436 states and 5783 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-11 22:57:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:57:55,032 INFO L93 Difference]: Finished difference Result 10324 states and 13158 transitions. [2024-11-11 22:57:55,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 22:57:55,033 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2024-11-11 22:57:55,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:57:55,088 INFO L225 Difference]: With dead ends: 10324 [2024-11-11 22:57:55,088 INFO L226 Difference]: Without dead ends: 10321 [2024-11-11 22:57:55,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-11-11 22:57:55,095 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 3089 mSDsluCounter, 2139 mSDsCounter, 0 mSdLazyCounter, 2296 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3159 SdHoareTripleChecker+Valid, 2680 SdHoareTripleChecker+Invalid, 2612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 2296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:57:55,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3159 Valid, 2680 Invalid, 2612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 2296 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 22:57:55,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10321 states. [2024-11-11 22:57:55,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10321 to 8320. [2024-11-11 22:57:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8320 states, 6509 states have (on average 1.2837609463819326) internal successors, (8356), 6599 states have internal predecessors, (8356), 890 states have call successors, (890), 740 states have call predecessors, (890), 919 states have return successors, (1459), 985 states have call predecessors, (1459), 887 states have call successors, (1459) [2024-11-11 22:57:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8320 states to 8320 states and 10705 transitions. [2024-11-11 22:57:55,972 INFO L78 Accepts]: Start accepts. Automaton has 8320 states and 10705 transitions. Word has length 74 [2024-11-11 22:57:55,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:57:55,972 INFO L471 AbstractCegarLoop]: Abstraction has 8320 states and 10705 transitions. [2024-11-11 22:57:55,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-11 22:57:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 8320 states and 10705 transitions. [2024-11-11 22:57:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 22:57:55,976 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:57:55,976 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 22:57:55,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 22:57:56,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:57:56,177 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:57:56,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:57:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1734280695, now seen corresponding path program 2 times [2024-11-11 22:57:56,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:57:56,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355523246] [2024-11-11 22:57:56,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:56,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:57:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:56,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:57:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:56,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:57:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:56,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:57:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:56,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:57:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:56,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:57:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:56,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:57:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:56,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:57:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:57:56,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:57:56,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355523246] [2024-11-11 22:57:56,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355523246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:57:56,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:57:56,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:57:56,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276702638] [2024-11-11 22:57:56,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:57:56,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:57:56,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:57:56,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:57:56,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:57:56,263 INFO L87 Difference]: Start difference. First operand 8320 states and 10705 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-11 22:57:57,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:57:57,480 INFO L93 Difference]: Finished difference Result 12993 states and 16698 transitions. [2024-11-11 22:57:57,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:57:57,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2024-11-11 22:57:57,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:57:57,509 INFO L225 Difference]: With dead ends: 12993 [2024-11-11 22:57:57,510 INFO L226 Difference]: Without dead ends: 5703 [2024-11-11 22:57:57,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:57:57,531 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 1425 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1461 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:57:57,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1461 Valid, 1699 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:57:57,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2024-11-11 22:57:57,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 5169. [2024-11-11 22:57:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5169 states, 4096 states have (on average 1.27197265625) internal successors, (5210), 4142 states have internal predecessors, (5210), 541 states have call successors, (541), 440 states have call predecessors, (541), 530 states have return successors, (818), 591 states have call predecessors, (818), 538 states have call successors, (818) [2024-11-11 22:57:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5169 states to 5169 states and 6569 transitions. [2024-11-11 22:57:57,960 INFO L78 Accepts]: Start accepts. Automaton has 5169 states and 6569 transitions. Word has length 77 [2024-11-11 22:57:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:57:57,961 INFO L471 AbstractCegarLoop]: Abstraction has 5169 states and 6569 transitions. [2024-11-11 22:57:57,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-11 22:57:57,961 INFO L276 IsEmpty]: Start isEmpty. Operand 5169 states and 6569 transitions. [2024-11-11 22:57:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-11 22:57:57,963 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:57:57,964 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:57:57,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:57:57,964 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:57:57,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:57:57,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1609122361, now seen corresponding path program 1 times [2024-11-11 22:57:57,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:57:57,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107126291] [2024-11-11 22:57:57,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:57,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:57:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:58,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:57:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:58,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:57:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:58,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:57:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:58,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:57:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:58,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:57:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:58,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:57:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:58,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:57:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:58,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 22:57:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 22:57:58,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:57:58,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107126291] [2024-11-11 22:57:58,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107126291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:57:58,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:57:58,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:57:58,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770056946] [2024-11-11 22:57:58,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:57:58,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:57:58,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:57:58,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:57:58,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:57:58,100 INFO L87 Difference]: Start difference. First operand 5169 states and 6569 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 22:58:00,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:00,200 INFO L93 Difference]: Finished difference Result 15217 states and 19102 transitions. [2024-11-11 22:58:00,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-11 22:58:00,201 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2024-11-11 22:58:00,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:00,254 INFO L225 Difference]: With dead ends: 15217 [2024-11-11 22:58:00,255 INFO L226 Difference]: Without dead ends: 10498 [2024-11-11 22:58:00,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-11 22:58:00,271 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 1906 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1924 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:00,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1924 Valid, 2079 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 22:58:00,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10498 states. [2024-11-11 22:58:01,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10498 to 9551. [2024-11-11 22:58:01,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9551 states, 7432 states have (on average 1.2370828848223896) internal successors, (9194), 7554 states have internal predecessors, (9194), 1037 states have call successors, (1037), 852 states have call predecessors, (1037), 1080 states have return successors, (1805), 1153 states have call predecessors, (1805), 1034 states have call successors, (1805) [2024-11-11 22:58:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9551 states to 9551 states and 12036 transitions. [2024-11-11 22:58:01,185 INFO L78 Accepts]: Start accepts. Automaton has 9551 states and 12036 transitions. Word has length 84 [2024-11-11 22:58:01,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:01,185 INFO L471 AbstractCegarLoop]: Abstraction has 9551 states and 12036 transitions. [2024-11-11 22:58:01,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 22:58:01,185 INFO L276 IsEmpty]: Start isEmpty. Operand 9551 states and 12036 transitions. [2024-11-11 22:58:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 22:58:01,189 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:01,189 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:58:01,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:58:01,190 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:01,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:01,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1227969209, now seen corresponding path program 1 times [2024-11-11 22:58:01,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:01,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235499608] [2024-11-11 22:58:01,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:01,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:01,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:01,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:58:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:01,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:58:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:01,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:58:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:01,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:58:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:01,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:58:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:01,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:58:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:01,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 22:58:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 22:58:01,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:01,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235499608] [2024-11-11 22:58:01,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235499608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:01,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:01,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:58:01,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120090262] [2024-11-11 22:58:01,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:01,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:58:01,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:01,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:58:01,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:58:01,335 INFO L87 Difference]: Start difference. First operand 9551 states and 12036 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 22:58:03,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:03,288 INFO L93 Difference]: Finished difference Result 18993 states and 23640 transitions. [2024-11-11 22:58:03,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 22:58:03,289 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2024-11-11 22:58:03,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:03,341 INFO L225 Difference]: With dead ends: 18993 [2024-11-11 22:58:03,341 INFO L226 Difference]: Without dead ends: 10310 [2024-11-11 22:58:03,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-11-11 22:58:03,369 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 3050 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3101 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:03,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3101 Valid, 2091 Invalid, 2076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:58:03,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10310 states. [2024-11-11 22:58:04,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10310 to 9386. [2024-11-11 22:58:04,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9386 states, 7311 states have (on average 1.2206264532895637) internal successors, (8924), 7435 states have internal predecessors, (8924), 1009 states have call successors, (1009), 838 states have call predecessors, (1009), 1064 states have return successors, (1639), 1119 states have call predecessors, (1639), 1006 states have call successors, (1639) [2024-11-11 22:58:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9386 states to 9386 states and 11572 transitions. [2024-11-11 22:58:04,218 INFO L78 Accepts]: Start accepts. Automaton has 9386 states and 11572 transitions. Word has length 93 [2024-11-11 22:58:04,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:04,219 INFO L471 AbstractCegarLoop]: Abstraction has 9386 states and 11572 transitions. [2024-11-11 22:58:04,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 22:58:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 9386 states and 11572 transitions. [2024-11-11 22:58:04,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-11 22:58:04,228 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:04,229 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:58:04,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:58:04,229 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:04,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:04,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2097868437, now seen corresponding path program 1 times [2024-11-11 22:58:04,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:04,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702122895] [2024-11-11 22:58:04,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:04,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:04,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:04,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:58:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:04,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:58:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:04,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:58:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:04,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:58:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:04,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:58:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:04,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:58:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:04,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 22:58:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:04,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 22:58:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:04,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:58:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:04,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 22:58:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:04,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:58:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:04,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:58:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:04,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:58:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:04,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 22:58:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:04,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 22:58:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-11 22:58:04,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:04,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702122895] [2024-11-11 22:58:04,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702122895] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:58:04,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427892741] [2024-11-11 22:58:04,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:04,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:58:04,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:58:04,386 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:58:04,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 22:58:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:04,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 22:58:04,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:58:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 22:58:04,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:58:04,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427892741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:04,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:58:04,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-11-11 22:58:04,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115484373] [2024-11-11 22:58:04,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:04,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:58:04,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:04,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:58:04,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 22:58:04,569 INFO L87 Difference]: Start difference. First operand 9386 states and 11572 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 22:58:05,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:05,048 INFO L93 Difference]: Finished difference Result 13503 states and 16533 transitions. [2024-11-11 22:58:05,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:58:05,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-11-11 22:58:05,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:05,070 INFO L225 Difference]: With dead ends: 13503 [2024-11-11 22:58:05,071 INFO L226 Difference]: Without dead ends: 4575 [2024-11-11 22:58:05,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 22:58:05,092 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 0 mSDsluCounter, 3147 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3936 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:05,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3936 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:58:05,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2024-11-11 22:58:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4423. [2024-11-11 22:58:05,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4423 states, 3560 states have (on average 1.2269662921348314) internal successors, (4368), 3597 states have internal predecessors, (4368), 424 states have call successors, (424), 332 states have call predecessors, (424), 437 states have return successors, (651), 494 states have call predecessors, (651), 421 states have call successors, (651) [2024-11-11 22:58:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4423 states to 4423 states and 5443 transitions. [2024-11-11 22:58:05,613 INFO L78 Accepts]: Start accepts. Automaton has 4423 states and 5443 transitions. Word has length 145 [2024-11-11 22:58:05,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:05,613 INFO L471 AbstractCegarLoop]: Abstraction has 4423 states and 5443 transitions. [2024-11-11 22:58:05,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 22:58:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand 4423 states and 5443 transitions. [2024-11-11 22:58:05,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 22:58:05,621 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:05,622 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:58:05,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 22:58:05,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-11 22:58:05,826 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:05,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:05,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1229740519, now seen corresponding path program 1 times [2024-11-11 22:58:05,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:05,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84871589] [2024-11-11 22:58:05,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:05,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:05,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:05,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:58:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:05,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:58:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:05,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:58:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:05,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:58:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:05,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:58:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:05,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:58:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:05,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 22:58:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:05,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 22:58:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:05,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 22:58:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:05,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 22:58:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:05,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:58:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:05,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:58:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:05,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 22:58:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:05,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 22:58:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:05,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 22:58:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-11 22:58:05,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:05,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84871589] [2024-11-11 22:58:05,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84871589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:05,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:05,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:58:05,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449127072] [2024-11-11 22:58:05,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:05,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:58:05,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:05,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:58:05,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:58:05,942 INFO L87 Difference]: Start difference. First operand 4423 states and 5443 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 22:58:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:06,975 INFO L93 Difference]: Finished difference Result 4886 states and 5961 transitions. [2024-11-11 22:58:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:58:06,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 147 [2024-11-11 22:58:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:06,996 INFO L225 Difference]: With dead ends: 4886 [2024-11-11 22:58:06,997 INFO L226 Difference]: Without dead ends: 4354 [2024-11-11 22:58:07,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:58:07,002 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 1137 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:07,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1515 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:58:07,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4354 states. [2024-11-11 22:58:07,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4354 to 4112. [2024-11-11 22:58:07,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4112 states, 3321 states have (on average 1.2306534176452875) internal successors, (4087), 3354 states have internal predecessors, (4087), 390 states have call successors, (390), 302 states have call predecessors, (390), 399 states have return successors, (604), 456 states have call predecessors, (604), 387 states have call successors, (604) [2024-11-11 22:58:07,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4112 states to 4112 states and 5081 transitions. [2024-11-11 22:58:07,389 INFO L78 Accepts]: Start accepts. Automaton has 4112 states and 5081 transitions. Word has length 147 [2024-11-11 22:58:07,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:07,389 INFO L471 AbstractCegarLoop]: Abstraction has 4112 states and 5081 transitions. [2024-11-11 22:58:07,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 22:58:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 4112 states and 5081 transitions. [2024-11-11 22:58:07,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-11 22:58:07,397 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:07,398 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:58:07,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:58:07,398 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:07,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:07,399 INFO L85 PathProgramCache]: Analyzing trace with hash -622782922, now seen corresponding path program 1 times [2024-11-11 22:58:07,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:07,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153991641] [2024-11-11 22:58:07,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:07,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:07,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:07,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:58:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:07,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 22:58:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:07,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:58:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:07,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:58:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:07,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:58:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:07,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:58:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:07,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 22:58:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:07,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 22:58:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:07,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 22:58:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:07,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 22:58:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:07,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:58:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:07,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:58:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:07,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 22:58:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:07,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 22:58:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:07,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:58:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:07,549 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-11 22:58:07,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:07,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153991641] [2024-11-11 22:58:07,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153991641] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:58:07,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121581578] [2024-11-11 22:58:07,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:07,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:58:07,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:58:07,552 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:58:07,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 22:58:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:07,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 22:58:07,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:58:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-11 22:58:07,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:58:07,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121581578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:07,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:58:07,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-11 22:58:07,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979651057] [2024-11-11 22:58:07,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:07,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:58:07,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:07,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:58:07,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:58:07,809 INFO L87 Difference]: Start difference. First operand 4112 states and 5081 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 22:58:08,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:08,028 INFO L93 Difference]: Finished difference Result 5687 states and 6946 transitions. [2024-11-11 22:58:08,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:58:08,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 158 [2024-11-11 22:58:08,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:08,040 INFO L225 Difference]: With dead ends: 5687 [2024-11-11 22:58:08,041 INFO L226 Difference]: Without dead ends: 2209 [2024-11-11 22:58:08,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:58:08,047 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 699 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:08,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 892 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:58:08,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2209 states. [2024-11-11 22:58:08,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 1973. [2024-11-11 22:58:08,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1973 states, 1633 states have (on average 1.2657685241886099) internal successors, (2067), 1649 states have internal predecessors, (2067), 173 states have call successors, (173), 125 states have call predecessors, (173), 165 states have return successors, (246), 199 states have call predecessors, (246), 170 states have call successors, (246) [2024-11-11 22:58:08,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 2486 transitions. [2024-11-11 22:58:08,205 INFO L78 Accepts]: Start accepts. Automaton has 1973 states and 2486 transitions. Word has length 158 [2024-11-11 22:58:08,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:08,206 INFO L471 AbstractCegarLoop]: Abstraction has 1973 states and 2486 transitions. [2024-11-11 22:58:08,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 22:58:08,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 2486 transitions. [2024-11-11 22:58:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-11 22:58:08,210 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:08,210 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:58:08,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 22:58:08,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:58:08,413 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:08,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:08,413 INFO L85 PathProgramCache]: Analyzing trace with hash -825958447, now seen corresponding path program 1 times [2024-11-11 22:58:08,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:08,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242747589] [2024-11-11 22:58:08,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:08,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:08,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:08,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:58:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:08,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:58:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:08,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:58:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:08,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:58:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:08,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:58:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:08,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:58:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:08,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 22:58:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:08,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 22:58:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:08,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 22:58:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:08,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 22:58:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:08,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:58:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:08,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:58:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:08,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 22:58:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:08,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 22:58:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:08,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-11 22:58:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-11 22:58:08,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:08,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242747589] [2024-11-11 22:58:08,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242747589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:08,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:08,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:58:08,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005649696] [2024-11-11 22:58:08,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:08,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:58:08,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:08,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:58:08,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:58:08,538 INFO L87 Difference]: Start difference. First operand 1973 states and 2486 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 22:58:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:09,475 INFO L93 Difference]: Finished difference Result 3551 states and 4356 transitions. [2024-11-11 22:58:09,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:58:09,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2024-11-11 22:58:09,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:09,488 INFO L225 Difference]: With dead ends: 3551 [2024-11-11 22:58:09,488 INFO L226 Difference]: Without dead ends: 2258 [2024-11-11 22:58:09,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:58:09,492 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 1061 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:09,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 2023 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:58:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2024-11-11 22:58:09,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2062. [2024-11-11 22:58:09,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2062 states, 1699 states have (on average 1.261330194231901) internal successors, (2143), 1718 states have internal predecessors, (2143), 185 states have call successors, (185), 137 states have call predecessors, (185), 176 states have return successors, (260), 207 states have call predecessors, (260), 182 states have call successors, (260) [2024-11-11 22:58:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 2588 transitions. [2024-11-11 22:58:09,758 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 2588 transitions. Word has length 159 [2024-11-11 22:58:09,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:09,759 INFO L471 AbstractCegarLoop]: Abstraction has 2062 states and 2588 transitions. [2024-11-11 22:58:09,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 22:58:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 2588 transitions. [2024-11-11 22:58:09,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-11 22:58:09,764 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:09,764 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:58:09,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:58:09,764 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:09,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:09,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1136712456, now seen corresponding path program 1 times [2024-11-11 22:58:09,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:09,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188155349] [2024-11-11 22:58:09,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:09,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:09,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:09,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:58:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:09,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:58:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:09,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:58:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:09,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:58:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:09,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:58:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:09,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:58:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:09,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 22:58:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:09,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 22:58:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:10,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 22:58:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:10,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 22:58:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:10,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:58:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:10,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:58:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:10,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 22:58:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:10,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-11 22:58:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:10,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:58:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-11 22:58:10,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:10,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188155349] [2024-11-11 22:58:10,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188155349] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:58:10,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988949777] [2024-11-11 22:58:10,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:10,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:58:10,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:58:10,035 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:58:10,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 22:58:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:10,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 22:58:10,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:58:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-11 22:58:10,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:58:10,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988949777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:10,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:58:10,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-11-11 22:58:10,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858296261] [2024-11-11 22:58:10,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:10,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:58:10,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:10,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:58:10,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:58:10,337 INFO L87 Difference]: Start difference. First operand 2062 states and 2588 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 22:58:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:10,992 INFO L93 Difference]: Finished difference Result 4657 states and 5704 transitions. [2024-11-11 22:58:10,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:58:10,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 162 [2024-11-11 22:58:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:11,008 INFO L225 Difference]: With dead ends: 4657 [2024-11-11 22:58:11,008 INFO L226 Difference]: Without dead ends: 2915 [2024-11-11 22:58:11,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-11 22:58:11,013 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 399 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:11,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1236 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:58:11,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2024-11-11 22:58:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 2885. [2024-11-11 22:58:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2885 states, 2378 states have (on average 1.2165685449957948) internal successors, (2893), 2403 states have internal predecessors, (2893), 255 states have call successors, (255), 189 states have call predecessors, (255), 250 states have return successors, (372), 293 states have call predecessors, (372), 252 states have call successors, (372) [2024-11-11 22:58:11,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 3520 transitions. [2024-11-11 22:58:11,267 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 3520 transitions. Word has length 162 [2024-11-11 22:58:11,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:11,267 INFO L471 AbstractCegarLoop]: Abstraction has 2885 states and 3520 transitions. [2024-11-11 22:58:11,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 22:58:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 3520 transitions. [2024-11-11 22:58:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:58:11,271 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:11,271 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:58:11,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 22:58:11,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-11 22:58:11,473 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:11,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash -431287319, now seen corresponding path program 1 times [2024-11-11 22:58:11,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:11,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694243797] [2024-11-11 22:58:11,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:11,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:11,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:11,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:58:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:11,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 22:58:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:11,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:58:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:11,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:58:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:11,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:58:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:11,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:58:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:11,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 22:58:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:11,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:58:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:11,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 22:58:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:11,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 22:58:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:11,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 22:58:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:11,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:58:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:11,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:58:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:11,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 22:58:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:11,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-11 22:58:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:11,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-11 22:58:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-11 22:58:11,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:11,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694243797] [2024-11-11 22:58:11,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694243797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:58:11,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497982240] [2024-11-11 22:58:11,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:11,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:58:11,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:58:11,618 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:58:11,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 22:58:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:11,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 22:58:11,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:58:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-11 22:58:11,809 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:58:11,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497982240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:11,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:58:11,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-11 22:58:11,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163678817] [2024-11-11 22:58:11,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:11,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:58:11,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:11,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:58:11,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:58:11,812 INFO L87 Difference]: Start difference. First operand 2885 states and 3520 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 22:58:12,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:12,570 INFO L93 Difference]: Finished difference Result 5252 states and 6274 transitions. [2024-11-11 22:58:12,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:58:12,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 179 [2024-11-11 22:58:12,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:12,583 INFO L225 Difference]: With dead ends: 5252 [2024-11-11 22:58:12,583 INFO L226 Difference]: Without dead ends: 2640 [2024-11-11 22:58:12,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-11 22:58:12,589 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 1073 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:12,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 1203 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:58:12,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2024-11-11 22:58:12,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2466. [2024-11-11 22:58:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 2053 states have (on average 1.2245494398441306) internal successors, (2514), 2073 states have internal predecessors, (2514), 209 states have call successors, (209), 149 states have call predecessors, (209), 202 states have return successors, (292), 244 states have call predecessors, (292), 206 states have call successors, (292) [2024-11-11 22:58:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 3015 transitions. [2024-11-11 22:58:12,802 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 3015 transitions. Word has length 179 [2024-11-11 22:58:12,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:12,803 INFO L471 AbstractCegarLoop]: Abstraction has 2466 states and 3015 transitions. [2024-11-11 22:58:12,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 22:58:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 3015 transitions. [2024-11-11 22:58:12,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:58:12,806 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:12,806 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:58:12,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 22:58:13,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 22:58:13,011 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:13,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:13,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2029088811, now seen corresponding path program 1 times [2024-11-11 22:58:13,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:13,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802226529] [2024-11-11 22:58:13,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:13,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:13,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:13,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:58:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:13,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:58:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:13,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:58:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:13,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:58:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:13,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:13,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802226529] [2024-11-11 22:58:13,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802226529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:13,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:13,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:58:13,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226145054] [2024-11-11 22:58:13,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:13,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:58:13,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:13,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:58:13,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:58:13,225 INFO L87 Difference]: Start difference. First operand 2466 states and 3015 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:15,343 INFO L93 Difference]: Finished difference Result 3036 states and 3933 transitions. [2024-11-11 22:58:15,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:58:15,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:58:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:15,352 INFO L225 Difference]: With dead ends: 3036 [2024-11-11 22:58:15,352 INFO L226 Difference]: Without dead ends: 2619 [2024-11-11 22:58:15,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:58:15,354 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 1239 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:15,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 1091 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 22:58:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2619 states. [2024-11-11 22:58:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2619 to 2466. [2024-11-11 22:58:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 2053 states have (on average 1.2240623477837311) internal successors, (2513), 2073 states have internal predecessors, (2513), 209 states have call successors, (209), 149 states have call predecessors, (209), 202 states have return successors, (292), 244 states have call predecessors, (292), 206 states have call successors, (292) [2024-11-11 22:58:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 3014 transitions. [2024-11-11 22:58:15,748 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 3014 transitions. Word has length 190 [2024-11-11 22:58:15,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:15,748 INFO L471 AbstractCegarLoop]: Abstraction has 2466 states and 3014 transitions. [2024-11-11 22:58:15,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:15,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 3014 transitions. [2024-11-11 22:58:15,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:58:15,751 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:15,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:58:15,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 22:58:15,752 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:15,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:15,752 INFO L85 PathProgramCache]: Analyzing trace with hash -680955241, now seen corresponding path program 1 times [2024-11-11 22:58:15,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:15,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557824739] [2024-11-11 22:58:15,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:15,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:15,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:15,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:58:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:15,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:58:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:15,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:58:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:15,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:58:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:15,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:15,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557824739] [2024-11-11 22:58:15,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557824739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:15,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:15,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:58:15,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151557806] [2024-11-11 22:58:15,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:15,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:58:15,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:15,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:58:15,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:58:15,957 INFO L87 Difference]: Start difference. First operand 2466 states and 3014 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:18,025 INFO L93 Difference]: Finished difference Result 3028 states and 3916 transitions. [2024-11-11 22:58:18,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:58:18,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:58:18,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:18,035 INFO L225 Difference]: With dead ends: 3028 [2024-11-11 22:58:18,035 INFO L226 Difference]: Without dead ends: 2619 [2024-11-11 22:58:18,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:58:18,037 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 1230 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:18,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 1089 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 22:58:18,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2619 states. [2024-11-11 22:58:18,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2619 to 2466. [2024-11-11 22:58:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 2053 states have (on average 1.2235752557233317) internal successors, (2512), 2073 states have internal predecessors, (2512), 209 states have call successors, (209), 149 states have call predecessors, (209), 202 states have return successors, (292), 244 states have call predecessors, (292), 206 states have call successors, (292) [2024-11-11 22:58:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 3013 transitions. [2024-11-11 22:58:18,471 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 3013 transitions. Word has length 190 [2024-11-11 22:58:18,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:18,471 INFO L471 AbstractCegarLoop]: Abstraction has 2466 states and 3013 transitions. [2024-11-11 22:58:18,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:18,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 3013 transitions. [2024-11-11 22:58:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:58:18,475 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:18,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:58:18,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 22:58:18,476 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:18,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:18,477 INFO L85 PathProgramCache]: Analyzing trace with hash 149698393, now seen corresponding path program 1 times [2024-11-11 22:58:18,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:18,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722234128] [2024-11-11 22:58:18,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:18,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:18,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:18,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:58:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:18,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:58:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:18,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:58:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:18,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:58:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:18,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:18,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722234128] [2024-11-11 22:58:18,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722234128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:18,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:18,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:58:18,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296799214] [2024-11-11 22:58:18,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:18,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:58:18,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:18,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:58:18,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:58:18,746 INFO L87 Difference]: Start difference. First operand 2466 states and 3013 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:21,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:21,775 INFO L93 Difference]: Finished difference Result 3596 states and 4832 transitions. [2024-11-11 22:58:21,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:58:21,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:58:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:21,787 INFO L225 Difference]: With dead ends: 3596 [2024-11-11 22:58:21,787 INFO L226 Difference]: Without dead ends: 3194 [2024-11-11 22:58:21,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:58:21,789 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 1920 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 2598 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1950 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 2752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 2598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:21,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1950 Valid, 1675 Invalid, 2752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 2598 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-11 22:58:21,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2024-11-11 22:58:22,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2887. [2024-11-11 22:58:22,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2887 states, 2445 states have (on average 1.2813905930470348) internal successors, (3133), 2466 states have internal predecessors, (3133), 231 states have call successors, (231), 155 states have call predecessors, (231), 209 states have return successors, (317), 266 states have call predecessors, (317), 228 states have call successors, (317) [2024-11-11 22:58:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 3681 transitions. [2024-11-11 22:58:22,173 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 3681 transitions. Word has length 190 [2024-11-11 22:58:22,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:22,174 INFO L471 AbstractCegarLoop]: Abstraction has 2887 states and 3681 transitions. [2024-11-11 22:58:22,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:22,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 3681 transitions. [2024-11-11 22:58:22,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:58:22,177 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:22,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:58:22,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 22:58:22,178 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:22,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:22,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1697328043, now seen corresponding path program 1 times [2024-11-11 22:58:22,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:22,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264133491] [2024-11-11 22:58:22,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:22,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:22,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:22,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:58:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:22,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:58:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:22,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:58:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:22,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:58:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:22,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:22,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:22,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264133491] [2024-11-11 22:58:22,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264133491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:22,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:22,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:58:22,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104107875] [2024-11-11 22:58:22,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:22,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:58:22,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:22,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:58:22,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:58:22,446 INFO L87 Difference]: Start difference. First operand 2887 states and 3681 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:26,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:26,553 INFO L93 Difference]: Finished difference Result 4612 states and 6463 transitions. [2024-11-11 22:58:26,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:58:26,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:58:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:26,565 INFO L225 Difference]: With dead ends: 4612 [2024-11-11 22:58:26,565 INFO L226 Difference]: Without dead ends: 3789 [2024-11-11 22:58:26,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:58:26,569 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 1955 mSDsluCounter, 2414 mSDsCounter, 0 mSdLazyCounter, 4104 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1985 SdHoareTripleChecker+Valid, 3113 SdHoareTripleChecker+Invalid, 4205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 4104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:26,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1985 Valid, 3113 Invalid, 4205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 4104 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 22:58:26,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3789 states. [2024-11-11 22:58:27,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3789 to 3279. [2024-11-11 22:58:27,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3279 states, 2808 states have (on average 1.3162393162393162) internal successors, (3696), 2830 states have internal predecessors, (3696), 253 states have call successors, (253), 161 states have call predecessors, (253), 216 states have return successors, (341), 289 states have call predecessors, (341), 250 states have call successors, (341) [2024-11-11 22:58:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 4290 transitions. [2024-11-11 22:58:27,076 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 4290 transitions. Word has length 190 [2024-11-11 22:58:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:27,077 INFO L471 AbstractCegarLoop]: Abstraction has 3279 states and 4290 transitions. [2024-11-11 22:58:27,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 4290 transitions. [2024-11-11 22:58:27,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:58:27,080 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:27,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:58:27,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 22:58:27,081 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:27,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:27,081 INFO L85 PathProgramCache]: Analyzing trace with hash 674388823, now seen corresponding path program 1 times [2024-11-11 22:58:27,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:27,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989547507] [2024-11-11 22:58:27,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:27,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:27,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:27,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:58:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:27,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:58:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:27,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:58:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:27,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:58:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:27,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:27,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989547507] [2024-11-11 22:58:27,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989547507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:27,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:27,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:58:27,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895971983] [2024-11-11 22:58:27,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:27,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:58:27,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:27,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:58:27,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:58:27,350 INFO L87 Difference]: Start difference. First operand 3279 states and 4290 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:31,584 INFO L93 Difference]: Finished difference Result 6111 states and 8848 transitions. [2024-11-11 22:58:31,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:58:31,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:58:31,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:31,602 INFO L225 Difference]: With dead ends: 6111 [2024-11-11 22:58:31,602 INFO L226 Difference]: Without dead ends: 4896 [2024-11-11 22:58:31,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:58:31,607 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 1953 mSDsluCounter, 2414 mSDsCounter, 0 mSdLazyCounter, 4100 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1983 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 4203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 4100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:31,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1983 Valid, 3111 Invalid, 4203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 4100 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 22:58:31,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4896 states. [2024-11-11 22:58:32,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4896 to 4064. [2024-11-11 22:58:32,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4064 states, 3535 states have (on average 1.3643564356435645) internal successors, (4823), 3559 states have internal predecessors, (4823), 297 states have call successors, (297), 173 states have call predecessors, (297), 230 states have return successors, (393), 335 states have call predecessors, (393), 294 states have call successors, (393) [2024-11-11 22:58:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4064 states to 4064 states and 5513 transitions. [2024-11-11 22:58:32,041 INFO L78 Accepts]: Start accepts. Automaton has 4064 states and 5513 transitions. Word has length 190 [2024-11-11 22:58:32,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:32,042 INFO L471 AbstractCegarLoop]: Abstraction has 4064 states and 5513 transitions. [2024-11-11 22:58:32,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 4064 states and 5513 transitions. [2024-11-11 22:58:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:58:32,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:32,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:58:32,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 22:58:32,046 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:32,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:32,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1050219499, now seen corresponding path program 1 times [2024-11-11 22:58:32,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:32,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628237027] [2024-11-11 22:58:32,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:32,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:32,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:32,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:58:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:32,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:58:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:32,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:58:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:32,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:58:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:32,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:32,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:32,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628237027] [2024-11-11 22:58:32,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628237027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:32,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:32,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:58:32,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962540579] [2024-11-11 22:58:32,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:32,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:58:32,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:32,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:58:32,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:58:32,302 INFO L87 Difference]: Start difference. First operand 4064 states and 5513 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:34,686 INFO L93 Difference]: Finished difference Result 6884 states and 10062 transitions. [2024-11-11 22:58:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:58:34,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:58:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:34,703 INFO L225 Difference]: With dead ends: 6884 [2024-11-11 22:58:34,703 INFO L226 Difference]: Without dead ends: 4884 [2024-11-11 22:58:34,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:58:34,709 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 1459 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 2270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:34,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1697 Invalid, 2270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 22:58:34,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4884 states. [2024-11-11 22:58:35,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4884 to 4064. [2024-11-11 22:58:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4064 states, 3535 states have (on average 1.3629420084865629) internal successors, (4818), 3559 states have internal predecessors, (4818), 297 states have call successors, (297), 173 states have call predecessors, (297), 230 states have return successors, (393), 335 states have call predecessors, (393), 294 states have call successors, (393) [2024-11-11 22:58:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4064 states to 4064 states and 5508 transitions. [2024-11-11 22:58:35,209 INFO L78 Accepts]: Start accepts. Automaton has 4064 states and 5508 transitions. Word has length 190 [2024-11-11 22:58:35,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:35,209 INFO L471 AbstractCegarLoop]: Abstraction has 4064 states and 5508 transitions. [2024-11-11 22:58:35,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:35,210 INFO L276 IsEmpty]: Start isEmpty. Operand 4064 states and 5508 transitions. [2024-11-11 22:58:35,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:58:35,213 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:35,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:58:35,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 22:58:35,213 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:35,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:35,214 INFO L85 PathProgramCache]: Analyzing trace with hash -551662697, now seen corresponding path program 1 times [2024-11-11 22:58:35,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:35,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815981917] [2024-11-11 22:58:35,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:35,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:35,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:35,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:58:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:35,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:58:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:35,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:58:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:35,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:58:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:35,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:35,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815981917] [2024-11-11 22:58:35,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815981917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:35,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:35,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:58:35,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005755292] [2024-11-11 22:58:35,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:35,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:58:35,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:35,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:58:35,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:58:35,483 INFO L87 Difference]: Start difference. First operand 4064 states and 5508 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:37,783 INFO L93 Difference]: Finished difference Result 6878 states and 10036 transitions. [2024-11-11 22:58:37,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:58:37,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:58:37,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:37,796 INFO L225 Difference]: With dead ends: 6878 [2024-11-11 22:58:37,796 INFO L226 Difference]: Without dead ends: 4878 [2024-11-11 22:58:37,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:58:37,800 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 1556 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 1999 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 2105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:37,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1587 Valid, 1696 Invalid, 2105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1999 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 22:58:37,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2024-11-11 22:58:38,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 4064. [2024-11-11 22:58:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4064 states, 3535 states have (on average 1.3615275813295615) internal successors, (4813), 3559 states have internal predecessors, (4813), 297 states have call successors, (297), 173 states have call predecessors, (297), 230 states have return successors, (393), 335 states have call predecessors, (393), 294 states have call successors, (393) [2024-11-11 22:58:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4064 states to 4064 states and 5503 transitions. [2024-11-11 22:58:38,283 INFO L78 Accepts]: Start accepts. Automaton has 4064 states and 5503 transitions. Word has length 190 [2024-11-11 22:58:38,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:38,283 INFO L471 AbstractCegarLoop]: Abstraction has 4064 states and 5503 transitions. [2024-11-11 22:58:38,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:38,283 INFO L276 IsEmpty]: Start isEmpty. Operand 4064 states and 5503 transitions. [2024-11-11 22:58:38,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:58:38,286 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:38,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:58:38,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 22:58:38,287 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:38,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:38,287 INFO L85 PathProgramCache]: Analyzing trace with hash 18609109, now seen corresponding path program 1 times [2024-11-11 22:58:38,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:38,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020131947] [2024-11-11 22:58:38,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:38,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:38,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:38,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:58:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:38,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:58:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:38,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:58:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:38,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:58:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:38,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:38,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020131947] [2024-11-11 22:58:38,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020131947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:38,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:38,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:58:38,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926768240] [2024-11-11 22:58:38,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:38,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:58:38,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:38,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:58:38,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:58:38,543 INFO L87 Difference]: Start difference. First operand 4064 states and 5503 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:40,764 INFO L93 Difference]: Finished difference Result 6866 states and 9998 transitions. [2024-11-11 22:58:40,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:58:40,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:58:40,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:40,783 INFO L225 Difference]: With dead ends: 6866 [2024-11-11 22:58:40,784 INFO L226 Difference]: Without dead ends: 4866 [2024-11-11 22:58:40,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:58:40,791 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 1689 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1720 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:40,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1720 Valid, 1416 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1932 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 22:58:40,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4866 states. [2024-11-11 22:58:41,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4866 to 4064. [2024-11-11 22:58:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4064 states, 3535 states have (on average 1.3601131541725602) internal successors, (4808), 3559 states have internal predecessors, (4808), 297 states have call successors, (297), 173 states have call predecessors, (297), 230 states have return successors, (393), 335 states have call predecessors, (393), 294 states have call successors, (393) [2024-11-11 22:58:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4064 states to 4064 states and 5498 transitions. [2024-11-11 22:58:41,298 INFO L78 Accepts]: Start accepts. Automaton has 4064 states and 5498 transitions. Word has length 190 [2024-11-11 22:58:41,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:41,298 INFO L471 AbstractCegarLoop]: Abstraction has 4064 states and 5498 transitions. [2024-11-11 22:58:41,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:41,298 INFO L276 IsEmpty]: Start isEmpty. Operand 4064 states and 5498 transitions. [2024-11-11 22:58:41,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:58:41,301 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:41,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:58:41,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 22:58:41,301 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:41,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:41,301 INFO L85 PathProgramCache]: Analyzing trace with hash -767388781, now seen corresponding path program 1 times [2024-11-11 22:58:41,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:41,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638028389] [2024-11-11 22:58:41,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:41,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:41,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:41,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:58:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:41,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:58:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:41,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:58:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:41,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:58:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:41,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:41,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:41,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638028389] [2024-11-11 22:58:41,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638028389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:41,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:41,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:58:41,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159898004] [2024-11-11 22:58:41,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:41,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:58:41,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:41,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:58:41,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:58:41,562 INFO L87 Difference]: Start difference. First operand 4064 states and 5498 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:45,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:58:45,755 INFO L93 Difference]: Finished difference Result 8971 states and 13291 transitions. [2024-11-11 22:58:45,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:58:45,756 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:58:45,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:58:45,774 INFO L225 Difference]: With dead ends: 8971 [2024-11-11 22:58:45,774 INFO L226 Difference]: Without dead ends: 6971 [2024-11-11 22:58:45,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:58:45,779 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 1932 mSDsluCounter, 2414 mSDsCounter, 0 mSdLazyCounter, 3994 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 4097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:58:45,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1962 Valid, 3111 Invalid, 4097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3994 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 22:58:45,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6971 states. [2024-11-11 22:58:46,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6971 to 5653. [2024-11-11 22:58:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5653 states, 5008 states have (on average 1.4129392971246006) internal successors, (7076), 5036 states have internal predecessors, (7076), 385 states have call successors, (385), 197 states have call predecessors, (385), 258 states have return successors, (503), 427 states have call predecessors, (503), 382 states have call successors, (503) [2024-11-11 22:58:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5653 states to 5653 states and 7964 transitions. [2024-11-11 22:58:46,348 INFO L78 Accepts]: Start accepts. Automaton has 5653 states and 7964 transitions. Word has length 190 [2024-11-11 22:58:46,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:58:46,348 INFO L471 AbstractCegarLoop]: Abstraction has 5653 states and 7964 transitions. [2024-11-11 22:58:46,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:58:46,348 INFO L276 IsEmpty]: Start isEmpty. Operand 5653 states and 7964 transitions. [2024-11-11 22:58:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:58:46,352 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:58:46,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:58:46,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 22:58:46,352 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:58:46,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:58:46,352 INFO L85 PathProgramCache]: Analyzing trace with hash -100006891, now seen corresponding path program 1 times [2024-11-11 22:58:46,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:58:46,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642128641] [2024-11-11 22:58:46,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:58:46,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:58:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:46,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:58:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:46,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:58:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:46,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:58:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:46,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:58:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:46,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:58:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:58:46,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:58:46,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:58:46,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642128641] [2024-11-11 22:58:46,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642128641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:58:46,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:58:46,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:58:46,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014866487] [2024-11-11 22:58:46,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:58:46,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:58:46,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:58:46,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:58:46,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:58:46,680 INFO L87 Difference]: Start difference. First operand 5653 states and 7964 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)