./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-2.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 030c097c5e5981a6b9166b6af780aa84c84c48bf3e4236dc73dc256776dad070 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 00:09:50,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 00:09:50,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 00:09:50,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 00:09:50,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 00:09:50,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 00:09:50,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 00:09:50,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 00:09:50,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 00:09:50,235 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 00:09:50,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 00:09:50,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 00:09:50,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 00:09:50,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 00:09:50,237 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 00:09:50,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 00:09:50,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 00:09:50,240 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 00:09:50,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 00:09:50,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 00:09:50,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 00:09:50,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 00:09:50,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 00:09:50,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 00:09:50,242 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 00:09:50,245 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 00:09:50,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 00:09:50,246 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 00:09:50,246 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 00:09:50,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 00:09:50,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 00:09:50,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 00:09:50,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:09:50,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 00:09:50,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 00:09:50,248 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 00:09:50,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 00:09:50,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 00:09:50,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 00:09:50,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 00:09:50,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 00:09:50,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 00:09:50,250 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 -> 030c097c5e5981a6b9166b6af780aa84c84c48bf3e4236dc73dc256776dad070 [2024-11-20 00:09:50,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 00:09:50,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 00:09:50,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 00:09:50,547 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 00:09:50,548 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 00:09:50,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-2.c [2024-11-20 00:09:52,053 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 00:09:52,296 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 00:09:52,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-2.c [2024-11-20 00:09:52,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69b7a235a/c2584ca8bcc543debc285f41a566b17f/FLAGc0ccf8ad1 [2024-11-20 00:09:52,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69b7a235a/c2584ca8bcc543debc285f41a566b17f [2024-11-20 00:09:52,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 00:09:52,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 00:09:52,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 00:09:52,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 00:09:52,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 00:09:52,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:09:52" (1/1) ... [2024-11-20 00:09:52,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18aac3ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:52, skipping insertion in model container [2024-11-20 00:09:52,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:09:52" (1/1) ... [2024-11-20 00:09:52,409 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 00:09:52,608 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-2.c[914,927] [2024-11-20 00:09:52,699 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-2.c[7115,7128] [2024-11-20 00:09:52,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:09:52,866 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 00:09:52,880 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-2.c[914,927] [2024-11-20 00:09:52,927 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-2.c[7115,7128] [2024-11-20 00:09:53,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:09:53,052 INFO L204 MainTranslator]: Completed translation [2024-11-20 00:09:53,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:53 WrapperNode [2024-11-20 00:09:53,053 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 00:09:53,054 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 00:09:53,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 00:09:53,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 00:09:53,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:53" (1/1) ... [2024-11-20 00:09:53,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:53" (1/1) ... [2024-11-20 00:09:53,139 INFO L138 Inliner]: procedures = 79, calls = 96, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 1128 [2024-11-20 00:09:53,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 00:09:53,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 00:09:53,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 00:09:53,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 00:09:53,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:53" (1/1) ... [2024-11-20 00:09:53,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:53" (1/1) ... [2024-11-20 00:09:53,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:53" (1/1) ... [2024-11-20 00:09:53,185 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-20 00:09:53,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:53" (1/1) ... [2024-11-20 00:09:53,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:53" (1/1) ... [2024-11-20 00:09:53,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:53" (1/1) ... [2024-11-20 00:09:53,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:53" (1/1) ... [2024-11-20 00:09:53,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:53" (1/1) ... [2024-11-20 00:09:53,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:53" (1/1) ... [2024-11-20 00:09:53,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 00:09:53,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 00:09:53,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 00:09:53,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 00:09:53,252 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:53" (1/1) ... [2024-11-20 00:09:53,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:09:53,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:09:53,291 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-20 00:09:53,295 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-20 00:09:53,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 00:09:53,349 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-20 00:09:53,349 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-20 00:09:53,349 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-20 00:09:53,351 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-20 00:09:53,351 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-20 00:09:53,351 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-20 00:09:53,351 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-20 00:09:53,352 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-20 00:09:53,352 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-20 00:09:53,352 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-20 00:09:53,352 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-20 00:09:53,352 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-20 00:09:53,352 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-20 00:09:53,352 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-20 00:09:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-20 00:09:53,353 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-20 00:09:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-20 00:09:53,353 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-20 00:09:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-20 00:09:53,354 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-20 00:09:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-20 00:09:53,354 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-20 00:09:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 00:09:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-20 00:09:53,354 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-20 00:09:53,355 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-20 00:09:53,355 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-20 00:09:53,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 00:09:53,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 00:09:53,356 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-20 00:09:53,356 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-20 00:09:53,543 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 00:09:53,545 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 00:09:54,743 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2024-11-20 00:09:54,744 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 00:09:54,782 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 00:09:54,783 INFO L316 CfgBuilder]: Removed 20 assume(true) statements. [2024-11-20 00:09:54,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:09:54 BoogieIcfgContainer [2024-11-20 00:09:54,783 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 00:09:54,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 00:09:54,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 00:09:54,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 00:09:54,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:09:52" (1/3) ... [2024-11-20 00:09:54,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7e5c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:09:54, skipping insertion in model container [2024-11-20 00:09:54,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:53" (2/3) ... [2024-11-20 00:09:54,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7e5c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:09:54, skipping insertion in model container [2024-11-20 00:09:54,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:09:54" (3/3) ... [2024-11-20 00:09:54,797 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.13.cil-2.c [2024-11-20 00:09:54,815 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 00:09:54,815 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 00:09:54,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 00:09:54,919 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;@611c1f94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 00:09:54,920 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 00:09:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 522 states, 464 states have (on average 1.625) internal successors, (754), 470 states have internal predecessors, (754), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-20 00:09:54,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:09:54,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:54,943 INFO L215 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-20 00:09:54,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:54,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:54,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1203630818, now seen corresponding path program 1 times [2024-11-20 00:09:54,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:54,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771706831] [2024-11-20 00:09:54,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:54,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:55,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:55,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:55,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:55,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:55,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:55,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:55,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:55,648 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-20 00:09:55,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:55,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771706831] [2024-11-20 00:09:55,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771706831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:55,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:55,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:09:55,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276674610] [2024-11-20 00:09:55,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:55,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:09:55,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:55,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:09:55,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:09:55,695 INFO L87 Difference]: Start difference. First operand has 522 states, 464 states have (on average 1.625) internal successors, (754), 470 states have internal predecessors, (754), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) 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-20 00:09:57,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:57,416 INFO L93 Difference]: Finished difference Result 1150 states and 1828 transitions. [2024-11-20 00:09:57,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:09:57,419 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-20 00:09:57,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:57,443 INFO L225 Difference]: With dead ends: 1150 [2024-11-20 00:09:57,444 INFO L226 Difference]: Without dead ends: 647 [2024-11-20 00:09:57,454 INFO L431 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-20 00:09:57,459 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 1276 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 2386 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:57,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 2386 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 00:09:57,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-11-20 00:09:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 608. [2024-11-20 00:09:57,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 532 states have (on average 1.5169172932330828) internal successors, (807), 538 states have internal predecessors, (807), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-11-20 00:09:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 914 transitions. [2024-11-20 00:09:57,621 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 914 transitions. Word has length 65 [2024-11-20 00:09:57,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:57,621 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 914 transitions. [2024-11-20 00:09:57,622 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-20 00:09:57,622 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 914 transitions. [2024-11-20 00:09:57,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:09:57,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:57,630 INFO L215 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-20 00:09:57,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 00:09:57,630 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:57,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:57,632 INFO L85 PathProgramCache]: Analyzing trace with hash -940393477, now seen corresponding path program 1 times [2024-11-20 00:09:57,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:57,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156871632] [2024-11-20 00:09:57,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:57,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,866 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-20 00:09:57,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:57,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156871632] [2024-11-20 00:09:57,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156871632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:57,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:57,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:09:57,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599810217] [2024-11-20 00:09:57,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:57,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:09:57,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:57,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:09:57,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:09:57,871 INFO L87 Difference]: Start difference. First operand 608 states and 914 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-20 00:09:59,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:59,297 INFO L93 Difference]: Finished difference Result 820 states and 1205 transitions. [2024-11-20 00:09:59,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:09:59,298 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-20 00:09:59,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:59,305 INFO L225 Difference]: With dead ends: 820 [2024-11-20 00:09:59,305 INFO L226 Difference]: Without dead ends: 643 [2024-11-20 00:09:59,306 INFO L431 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-20 00:09:59,308 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 1027 mSDsluCounter, 2315 mSDsCounter, 0 mSdLazyCounter, 2039 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 2757 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:59,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 2757 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2039 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:09:59,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-11-20 00:09:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 613. [2024-11-20 00:09:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 536 states have (on average 1.5111940298507462) internal successors, (810), 542 states have internal predecessors, (810), 52 states have call successors, (52), 21 states have call predecessors, (52), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2024-11-20 00:09:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 918 transitions. [2024-11-20 00:09:59,349 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 918 transitions. Word has length 65 [2024-11-20 00:09:59,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:59,349 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 918 transitions. [2024-11-20 00:09:59,350 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-20 00:09:59,350 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 918 transitions. [2024-11-20 00:09:59,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:09:59,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:59,352 INFO L215 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-20 00:09:59,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 00:09:59,353 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:59,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:59,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1969752775, now seen corresponding path program 1 times [2024-11-20 00:09:59,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:59,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352274705] [2024-11-20 00:09:59,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:59,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:59,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:59,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:59,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:59,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:59,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:59,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:59,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:59,558 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-20 00:09:59,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:59,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352274705] [2024-11-20 00:09:59,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352274705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:59,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:59,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:09:59,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808181704] [2024-11-20 00:09:59,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:59,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:09:59,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:59,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:09:59,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:09:59,565 INFO L87 Difference]: Start difference. First operand 613 states and 918 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-20 00:10:01,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:01,781 INFO L93 Difference]: Finished difference Result 1787 states and 2510 transitions. [2024-11-20 00:10:01,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-20 00:10:01,782 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-20 00:10:01,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:01,793 INFO L225 Difference]: With dead ends: 1787 [2024-11-20 00:10:01,795 INFO L226 Difference]: Without dead ends: 1605 [2024-11-20 00:10:01,798 INFO L431 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-20 00:10:01,800 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 2825 mSDsluCounter, 2189 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2841 SdHoareTripleChecker+Valid, 2751 SdHoareTripleChecker+Invalid, 2461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:01,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2841 Valid, 2751 Invalid, 2461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 00:10:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2024-11-20 00:10:01,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1363. [2024-11-20 00:10:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1129 states have (on average 1.4136403897254208) internal successors, (1596), 1145 states have internal predecessors, (1596), 130 states have call successors, (130), 89 states have call predecessors, (130), 102 states have return successors, (169), 131 states have call predecessors, (169), 128 states have call successors, (169) [2024-11-20 00:10:01,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1895 transitions. [2024-11-20 00:10:01,907 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1895 transitions. Word has length 65 [2024-11-20 00:10:01,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:01,909 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1895 transitions. [2024-11-20 00:10:01,909 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-20 00:10:01,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1895 transitions. [2024-11-20 00:10:01,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:10:01,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:01,914 INFO L215 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-20 00:10:01,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 00:10:01,914 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:01,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:01,914 INFO L85 PathProgramCache]: Analyzing trace with hash -918303686, now seen corresponding path program 1 times [2024-11-20 00:10:01,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:01,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005121477] [2024-11-20 00:10:01,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:01,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:01,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:01,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:02,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:02,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:02,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:02,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:02,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:02,121 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-20 00:10:02,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:02,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005121477] [2024-11-20 00:10:02,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005121477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:02,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:02,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:10:02,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671544978] [2024-11-20 00:10:02,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:02,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:10:02,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:02,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:10:02,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:10:02,129 INFO L87 Difference]: Start difference. First operand 1363 states and 1895 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-20 00:10:03,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:03,502 INFO L93 Difference]: Finished difference Result 2489 states and 3382 transitions. [2024-11-20 00:10:03,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 00:10:03,503 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-20 00:10:03,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:03,511 INFO L225 Difference]: With dead ends: 2489 [2024-11-20 00:10:03,511 INFO L226 Difference]: Without dead ends: 1557 [2024-11-20 00:10:03,515 INFO L431 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-20 00:10:03,520 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 690 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 2083 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 3114 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:03,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 3114 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2083 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:10:03,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2024-11-20 00:10:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1393. [2024-11-20 00:10:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1153 states have (on average 1.3998265394622724) internal successors, (1614), 1169 states have internal predecessors, (1614), 130 states have call successors, (130), 89 states have call predecessors, (130), 108 states have return successors, (177), 137 states have call predecessors, (177), 128 states have call successors, (177) [2024-11-20 00:10:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1921 transitions. [2024-11-20 00:10:03,640 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1921 transitions. Word has length 65 [2024-11-20 00:10:03,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:03,642 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 1921 transitions. [2024-11-20 00:10:03,643 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-20 00:10:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1921 transitions. [2024-11-20 00:10:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:10:03,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:03,644 INFO L215 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-20 00:10:03,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 00:10:03,644 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:03,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:03,645 INFO L85 PathProgramCache]: Analyzing trace with hash 467899708, now seen corresponding path program 1 times [2024-11-20 00:10:03,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:03,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568545358] [2024-11-20 00:10:03,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:03,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:03,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:03,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:03,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:03,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:03,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:03,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:03,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:03,861 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-20 00:10:03,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:03,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568545358] [2024-11-20 00:10:03,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568545358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:03,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:03,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:10:03,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778852081] [2024-11-20 00:10:03,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:03,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:10:03,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:03,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:10:03,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:10:03,864 INFO L87 Difference]: Start difference. First operand 1393 states and 1921 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 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-20 00:10:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:05,200 INFO L93 Difference]: Finished difference Result 3052 states and 4074 transitions. [2024-11-20 00:10:05,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 00:10:05,201 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 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-20 00:10:05,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:05,212 INFO L225 Difference]: With dead ends: 3052 [2024-11-20 00:10:05,212 INFO L226 Difference]: Without dead ends: 2092 [2024-11-20 00:10:05,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-20 00:10:05,218 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 1541 mSDsluCounter, 1862 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:05,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 2272 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:10:05,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2024-11-20 00:10:05,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 1884. [2024-11-20 00:10:05,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1540 states have (on average 1.3694805194805195) internal successors, (2109), 1568 states have internal predecessors, (2109), 180 states have call successors, (180), 130 states have call predecessors, (180), 162 states have return successors, (271), 189 states have call predecessors, (271), 178 states have call successors, (271) [2024-11-20 00:10:05,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2560 transitions. [2024-11-20 00:10:05,375 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2560 transitions. Word has length 65 [2024-11-20 00:10:05,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:05,375 INFO L471 AbstractCegarLoop]: Abstraction has 1884 states and 2560 transitions. [2024-11-20 00:10:05,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 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-20 00:10:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2560 transitions. [2024-11-20 00:10:05,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:10:05,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:05,378 INFO L215 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-20 00:10:05,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 00:10:05,380 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:05,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:05,380 INFO L85 PathProgramCache]: Analyzing trace with hash 333886202, now seen corresponding path program 1 times [2024-11-20 00:10:05,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:05,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319061301] [2024-11-20 00:10:05,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:05,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:05,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:05,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:05,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:05,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:05,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:05,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:05,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:05,504 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-20 00:10:05,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:05,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319061301] [2024-11-20 00:10:05,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319061301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:05,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:05,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:05,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941569043] [2024-11-20 00:10:05,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:05,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:05,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:05,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:05,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:05,506 INFO L87 Difference]: Start difference. First operand 1884 states and 2560 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-20 00:10:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:06,511 INFO L93 Difference]: Finished difference Result 4959 states and 6563 transitions. [2024-11-20 00:10:06,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 00:10:06,511 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-20 00:10:06,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:06,531 INFO L225 Difference]: With dead ends: 4959 [2024-11-20 00:10:06,531 INFO L226 Difference]: Without dead ends: 3515 [2024-11-20 00:10:06,537 INFO L431 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-20 00:10:06,538 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 1883 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1919 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:06,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1919 Valid, 1529 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:10:06,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3515 states. [2024-11-20 00:10:06,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3515 to 3267. [2024-11-20 00:10:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3267 states, 2612 states have (on average 1.3162327718223583) internal successors, (3438), 2667 states have internal predecessors, (3438), 332 states have call successors, (332), 253 states have call predecessors, (332), 321 states have return successors, (557), 353 states have call predecessors, (557), 330 states have call successors, (557) [2024-11-20 00:10:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3267 states to 3267 states and 4327 transitions. [2024-11-20 00:10:06,792 INFO L78 Accepts]: Start accepts. Automaton has 3267 states and 4327 transitions. Word has length 65 [2024-11-20 00:10:06,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:06,792 INFO L471 AbstractCegarLoop]: Abstraction has 3267 states and 4327 transitions. [2024-11-20 00:10:06,793 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-20 00:10:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3267 states and 4327 transitions. [2024-11-20 00:10:06,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 00:10:06,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:06,799 INFO L215 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-20 00:10:06,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 00:10:06,799 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:06,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:06,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1851984349, now seen corresponding path program 1 times [2024-11-20 00:10:06,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:06,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708074473] [2024-11-20 00:10:06,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:06,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:06,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:06,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:06,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:06,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:06,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:06,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:06,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:06,888 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-20 00:10:06,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:06,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708074473] [2024-11-20 00:10:06,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708074473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:06,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:06,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:10:06,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375846649] [2024-11-20 00:10:06,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:06,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:10:06,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:06,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:10:06,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:10:06,894 INFO L87 Difference]: Start difference. First operand 3267 states and 4327 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-20 00:10:07,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:07,992 INFO L93 Difference]: Finished difference Result 8289 states and 10889 transitions. [2024-11-20 00:10:07,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:10:07,992 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-20 00:10:07,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:08,021 INFO L225 Difference]: With dead ends: 8289 [2024-11-20 00:10:08,022 INFO L226 Difference]: Without dead ends: 5441 [2024-11-20 00:10:08,031 INFO L431 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-20 00:10:08,032 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 1246 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:08,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 1550 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:10:08,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5441 states. [2024-11-20 00:10:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5441 to 4961. [2024-11-20 00:10:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4961 states, 3903 states have (on average 1.29387650525237) internal successors, (5050), 3971 states have internal predecessors, (5050), 530 states have call successors, (530), 427 states have call predecessors, (530), 526 states have return successors, (892), 569 states have call predecessors, (892), 528 states have call successors, (892) [2024-11-20 00:10:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4961 states to 4961 states and 6472 transitions. [2024-11-20 00:10:08,480 INFO L78 Accepts]: Start accepts. Automaton has 4961 states and 6472 transitions. Word has length 66 [2024-11-20 00:10:08,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:08,481 INFO L471 AbstractCegarLoop]: Abstraction has 4961 states and 6472 transitions. [2024-11-20 00:10:08,481 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-20 00:10:08,481 INFO L276 IsEmpty]: Start isEmpty. Operand 4961 states and 6472 transitions. [2024-11-20 00:10:08,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 00:10:08,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:08,484 INFO L215 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-20 00:10:08,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 00:10:08,484 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:08,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:08,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1089761896, now seen corresponding path program 1 times [2024-11-20 00:10:08,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:08,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972343777] [2024-11-20 00:10:08,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:08,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:08,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:08,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:08,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:08,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:08,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:08,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:08,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:08,596 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-20 00:10:08,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:08,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972343777] [2024-11-20 00:10:08,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972343777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:08,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:08,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:08,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914782303] [2024-11-20 00:10:08,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:08,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:08,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:08,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:08,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:08,599 INFO L87 Difference]: Start difference. First operand 4961 states and 6472 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-20 00:10:09,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:09,726 INFO L93 Difference]: Finished difference Result 6555 states and 8452 transitions. [2024-11-20 00:10:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 00:10:09,727 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-20 00:10:09,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:09,763 INFO L225 Difference]: With dead ends: 6555 [2024-11-20 00:10:09,763 INFO L226 Difference]: Without dead ends: 6552 [2024-11-20 00:10:09,767 INFO L431 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-20 00:10:09,768 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 2255 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2264 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:09,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2264 Valid, 1573 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:10:09,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6552 states. [2024-11-20 00:10:10,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6552 to 6027. [2024-11-20 00:10:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6027 states, 4712 states have (on average 1.2801358234295417) internal successors, (6032), 4795 states have internal predecessors, (6032), 656 states have call successors, (656), 541 states have call predecessors, (656), 657 states have return successors, (1097), 697 states have call predecessors, (1097), 655 states have call successors, (1097) [2024-11-20 00:10:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6027 states to 6027 states and 7785 transitions. [2024-11-20 00:10:10,343 INFO L78 Accepts]: Start accepts. Automaton has 6027 states and 7785 transitions. Word has length 73 [2024-11-20 00:10:10,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:10,344 INFO L471 AbstractCegarLoop]: Abstraction has 6027 states and 7785 transitions. [2024-11-20 00:10:10,345 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-20 00:10:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 6027 states and 7785 transitions. [2024-11-20 00:10:10,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-20 00:10:10,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:10,349 INFO L215 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-20 00:10:10,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 00:10:10,350 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:10,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:10,351 INFO L85 PathProgramCache]: Analyzing trace with hash 575598988, now seen corresponding path program 1 times [2024-11-20 00:10:10,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:10,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119452140] [2024-11-20 00:10:10,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:10,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:10,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:10,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:10,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:10,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:10,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:10,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:10,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:10,576 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-20 00:10:10,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:10,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119452140] [2024-11-20 00:10:10,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119452140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:10:10,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201101476] [2024-11-20 00:10:10,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:10,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:10:10,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:10:10,580 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-20 00:10:10,581 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-20 00:10:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:10,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 00:10:10,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:10:11,044 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-20 00:10:11,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 00:10:11,161 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-20 00:10:11,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201101476] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 00:10:11,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 00:10:11,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-11-20 00:10:11,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198263053] [2024-11-20 00:10:11,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 00:10:11,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 00:10:11,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:11,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 00:10:11,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 00:10:11,164 INFO L87 Difference]: Start difference. First operand 6027 states and 7785 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-20 00:10:13,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:13,604 INFO L93 Difference]: Finished difference Result 13625 states and 17319 transitions. [2024-11-20 00:10:13,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-20 00:10:13,605 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-20 00:10:13,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:13,678 INFO L225 Difference]: With dead ends: 13625 [2024-11-20 00:10:13,678 INFO L226 Difference]: Without dead ends: 13622 [2024-11-20 00:10:13,685 INFO L431 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-20 00:10:13,688 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 3155 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 1793 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3224 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 2122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 1793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:13,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3224 Valid, 2224 Invalid, 2122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 1793 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:10:13,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13622 states. [2024-11-20 00:10:14,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13622 to 11325. [2024-11-20 00:10:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11325 states, 8824 states have (on average 1.2671124206708975) internal successors, (11181), 8979 states have internal predecessors, (11181), 1222 states have call successors, (1222), 1031 states have call predecessors, (1222), 1277 states have return successors, (2076), 1321 states have call predecessors, (2076), 1221 states have call successors, (2076) [2024-11-20 00:10:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11325 states to 11325 states and 14479 transitions. [2024-11-20 00:10:14,873 INFO L78 Accepts]: Start accepts. Automaton has 11325 states and 14479 transitions. Word has length 74 [2024-11-20 00:10:14,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:14,873 INFO L471 AbstractCegarLoop]: Abstraction has 11325 states and 14479 transitions. [2024-11-20 00:10:14,874 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-20 00:10:14,874 INFO L276 IsEmpty]: Start isEmpty. Operand 11325 states and 14479 transitions. [2024-11-20 00:10:14,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-20 00:10:14,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:14,877 INFO L215 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-20 00:10:14,887 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-20 00:10:15,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:10:15,078 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:15,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:15,079 INFO L85 PathProgramCache]: Analyzing trace with hash 451749144, now seen corresponding path program 2 times [2024-11-20 00:10:15,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:15,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842927377] [2024-11-20 00:10:15,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:15,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:15,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:15,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:15,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:15,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:15,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:15,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:15,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:15,159 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-20 00:10:15,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:15,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842927377] [2024-11-20 00:10:15,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842927377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:15,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:15,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:10:15,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333140397] [2024-11-20 00:10:15,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:15,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:10:15,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:15,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:10:15,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:10:15,161 INFO L87 Difference]: Start difference. First operand 11325 states and 14479 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-20 00:10:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:16,488 INFO L93 Difference]: Finished difference Result 17860 states and 22871 transitions. [2024-11-20 00:10:16,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 00:10:16,489 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-20 00:10:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:16,524 INFO L225 Difference]: With dead ends: 17860 [2024-11-20 00:10:16,524 INFO L226 Difference]: Without dead ends: 7842 [2024-11-20 00:10:16,549 INFO L431 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-20 00:10:16,550 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 1411 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:16,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1447 Valid, 1661 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:10:16,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7842 states. [2024-11-20 00:10:17,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7842 to 7354. [2024-11-20 00:10:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7354 states, 5759 states have (on average 1.2496961277999652) internal successors, (7197), 5858 states have internal predecessors, (7197), 789 states have call successors, (789), 655 states have call predecessors, (789), 804 states have return successors, (1271), 847 states have call predecessors, (1271), 788 states have call successors, (1271) [2024-11-20 00:10:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7354 states to 7354 states and 9257 transitions. [2024-11-20 00:10:17,104 INFO L78 Accepts]: Start accepts. Automaton has 7354 states and 9257 transitions. Word has length 77 [2024-11-20 00:10:17,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:17,104 INFO L471 AbstractCegarLoop]: Abstraction has 7354 states and 9257 transitions. [2024-11-20 00:10:17,105 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-20 00:10:17,105 INFO L276 IsEmpty]: Start isEmpty. Operand 7354 states and 9257 transitions. [2024-11-20 00:10:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-20 00:10:17,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:17,108 INFO L215 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-20 00:10:17,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 00:10:17,109 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:17,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:17,109 INFO L85 PathProgramCache]: Analyzing trace with hash 306488926, now seen corresponding path program 1 times [2024-11-20 00:10:17,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:17,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135693595] [2024-11-20 00:10:17,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:17,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:17,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:17,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:17,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:17,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:17,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:17,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:17,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:17,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 00:10:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:17,245 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-20 00:10:17,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:17,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135693595] [2024-11-20 00:10:17,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135693595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:17,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:17,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:10:17,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509589229] [2024-11-20 00:10:17,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:17,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:10:17,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:17,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:10:17,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:10:17,247 INFO L87 Difference]: Start difference. First operand 7354 states and 9257 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-20 00:10:19,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:19,812 INFO L93 Difference]: Finished difference Result 21232 states and 26608 transitions. [2024-11-20 00:10:19,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 00:10:19,813 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-20 00:10:19,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:19,868 INFO L225 Difference]: With dead ends: 21232 [2024-11-20 00:10:19,868 INFO L226 Difference]: Without dead ends: 14325 [2024-11-20 00:10:19,886 INFO L431 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-20 00:10:19,887 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 1118 mSDsluCounter, 2344 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 2806 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:19,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 2806 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:10:19,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14325 states. [2024-11-20 00:10:20,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14325 to 13586. [2024-11-20 00:10:20,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13586 states, 10463 states have (on average 1.2176240084105896) internal successors, (12740), 10696 states have internal predecessors, (12740), 1509 states have call successors, (1509), 1259 states have call predecessors, (1509), 1612 states have return successors, (2736), 1643 states have call predecessors, (2736), 1508 states have call successors, (2736) [2024-11-20 00:10:20,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13586 states to 13586 states and 16985 transitions. [2024-11-20 00:10:20,920 INFO L78 Accepts]: Start accepts. Automaton has 13586 states and 16985 transitions. Word has length 84 [2024-11-20 00:10:20,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:20,920 INFO L471 AbstractCegarLoop]: Abstraction has 13586 states and 16985 transitions. [2024-11-20 00:10:20,921 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-20 00:10:20,921 INFO L276 IsEmpty]: Start isEmpty. Operand 13586 states and 16985 transitions. [2024-11-20 00:10:20,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-20 00:10:20,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:20,928 INFO L215 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-20 00:10:20,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 00:10:20,929 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:20,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:20,929 INFO L85 PathProgramCache]: Analyzing trace with hash -25236298, now seen corresponding path program 1 times [2024-11-20 00:10:20,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:20,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889426613] [2024-11-20 00:10:20,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:20,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:21,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:21,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:21,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:21,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:21,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:21,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:21,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:21,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:10:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:21,054 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-20 00:10:21,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:21,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889426613] [2024-11-20 00:10:21,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889426613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:21,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:21,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:10:21,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115594137] [2024-11-20 00:10:21,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:21,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:10:21,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:21,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:10:21,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:10:21,057 INFO L87 Difference]: Start difference. First operand 13586 states and 16985 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-20 00:10:23,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:23,081 INFO L93 Difference]: Finished difference Result 24452 states and 30344 transitions. [2024-11-20 00:10:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-20 00:10:23,081 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-20 00:10:23,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:23,137 INFO L225 Difference]: With dead ends: 24452 [2024-11-20 00:10:23,137 INFO L226 Difference]: Without dead ends: 11939 [2024-11-20 00:10:23,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-11-20 00:10:23,177 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 2564 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2611 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:23,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2611 Valid, 2451 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 00:10:23,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11939 states. [2024-11-20 00:10:24,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11939 to 11089. [2024-11-20 00:10:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11089 states, 8594 states have (on average 1.2079357691412613) internal successors, (10381), 8759 states have internal predecessors, (10381), 1208 states have call successors, (1208), 1008 states have call predecessors, (1208), 1285 states have return successors, (1995), 1331 states have call predecessors, (1995), 1207 states have call successors, (1995) [2024-11-20 00:10:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11089 states to 11089 states and 13584 transitions. [2024-11-20 00:10:24,555 INFO L78 Accepts]: Start accepts. Automaton has 11089 states and 13584 transitions. Word has length 93 [2024-11-20 00:10:24,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:24,555 INFO L471 AbstractCegarLoop]: Abstraction has 11089 states and 13584 transitions. [2024-11-20 00:10:24,556 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-20 00:10:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 11089 states and 13584 transitions. [2024-11-20 00:10:24,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 00:10:24,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:24,569 INFO L215 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-20 00:10:24,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 00:10:24,570 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:24,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:24,571 INFO L85 PathProgramCache]: Analyzing trace with hash 909382032, now seen corresponding path program 1 times [2024-11-20 00:10:24,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:24,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345544617] [2024-11-20 00:10:24,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:24,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 00:10:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 00:10:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 00:10:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 00:10:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:10:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 00:10:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 00:10:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,767 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-20 00:10:24,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:24,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345544617] [2024-11-20 00:10:24,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345544617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:10:24,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261481206] [2024-11-20 00:10:24,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:24,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:10:24,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:10:24,771 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-20 00:10:24,772 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-20 00:10:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 00:10:24,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:10:24,976 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-20 00:10:24,977 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:10:24,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261481206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:24,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:10:24,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-11-20 00:10:24,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488597423] [2024-11-20 00:10:24,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:24,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:10:24,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:24,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:10:24,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-20 00:10:24,980 INFO L87 Difference]: Start difference. First operand 11089 states and 13584 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-20 00:10:25,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:25,681 INFO L93 Difference]: Finished difference Result 16050 states and 19517 transitions. [2024-11-20 00:10:25,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 00:10:25,682 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-20 00:10:25,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:25,714 INFO L225 Difference]: With dead ends: 16050 [2024-11-20 00:10:25,714 INFO L226 Difference]: Without dead ends: 5418 [2024-11-20 00:10:25,742 INFO L431 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-20 00:10:25,743 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 0 mSDsluCounter, 3099 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3876 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-20 00:10:25,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3876 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:10:25,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5418 states. [2024-11-20 00:10:26,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5418 to 5262. [2024-11-20 00:10:26,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5262 states, 4203 states have (on average 1.2088984059005472) internal successors, (5081), 4253 states have internal predecessors, (5081), 516 states have call successors, (516), 414 states have call predecessors, (516), 541 states have return successors, (809), 595 states have call predecessors, (809), 515 states have call successors, (809) [2024-11-20 00:10:26,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5262 states to 5262 states and 6406 transitions. [2024-11-20 00:10:26,298 INFO L78 Accepts]: Start accepts. Automaton has 5262 states and 6406 transitions. Word has length 145 [2024-11-20 00:10:26,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:26,298 INFO L471 AbstractCegarLoop]: Abstraction has 5262 states and 6406 transitions. [2024-11-20 00:10:26,298 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-20 00:10:26,299 INFO L276 IsEmpty]: Start isEmpty. Operand 5262 states and 6406 transitions. [2024-11-20 00:10:26,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 00:10:26,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:26,307 INFO L215 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-20 00:10:26,316 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-20 00:10:26,508 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,SelfDestructingSolverStorable12 [2024-11-20 00:10:26,509 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:26,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:26,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1577701308, now seen corresponding path program 1 times [2024-11-20 00:10:26,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:26,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945347568] [2024-11-20 00:10:26,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:26,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:26,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:26,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:26,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:26,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:26,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:26,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:26,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:26,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 00:10:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:26,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 00:10:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:26,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 00:10:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:26,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 00:10:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:26,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:26,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:26,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 00:10:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:26,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 00:10:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:26,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 00:10:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:26,615 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-20 00:10:26,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:26,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945347568] [2024-11-20 00:10:26,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945347568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:26,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:26,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:10:26,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786408220] [2024-11-20 00:10:26,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:26,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:10:26,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:26,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:10:26,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:10:26,619 INFO L87 Difference]: Start difference. First operand 5262 states and 6406 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-20 00:10:27,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:27,514 INFO L93 Difference]: Finished difference Result 5800 states and 7016 transitions. [2024-11-20 00:10:27,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:10:27,514 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-20 00:10:27,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:27,538 INFO L225 Difference]: With dead ends: 5800 [2024-11-20 00:10:27,539 INFO L226 Difference]: Without dead ends: 5018 [2024-11-20 00:10:27,543 INFO L431 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-20 00:10:27,544 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 800 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:27,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 1831 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:10:27,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5018 states. [2024-11-20 00:10:27,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5018 to 4806. [2024-11-20 00:10:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4806 states, 3853 states have (on average 1.2138593303919025) internal successors, (4677), 3898 states have internal predecessors, (4677), 466 states have call successors, (466), 370 states have call predecessors, (466), 485 states have return successors, (738), 538 states have call predecessors, (738), 465 states have call successors, (738) [2024-11-20 00:10:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4806 states to 4806 states and 5881 transitions. [2024-11-20 00:10:27,945 INFO L78 Accepts]: Start accepts. Automaton has 4806 states and 5881 transitions. Word has length 147 [2024-11-20 00:10:27,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:27,946 INFO L471 AbstractCegarLoop]: Abstraction has 4806 states and 5881 transitions. [2024-11-20 00:10:27,946 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-20 00:10:27,946 INFO L276 IsEmpty]: Start isEmpty. Operand 4806 states and 5881 transitions. [2024-11-20 00:10:27,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 00:10:27,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:27,956 INFO L215 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, 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-20 00:10:27,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 00:10:27,956 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:27,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:27,957 INFO L85 PathProgramCache]: Analyzing trace with hash 330615963, now seen corresponding path program 1 times [2024-11-20 00:10:27,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:27,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525595906] [2024-11-20 00:10:27,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:27,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:28,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:28,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 00:10:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:28,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:28,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:28,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:28,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:10:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:28,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:10:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:28,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 00:10:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:28,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 00:10:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:28,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 00:10:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:28,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 00:10:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:28,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:28,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:28,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 00:10:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:28,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-20 00:10:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:28,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:10:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:28,105 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-20 00:10:28,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:28,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525595906] [2024-11-20 00:10:28,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525595906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:10:28,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039625330] [2024-11-20 00:10:28,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:28,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:10:28,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:10:28,108 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-20 00:10:28,109 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-20 00:10:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:28,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 00:10:28,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:10:28,379 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-20 00:10:28,380 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:10:28,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039625330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:28,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:10:28,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-20 00:10:28,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554099822] [2024-11-20 00:10:28,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:28,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:10:28,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:28,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:10:28,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:10:28,385 INFO L87 Difference]: Start difference. First operand 4806 states and 5881 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-20 00:10:28,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:28,679 INFO L93 Difference]: Finished difference Result 6650 states and 8057 transitions. [2024-11-20 00:10:28,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:10:28,679 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-20 00:10:28,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:28,693 INFO L225 Difference]: With dead ends: 6650 [2024-11-20 00:10:28,693 INFO L226 Difference]: Without dead ends: 2565 [2024-11-20 00:10:28,700 INFO L431 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-20 00:10:28,701 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 687 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 880 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-20 00:10:28,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 880 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:10:28,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2024-11-20 00:10:28,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 2565. [2024-11-20 00:10:28,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2095 states have (on average 1.2353221957040572) internal successors, (2588), 2119 states have internal predecessors, (2588), 233 states have call successors, (233), 178 states have call predecessors, (233), 235 states have return successors, (343), 268 states have call predecessors, (343), 232 states have call successors, (343) [2024-11-20 00:10:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3164 transitions. [2024-11-20 00:10:28,921 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3164 transitions. Word has length 158 [2024-11-20 00:10:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:28,922 INFO L471 AbstractCegarLoop]: Abstraction has 2565 states and 3164 transitions. [2024-11-20 00:10:28,922 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-20 00:10:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3164 transitions. [2024-11-20 00:10:28,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-20 00:10:28,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:28,928 INFO L215 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-20 00:10:28,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 00:10:29,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:10:29,129 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:29,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:29,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1087569844, now seen corresponding path program 1 times [2024-11-20 00:10:29,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:29,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444825015] [2024-11-20 00:10:29,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:29,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 00:10:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 00:10:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 00:10:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:10:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-20 00:10:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 00:10:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 00:10:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,258 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-20 00:10:29,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:29,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444825015] [2024-11-20 00:10:29,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444825015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:29,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:29,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:29,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672565116] [2024-11-20 00:10:29,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:29,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:29,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:29,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:29,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:29,260 INFO L87 Difference]: Start difference. First operand 2565 states and 3164 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-20 00:10:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:30,329 INFO L93 Difference]: Finished difference Result 4431 states and 5376 transitions. [2024-11-20 00:10:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 00:10:30,330 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-20 00:10:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:30,345 INFO L225 Difference]: With dead ends: 4431 [2024-11-20 00:10:30,345 INFO L226 Difference]: Without dead ends: 2662 [2024-11-20 00:10:30,348 INFO L431 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-20 00:10:30,348 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 720 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:30,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 2351 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 00:10:30,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2024-11-20 00:10:30,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2116. [2024-11-20 00:10:30,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 1742 states have (on average 1.2531572904707233) internal successors, (2183), 1761 states have internal predecessors, (2183), 189 states have call successors, (189), 142 states have call predecessors, (189), 183 states have return successors, (267), 213 states have call predecessors, (267), 188 states have call successors, (267) [2024-11-20 00:10:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 2639 transitions. [2024-11-20 00:10:30,528 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 2639 transitions. Word has length 159 [2024-11-20 00:10:30,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:30,529 INFO L471 AbstractCegarLoop]: Abstraction has 2116 states and 2639 transitions. [2024-11-20 00:10:30,529 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-20 00:10:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2639 transitions. [2024-11-20 00:10:30,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-20 00:10:30,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:30,534 INFO L215 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-20 00:10:30,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 00:10:30,534 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:30,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:30,534 INFO L85 PathProgramCache]: Analyzing trace with hash 652410719, now seen corresponding path program 1 times [2024-11-20 00:10:30,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:30,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397380188] [2024-11-20 00:10:30,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:30,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:30,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:30,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:30,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:30,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:30,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:30,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:30,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:30,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 00:10:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:30,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 00:10:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:30,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 00:10:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:30,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 00:10:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:30,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:30,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:30,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 00:10:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:30,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 00:10:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:30,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 00:10:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:30,797 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-20 00:10:30,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:30,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397380188] [2024-11-20 00:10:30,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397380188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:10:30,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536417681] [2024-11-20 00:10:30,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:30,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:10:30,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:10:30,800 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-20 00:10:30,802 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-20 00:10:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:30,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 00:10:30,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:10:31,110 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-20 00:10:31,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:10:31,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536417681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:31,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:10:31,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-11-20 00:10:31,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746901322] [2024-11-20 00:10:31,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:31,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:10:31,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:31,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:10:31,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:10:31,115 INFO L87 Difference]: Start difference. First operand 2116 states and 2639 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-20 00:10:31,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:31,737 INFO L93 Difference]: Finished difference Result 4714 states and 5758 transitions. [2024-11-20 00:10:31,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:10:31,738 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-20 00:10:31,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:31,750 INFO L225 Difference]: With dead ends: 4714 [2024-11-20 00:10:31,751 INFO L226 Difference]: Without dead ends: 2940 [2024-11-20 00:10:31,755 INFO L431 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-20 00:10:31,755 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 399 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:31,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1198 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:10:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2024-11-20 00:10:31,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2910. [2024-11-20 00:10:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2401 states have (on average 1.213244481466056) internal successors, (2913), 2425 states have internal predecessors, (2913), 255 states have call successors, (255), 190 states have call predecessors, (255), 252 states have return successors, (374), 295 states have call predecessors, (374), 254 states have call successors, (374) [2024-11-20 00:10:31,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 3542 transitions. [2024-11-20 00:10:32,004 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 3542 transitions. Word has length 162 [2024-11-20 00:10:32,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:32,005 INFO L471 AbstractCegarLoop]: Abstraction has 2910 states and 3542 transitions. [2024-11-20 00:10:32,005 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-20 00:10:32,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 3542 transitions. [2024-11-20 00:10:32,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 00:10:32,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:32,009 INFO L215 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-20 00:10:32,018 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-20 00:10:32,210 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,SelfDestructingSolverStorable16 [2024-11-20 00:10:32,211 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:32,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:32,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1562959688, now seen corresponding path program 1 times [2024-11-20 00:10:32,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:32,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209614853] [2024-11-20 00:10:32,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:32,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 00:10:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:10:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:10:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 00:10:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 00:10:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 00:10:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 00:10:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 00:10:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 00:10:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 00:10:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 00:10:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,347 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-20 00:10:32,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:32,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209614853] [2024-11-20 00:10:32,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209614853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:10:32,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973081829] [2024-11-20 00:10:32,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:32,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:10:32,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:10:32,351 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-20 00:10:32,353 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-20 00:10:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 00:10:32,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:10:32,528 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-20 00:10:32,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:10:32,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973081829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:32,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:10:32,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-20 00:10:32,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169906155] [2024-11-20 00:10:32,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:32,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:10:32,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:32,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:10:32,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 00:10:32,531 INFO L87 Difference]: Start difference. First operand 2910 states and 3542 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-20 00:10:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:33,373 INFO L93 Difference]: Finished difference Result 5293 states and 6313 transitions. [2024-11-20 00:10:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:10:33,373 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-20 00:10:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:33,385 INFO L225 Difference]: With dead ends: 5293 [2024-11-20 00:10:33,386 INFO L226 Difference]: Without dead ends: 2649 [2024-11-20 00:10:33,390 INFO L431 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-20 00:10:33,390 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 1060 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:33,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 1174 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:10:33,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2024-11-20 00:10:33,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 2475. [2024-11-20 00:10:33,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2475 states, 2062 states have (on average 1.2216294859359844) internal successors, (2519), 2081 states have internal predecessors, (2519), 208 states have call successors, (208), 149 states have call predecessors, (208), 203 states have return successors, (293), 245 states have call predecessors, (293), 207 states have call successors, (293) [2024-11-20 00:10:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3020 transitions. [2024-11-20 00:10:33,559 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3020 transitions. Word has length 179 [2024-11-20 00:10:33,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:33,559 INFO L471 AbstractCegarLoop]: Abstraction has 2475 states and 3020 transitions. [2024-11-20 00:10:33,560 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-20 00:10:33,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3020 transitions. [2024-11-20 00:10:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-20 00:10:33,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:33,563 INFO L215 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] [2024-11-20 00:10:33,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 00:10:33,763 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,SelfDestructingSolverStorable17 [2024-11-20 00:10:33,764 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:33,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:33,765 INFO L85 PathProgramCache]: Analyzing trace with hash -40286645, now seen corresponding path program 1 times [2024-11-20 00:10:33,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:33,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971590951] [2024-11-20 00:10:33,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:33,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:33,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:33,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:10:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:33,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:33,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:10:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:33,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:10:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:33,967 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-20 00:10:33,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:33,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971590951] [2024-11-20 00:10:33,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971590951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:33,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:33,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:10:33,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294491010] [2024-11-20 00:10:33,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:33,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:10:33,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:33,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:10:33,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:10:33,970 INFO L87 Difference]: Start difference. First operand 2475 states and 3020 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:36,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:36,161 INFO L93 Difference]: Finished difference Result 3038 states and 3926 transitions. [2024-11-20 00:10:36,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:10:36,162 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2024-11-20 00:10:36,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:36,175 INFO L225 Difference]: With dead ends: 3038 [2024-11-20 00:10:36,175 INFO L226 Difference]: Without dead ends: 2628 [2024-11-20 00:10:36,177 INFO L431 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-20 00:10:36,177 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 1225 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:36,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 1062 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 00:10:36,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2628 states. [2024-11-20 00:10:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2628 to 2475. [2024-11-20 00:10:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2475 states, 2062 states have (on average 1.2211445198836082) internal successors, (2518), 2081 states have internal predecessors, (2518), 208 states have call successors, (208), 149 states have call predecessors, (208), 203 states have return successors, (293), 245 states have call predecessors, (293), 207 states have call successors, (293) [2024-11-20 00:10:36,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3019 transitions. [2024-11-20 00:10:36,564 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3019 transitions. Word has length 189 [2024-11-20 00:10:36,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:36,565 INFO L471 AbstractCegarLoop]: Abstraction has 2475 states and 3019 transitions. [2024-11-20 00:10:36,565 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3019 transitions. [2024-11-20 00:10:36,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-20 00:10:36,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:36,568 INFO L215 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] [2024-11-20 00:10:36,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 00:10:36,568 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:36,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:36,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1797913783, now seen corresponding path program 1 times [2024-11-20 00:10:36,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:36,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772053606] [2024-11-20 00:10:36,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:36,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:36,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:36,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:10:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:36,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:36,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:10:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:36,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:10:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:36,765 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-20 00:10:36,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:36,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772053606] [2024-11-20 00:10:36,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772053606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:36,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:36,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:10:36,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268473751] [2024-11-20 00:10:36,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:36,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:10:36,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:36,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:10:36,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:10:36,767 INFO L87 Difference]: Start difference. First operand 2475 states and 3019 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:39,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:39,058 INFO L93 Difference]: Finished difference Result 3030 states and 3909 transitions. [2024-11-20 00:10:39,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:10:39,059 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2024-11-20 00:10:39,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:39,076 INFO L225 Difference]: With dead ends: 3030 [2024-11-20 00:10:39,077 INFO L226 Difference]: Without dead ends: 2628 [2024-11-20 00:10:39,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:10:39,079 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 1216 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:39,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 1060 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 00:10:39,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2628 states. [2024-11-20 00:10:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2628 to 2475. [2024-11-20 00:10:39,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2475 states, 2062 states have (on average 1.2206595538312317) internal successors, (2517), 2081 states have internal predecessors, (2517), 208 states have call successors, (208), 149 states have call predecessors, (208), 203 states have return successors, (293), 245 states have call predecessors, (293), 207 states have call successors, (293) [2024-11-20 00:10:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3018 transitions. [2024-11-20 00:10:39,505 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3018 transitions. Word has length 189 [2024-11-20 00:10:39,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:39,506 INFO L471 AbstractCegarLoop]: Abstraction has 2475 states and 3018 transitions. [2024-11-20 00:10:39,506 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:39,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3018 transitions. [2024-11-20 00:10:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-20 00:10:39,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:39,510 INFO L215 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] [2024-11-20 00:10:39,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 00:10:39,511 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:39,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:39,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1969659463, now seen corresponding path program 1 times [2024-11-20 00:10:39,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:39,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724313654] [2024-11-20 00:10:39,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:39,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:39,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:39,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:10:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:39,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:39,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:10:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:39,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:10:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:39,765 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-20 00:10:39,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:39,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724313654] [2024-11-20 00:10:39,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724313654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:39,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:39,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:10:39,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515919766] [2024-11-20 00:10:39,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:39,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:10:39,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:39,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:10:39,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:10:39,768 INFO L87 Difference]: Start difference. First operand 2475 states and 3018 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:43,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:43,078 INFO L93 Difference]: Finished difference Result 3591 states and 4813 transitions. [2024-11-20 00:10:43,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:10:43,078 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2024-11-20 00:10:43,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:43,090 INFO L225 Difference]: With dead ends: 3591 [2024-11-20 00:10:43,090 INFO L226 Difference]: Without dead ends: 3196 [2024-11-20 00:10:43,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:10:43,092 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 1904 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 2593 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1934 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 2739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:43,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1934 Valid, 1626 Invalid, 2739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2593 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-20 00:10:43,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states. [2024-11-20 00:10:43,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 2891. [2024-11-20 00:10:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2891 states, 2449 states have (on average 1.2772560228664762) internal successors, (3128), 2469 states have internal predecessors, (3128), 230 states have call successors, (230), 155 states have call predecessors, (230), 210 states have return successors, (318), 267 states have call predecessors, (318), 229 states have call successors, (318) [2024-11-20 00:10:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2891 states to 2891 states and 3676 transitions. [2024-11-20 00:10:43,447 INFO L78 Accepts]: Start accepts. Automaton has 2891 states and 3676 transitions. Word has length 189 [2024-11-20 00:10:43,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:43,447 INFO L471 AbstractCegarLoop]: Abstraction has 2891 states and 3676 transitions. [2024-11-20 00:10:43,447 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 3676 transitions. [2024-11-20 00:10:43,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-20 00:10:43,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:43,450 INFO L215 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] [2024-11-20 00:10:43,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 00:10:43,450 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:43,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:43,451 INFO L85 PathProgramCache]: Analyzing trace with hash -306679349, now seen corresponding path program 1 times [2024-11-20 00:10:43,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:43,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660747499] [2024-11-20 00:10:43,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:43,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:43,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:43,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:10:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:43,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:43,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:10:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:43,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:10:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:43,751 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-20 00:10:43,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:43,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660747499] [2024-11-20 00:10:43,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660747499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:43,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:43,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:43,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951819740] [2024-11-20 00:10:43,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:43,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:43,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:43,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:43,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:43,754 INFO L87 Difference]: Start difference. First operand 2891 states and 3676 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:47,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:47,962 INFO L93 Difference]: Finished difference Result 4597 states and 6424 transitions. [2024-11-20 00:10:47,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:10:47,963 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2024-11-20 00:10:47,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:47,980 INFO L225 Difference]: With dead ends: 4597 [2024-11-20 00:10:47,980 INFO L226 Difference]: Without dead ends: 3786 [2024-11-20 00:10:47,983 INFO L431 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-20 00:10:47,984 INFO L432 NwaCegarLoop]: 677 mSDtfsCounter, 1941 mSDsluCounter, 2331 mSDsCounter, 0 mSdLazyCounter, 4089 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1971 SdHoareTripleChecker+Valid, 3008 SdHoareTripleChecker+Invalid, 4186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 4089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:47,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1971 Valid, 3008 Invalid, 4186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 4089 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-20 00:10:47,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2024-11-20 00:10:48,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3278. [2024-11-20 00:10:48,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 2807 states have (on average 1.3113644460277876) internal successors, (3681), 2828 states have internal predecessors, (3681), 252 states have call successors, (252), 161 states have call predecessors, (252), 217 states have return successors, (342), 290 states have call predecessors, (342), 251 states have call successors, (342) [2024-11-20 00:10:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 4275 transitions. [2024-11-20 00:10:48,458 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 4275 transitions. Word has length 189 [2024-11-20 00:10:48,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:48,458 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 4275 transitions. [2024-11-20 00:10:48,459 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:48,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 4275 transitions. [2024-11-20 00:10:48,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-20 00:10:48,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:48,462 INFO L215 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] [2024-11-20 00:10:48,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 00:10:48,462 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:48,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:48,463 INFO L85 PathProgramCache]: Analyzing trace with hash -2031287671, now seen corresponding path program 1 times [2024-11-20 00:10:48,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:48,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643048977] [2024-11-20 00:10:48,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:48,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:48,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:48,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:10:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:48,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:48,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:10:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:48,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:10:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:48,738 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-20 00:10:48,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:48,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643048977] [2024-11-20 00:10:48,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643048977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:48,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:48,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:48,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634854972] [2024-11-20 00:10:48,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:48,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:48,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:48,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:48,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:48,739 INFO L87 Difference]: Start difference. First operand 3278 states and 4275 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:53,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:53,045 INFO L93 Difference]: Finished difference Result 6081 states and 8779 transitions. [2024-11-20 00:10:53,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:10:53,046 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2024-11-20 00:10:53,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:53,066 INFO L225 Difference]: With dead ends: 6081 [2024-11-20 00:10:53,067 INFO L226 Difference]: Without dead ends: 4883 [2024-11-20 00:10:53,072 INFO L431 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-20 00:10:53,073 INFO L432 NwaCegarLoop]: 675 mSDtfsCounter, 1939 mSDsluCounter, 2331 mSDsCounter, 0 mSdLazyCounter, 4085 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1969 SdHoareTripleChecker+Valid, 3006 SdHoareTripleChecker+Invalid, 4184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 4085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:53,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1969 Valid, 3006 Invalid, 4184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 4085 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-20 00:10:53,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2024-11-20 00:10:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 4053. [2024-11-20 00:10:53,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4053 states, 3524 states have (on average 1.358683314415437) internal successors, (4788), 3547 states have internal predecessors, (4788), 296 states have call successors, (296), 173 states have call predecessors, (296), 231 states have return successors, (394), 336 states have call predecessors, (394), 295 states have call successors, (394) [2024-11-20 00:10:53,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 5478 transitions. [2024-11-20 00:10:53,513 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 5478 transitions. Word has length 189 [2024-11-20 00:10:53,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:53,514 INFO L471 AbstractCegarLoop]: Abstraction has 4053 states and 5478 transitions. [2024-11-20 00:10:53,514 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:53,514 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 5478 transitions. [2024-11-20 00:10:53,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-20 00:10:53,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:53,517 INFO L215 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] [2024-11-20 00:10:53,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 00:10:53,518 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:53,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:53,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1532730869, now seen corresponding path program 1 times [2024-11-20 00:10:53,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:53,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372783682] [2024-11-20 00:10:53,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:53,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:53,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:53,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:10:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:53,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:53,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:10:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:53,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:10:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:53,776 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-20 00:10:53,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:53,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372783682] [2024-11-20 00:10:53,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372783682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:53,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:53,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:53,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305996778] [2024-11-20 00:10:53,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:53,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:53,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:53,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:53,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:53,779 INFO L87 Difference]: Start difference. First operand 4053 states and 5478 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:56,190 INFO L93 Difference]: Finished difference Result 6846 states and 9975 transitions. [2024-11-20 00:10:56,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:10:56,191 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2024-11-20 00:10:56,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:56,211 INFO L225 Difference]: With dead ends: 6846 [2024-11-20 00:10:56,212 INFO L226 Difference]: Without dead ends: 4873 [2024-11-20 00:10:56,216 INFO L431 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-20 00:10:56,217 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 1543 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 2010 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 2112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:56,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1574 Valid, 1649 Invalid, 2112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2010 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 00:10:56,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2024-11-20 00:10:56,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4053. [2024-11-20 00:10:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4053 states, 3524 states have (on average 1.3572644721906924) internal successors, (4783), 3547 states have internal predecessors, (4783), 296 states have call successors, (296), 173 states have call predecessors, (296), 231 states have return successors, (394), 336 states have call predecessors, (394), 295 states have call successors, (394) [2024-11-20 00:10:56,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 5473 transitions. [2024-11-20 00:10:56,682 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 5473 transitions. Word has length 189 [2024-11-20 00:10:56,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:56,683 INFO L471 AbstractCegarLoop]: Abstraction has 4053 states and 5473 transitions. [2024-11-20 00:10:56,683 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 5473 transitions. [2024-11-20 00:10:56,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-20 00:10:56,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:56,685 INFO L215 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] [2024-11-20 00:10:56,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 00:10:56,686 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:56,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:56,686 INFO L85 PathProgramCache]: Analyzing trace with hash -962459063, now seen corresponding path program 1 times [2024-11-20 00:10:56,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:56,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605989934] [2024-11-20 00:10:56,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:56,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:10:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:10:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:10:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,937 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-20 00:10:56,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:56,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605989934] [2024-11-20 00:10:56,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605989934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:56,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:56,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:56,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166857822] [2024-11-20 00:10:56,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:56,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:56,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:56,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:56,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:56,938 INFO L87 Difference]: Start difference. First operand 4053 states and 5473 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:59,045 INFO L93 Difference]: Finished difference Result 6840 states and 9949 transitions. [2024-11-20 00:10:59,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:10:59,045 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2024-11-20 00:10:59,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:59,064 INFO L225 Difference]: With dead ends: 6840 [2024-11-20 00:10:59,064 INFO L226 Difference]: Without dead ends: 4867 [2024-11-20 00:10:59,069 INFO L431 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-20 00:10:59,069 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 1678 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1948 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 2091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:59,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 1378 Invalid, 2091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1948 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 00:10:59,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4867 states. [2024-11-20 00:10:59,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4867 to 4053. [2024-11-20 00:10:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4053 states, 3524 states have (on average 1.3558456299659478) internal successors, (4778), 3547 states have internal predecessors, (4778), 296 states have call successors, (296), 173 states have call predecessors, (296), 231 states have return successors, (394), 336 states have call predecessors, (394), 295 states have call successors, (394) [2024-11-20 00:10:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 5468 transitions. [2024-11-20 00:10:59,565 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 5468 transitions. Word has length 189 [2024-11-20 00:10:59,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:59,565 INFO L471 AbstractCegarLoop]: Abstraction has 4053 states and 5468 transitions. [2024-11-20 00:10:59,565 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 5468 transitions. [2024-11-20 00:10:59,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-20 00:10:59,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:59,567 INFO L215 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] [2024-11-20 00:10:59,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 00:10:59,567 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:59,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:59,568 INFO L85 PathProgramCache]: Analyzing trace with hash 441410123, now seen corresponding path program 1 times [2024-11-20 00:10:59,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:59,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186172077] [2024-11-20 00:10:59,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:59,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:59,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:59,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:10:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:59,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:59,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:10:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:59,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:10:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:59,814 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-20 00:10:59,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:59,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186172077] [2024-11-20 00:10:59,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186172077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:59,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:59,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:59,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603222394] [2024-11-20 00:10:59,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:59,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:59,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:59,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:59,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:59,817 INFO L87 Difference]: Start difference. First operand 4053 states and 5468 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:11:01,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:01,913 INFO L93 Difference]: Finished difference Result 6828 states and 9911 transitions. [2024-11-20 00:11:01,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:11:01,914 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2024-11-20 00:11:01,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:01,935 INFO L225 Difference]: With dead ends: 6828 [2024-11-20 00:11:01,935 INFO L226 Difference]: Without dead ends: 4855 [2024-11-20 00:11:01,941 INFO L431 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-20 00:11:01,942 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 1674 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:01,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 1378 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1928 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 00:11:01,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4855 states. [2024-11-20 00:11:02,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4855 to 4053. [2024-11-20 00:11:02,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4053 states, 3524 states have (on average 1.3544267877412033) internal successors, (4773), 3547 states have internal predecessors, (4773), 296 states have call successors, (296), 173 states have call predecessors, (296), 231 states have return successors, (394), 336 states have call predecessors, (394), 295 states have call successors, (394) [2024-11-20 00:11:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 5463 transitions. [2024-11-20 00:11:02,442 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 5463 transitions. Word has length 189 [2024-11-20 00:11:02,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:02,443 INFO L471 AbstractCegarLoop]: Abstraction has 4053 states and 5463 transitions. [2024-11-20 00:11:02,443 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:11:02,443 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 5463 transitions. [2024-11-20 00:11:02,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-20 00:11:02,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:02,445 INFO L215 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] [2024-11-20 00:11:02,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 00:11:02,445 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:02,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:02,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1108792013, now seen corresponding path program 1 times [2024-11-20 00:11:02,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:02,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540140090] [2024-11-20 00:11:02,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:02,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:02,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:02,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:11:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:02,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:02,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:11:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:02,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:11:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:02,717 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-20 00:11:02,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:02,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540140090] [2024-11-20 00:11:02,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540140090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:02,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:02,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:02,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805518863] [2024-11-20 00:11:02,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:02,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:02,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:02,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:02,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:02,720 INFO L87 Difference]: Start difference. First operand 4053 states and 5463 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)