./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_3.cil+token_ring.08.cil-1.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_3.cil+token_ring.08.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5202e6cfdb0072b2d97423b078e60556fe6d43d8002548ceef037df7f02499eb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 00:11:28,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 00:11:28,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 00:11:28,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 00:11:28,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 00:11:28,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 00:11:28,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 00:11:28,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 00:11:28,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 00:11:28,748 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 00:11:28,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 00:11:28,748 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 00:11:28,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 00:11:28,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 00:11:28,749 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 00:11:28,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 00:11:28,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 00:11:28,750 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 00:11:28,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 00:11:28,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 00:11:28,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 00:11:28,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 00:11:28,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 00:11:28,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 00:11:28,752 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 00:11:28,752 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 00:11:28,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 00:11:28,753 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 00:11:28,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 00:11:28,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 00:11:28,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 00:11:28,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 00:11:28,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:11:28,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 00:11:28,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 00:11:28,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 00:11:28,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 00:11:28,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 00:11:28,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 00:11:28,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 00:11:28,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 00:11:28,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 00:11:28,757 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 -> 5202e6cfdb0072b2d97423b078e60556fe6d43d8002548ceef037df7f02499eb [2024-11-20 00:11:28,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 00:11:28,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 00:11:28,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 00:11:28,958 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 00:11:28,958 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 00:11:28,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c [2024-11-20 00:11:30,209 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 00:11:30,385 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 00:11:30,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c [2024-11-20 00:11:30,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82c2cbbd/4e2d455a995c4015920d94025ddcceb0/FLAG95797f38d [2024-11-20 00:11:30,411 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82c2cbbd/4e2d455a995c4015920d94025ddcceb0 [2024-11-20 00:11:30,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 00:11:30,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 00:11:30,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 00:11:30,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 00:11:30,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 00:11:30,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:11:30" (1/1) ... [2024-11-20 00:11:30,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f019644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:30, skipping insertion in model container [2024-11-20 00:11:30,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:11:30" (1/1) ... [2024-11-20 00:11:30,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 00:11:30,683 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_3.cil+token_ring.08.cil-1.c[911,924] [2024-11-20 00:11:30,742 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_3.cil+token_ring.08.cil-1.c[8416,8429] [2024-11-20 00:11:30,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:11:30,795 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 00:11:30,808 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_3.cil+token_ring.08.cil-1.c[911,924] [2024-11-20 00:11:30,833 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_3.cil+token_ring.08.cil-1.c[8416,8429] [2024-11-20 00:11:30,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:11:30,883 INFO L204 MainTranslator]: Completed translation [2024-11-20 00:11:30,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:30 WrapperNode [2024-11-20 00:11:30,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 00:11:30,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 00:11:30,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 00:11:30,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 00:11:30,892 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:11:30" (1/1) ... [2024-11-20 00:11:30,903 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:11:30" (1/1) ... [2024-11-20 00:11:30,941 INFO L138 Inliner]: procedures = 71, calls = 85, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 866 [2024-11-20 00:11:30,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 00:11:30,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 00:11:30,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 00:11:30,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 00:11:30,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:30" (1/1) ... [2024-11-20 00:11:30,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:30" (1/1) ... [2024-11-20 00:11:30,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:30" (1/1) ... [2024-11-20 00:11:30,976 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:11:30,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:30" (1/1) ... [2024-11-20 00:11:30,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:30" (1/1) ... [2024-11-20 00:11:30,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:30" (1/1) ... [2024-11-20 00:11:30,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:30" (1/1) ... [2024-11-20 00:11:30,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:30" (1/1) ... [2024-11-20 00:11:30,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:30" (1/1) ... [2024-11-20 00:11:31,003 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 00:11:31,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 00:11:31,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 00:11:31,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 00:11:31,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:30" (1/1) ... [2024-11-20 00:11:31,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:11:31,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:11:31,050 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:11:31,056 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:11:31,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 00:11:31,098 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-20 00:11:31,098 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-20 00:11:31,098 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-20 00:11:31,099 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-20 00:11:31,100 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-20 00:11:31,100 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-20 00:11:31,100 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-20 00:11:31,100 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-20 00:11:31,100 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-20 00:11:31,100 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-20 00:11:31,100 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-20 00:11:31,101 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-20 00:11:31,101 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-20 00:11:31,101 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-20 00:11:31,101 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-20 00:11:31,101 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-20 00:11:31,101 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-20 00:11:31,101 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-20 00:11:31,102 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-20 00:11:31,102 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-20 00:11:31,102 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-20 00:11:31,102 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-20 00:11:31,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 00:11:31,103 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-20 00:11:31,103 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-20 00:11:31,103 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-20 00:11:31,103 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-20 00:11:31,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 00:11:31,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 00:11:31,103 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-20 00:11:31,103 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-20 00:11:31,221 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 00:11:31,223 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 00:11:31,754 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-11-20 00:11:31,754 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-11-20 00:11:31,889 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-20 00:11:31,890 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 00:11:31,917 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 00:11:31,917 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-20 00:11:31,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:11:31 BoogieIcfgContainer [2024-11-20 00:11:31,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 00:11:31,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 00:11:31,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 00:11:31,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 00:11:31,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:11:30" (1/3) ... [2024-11-20 00:11:31,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2daeb1d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:11:31, skipping insertion in model container [2024-11-20 00:11:31,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:30" (2/3) ... [2024-11-20 00:11:31,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2daeb1d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:11:31, skipping insertion in model container [2024-11-20 00:11:31,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:11:31" (3/3) ... [2024-11-20 00:11:31,928 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.08.cil-1.c [2024-11-20 00:11:31,944 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 00:11:31,945 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 00:11:32,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 00:11:32,017 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;@5cf5056a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 00:11:32,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 00:11:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 408 states, 353 states have (on average 1.6033994334277621) internal successors, (566), 359 states have internal predecessors, (566), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-20 00:11:32,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:11:32,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:32,032 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:11:32,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:32,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:32,037 INFO L85 PathProgramCache]: Analyzing trace with hash -462714198, now seen corresponding path program 1 times [2024-11-20 00:11:32,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:32,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107119471] [2024-11-20 00:11:32,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:32,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:32,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:32,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:32,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:11:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:32,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:11:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:32,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:11:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:32,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:11:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:32,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:11:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:32,454 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:32,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:32,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107119471] [2024-11-20 00:11:32,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107119471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:32,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:32,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:11:32,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949559446] [2024-11-20 00:11:32,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:32,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:11:32,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:32,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:11:32,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:32,485 INFO L87 Difference]: Start difference. First operand has 408 states, 353 states have (on average 1.6033994334277621) internal successors, (566), 359 states have internal predecessors, (566), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) 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:11:33,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:33,639 INFO L93 Difference]: Finished difference Result 943 states and 1479 transitions. [2024-11-20 00:11:33,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:11:33,642 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:11:33,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:33,653 INFO L225 Difference]: With dead ends: 943 [2024-11-20 00:11:33,653 INFO L226 Difference]: Without dead ends: 549 [2024-11-20 00:11:33,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:11:33,664 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 1054 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:33,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 1797 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 00:11:33,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-11-20 00:11:33,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 510. [2024-11-20 00:11:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 435 states have (on average 1.4965517241379311) internal successors, (651), 441 states have internal predecessors, (651), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2024-11-20 00:11:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 756 transitions. [2024-11-20 00:11:33,745 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 756 transitions. Word has length 65 [2024-11-20 00:11:33,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:33,746 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 756 transitions. [2024-11-20 00:11:33,747 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:11:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 756 transitions. [2024-11-20 00:11:33,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:11:33,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:33,752 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:11:33,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 00:11:33,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:33,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:33,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1216174442, now seen corresponding path program 1 times [2024-11-20 00:11:33,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:33,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145174845] [2024-11-20 00:11:33,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:33,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:11:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:11:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:11:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:11:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:11:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:33,946 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:33,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:33,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145174845] [2024-11-20 00:11:33,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145174845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:33,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:33,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:11:33,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534831242] [2024-11-20 00:11:33,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:33,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:11:33,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:33,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:11:33,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:33,954 INFO L87 Difference]: Start difference. First operand 510 states and 756 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:11:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:35,145 INFO L93 Difference]: Finished difference Result 907 states and 1322 transitions. [2024-11-20 00:11:35,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 00:11:35,146 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:11:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:35,150 INFO L225 Difference]: With dead ends: 907 [2024-11-20 00:11:35,150 INFO L226 Difference]: Without dead ends: 698 [2024-11-20 00:11:35,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-20 00:11:35,152 INFO L432 NwaCegarLoop]: 403 mSDtfsCounter, 1158 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:35,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 2134 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 00:11:35,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-20 00:11:35,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 622. [2024-11-20 00:11:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 525 states have (on average 1.48) internal successors, (777), 533 states have internal predecessors, (777), 64 states have call successors, (64), 28 states have call predecessors, (64), 31 states have return successors, (75), 64 states have call predecessors, (75), 62 states have call successors, (75) [2024-11-20 00:11:35,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 916 transitions. [2024-11-20 00:11:35,195 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 916 transitions. Word has length 65 [2024-11-20 00:11:35,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:35,195 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 916 transitions. [2024-11-20 00:11:35,195 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:11:35,195 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 916 transitions. [2024-11-20 00:11:35,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:11:35,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:35,200 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:11:35,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 00:11:35,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:35,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:35,201 INFO L85 PathProgramCache]: Analyzing trace with hash -812411668, now seen corresponding path program 1 times [2024-11-20 00:11:35,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:35,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887690668] [2024-11-20 00:11:35,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:35,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:35,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:35,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:35,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:11:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:35,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:11:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:35,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:11:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:35,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:11:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:35,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:11:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:11:35,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:35,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887690668] [2024-11-20 00:11:35,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887690668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:35,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:35,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:35,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130043924] [2024-11-20 00:11:35,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:35,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:35,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:35,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:35,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:35,302 INFO L87 Difference]: Start difference. First operand 622 states and 916 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), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:11:36,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:36,060 INFO L93 Difference]: Finished difference Result 1294 states and 1858 transitions. [2024-11-20 00:11:36,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 00:11:36,061 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), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-11-20 00:11:36,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:36,066 INFO L225 Difference]: With dead ends: 1294 [2024-11-20 00:11:36,066 INFO L226 Difference]: Without dead ends: 979 [2024-11-20 00:11:36,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-20 00:11:36,068 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 1269 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:36,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 1667 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:11:36,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-11-20 00:11:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 903. [2024-11-20 00:11:36,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 751 states have (on average 1.4434087882822904) internal successors, (1084), 763 states have internal predecessors, (1084), 94 states have call successors, (94), 49 states have call predecessors, (94), 56 states have return successors, (113), 94 states have call predecessors, (113), 92 states have call successors, (113) [2024-11-20 00:11:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1291 transitions. [2024-11-20 00:11:36,127 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1291 transitions. Word has length 65 [2024-11-20 00:11:36,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:36,127 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1291 transitions. [2024-11-20 00:11:36,127 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), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:11:36,128 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1291 transitions. [2024-11-20 00:11:36,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 00:11:36,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:36,130 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:11:36,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 00:11:36,132 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:36,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash 494446571, now seen corresponding path program 1 times [2024-11-20 00:11:36,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:36,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582015556] [2024-11-20 00:11:36,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:36,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:11:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:11:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:11:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 00:11:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:11:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:36,295 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:36,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:36,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582015556] [2024-11-20 00:11:36,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582015556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:36,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:36,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:11:36,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123916051] [2024-11-20 00:11:36,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:36,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:11:36,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:36,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:11:36,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:11:36,298 INFO L87 Difference]: Start difference. First operand 903 states and 1291 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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:11:37,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:37,304 INFO L93 Difference]: Finished difference Result 1571 states and 2218 transitions. [2024-11-20 00:11:37,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:11:37,304 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2024-11-20 00:11:37,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:37,310 INFO L225 Difference]: With dead ends: 1571 [2024-11-20 00:11:37,310 INFO L226 Difference]: Without dead ends: 975 [2024-11-20 00:11:37,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-20 00:11:37,313 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 504 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:37,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 2410 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1633 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 00:11:37,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-11-20 00:11:37,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 918. [2024-11-20 00:11:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 763 states have (on average 1.432503276539974) internal successors, (1093), 775 states have internal predecessors, (1093), 94 states have call successors, (94), 49 states have call predecessors, (94), 59 states have return successors, (116), 97 states have call predecessors, (116), 92 states have call successors, (116) [2024-11-20 00:11:37,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1303 transitions. [2024-11-20 00:11:37,399 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1303 transitions. Word has length 66 [2024-11-20 00:11:37,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:37,400 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1303 transitions. [2024-11-20 00:11:37,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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:11:37,400 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1303 transitions. [2024-11-20 00:11:37,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 00:11:37,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:37,402 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:11:37,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 00:11:37,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:37,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:37,403 INFO L85 PathProgramCache]: Analyzing trace with hash -534912727, now seen corresponding path program 1 times [2024-11-20 00:11:37,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:37,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250824314] [2024-11-20 00:11:37,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:37,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:37,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:37,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:37,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:11:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:37,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:11:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:37,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:11:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:37,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 00:11:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:37,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:11:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:37,529 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:37,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:37,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250824314] [2024-11-20 00:11:37,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250824314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:37,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:37,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:11:37,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054285618] [2024-11-20 00:11:37,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:37,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:11:37,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:37,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:11:37,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:11:37,531 INFO L87 Difference]: Start difference. First operand 918 states and 1303 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 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:11:39,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:39,173 INFO L93 Difference]: Finished difference Result 3123 states and 4424 transitions. [2024-11-20 00:11:39,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-20 00:11:39,173 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 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 66 [2024-11-20 00:11:39,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:39,179 INFO L225 Difference]: With dead ends: 3123 [2024-11-20 00:11:39,179 INFO L226 Difference]: Without dead ends: 1281 [2024-11-20 00:11:39,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-20 00:11:39,184 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 2384 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 2102 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2401 SdHoareTripleChecker+Valid, 2109 SdHoareTripleChecker+Invalid, 2503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 2102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:39,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2401 Valid, 2109 Invalid, 2503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 2102 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:11:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2024-11-20 00:11:39,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1126. [2024-11-20 00:11:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 915 states have (on average 1.3956284153005465) internal successors, (1277), 931 states have internal predecessors, (1277), 124 states have call successors, (124), 70 states have call predecessors, (124), 85 states have return successors, (165), 128 states have call predecessors, (165), 122 states have call successors, (165) [2024-11-20 00:11:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1566 transitions. [2024-11-20 00:11:39,249 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1566 transitions. Word has length 66 [2024-11-20 00:11:39,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:39,250 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1566 transitions. [2024-11-20 00:11:39,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 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:11:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1566 transitions. [2024-11-20 00:11:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 00:11:39,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:39,251 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] [2024-11-20 00:11:39,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 00:11:39,252 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:39,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:39,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1164222712, now seen corresponding path program 1 times [2024-11-20 00:11:39,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:39,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370285367] [2024-11-20 00:11:39,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:39,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:39,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:39,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:11:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:39,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:11:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:39,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:11:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:39,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 00:11:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:39,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 00:11:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:39,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 00:11:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:39,367 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:39,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:39,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370285367] [2024-11-20 00:11:39,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370285367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:39,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:39,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:11:39,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524469157] [2024-11-20 00:11:39,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:39,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:11:39,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:39,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:11:39,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:11:39,371 INFO L87 Difference]: Start difference. First operand 1126 states and 1566 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:11:40,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:40,310 INFO L93 Difference]: Finished difference Result 2311 states and 3191 transitions. [2024-11-20 00:11:40,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 00:11:40,311 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 67 [2024-11-20 00:11:40,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:40,313 INFO L225 Difference]: With dead ends: 2311 [2024-11-20 00:11:40,313 INFO L226 Difference]: Without dead ends: 287 [2024-11-20 00:11:40,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-11-20 00:11:40,317 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 1313 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:40,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 2006 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:11:40,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-20 00:11:40,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-11-20 00:11:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 258 states have (on average 1.5387596899224807) internal successors, (397), 259 states have internal predecessors, (397), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 00:11:40,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 441 transitions. [2024-11-20 00:11:40,325 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 441 transitions. Word has length 67 [2024-11-20 00:11:40,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:40,325 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 441 transitions. [2024-11-20 00:11:40,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:11:40,327 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 441 transitions. [2024-11-20 00:11:40,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 00:11:40,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:40,328 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] [2024-11-20 00:11:40,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 00:11:40,328 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:40,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:40,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1987291879, now seen corresponding path program 1 times [2024-11-20 00:11:40,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:40,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995270967] [2024-11-20 00:11:40,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:40,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:11:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:11:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:11:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:11:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:40,431 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:40,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:40,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995270967] [2024-11-20 00:11:40,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995270967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:40,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:40,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:11:40,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170767234] [2024-11-20 00:11:40,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:40,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:11:40,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:40,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:11:40,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:11:40,433 INFO L87 Difference]: Start difference. First operand 287 states and 441 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 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:11:41,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:41,235 INFO L93 Difference]: Finished difference Result 663 states and 1038 transitions. [2024-11-20 00:11:41,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 00:11:41,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 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 134 [2024-11-20 00:11:41,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:41,238 INFO L225 Difference]: With dead ends: 663 [2024-11-20 00:11:41,238 INFO L226 Difference]: Without dead ends: 385 [2024-11-20 00:11:41,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:11:41,241 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 741 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:41,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 571 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:11:41,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-20 00:11:41,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 287. [2024-11-20 00:11:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 258 states have (on average 1.5348837209302326) internal successors, (396), 259 states have internal predecessors, (396), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 00:11:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 440 transitions. [2024-11-20 00:11:41,254 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 440 transitions. Word has length 134 [2024-11-20 00:11:41,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:41,254 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 440 transitions. [2024-11-20 00:11:41,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 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:11:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 440 transitions. [2024-11-20 00:11:41,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 00:11:41,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:41,255 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] [2024-11-20 00:11:41,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 00:11:41,256 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:41,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:41,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1360637531, now seen corresponding path program 1 times [2024-11-20 00:11:41,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:41,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705216045] [2024-11-20 00:11:41,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:41,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:41,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:41,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:11:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:41,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:11:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:41,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:11:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:41,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:11:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:41,410 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:41,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:41,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705216045] [2024-11-20 00:11:41,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705216045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:41,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:41,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:11:41,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098015418] [2024-11-20 00:11:41,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:41,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:11:41,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:41,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:11:41,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:11:41,413 INFO L87 Difference]: Start difference. First operand 287 states and 440 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 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:42,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:42,913 INFO L93 Difference]: Finished difference Result 1033 states and 1625 transitions. [2024-11-20 00:11:42,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:11:42,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 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 134 [2024-11-20 00:11:42,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:42,917 INFO L225 Difference]: With dead ends: 1033 [2024-11-20 00:11:42,917 INFO L226 Difference]: Without dead ends: 763 [2024-11-20 00:11:42,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:11:42,918 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 1110 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:42,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 974 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:11:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2024-11-20 00:11:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 568. [2024-11-20 00:11:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 515 states have (on average 1.5475728155339805) internal successors, (797), 517 states have internal predecessors, (797), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-11-20 00:11:42,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 878 transitions. [2024-11-20 00:11:42,941 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 878 transitions. Word has length 134 [2024-11-20 00:11:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:42,941 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 878 transitions. [2024-11-20 00:11:42,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 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:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 878 transitions. [2024-11-20 00:11:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 00:11:42,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:42,942 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] [2024-11-20 00:11:42,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 00:11:42,943 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:42,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:42,943 INFO L85 PathProgramCache]: Analyzing trace with hash -345866017, now seen corresponding path program 1 times [2024-11-20 00:11:42,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:42,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486596902] [2024-11-20 00:11:42,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:42,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:42,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:43,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:11:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:43,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:11:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:43,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:11:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:43,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:11:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:43,120 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:43,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486596902] [2024-11-20 00:11:43,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486596902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:43,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:43,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:43,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308304118] [2024-11-20 00:11:43,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:43,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:43,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:43,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:43,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:43,123 INFO L87 Difference]: Start difference. First operand 568 states and 878 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:45,124 INFO L93 Difference]: Finished difference Result 1704 states and 2681 transitions. [2024-11-20 00:11:45,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:11:45,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-20 00:11:45,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:45,129 INFO L225 Difference]: With dead ends: 1704 [2024-11-20 00:11:45,129 INFO L226 Difference]: Without dead ends: 1153 [2024-11-20 00:11:45,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:11:45,130 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 1127 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 2538 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:45,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 1871 Invalid, 2591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2538 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 00:11:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-11-20 00:11:45,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 830. [2024-11-20 00:11:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 753 states have (on average 1.5405046480743692) internal successors, (1160), 756 states have internal predecessors, (1160), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-11-20 00:11:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1277 transitions. [2024-11-20 00:11:45,165 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1277 transitions. Word has length 134 [2024-11-20 00:11:45,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:45,165 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1277 transitions. [2024-11-20 00:11:45,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1277 transitions. [2024-11-20 00:11:45,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 00:11:45,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:45,166 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] [2024-11-20 00:11:45,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 00:11:45,166 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:45,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:45,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1656020253, now seen corresponding path program 1 times [2024-11-20 00:11:45,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:45,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094340953] [2024-11-20 00:11:45,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:45,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:45,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:45,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:11:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:45,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:11:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:45,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:11:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:45,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:11:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:45,362 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:45,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:45,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094340953] [2024-11-20 00:11:45,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094340953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:45,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:45,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:45,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750900526] [2024-11-20 00:11:45,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:45,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:45,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:45,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:45,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:45,364 INFO L87 Difference]: Start difference. First operand 830 states and 1277 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:47,392 INFO L93 Difference]: Finished difference Result 2693 states and 4226 transitions. [2024-11-20 00:11:47,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:11:47,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-20 00:11:47,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:47,400 INFO L225 Difference]: With dead ends: 2693 [2024-11-20 00:11:47,400 INFO L226 Difference]: Without dead ends: 1880 [2024-11-20 00:11:47,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:11:47,403 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 1131 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 2529 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 2584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:47,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 1869 Invalid, 2584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2529 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 00:11:47,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2024-11-20 00:11:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1355. [2024-11-20 00:11:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1230 states have (on average 1.5341463414634147) internal successors, (1887), 1235 states have internal predecessors, (1887), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-11-20 00:11:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 2080 transitions. [2024-11-20 00:11:47,491 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 2080 transitions. Word has length 134 [2024-11-20 00:11:47,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:47,491 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 2080 transitions. [2024-11-20 00:11:47,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:47,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2080 transitions. [2024-11-20 00:11:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 00:11:47,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:47,493 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] [2024-11-20 00:11:47,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 00:11:47,493 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:47,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:47,493 INFO L85 PathProgramCache]: Analyzing trace with hash -911802081, now seen corresponding path program 1 times [2024-11-20 00:11:47,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:47,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065537695] [2024-11-20 00:11:47,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:47,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:11:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:11:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:11:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:11:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:47,652 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:47,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:47,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065537695] [2024-11-20 00:11:47,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065537695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:47,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:47,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:47,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728885477] [2024-11-20 00:11:47,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:47,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:47,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:47,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:47,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:47,654 INFO L87 Difference]: Start difference. First operand 1355 states and 2080 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:49,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:49,829 INFO L93 Difference]: Finished difference Result 4595 states and 7181 transitions. [2024-11-20 00:11:49,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:11:49,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-20 00:11:49,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:49,855 INFO L225 Difference]: With dead ends: 4595 [2024-11-20 00:11:49,856 INFO L226 Difference]: Without dead ends: 3257 [2024-11-20 00:11:49,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:11:49,868 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 1127 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 2501 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:49,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 1869 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2501 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 00:11:49,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2024-11-20 00:11:50,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 2411. [2024-11-20 00:11:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2190 states have (on average 1.5301369863013699) internal successors, (3351), 2199 states have internal predecessors, (3351), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-11-20 00:11:50,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 3702 transitions. [2024-11-20 00:11:50,023 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 3702 transitions. Word has length 134 [2024-11-20 00:11:50,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:50,024 INFO L471 AbstractCegarLoop]: Abstraction has 2411 states and 3702 transitions. [2024-11-20 00:11:50,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:50,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 3702 transitions. [2024-11-20 00:11:50,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 00:11:50,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:50,026 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] [2024-11-20 00:11:50,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 00:11:50,026 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:50,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:50,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1735802273, now seen corresponding path program 1 times [2024-11-20 00:11:50,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:50,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514204463] [2024-11-20 00:11:50,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:50,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:11:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:11:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:11:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:11:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:50,202 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:50,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:50,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514204463] [2024-11-20 00:11:50,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514204463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:50,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:50,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:50,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946576851] [2024-11-20 00:11:50,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:50,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:50,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:50,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:50,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:50,204 INFO L87 Difference]: Start difference. First operand 2411 states and 3702 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:51,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:51,186 INFO L93 Difference]: Finished difference Result 5666 states and 8856 transitions. [2024-11-20 00:11:51,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:11:51,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-20 00:11:51,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:51,196 INFO L225 Difference]: With dead ends: 5666 [2024-11-20 00:11:51,196 INFO L226 Difference]: Without dead ends: 3272 [2024-11-20 00:11:51,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:11:51,201 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 989 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:51,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 790 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:11:51,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3272 states. [2024-11-20 00:11:51,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3272 to 2411. [2024-11-20 00:11:51,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2190 states have (on average 1.526027397260274) internal successors, (3342), 2199 states have internal predecessors, (3342), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-11-20 00:11:51,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 3693 transitions. [2024-11-20 00:11:51,336 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 3693 transitions. Word has length 134 [2024-11-20 00:11:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:51,337 INFO L471 AbstractCegarLoop]: Abstraction has 2411 states and 3693 transitions. [2024-11-20 00:11:51,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 3693 transitions. [2024-11-20 00:11:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 00:11:51,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:51,338 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] [2024-11-20 00:11:51,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 00:11:51,339 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:51,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:51,339 INFO L85 PathProgramCache]: Analyzing trace with hash -395548449, now seen corresponding path program 1 times [2024-11-20 00:11:51,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:51,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317431101] [2024-11-20 00:11:51,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:51,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:11:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:11:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:11:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:11:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:51,473 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:51,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:51,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317431101] [2024-11-20 00:11:51,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317431101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:51,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:51,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:51,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827954529] [2024-11-20 00:11:51,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:51,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:51,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:51,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:51,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:51,475 INFO L87 Difference]: Start difference. First operand 2411 states and 3693 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:52,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:52,579 INFO L93 Difference]: Finished difference Result 5656 states and 8809 transitions. [2024-11-20 00:11:52,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:11:52,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-20 00:11:52,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:52,591 INFO L225 Difference]: With dead ends: 5656 [2024-11-20 00:11:52,591 INFO L226 Difference]: Without dead ends: 3262 [2024-11-20 00:11:52,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:11:52,597 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 819 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:52,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 943 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 00:11:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2024-11-20 00:11:52,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 2411. [2024-11-20 00:11:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2190 states have (on average 1.521917808219178) internal successors, (3333), 2199 states have internal predecessors, (3333), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-11-20 00:11:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 3684 transitions. [2024-11-20 00:11:52,789 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 3684 transitions. Word has length 134 [2024-11-20 00:11:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:52,789 INFO L471 AbstractCegarLoop]: Abstraction has 2411 states and 3684 transitions. [2024-11-20 00:11:52,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 3684 transitions. [2024-11-20 00:11:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 00:11:52,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:52,792 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] [2024-11-20 00:11:52,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 00:11:52,793 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:52,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:52,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1434133023, now seen corresponding path program 1 times [2024-11-20 00:11:52,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:52,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585290218] [2024-11-20 00:11:52,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:52,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:11:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:11:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:11:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:11:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:52,953 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:52,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:52,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585290218] [2024-11-20 00:11:52,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585290218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:52,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:52,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:52,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658263598] [2024-11-20 00:11:52,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:52,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:52,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:52,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:52,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:52,955 INFO L87 Difference]: Start difference. First operand 2411 states and 3684 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:54,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:54,053 INFO L93 Difference]: Finished difference Result 5646 states and 8762 transitions. [2024-11-20 00:11:54,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:11:54,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-20 00:11:54,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:54,063 INFO L225 Difference]: With dead ends: 5646 [2024-11-20 00:11:54,063 INFO L226 Difference]: Without dead ends: 3252 [2024-11-20 00:11:54,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:11:54,067 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 817 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:54,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 943 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 00:11:54,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3252 states. [2024-11-20 00:11:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3252 to 2411. [2024-11-20 00:11:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2190 states have (on average 1.5178082191780822) internal successors, (3324), 2199 states have internal predecessors, (3324), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-11-20 00:11:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 3675 transitions. [2024-11-20 00:11:54,184 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 3675 transitions. Word has length 134 [2024-11-20 00:11:54,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:54,184 INFO L471 AbstractCegarLoop]: Abstraction has 2411 states and 3675 transitions. [2024-11-20 00:11:54,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:54,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 3675 transitions. [2024-11-20 00:11:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 00:11:54,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:54,186 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] [2024-11-20 00:11:54,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 00:11:54,186 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:54,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:54,186 INFO L85 PathProgramCache]: Analyzing trace with hash 887668895, now seen corresponding path program 1 times [2024-11-20 00:11:54,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:54,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369374279] [2024-11-20 00:11:54,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:54,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:11:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:11:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:11:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:11:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:54,318 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:54,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:54,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369374279] [2024-11-20 00:11:54,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369374279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:54,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:54,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:54,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719961724] [2024-11-20 00:11:54,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:54,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:54,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:54,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:54,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:54,320 INFO L87 Difference]: Start difference. First operand 2411 states and 3675 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:56,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:56,383 INFO L93 Difference]: Finished difference Result 8379 states and 12933 transitions. [2024-11-20 00:11:56,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:11:56,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-20 00:11:56,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:56,423 INFO L225 Difference]: With dead ends: 8379 [2024-11-20 00:11:56,425 INFO L226 Difference]: Without dead ends: 5985 [2024-11-20 00:11:56,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:11:56,432 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 1105 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 2413 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 2468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:56,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 1869 Invalid, 2468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2413 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 00:11:56,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5985 states. [2024-11-20 00:11:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5985 to 4555. [2024-11-20 00:11:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4555 states, 4142 states have (on average 1.5123128923225495) internal successors, (6264), 4159 states have internal predecessors, (6264), 294 states have call successors, (294), 102 states have call predecessors, (294), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-11-20 00:11:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4555 states to 4555 states and 6949 transitions. [2024-11-20 00:11:56,807 INFO L78 Accepts]: Start accepts. Automaton has 4555 states and 6949 transitions. Word has length 134 [2024-11-20 00:11:56,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:56,811 INFO L471 AbstractCegarLoop]: Abstraction has 4555 states and 6949 transitions. [2024-11-20 00:11:56,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6949 transitions. [2024-11-20 00:11:56,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 00:11:56,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:56,814 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] [2024-11-20 00:11:56,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 00:11:56,815 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:56,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:56,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1254191583, now seen corresponding path program 1 times [2024-11-20 00:11:56,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:56,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575847659] [2024-11-20 00:11:56,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:56,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:56,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:56,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:11:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:56,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:11:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:57,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:11:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:57,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:11:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:57,012 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:57,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:57,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575847659] [2024-11-20 00:11:57,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575847659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:57,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:57,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:57,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158193079] [2024-11-20 00:11:57,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:57,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:57,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:57,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:57,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:57,014 INFO L87 Difference]: Start difference. First operand 4555 states and 6949 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:59,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:59,835 INFO L93 Difference]: Finished difference Result 17945 states and 27687 transitions. [2024-11-20 00:11:59,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:11:59,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-20 00:11:59,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:59,865 INFO L225 Difference]: With dead ends: 17945 [2024-11-20 00:11:59,866 INFO L226 Difference]: Without dead ends: 13407 [2024-11-20 00:11:59,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:11:59,874 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 1187 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 2925 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 2982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:59,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 1859 Invalid, 2982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2925 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-20 00:11:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13407 states. [2024-11-20 00:12:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13407 to 8804. [2024-11-20 00:12:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8804 states, 8023 states have (on average 1.5109061448336034) internal successors, (12122), 8056 states have internal predecessors, (12122), 550 states have call successors, (550), 198 states have call predecessors, (550), 230 states have return successors, (825), 581 states have call predecessors, (825), 550 states have call successors, (825) [2024-11-20 00:12:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8804 states to 8804 states and 13497 transitions. [2024-11-20 00:12:00,490 INFO L78 Accepts]: Start accepts. Automaton has 8804 states and 13497 transitions. Word has length 134 [2024-11-20 00:12:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:12:00,491 INFO L471 AbstractCegarLoop]: Abstraction has 8804 states and 13497 transitions. [2024-11-20 00:12:00,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:12:00,491 INFO L276 IsEmpty]: Start isEmpty. Operand 8804 states and 13497 transitions. [2024-11-20 00:12:00,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 00:12:00,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:12:00,495 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] [2024-11-20 00:12:00,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 00:12:00,496 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:12:00,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:12:00,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1877473185, now seen corresponding path program 1 times [2024-11-20 00:12:00,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:12:00,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666864750] [2024-11-20 00:12:00,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:12:00,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:12:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:12:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:12:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:12:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:12:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:12:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:00,626 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:12:00,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:12:00,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666864750] [2024-11-20 00:12:00,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666864750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:12:00,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:12:00,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:12:00,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540854236] [2024-11-20 00:12:00,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:12:00,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:12:00,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:12:00,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:12:00,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:12:00,628 INFO L87 Difference]: Start difference. First operand 8804 states and 13497 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:12:04,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:12:04,019 INFO L93 Difference]: Finished difference Result 34608 states and 53629 transitions. [2024-11-20 00:12:04,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:12:04,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-20 00:12:04,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:12:04,090 INFO L225 Difference]: With dead ends: 34608 [2024-11-20 00:12:04,090 INFO L226 Difference]: Without dead ends: 25821 [2024-11-20 00:12:04,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:12:04,116 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 1399 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 2374 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:12:04,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1423 Valid, 1855 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2374 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 00:12:04,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25821 states. [2024-11-20 00:12:05,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25821 to 17125. [2024-11-20 00:12:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17125 states, 15624 states have (on average 1.5102406554019456) internal successors, (23596), 15689 states have internal predecessors, (23596), 1046 states have call successors, (1046), 390 states have call predecessors, (1046), 454 states have return successors, (1839), 1109 states have call predecessors, (1839), 1046 states have call successors, (1839) [2024-11-20 00:12:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17125 states to 17125 states and 26481 transitions. [2024-11-20 00:12:05,279 INFO L78 Accepts]: Start accepts. Automaton has 17125 states and 26481 transitions. Word has length 134 [2024-11-20 00:12:05,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:12:05,279 INFO L471 AbstractCegarLoop]: Abstraction has 17125 states and 26481 transitions. [2024-11-20 00:12:05,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:12:05,280 INFO L276 IsEmpty]: Start isEmpty. Operand 17125 states and 26481 transitions. [2024-11-20 00:12:05,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 00:12:05,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:12:05,289 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] [2024-11-20 00:12:05,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 00:12:05,289 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:12:05,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:12:05,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1759031711, now seen corresponding path program 1 times [2024-11-20 00:12:05,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:12:05,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747981686] [2024-11-20 00:12:05,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:12:05,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:12:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:05,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:12:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:05,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:12:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:05,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:12:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:05,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:12:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:05,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:12:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12: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:12:05,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:12:05,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747981686] [2024-11-20 00:12:05,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747981686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:12:05,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:12:05,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:12:05,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108481824] [2024-11-20 00:12:05,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:12:05,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:12:05,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:12:05,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:12:05,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:12:05,506 INFO L87 Difference]: Start difference. First operand 17125 states and 26481 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:12:10,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:12:10,159 INFO L93 Difference]: Finished difference Result 65901 states and 103007 transitions. [2024-11-20 00:12:10,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:12:10,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-20 00:12:10,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:12:10,277 INFO L225 Difference]: With dead ends: 65901 [2024-11-20 00:12:10,277 INFO L226 Difference]: Without dead ends: 48793 [2024-11-20 00:12:10,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:12:10,315 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 1317 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:12:10,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1341 Valid, 1859 Invalid, 2406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 00:12:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48793 states. [2024-11-20 00:12:12,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48793 to 33959. [2024-11-20 00:12:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33959 states, 31050 states have (on average 1.5123993558776168) internal successors, (46960), 31179 states have internal predecessors, (46960), 2006 states have call successors, (2006), 774 states have call predecessors, (2006), 902 states have return successors, (4321), 2133 states have call predecessors, (4321), 2006 states have call successors, (4321) [2024-11-20 00:12:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33959 states to 33959 states and 53287 transitions. [2024-11-20 00:12:12,635 INFO L78 Accepts]: Start accepts. Automaton has 33959 states and 53287 transitions. Word has length 134 [2024-11-20 00:12:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:12:12,636 INFO L471 AbstractCegarLoop]: Abstraction has 33959 states and 53287 transitions. [2024-11-20 00:12:12,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:12:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 33959 states and 53287 transitions. [2024-11-20 00:12:12,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 00:12:12,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:12:12,654 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] [2024-11-20 00:12:12,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 00:12:12,655 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:12:12,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:12:12,655 INFO L85 PathProgramCache]: Analyzing trace with hash 502541539, now seen corresponding path program 1 times [2024-11-20 00:12:12,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:12:12,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876426074] [2024-11-20 00:12:12,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:12:12,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:12:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:12,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:12:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:12,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:12:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:12,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:12:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:12,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:12:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:12,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:12:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:12,817 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:12:12,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:12:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876426074] [2024-11-20 00:12:12,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876426074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:12:12,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:12:12,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:12:12,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756337445] [2024-11-20 00:12:12,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:12:12,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:12:12,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:12:12,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:12:12,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:12:12,819 INFO L87 Difference]: Start difference. First operand 33959 states and 53287 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:12:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:12:21,221 INFO L93 Difference]: Finished difference Result 128749 states and 204071 transitions. [2024-11-20 00:12:21,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:12:21,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-20 00:12:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:12:21,508 INFO L225 Difference]: With dead ends: 128749 [2024-11-20 00:12:21,508 INFO L226 Difference]: Without dead ends: 94807 [2024-11-20 00:12:21,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:12:21,603 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 1340 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 2032 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:12:21,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 1206 Invalid, 2118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2032 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 00:12:21,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94807 states. [2024-11-20 00:12:26,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94807 to 67560. [2024-11-20 00:12:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67560 states, 61899 states have (on average 1.5144994264850806) internal successors, (93746), 62156 states have internal predecessors, (93746), 3862 states have call successors, (3862), 1542 states have call predecessors, (3862), 1798 states have return successors, (10679), 4117 states have call predecessors, (10679), 3862 states have call successors, (10679) [2024-11-20 00:12:26,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67560 states to 67560 states and 108287 transitions. [2024-11-20 00:12:26,771 INFO L78 Accepts]: Start accepts. Automaton has 67560 states and 108287 transitions. Word has length 134 [2024-11-20 00:12:26,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:12:26,772 INFO L471 AbstractCegarLoop]: Abstraction has 67560 states and 108287 transitions. [2024-11-20 00:12:26,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:12:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 67560 states and 108287 transitions. [2024-11-20 00:12:26,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 00:12:26,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:12:26,802 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] [2024-11-20 00:12:26,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 00:12:26,802 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:12:26,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:12:26,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1364167135, now seen corresponding path program 1 times [2024-11-20 00:12:26,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:12:26,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474861317] [2024-11-20 00:12:26,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:12:26,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:12:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:26,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:12:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:26,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 00:12:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:26,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:12:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:26,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:12:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:26,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 00:12:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:12:26,934 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:12:26,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:12:26,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474861317] [2024-11-20 00:12:26,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474861317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:12:26,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:12:26,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:12:26,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319126623] [2024-11-20 00:12:26,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:12:26,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:12:26,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:12:26,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:12:26,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:12:26,936 INFO L87 Difference]: Start difference. First operand 67560 states and 108287 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:12:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:12:32,919 INFO L93 Difference]: Finished difference Result 153746 states and 252145 transitions. [2024-11-20 00:12:32,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:12:32,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-20 00:12:32,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:12:33,313 INFO L225 Difference]: With dead ends: 153746 [2024-11-20 00:12:33,314 INFO L226 Difference]: Without dead ends: 86203 [2024-11-20 00:12:33,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:12:33,420 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 940 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:12:33,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 789 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:12:33,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86203 states.